Find a lesson, question or project

Start typing to search published content and planned structures.

↑ ↓ moveEnter openEsc close

Best for: Students and self-taught beginners building DSA skills.

Follow 20 ordered topics with 452 practice problems and 43 theory lessons. Learn the concept, attempt its exercises, then move on when you can explain the approach. Use the topic filter to revisit a specific gap.

System Design Atlas practice · Question list checked .

495 learning items452 practice problems43 theory lessons20 topics31 with Atlas lessons

495 of 495 learning items shown · All filters clear

Beginner Problems

83 learning items
  1. Breaking The Myth — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Programming and What Are Computers? — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. How to Think Like a Programmer — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Flowcharts and Pseudocode — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Flowchart Problem-Solving — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Dry Runs, Edge Cases and Debugging — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Programming Languages and Choosing a Path — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFundamentals of Programming

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Learn C++ — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksLanguage Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Learn Java — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksLanguage Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. Learn Python — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksLanguage Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  11. Easy and Medium — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksLogic Building (Patterns)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  12. Hard — Find on GeeksforGeeks (opens in a new tab)

    ProTheory lessonGeeksforGeeksLogic Building (Patterns)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  13. Pattern 1 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  14. Pattern 2 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  15. Pattern 3 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  16. Pattern 4 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  17. Pattern 5 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  18. Pattern 6 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  19. Pattern 7 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  20. Pattern 8 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  21. Pattern 9 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  22. Pattern 10 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  23. Pattern 11 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  24. Pattern 12 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  25. Pattern 13 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  26. Pattern 14 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  27. Pattern 15 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  28. Pattern 16 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  29. Pattern 17 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  30. Pattern 18 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  31. Pattern 19 — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  32. Pattern 20 — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  33. Pattern 21 — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  34. Pattern 22 — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPatterns

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  35. Theory with examples — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksTime Complexity

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  36. STL — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksStandard Libraries & Collections

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  37. Java Collections — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksStandard Libraries & Collections

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  38. Python Libraries Part 1 — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksStandard Libraries & Collections

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  39. Python Libraries Part 2 — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksStandard Libraries & Collections

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  40. Basic Maths — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksConcept Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  41. Basic Arrays — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksConcept Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  42. Basic Hashing — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksConcept Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  43. Basic String — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksConcept Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  44. Count all Digits of a Number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  45. Count number of odd digits in a number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  46. Reverse a number — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  47. Palindrome Number — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeBasic Maths
  48. Return the Largest Digit in a Number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  49. Factorial of a given number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  50. Check for Prime Number — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  51. Count of Prime Numbers till N — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  52. GCD of Two Numbers — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  53. LCM of two numbers — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  54. Divisors of a Number — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Maths

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  55. Sum of Array Elements — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Arrays

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  56. Count of odd numbers in Array — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Arrays

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  57. Check if the Array is Sorted I — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Arrays

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  58. Reverse an array — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Arrays

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  59. Highest Occurring Element in an Array — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Hashing

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  60. Second Highest Occurring Element — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Hashing

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  61. Sum of Highest and Lowest Frequency — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Hashing

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  62. Reverse a String II — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeBasic Strings
  63. Palindrome Check — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Strings

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  64. Isomorphic Strings — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeBasic Strings
  65. Rotate String — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeBasic Strings
  66. Valid Anagram — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeBasic Strings
  67. Recursion Theory — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  68. Recursion Concepts with Parameters — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  69. Sum of First N Numbers — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  70. Factorial of a Given Number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  71. Sum of Array Elements II — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  72. Reverse a String I — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeBasic Recursion
  73. Check if String is Palindrome or Not — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  74. Check if a Number is Prime or Not — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  75. Reverse an array 2 — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  76. Sum of Digits in a Given Number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBasic Recursion

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  77. Fibonacci Number — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeBasic Recursion

Sorting

7 learning items
  1. Selection Sort — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Bubble Sort — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Insertion Sorting — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Merge Sorting — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Quick Sorting — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Recursive Bubble Sort — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Recursive Insertion Sort — Read on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksAlgorithms

    Pattern reference. The Atlas solution uses recursion for insertion as well, without loops.

Arrays

32 learning items
  1. Largest Element — Read on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksFundamentals
  2. Left Rotate Array by One — Solve on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksFundamentals

    Related Atlas lesson: Rotate Array. Check the source problem’s input/output requirements before adapting it.

    Use d = 1 for the one-position left-rotation exercise.

  3. Left Rotate Array by K Places — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals

    Related Atlas lesson: Rotate Array. Check the source problem’s input/output requirements before adapting it.

  4. Move Zeros to End — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeLogic Building

    Related Atlas lesson: Move Zeroes. Check the source problem’s input/output requirements before adapting it.

  5. Remove duplicates from sorted array — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeLogic Building

    Related Atlas lesson: Remove Duplicates from Sorted Array. Check the source problem’s input/output requirements before adapting it.

  6. Find missing number — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksLogic Building

    Related Atlas lesson: Missing Number. Check the source problem’s input/output requirements before adapting it.

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Union of two sorted arrays — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Intersection of two sorted arrays — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Leaders in an Array — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs(Medium)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. Pascal's Triangle I — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs(Medium)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  11. Pascal's Triangle II — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs(Medium)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  12. Pascal's Triangle III — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs(Medium)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  13. Set Matrix Zeroes — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs(Medium)
  14. Two Sum — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeFAQs(Medium)
  15. 3 Sum — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs(Medium)
  16. 4 Sum — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeFAQs(Medium)
  17. Next Permutation — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs(Medium)
  18. Count Inversions — Read on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksFAQs(Hard)
  19. Merge two sorted arrays without extra space — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs(Hard)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Hashing

6 learning items
  1. Basic Hashing — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksTheory

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Longest subarray with sum K — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs

    Related Atlas lesson: Maximum Size Subarray Sum Equals k. Check the source problem’s input/output requirements before adapting it.

  3. Largest Subarray with Sum 0 — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs

    Related Atlas lesson: Maximum Size Subarray Sum Equals k. Check the source problem’s input/output requirements before adapting it.

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Count subarrays with given sum — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs

    Related Atlas lesson: Subarray Sum Equals K. Check the source problem’s input/output requirements before adapting it.

Binary Search

32 learning items
  1. Lower Bound — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Upper Bound — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Floor and Ceil in Sorted Array — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Find out how many times the array is rotated — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Count Occurrences in a Sorted Array — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Find Nth root of a number — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksOn answers

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Painter's Partition — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksOn answers

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Kth element of 2 sorted arrays — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Find row with maximum 1's — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeks2D Arrays

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. Matrix Median — Solve on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeks2D Arrays

Strings (Basic and Medium)

7 learning items
  1. Roman to Integer — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeString Conversions
  2. String to Integer (atoi) — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeString Conversions
  3. Count Number of Substrings — Find on GeeksforGeeks (opens in a new tab)

    UnratedPractice problemGeeksforGeeksSubstring Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Recursion

22 learning items
  1. Pow(x,n) — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeImplementation Problems

    Related Atlas lesson: Pow(x, n). Check the source problem’s input/output requirements before adapting it.

  2. Generate Parentheses — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeImplementation Problems

    Related Atlas lesson: Generate Parentheses. Check the source problem’s input/output requirements before adapting it.

  3. Power Set — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeImplementation Problems

    Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.

  4. Count Good Numbers — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeImplementation Problems
  5. Reverse a Stack — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksImplementation Problems

    The Atlas exercise additionally requires recursion without loops; keep that requirement when practising.

  6. Learn All Patterns of Subsequences (Theory) — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksSubsequence Pattern Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Count all subsequences with sum K — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksSubsequence Pattern Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Combination Sum — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs (Medium)

    Related Atlas lesson: Combination Sum. Check the source problem’s input/output requirements before adapting it.

  9. Combination Sum II — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs (Medium)

    Related Atlas lesson: Combination Sum II. Check the source problem’s input/output requirements before adapting it.

  10. Subsets I — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs (Medium)

    Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.

  11. Subsets II — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs (Medium)

    Related Atlas lesson: Subsets II. Check the source problem’s input/output requirements before adapting it.

  12. Combination Sum III — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeFAQs (Medium)

    Related Atlas lesson: Combination Sum III. Check the source problem’s input/output requirements before adapting it.

  13. Letter Combinations of a Phone Number — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard

    Related Atlas lesson: Letter Combinations of a Phone Number. Check the source problem’s input/output requirements before adapting it.

  14. Palindrome partitioning — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeFAQs (Hard)

    Related Atlas lesson: Palindrome Partitioning. Check the source problem’s input/output requirements before adapting it.

  15. N Queen — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeFAQs (Hard)

    Related Atlas lesson: N-Queens. Check the source problem’s input/output requirements before adapting it.

  16. Rat in a Maze — Solve on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksFAQs (Hard)
  17. Sudoku Solver — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeFAQs (Hard)

    Related Atlas lesson: Sudoku Solver. Check the source problem’s input/output requirements before adapting it.

  18. Expression Add Operators — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeFAQs (Hard)

    Related Atlas lesson: Expression Add Operators. Check the source problem’s input/output requirements before adapting it.

Linked-List

49 learning items
  1. Introduction to Singly LinkedList — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Traversal in Linked List — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Deletion in Linked List — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Insertion in Linked List — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Deletion of the head of LL — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Deletion of the tail of Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Deletion of the Kth element of Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Delete the element with value X — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Insertion at the head of Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. Insertion at the tail of Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  11. Insertion at the Kth position of Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  12. Insertion before the value X in Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  13. Find the length of the Linked List — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  14. Search in Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Single LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  15. Introduction to Doubly LL — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  16. Deletion in Doubly LL — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  17. Insertion in DLL — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  18. Convert Array to Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  19. Delete Tail of Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  20. Delete Kth Element of Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  21. Removing given node in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  22. Insert node before head in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  23. Insert node before tail in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  24. Insert node before (kth node) in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  25. Insert before given node in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  26. Delete head of Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  27. Reverse a Doubly Linked List — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFundamentals (Doubly LL)

    Related Atlas lesson: Reverse Linked List. Check the source problem’s input/output requirements before adapting it.

  28. Segregate odd and even nodes in Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  29. Sort a Linked List of 0's 1's and 2's — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLogic Building

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  30. Reverse a LL — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeLogic Building
  31. Length of loop in LL — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs (Medium)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  32. Rotate a LL — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs (Hard)
  33. Flattening of LL — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksFAQs (Hard)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  34. Sort LL — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeFAQs (Hard)
  35. Delete all occurrences of a key in DLL — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQS (DLL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  36. Remove duplicates from sorted DLL — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQS (DLL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  37. Find Pairs with Given Sum in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQS (DLL)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Bit Manipulation

14 learning items
  1. Introduction to Bits and Tricks — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksTheory

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Check if the i-th bit is Set or Not — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBit Fundamentals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Check if a Number is Odd or Not — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBit Fundamentals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Set the Rightmost Unset Bit — Find on GeeksforGeeks (opens in a new tab)

    UnratedPractice problemGeeksforGeeksBit Fundamentals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Swap Two Numbers — Find on GeeksforGeeks (opens in a new tab)

    BasicPractice problemGeeksforGeeksBit Fundamentals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Power Set Bit Manipulation — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeProblems

    Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.

  7. XOR of numbers in a given range — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksProblems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Greedy Algorithms

14 learning items
  1. Fractional Knapsack — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksEasy

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Shortest Job First — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksScheduling and Interval Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Job sequencing Problem — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksScheduling and Interval Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. N meetings in one room — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksScheduling and Interval Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Non-overlapping Intervals — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeScheduling and Interval Problems
  6. Insert Interval — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeScheduling and Interval Problems
  7. Merge Intervals — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeScheduling and Interval Problems
  8. Minimum number of platforms required for a railway — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksScheduling and Interval Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Valid Paranthesis Checker — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksHard

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Sliding Window / 2 Pointer

13 learning items
  1. Theory — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksPattern and Template

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Longest Substring Without Repeating Characters — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeLongest and Smallest Window Problems
  3. Max Consecutive Ones III — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeLongest and Smallest Window Problems
  4. Fruit Into Baskets — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeLongest and Smallest Window Problems
  5. Longest Repeating Character Replacement — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeLongest and Smallest Window Problems
  6. Minimum Window Substring — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeLongest and Smallest Window Problems
  7. Minimum Window Subsequence — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeLongest and Smallest Window Problems
  8. Number of Substrings Containing All Three Characters — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeCounting Subarrays / Substrings Problems
  9. Binary Subarrays With Sum — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeCounting Subarrays / Substrings Problems
  10. Count number of Nice subarrays — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeCounting Subarrays / Substrings Problems
  11. Subarrays with K Different Integers — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeCounting Subarrays / Substrings Problems

Stack / Queues

31 learning items
  1. Implementation using different DS — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksImplementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Implement Stack using Arrays — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksImplementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Implement Queue using Arrays — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksImplementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Implement stack using Linkedlist — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksImplementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Implement queue using Linkedlist — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksImplementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Balanced Paranthesis — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeImplementation
  7. Infix to Postfix Conversion — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPrefix, Infix and Postfix Conversions

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Infix to Prefix Conversion — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPrefix, Infix and Postfix Conversions

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Prefix to Infix Conversion — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPrefix, Infix and Postfix Conversions

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. Prefix to Postfix Conversion — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPrefix, Infix and Postfix Conversions

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  11. Postfix to Infix Conversion — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPrefix, Infix and Postfix Conversions

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  12. Postfix to Prefix Conversion — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksPrefix, Infix and Postfix Conversions

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  13. Next Greater Element — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMonotonic Stack
  14. Asteroid Collision — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeMonotonic Stack
  15. Remove K Digits — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeMonotonic Stack
  16. Next Smaller Element — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMonotonic Stack

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  17. Number of Greater Elements to the Right — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Binary Trees

32 learning items
  1. Introduction — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksTheory/Traversals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Inorder Traversal — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeTheory/Traversals
  3. Preorder Traversal — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeTheory/Traversals
  4. Postorder Traversal — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeTheory/Traversals
  5. Level Order Traversal — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTheory/Traversals
  6. Pre, Post, Inorder in one traversal — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory/Traversals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Maximum Depth in BT — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeMedium Problems
  8. Maximum path sum — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeMedium Problems
  9. Children Sum Property in Binary Tree — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMedium Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. Top View of BT — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  11. Bottom view of BT — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  12. Right/Left View of BT — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  13. Requirements needed to construct a unique BT — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksConstruction Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  14. Serialize and De-serialize BT — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeConstruction Problems
  15. Morris Inorder Traversal — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeTraversal in Constant Space
  16. Morris Preorder Traversal — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeTraversal in Constant Space

Binary Search Trees

15 learning items
  1. Introduction to BST — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksTheory and Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Search in BST — Solve on LeetCode (opens in a new tab)

    BasicPractice problemLeetCodeTheory and Basics
  3. Floor and Ceil in a BST — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Minimum and Maximum in BST — Find on GeeksforGeeks (opens in a new tab)

    UnratedPractice problemGeeksforGeeksTheory and Basics

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Kth Smallest and Largest element in BST — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMedium

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Inorder successor and predecessor in BST — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMedium

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Heaps

20 learning items
  1. Heaps (Theory Video) — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Heapify Algorithm — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Build heap from a given Array — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Implement Min Heap — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Implement Max Heap — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Check if an array represents a min heap — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. Convert Min Heap to Max Heap — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  8. Heap Sort — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksTheory and Implementation

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. K-th Largest element in an array — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeTheory and Implementation
  10. Sort K sorted array — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  11. Maximum Sum Combination — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksFAQs

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Graphs

46 learning items
  1. Introduction to Graph — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksTheory and traversals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Traversal Techniques — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksTheory and traversals

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Connected Components — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTheory and traversals
  4. Number of provinces — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  5. Number of islands — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  6. Flood fill algorithm — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  7. Number of enclaves — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  8. Rotten Oranges — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  9. Surrounded Regions — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  10. Number of distinct islands — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeTraversal Problems
  11. Topological sort or Kahn's algorithm — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksCycles

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  12. Course Schedule I — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard Problems
  13. Alien Dictionary — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard Problems
  14. Shortest path in DAG — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksHard Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  15. Shortest path in undirected graph with unit weights — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksHard Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  16. Word ladder I — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard Problems
  17. Word ladder II — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard Problems
  18. Dijkstra's algorithm — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksShortest Path Algorithms
  19. Print Shortest Path — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksShortest Path Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  20. Shortest Distance in a Binary Maze — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksShortest Path Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  21. Path with minimum effort — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeShortest Path Algorithms
  22. Cheapest flight within K stops — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeShortest Path Algorithms
  23. Minimum multiplications to reach end — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksShortest Path Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  24. Bellman ford algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksShortest Path Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  25. Floyd warshall algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksShortest Path Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  26. Network Delay Time — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeShortest Path Algorithms
  27. Swim in Rising Water — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeShortest Path Algorithms
  28. MST theory — Find on GeeksforGeeks (opens in a new tab)

    CoreTheory lessonGeeksforGeeksMinimum Spanning Tree

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  29. Disjoint Set — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMinimum Spanning Tree

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  30. Find the MST weight — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeMinimum Spanning Tree
  31. Accounts merge — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeHard Problems II
  32. Number of islands II — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard Problems II
  33. Making a large island — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeHard Problems II
  34. Kosaraju's algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksAdditional Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  35. Bridges in graph — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeAdditional Algorithms
  36. Articulation point in graph — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksAdditional Algorithms

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Dynamic Programming

53 learning items
  1. Introduction to DP — Find on GeeksforGeeks (opens in a new tab)

    BasicTheory lessonGeeksforGeeksIntroduction

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Frog Jump — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeks1D DP
  3. Frog jump with K distances — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeks1D DP

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  4. Ninja's training — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeks2D DP

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Triangle — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeDP on grids
  6. Subset sum equals to target — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksDP on subsequences
  7. Partition equal subset sum — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeDP on subsequences
  8. Count subsets with sum K — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksDP on subsequences

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  9. Count partitions with given difference — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksDP on subsequences

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  10. 0 and 1 Knapsack — Solve on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksDP on subsequences
  11. Minimum coins — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeDP on subsequences
  12. Target sum — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeDP on subsequences
  13. Coin change II — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeDP on subsequences
  14. Unbounded knapsack — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksDP on subsequences

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  15. Rod cutting problem — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksDP on subsequences

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  16. Print Longest Increasing Subsequence — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksLIS

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  17. Longest Bitonic Subsequence — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksLIS

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  18. Minimum insertions or deletions to convert string A to B — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksDP on strings

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  19. Edit distance — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeDP on strings
  20. Wildcard matching — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeDP on strings
  21. Word Break — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeDP on strings
  22. Count Palindromic Subsequences — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksDP on strings

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  23. Different Ways to Evaluate a Boolean Expression — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksMCM DP

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Tries

7 learning items
  1. Bit PreRequisites for TRIE Problems — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksTheory

    Direct match not yet confirmed; opens a GeeksforGeeks search.

Strings (Advanced Algo)

9 learning items
  1. Reverse every word in a string — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMedium Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Minimum number of bracket reversals to make an expression balanced — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksMedium Problems

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Count and say — Solve on LeetCode (opens in a new tab)

    CorePractice problemLeetCodeMedium Problems
  4. Hashing In Strings | Theory — Find on GeeksforGeeks (opens in a new tab)

    UnratedTheory lessonGeeksforGeeksAdvanced Problems (Less asked)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  5. Rabin Karp Algorithm — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksAdvanced Problems (Less asked)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  6. Z function — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksAdvanced Problems (Less asked)

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  7. KMP Algorithm or LPS array — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeAdvanced Problems (Less asked)
  8. Shortest Palindrome — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeAdvanced Problems (Less asked)
  9. Longest happy prefix — Solve on LeetCode (opens in a new tab)

    ProPractice problemLeetCodeAdvanced Problems (Less asked)

Maths

3 learning items
  1. Print all primes till N — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksSieve of Eratosthenes

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  2. Prime factorisation of a Number — Find on GeeksforGeeks (opens in a new tab)

    CorePractice problemGeeksforGeeksSieve of Eratosthenes

    Direct match not yet confirmed; opens a GeeksforGeeks search.

  3. Count primes in range L to R — Find on GeeksforGeeks (opens in a new tab)

    ProPractice problemGeeksforGeeksSieve of Eratosthenes

    Direct match not yet confirmed; opens a GeeksforGeeks search.