This class was created by Brainscape user Unknown Unknown. Visit their profile to learn more about the creator.
By:
Unknown Unknown
- decks
- flashcards
- learners
Decks in this class (20)
Javascript Specific
What is the time complexity of tr...,
What is the time complexity of sp...,
What is the time complexity of so...
16
cards
Problem Solving Strategies
What is the difference between br...,
How do you decide whether to use ...,
When should you use greedy instea...
9
cards
Time Complexity
What is amortized time complexity 1,
What types of problems have o log...,
What is big o notation 3
5
cards
Strings
What is the time complexity of ch...,
What is the kmp algorithm used for 2,
What is the rabin karp algorithm ...
6
cards
Arrays & Linked List
What is the difference between an...,
What is the time complexity of ac...,
What is the time complexity of ac...
6
cards
Two Pointers & Sliding Windows
How does the two pointer techniqu...,
What are common two pointer use c...,
What is sliding window 3
8
cards
Stacks & Queues
What is a stack what are its key ...,
What is a queue how does it diffe...,
How does a priority queue work 3
4
cards
Heaps
What is the difference between a ...,
What is the time complexity of in...,
What is the time complexity of ex...
6
cards
Sorting
What is the time complexity of so...,
What is the best case and worst c...,
What is the difference between qu...
10
cards
Searching
How does binary search work what ...,
When to use binary search vs tern...
2
cards
Graphs
What is the difference between bf...,
What data structure is used for b...,
What data structure is used for d...
6
cards
Tree Traversal
What are the methods of tree trav...,
What is inorder traversal 2,
What is preorder traversal 3
7
cards
Shortest Path Algos
What is dijkstra s algorithm used...,
What is the bellman ford algorith...,
What is floyd warshall used for 3
3
cards
Binary Trees & BST
What is a binary search tree bst 1,
What is the difference between a ...,
What is an avl tree 3
4
cards
Trie & Specialized Trees
Blank 1,
How does a segment tree work 2
2
cards
Dynamic Programming
What are the two main techniques ...,
What is the difference between to...,
What is the time complexity of so...
20
cards
Bitwise Operations
What is the result of x x 1 1,
How do you check if a number is a...,
How do you swap two numbers using...
13
cards
Union Find
What is union find 1,
How does the path compression tec...,
What is the difference between un...
5
cards
META SPECIFIC
What are common graph related pro...,
How do you detect cycles in a dir...,
What are common dp problems at me...
7
cards
Toolbox
Prefix sum 1,
Union find 2,
Blank 3
14
cards
More about
DSA 2
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Unknown Unknown's DSA 2 flashcards now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
Looking for something else?
DEN1DSA
- 16 decks
- 783 flashcards
- 16 learners
Decks:
Hierarchy Of Structure, Organ Systems, Molecules Cells Cavities, And more!
CS2210: DSA
- 16 decks
- 217 flashcards
- 25 learners
Decks:
Week 1 Search Problem Linear Search Bina, Week 2 Analysis Of Algorithms, Week 2 Recursive Algorithm Time Complexi, And more!
DSA
- 3 decks
- 43 flashcards
- 5 learners
Decks:
Quiz 1 Prelim Exam, Quiz 2 Prelim Exam, Types Of Data Structure, And more!
