Atlas practice / 495 learning items
Zero to Hero DSA Sheet
Start from the foundations when you need theory and practice together before moving into interview revision.
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 of 495 learning items shown · All filters clear
Beginner Problems
83 learning itemsBreaking The Myth — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Programming and What Are Computers? — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
How to Think Like a Programmer — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Flowcharts and Pseudocode — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Flowchart Problem-Solving — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Dry Runs, Edge Cases and Debugging — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Programming Languages and Choosing a Path — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Learn C++ — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Learn Java — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Learn Python — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Easy and Medium — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Hard — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 1 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 2 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 3 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 4 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 5 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 6 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 7 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 8 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 9 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 10 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 11 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 12 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 13 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 14 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 15 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 16 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 17 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 18 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 19 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 20 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 21 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pattern 22 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Theory with examples — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
STL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Java Collections — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Python Libraries Part 1 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Python Libraries Part 2 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Basic Maths — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Basic Arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Basic Hashing — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Basic String — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count all Digits of a Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count number of odd digits in a number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Reverse a number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Return the Largest Digit in a Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Factorial of a given number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check for Prime Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count of Prime Numbers till N — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
GCD of Two Numbers — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
LCM of two numbers — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Divisors of a Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sum of Array Elements — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count of odd numbers in Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check if the Array is Sorted I — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Reverse an array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Highest Occurring Element in an Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Second Highest Occurring Element — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sum of Highest and Lowest Frequency — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Palindrome Check — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Recursion Theory — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Recursion Concepts with Parameters — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sum of First N Numbers — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Factorial of a Given Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sum of Array Elements II — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check if String is Palindrome or Not — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check if a Number is Prime or Not — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Reverse an array 2 — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sum of Digits in a Given Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sorting
7 learning itemsSelection Sort — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Bubble Sort — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion Sorting — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Merge Sorting — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Quick Sorting — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Recursive Bubble Sort — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Recursive Insertion Sort — Read on GeeksforGeeks (opens in a new tab)
Pattern reference. The Atlas solution uses recursion for insertion as well, without loops.
Arrays
32 learning itemsLinear Search — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Left Rotate Array by One — Solve on GeeksforGeeks (opens in a new tab)
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.
Left Rotate Array by K Places — Solve on GeeksforGeeks (opens in a new tab)
Related Atlas lesson: Rotate Array. Check the source problem’s input/output requirements before adapting it.
Move Zeros to End — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Move Zeroes. Check the source problem’s input/output requirements before adapting it.
Remove duplicates from sorted array — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Remove Duplicates from Sorted Array. Check the source problem’s input/output requirements before adapting it.
Find missing number — Find on GeeksforGeeks (opens in a new tab)
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.
Union of two sorted arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Intersection of two sorted arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Leaders in an Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pascal's Triangle I — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pascal's Triangle II — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pascal's Triangle III — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Merge two sorted arrays without extra space — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Hashing
6 learning itemsBasic Hashing — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Longest subarray with sum K — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Maximum Size Subarray Sum Equals k. Check the source problem’s input/output requirements before adapting it.
Largest Subarray with Sum 0 — Find on GeeksforGeeks (opens in a new tab)
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.
Count subarrays with given sum — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subarray Sum Equals K. Check the source problem’s input/output requirements before adapting it.
Binary Search
32 learning itemsLower Bound — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Upper Bound — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Floor and Ceil in Sorted Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Find out how many times the array is rotated — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count Occurrences in a Sorted Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Find Nth root of a number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Painter's Partition — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Kth element of 2 sorted arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Find row with maximum 1's — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Strings (Basic and Medium)
7 learning itemsCount Number of Substrings — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Recursion
22 learning itemsPow(x,n) — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Pow(x, n). Check the source problem’s input/output requirements before adapting it.
Generate Parentheses — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Generate Parentheses. Check the source problem’s input/output requirements before adapting it.
Power Set — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.
Reverse a Stack — Solve on GeeksforGeeks (opens in a new tab)
The Atlas exercise additionally requires recursion without loops; keep that requirement when practising.
Learn All Patterns of Subsequences (Theory) — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count all subsequences with sum K — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Combination Sum — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Combination Sum. Check the source problem’s input/output requirements before adapting it.
Combination Sum II — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Combination Sum II. Check the source problem’s input/output requirements before adapting it.
Subsets I — Solve on GeeksforGeeks (opens in a new tab)
Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.
Subsets II — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subsets II. Check the source problem’s input/output requirements before adapting it.
Combination Sum III — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Combination Sum III. Check the source problem’s input/output requirements before adapting it.
Letter Combinations of a Phone Number — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Letter Combinations of a Phone Number. Check the source problem’s input/output requirements before adapting it.
Palindrome partitioning — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Palindrome Partitioning. Check the source problem’s input/output requirements before adapting it.
Word Search — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Word Search. Check the source problem’s input/output requirements before adapting it.
N Queen — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: N-Queens. Check the source problem’s input/output requirements before adapting it.
Sudoku Solver — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Sudoku Solver. Check the source problem’s input/output requirements before adapting it.
Expression Add Operators — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Expression Add Operators. Check the source problem’s input/output requirements before adapting it.
Linked-List
49 learning itemsIntroduction to Singly LinkedList — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Traversal in Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Deletion in Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion in Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Deletion of the head of LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Deletion of the tail of Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Deletion of the Kth element of Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Delete the element with value X — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion at the head of Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion at the tail of Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion at the Kth position of Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion before the value X in Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Find the length of the Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Search in Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Introduction to Doubly LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Deletion in Doubly LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insertion in DLL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Convert Array to Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Delete Tail of Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Delete Kth Element of Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Removing given node in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insert node before head in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insert node before tail in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insert node before (kth node) in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Insert before given node in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Delete head of Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Reverse a Doubly Linked List — Solve on GeeksforGeeks (opens in a new tab)
Related Atlas lesson: Reverse Linked List. Check the source problem’s input/output requirements before adapting it.
Segregate odd and even nodes in Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sort a Linked List of 0's 1's and 2's — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Length of loop in LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Flattening of LL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Delete all occurrences of a key in DLL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Remove duplicates from sorted DLL — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Find Pairs with Given Sum in Doubly Linked List — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Bit Manipulation
14 learning itemsIntroduction to Bits and Tricks — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check if the i-th bit is Set or Not — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check if a Number is Odd or Not — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Set the Rightmost Unset Bit — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Swap Two Numbers — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Power Set Bit Manipulation — Solve on LeetCode (opens in a new tab)
Related Atlas lesson: Subsets. Check the source problem’s input/output requirements before adapting it.
XOR of numbers in a given range — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Greedy Algorithms
14 learning itemsFractional Knapsack — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Shortest Job First — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Job sequencing Problem — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
N meetings in one room — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Minimum number of platforms required for a railway — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Valid Paranthesis Checker — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sliding Window / 2 Pointer
13 learning itemsTheory — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Stack / Queues
31 learning itemsImplementation using different DS — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement Stack using Arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement Queue using Arrays — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement stack using Linkedlist — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement queue using Linkedlist — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Infix to Postfix Conversion — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Infix to Prefix Conversion — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Prefix to Infix Conversion — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Prefix to Postfix Conversion — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Postfix to Infix Conversion — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Postfix to Prefix Conversion — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Next Smaller Element — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Number of Greater Elements to the Right — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Binary Trees
32 learning itemsIntroduction — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Pre, Post, Inorder in one traversal — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Children Sum Property in Binary Tree — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Top View of BT — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Bottom view of BT — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Right/Left View of BT — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Requirements needed to construct a unique BT — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Binary Search Trees
15 learning itemsIntroduction to BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Floor and Ceil in a BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Minimum and Maximum in BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Kth Smallest and Largest element in BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Inorder successor and predecessor in BST — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Heaps
20 learning itemsHeaps (Theory Video) — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Heapify Algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Build heap from a given Array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement Min Heap — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Implement Max Heap — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Check if an array represents a min heap — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Convert Min Heap to Max Heap — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Heap Sort — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Sort K sorted array — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Maximum Sum Combination — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Graphs
46 learning itemsIntroduction to Graph — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Traversal Techniques — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Topological sort or Kahn's algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Shortest path in DAG — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Shortest path in undirected graph with unit weights — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Print Shortest Path — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Shortest Distance in a Binary Maze — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Minimum multiplications to reach end — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Bellman ford algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Floyd warshall algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
MST theory — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Disjoint Set — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Kosaraju's algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Articulation point in graph — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Dynamic Programming
53 learning itemsIntroduction to DP — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Frog jump with K distances — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Ninja's training — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count subsets with sum K — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count partitions with given difference — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Unbounded knapsack — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Rod cutting problem — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Print Longest Increasing Subsequence — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Longest Bitonic Subsequence — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Minimum insertions or deletions to convert string A to B — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count Palindromic Subsequences — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Different Ways to Evaluate a Boolean Expression — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Tries
7 learning itemsBit PreRequisites for TRIE Problems — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Strings (Advanced Algo)
9 learning itemsReverse every word in a string — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Minimum number of bracket reversals to make an expression balanced — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Hashing In Strings | Theory — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Rabin Karp Algorithm — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Z function — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Maths
3 learning itemsPrint all primes till N — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Prime factorisation of a Number — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
Count primes in range L to R — Find on GeeksforGeeks (opens in a new tab)
Direct match not yet confirmed; opens a GeeksforGeeks search.
No learning items match these filters
Try a shorter search or clear the filters to see the full list.