> Flashcards

Master new concepts with interactive study decks. Click on any deck to start studying.

13

Study Decks

576

Total Cards

~58

Minutes Study Time

Backtracking

Master backtracking algorithms including N-Queens, sudoku solving, subset generation, and constraint satisfaction problems.

Algorithm Analysis
35 cards
~4 min
algorithm-analysis#backtracking#n-queens+3
Ready to study
→

Branch and Bound

Master branch and bound optimization techniques including traveling salesman, knapsack problems, and bound computation strategies.

Algorithm Analysis
40 cards
~4 min
algorithm-analysis#branch-bound#optimization+3
Ready to study
→

Computational Complexity - Searching

Master searching algorithm complexities including linear search, binary search, hash table operations, and search optimization techniques.

Algorithm Analysis
53 cards
~6 min
algorithm-analysis#searching#binary-search+3
Ready to study
→

Computational Complexity - Sorting

Master sorting algorithm complexities including comparison-based sorts, counting sort, radix sort, and lower bound analysis.

Algorithm Analysis
44 cards
~5 min
algorithm-analysis#sorting#complexity-analysis+4
Ready to study
→

Divide and Conquer

Master divide and conquer algorithms including merge sort, quick sort, binary search, and advanced techniques like Strassen's matrix multiplication.

Algorithm Analysis
82 cards
~9 min
algorithm-analysis#divide-conquer#merge-sort+3
Ready to study
→

Dynamic Programming

Master dynamic programming techniques including memoization, tabulation, optimal substructure, and classic DP problems.

Algorithm Analysis
37 cards
~4 min
algorithm-analysis#dynamic-programming#memoization+4
Ready to study
→

Genetic Algorithms

Master genetic algorithm concepts including selection, crossover, mutation, and evolutionary optimization techniques.

Algorithm Analysis
52 cards
~6 min
algorithm-analysis#genetic-algorithms#evolutionary-computation+4
Ready to study
→

Graph Algorithms

Master fundamental graph algorithms including BFS, DFS, shortest paths, minimum spanning trees, and topological sorting.

Algorithm Analysis
51 cards
~6 min
algorithm-analysis#graphs#bfs+4
Ready to study
→

Greedy Algorithms

Master greedy algorithm strategies including activity selection, fractional knapsack, Huffman coding, and minimum spanning trees.

Algorithm Analysis
37 cards
~4 min
algorithm-analysis#greedy#optimization+3
Ready to study
→

Algorithm Analysis Introduction

Master fundamental concepts of algorithm analysis including Big O notation, recurrence relations, Master Theorem, and amortized analysis.

Algorithm Analysis
33 cards
~4 min
algorithm-analysis#big-o#complexity+3
Ready to study
→

Mathematical Examples

Master mathematical foundations for algorithm analysis including summations, recurrence relations, and asymptotic notation examples.

Algorithm Analysis
15 cards
~2 min
algorithm-analysis#mathematics#summations+3
Ready to study
→

NP-Completeness

Master computational complexity theory including P vs NP, NP-completeness, polynomial reductions, and classic NP-complete problems.

Algorithm Analysis
48 cards
~5 min
algorithm-analysis#np-completeness#complexity-theory+3
Ready to study
→

String Algorithms

Master essential string algorithms including pattern matching, substring search, and string processing techniques.

Algorithm Analysis
49 cards
~5 min
algorithm-analysis#strings#pattern-matching+3
Ready to study
→

More Decks Coming Soon

We're constantly adding new study materials. Have a topic you'd like to see covered?

Data StructuresMachine LearningSystem DesignWeb Development