Data Structure and Algorithms (Basics) in 30 hours

Anirban Sinha

profile
Data Structure and Algorithms (Basics) in 30 hours
profile
Courses
  1. Arrays - 1 hour
  2. Strings - 1 hour
  3. Bit Manipulation - 1 hour
  4. Hash Tables - 1 hour
  5. Two Pointers - 1 hour
  6. Prefix Sum - 1 hour
  7. Sliding Window - Fixed Size - 1 hour
  8. Sliding Window - Dynamic Size - 1 hour
  9. Kadane's Algorithm - 1 hour
  10. Matrix (2D Array) - 1 hour
  11. Linked List - 1 hour
  12. LinkedList In-place Reversal - 1 hour
  13. Fast and Slow Pointers - 1 hour
  14. Stacks - 1 hour
  15. Monotonic Stack - 1 hour
  16. Queues - 1 hour
  17. Monotonic Queue - 1 hour
  18. Bucket Sort - 1 hour
  19. Recursion - 1 hour
  20. Divide and Conquer - 1 hour
  21. Merge Sort - 1 hour
  22. QuickSort / QuickSelect - 1 hour
  23. Binary Search - 1 hour
  24. Backtracking - 1 hour
  25. Tree Traversal - Level Order - 1 hour
  26. Tree Traversal - Pre Order - 1 hour
  27. Tree Traversal - In Order - 1 hour
  28. Tree Traversal - Post-Order - 1 hour
  29. BST / Ordered Set - 1 hour
  30. Tries - 1 hour
  31. Heaps - 1 hour
  32. Two Heaps - 1 hour
  33. Top K Elements - 1 hour
  34. Intervals - 1 hour
  35. K-Way Merge - 1 hour
  36. Data Structure Design - 1 hour
  37. Greedy - 1 hour
  38. Depth First Search (DFS) - 1 hour
  39. Breadth First Search (BFS) - 1 hour
  40. Topological Sort - 1 hour
  41. Union Find - 1 hour
  42. Minimum Spanning Tree - 1 hour
  43. Shortest Path - 1 hour
  44. Eulerian Circuit - 1 hour
  45. 1-D DP - 1 hour
  46. 0/1 Knapsack - 1 hour
  47. Unbounded Knapsack - 1 hour
  48. Longest Increasing Subsequence (LIS) - 1 hour
  49. 2D Grid DP - 1 hour
  50. String DP - 1 hour
  51. Tree / Graph DP - 1 hour
  52. Bitmask DP - 1 hour
  53. Digit DP - 1 hour
  54. Probability DP - 1 hour
  55. State Machine DP - 1 hour
  56. Maths / Geometry - 1 hour
  57. String Matching - 1 hour
  58. Binary Indexed Tree / Segment Tree - 1 hour
  59. Line Sweep - 1 hour
Terms | Privacy
₹25,000
Terms | Privacy