Data Structures and Algorithms Certification Program

1. Introduction to Asymptotic Analysis and Big O Notation
2. Order complexity analysis
3. Theoretical complexity analysis
4. Time complexity analysis of searching and sorting
5. Theoretical space complexity
6. Space complexity analysis of recursive algorithms

Case study 1: Big (O) of Nested Loop with Addition

Case study 2: Big (O) of Nested Loop with Subtraction

Case study 3: Big (O) of Nested Loop with Multiplication

Case study 4: Nested Loop with Multiplication (Basic)

Case study 5: Nested Loop with Multiplication (Intermediate)

Case study 6: Nested Loop with Multiplication (Advanced)

Case study 7: Nested Loop with Multiplication (Pro)

1. Introduction to Arrays
2. How arrays are stored in memory?
3. Passing arrays to functions
4. Multidimensional arrays
5. Two Pointers
6. Find Maximum in Sliding Window
7. Search a Rotated Array
8. Find the Smallest Common Number
9. Rotate an Array by N Elements
10. Find Low/High Index of a Key in a Sorted Array
11. Move All Zeros to the Beginning of the Array
12. Stock Buy Sell to Maximize Profit
13. Merge an Array With Overlapping Intervals
14. Find Pair With Given Sum in an Array
15. Sort an Array Using Quicksort Algorithm
16. Cyclic Sort (easy)
17. Find the Missing Number (easy)
18. Maximum Sum Subarray of Size K (easy)
19. Smallest Subarray With a Greater Sum (easy)
20. Squaring a Sorted Array (easy)
21. Subsets With Duplicates (easy)
22. Bitonic Array Maximum (easy)
23. Permutations (medium)
24. Triplet Sum to Zero (medium)
25. Triplet Sum Close to Target (medium)
26. Triplets with Smaller Sum (medium)
27. Subarrays with Product Less than a Target (medium)
28. Dutch National Flag Problem (medium)
29. Merge Intervals (medium)
30. Insert Interval (medium)
31. Intervals Intersection (medium)
32. Conflicting Appointments (medium)
33. Ceiling of a Number (medium)
34. Next Letter (medium)
35. Number Range (medium)
36. Search in a Sorted Infinite Array (medium)
37. Minimum Difference Element (medium)
38. Solve N-Queens Problem
39. Find K-Sum Subsets

1. Introduction to strings
2. How strings are stored in memory?
3. Reverse Words in a Sentence
4. Remove Duplicates from a String
5. Remove White Spaces from a String
6. Word Break Problem
7. XML to Tree
8. Find all Palindrome Substrings
9. Regular Expression Matching in String
10. Longest Palindromic Subsequence
11. Longest Palindromic Substring
12. Count of Palindromic Substrings
13. Minimum Deletions in a String to make it a Palindrome
14. Longest Common Substring
15. Longest Common Subsequence
16. Minimum Deletions & Insertions to Transform a String into another
17. Fruits into Baskets (medium)
18. Longest Substring with maximum K Distinct Characters (medium)
19. String Permutations by changing case (medium)
20. Balanced Parentheses (hard)
21. Unique Generalized Abbreviations (hard)
22. Longest Substring with Distinct Characters (hard)
23. Longest Substring with Same Letters after Replacement (hard)
24. Boggle
25. Generate all Combinations of Balanced Parentheses

1. Singly Linked Lists (SLL)
2. Basic Linked List Operations
3. Circular Linked List
4. Doubly Linked List (DLL)
5. Reverse a Singly Linked List
6. Remove Duplicates from a Linked List
7. Delete All Occurrences of a Given Key in a Linked List
8. Sort Linked List Using Insertion Sort
9. LinkedList Cycle (easy)
10. Start of LinkedList Cycle (medium)
11. Happy Number (medium)
    • Middle of the LinkedList (easy)
    • Intersection Point of Two Lists
    • Find n'th Node from the End of a Linked List
    • Swap Nth Node with Head
    • Merge Two Sorted Linked Lists
    • Sort a Linked List Using Merge Sort
    • Reverse Even Nodes in a Linked List
    • Rotate a Linked ListReverse Alternate K Nodes in a  Singly  Linked List
    • Add Two Integers Represented by Linked Lists
    • Copy Linked List with Arbitrary Pointer
    • Reverse a Sub-list (medium)
    • Reverse every K-element Sub-list (medium)
    • Merge K Sorted Lists (medium)
    • Kth Smallest Number in M Sorted Lists (Medium)

1. Stack (Implementation)
2. Queue (Implementation)
3. Reversing First k Elements of Queue
4. Implement Stack Using Queues
5. Implement Queue Using Stacks
6. Evaluate Arithmetic Expressions
7. Merge Intervals
8. Longest Valid Parentheses
9. Largest rectangle in histogram
10. Minimum remove to make a valid parentheses
11. Remove duplicate letters
12. Remove k digits
13. Add two numbers
14. Decode string

Searching

1. Linear Search
2. Binary Search
3. Hash table
4. Interpolation Search

Sorting

1. Bubble sort
2. Insertion sort
3. Heap sort
4. Selection sort
5. Merge Sort
6. Quick sort
7. Shell/Radix sort

1. An Introduction to Trees and Basic Tree Properties!
2. What is a Binary Tree?
3. Binary Search Trees
4. N-ary Trees
5. Segment Trees (Segment Interval)
6. Spanning Tree
7. AVL Trees
8. Check if Two Binary Trees are Identical
9. Write an In-Order Iterator for a Binary Tree
10. Iterative In-order Traversal of Binary Tree
11. In-order Successor of Binary Search Tree
12. In-order Successor Binary Search Tree With Parent Pointers
13. Level Order Traversal of Binary Tree
14. Reverse Level Order Traversal (easy)
15. Level Averages in a Binary Tree (easy)
16. Level Order Successor (easy)
17. Zigzag Traversal (medium)
18. Connect Level Order Siblings (medium)
19. Is a Binary Search Tree Valid?
20. Convert Binary Tree to Doubly Linked List
21. Print Tree Perimeter
22. Connect All Siblings of a Binary Tree
23. Serialize/Deserialize Binary Tree
24. Nth Highest Number in Binary Search Tree
25. Mirror Binary Tree Nodes
26. Delete Zero Sum Sub-Trees
27. Convert N-ary Tree to Binary Tree
28. Minimum Depth of a Binary Tree (easy)
29. All Paths for a Sum (medium)
30. Sum of Path Numbers (medium)
31. Path With Given Sequence (medium)
32. Count Paths for a Sum (medium)
33. Find the Median of a Number Stream (medium)
34. Sliding Window Median (hard)
35. Maximize Capital (hard)

1. Introduction to Priority Queues
2. Ways to implement priority queues
3. Introduction to heaps
4. Min-max Heaps
5. Heapify
6. Insert and Delete operations in heaps
7. Implementing priority queues
8. Heap sort
9. Inbuilt Priority Queue

1. What is a Trie?
2. Structure of a Trie
3. Total Number of Words in a Trie
4. Find All Words Stored in Trie
5. List Sort Using Tries
6. Word Formation from a Vector Using Trie
7. Huffman Coding

1. What is a Graph?
2. Types of Graphs
3. Representation of Graphs
4. Directed Acyclic Graphs (DAG)
5. Depth First Search (DFS)
6. Breadth First Search (BFS)
7. Djikstra's Algorithm
8. Floyd-Warshall Algorithm
9. Bellman Ford Algorithm
10. Ford Fulkerson algorithm
11. Detect Cycle in Graph
12. Find a "Mother Vertex" in a Graph
13. Count the number of Edges in an Undirected Graph
14. Check if a Path Exists Between Two Vertices
15. Check if an Undirected Graph is Tree or not
16. Find the Shortest Path between Two Vertices
17. Clone a Directed Graph
18. Minimum Spanning Tree
19. Word Chaining
20. Topological Sort (medium)
21. Tasks Scheduling (medium)
22. Tasks Scheduling Order (medium)
23. All Tasks Scheduling Orders (hard)
24. Alien Dictionary (hard)

1. What is Recursion?
2. Direct vs. Indirect Recursion
3. Advantages and Disadvantages
4. Find the greatest common divisor
5. Check for Prime Number
6. Let's find the total number of vowels
7. Is this String a Palindrome?
8. Sort an Array
9. Shuffle Integers
10. Closest Pair of Points
11. Collect Coins in Minimum Steps
12. Merge a Number of Sorted Arrays

1. Introduction to Dynamic Programming
2. Memoization
3. Fibonacci Numbers
4. Largest Sum Subarray
5. MaxSum Subsequence - Nonadjacent Elements
6. Find Combinations for Game Scoring
7. Coin Change
8. Minimum Coin Change
9. Levenshtein Distance
10. Equal Subset Sum Partition (medium)
11. Subset Sum (medium)
12. Minimum Subset Sum Difference (hard)
13. Longest Subarray with Ones after Replacement (hard)
14. Rod Cutting
15. Strings Interleaving
16. Staircase
17. Unbounded Knapsack
18. Maximum Ribbon Cut
19. House thief
20. Minimum Deletions to Make a Sequence Sorted
21. Palindromic Partitioning
22. Longest Bitonic Subsequence
    • Minimum jumps to reach the end
    • Minimum jumps with fee
    • Number factors
    • Equal Subset Sum Partition
    • Minimum Subset Sum Difference
    • Count of Subset Sum

1. Introduction to System Design Basics
2. Key Characteristics of Distributed Systems
3. Load Balancing
4. Caching
5. Data Partitioning
6. Indexes
7. Proxies
8. Redundancy and Replication
9. SQL vs. NoSQL
10. Consistent Hashing
11. Long-Polling vs WebSockets vs Server-Sent Events

1. Introduction to System Design Patterns
2. Bloom Filters
3. Consistent Hashing
4. Quorum
5. Leader and Follower
6. Write-ahead Log
7. Segmented Log
8. High-Water Mark
9. Lease
10. Heartbeat
11. Gossip Protocol
12. Phi Accrual Failure Detection
13. Split Brain
14. Fencing
15. Checksum
16. Vector Clocks
17. CAP Theorem
18. PACELC Theorem
19. Hinted Handoff
20. Read Repair
21. Merkle Trees

1. Designing a URL Shortening service like TinyURL
2. Designing Instagram
3. Designing Dropbox
4. Designing Facebook Messenger
5. Designing Twitter
6. Designing Youtube or Netflix
7. Designing Typeahead Suggestion
8. Designing an API Rate Limiter
9. Designing Twitter Search
10. Designing a Web Crawler
11. Designing Facebook’s Newsfeed
12. Designing Uber backend

1. Recognizing Behavioral Interview Questions
2. Prior Experience Questions
3. Parsing Prior Experience Questions
4. Sample Prior Experience Questions
5. Hypotheticals
6. Answering Hypothetical Questions
7. Values-Based Questions
8. Asking Questions
9. Good Questions to Ask