Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.
Striver · takeUforward
Striver’s A2Z DSA Sheet
A structured journey from programming fundamentals to advanced DSA.
402 practice entries · Source checked
0 / 402 completed0%
About this source edition
Practice-problem snapshot · 20 Sep 2026; theory lessons excluded
“Source checked” is when this edition was retrieved, not a claim that the creator updated it then.
Original sheet ↗Dataset source ↗Beginner Problems
0 / 60
Patterns
0 / 22
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Pattern 1 | — | Open ↗ | ||
| Pattern 2 | — | Open ↗ | ||
| Pattern 3 | — | Open ↗ | ||
| Pattern 4 | — | Open ↗ | ||
| Pattern 5 | — | Open ↗ | ||
| Pattern 6 | — | Open ↗ | ||
| Pattern 7 | — | Open ↗ | ||
| Pattern 8 | — | Open ↗ | ||
| Pattern 9 | — | Open ↗ | ||
| Pattern 10 | — | Open ↗ | ||
| Pattern 11 | — | Open ↗ | ||
| Pattern 12 | — | Open ↗ | ||
| Pattern 13 | — | Open ↗ | ||
| Pattern 14 | — | Open ↗ | ||
| Pattern 15 | — | Open ↗ | ||
| Pattern 16 | — | Open ↗ | ||
| Pattern 17 | — | Open ↗ | ||
| Pattern 18 | — | Open ↗ | ||
| Pattern 19 | — | Open ↗ | ||
| Pattern 20 | — | Open ↗ | ||
| Pattern 21 | — | Open ↗ | ||
| Pattern 22 | — | Open ↗ |
Basic Maths
0 / 13
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Count all Digits of a Number | Easy | Open ↗ | ||
| Count number of odd digits in a number | — | Open ↗ | — | |
| Reverse a number | Medium | Open ↗ | ||
| Palindrome Number | Easy | Open ↗ | ||
| Return the Largest Digit in a Number | — | Open ↗ | — | |
| Factorial of a given number | — | Open ↗ | ||
| Check if the Number is Armstrong May require a platform subscription | Easy | Open ↗ | ||
| Check for Perfect Number | Easy | Open ↗ | — | |
| Check for Prime Number | Easy | Open ↗ | ||
| Count of Prime Numbers till N | — | Open ↗ | — | |
| GCD of Two Numbers | — | Open ↗ | ||
| LCM of two numbers | Easy | Open ↗ | — | |
| Divisors of a Number | Easy | Open ↗ |
Basic Arrays
0 / 4
Basic Hashing
0 / 3
Basic Strings
0 / 8
Basic Recursion
0 / 10
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Sum of First N Numbers | Easy | Open ↗ | ||
| Factorial of a Given Number | — | Open ↗ | — | |
| Sum of Array Elements II | — | Open ↗ | — | |
| Reverse a String I | — | Open ↗ | — | |
| Check if String is Palindrome or Not | Easy | Open ↗ | ||
| Check if a Number is Prime or Not | — | Open ↗ | — | |
| Reverse an array 2 | — | Open ↗ | — | |
| Check if the Array is Sorted II | Easy | Open ↗ | ||
| Sum of Digits in a Given Number | Easy | Open ↗ | — | |
| Fibonacci Number | Easy | Open ↗ |
Sorting
0 / 5
Arrays
0 / 32
Fundamentals
0 / 6
Logic Building
0 / 5
FAQs(Medium)
0 / 15
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Majority Element-I | Easy | Open ↗ | ||
| Leaders in an Array | Easy | Open ↗ | ||
| Rearrange array elements by sign | Medium | Open ↗ | ||
| Print the matrix in spiral manner | Medium | Open ↗ | ||
| Pascal's Triangle I | Easy | Open ↗ | ||
| Pascal's Triangle II | Medium | Open ↗ | — | |
| Pascal's Triangle III | — | Open ↗ | — | |
| Rotate matrix by 90 degrees | Medium | Open ↗ | ||
| Set Matrix Zeroes | Medium | Open ↗ | ||
| Two Sum | Easy | Open ↗ | ||
| 3 Sum | Medium | Open ↗ | ||
| 4 Sum | Medium | Open ↗ | ||
| Sort an array of 0's 1's and 2's | Medium | Open ↗ | ||
| Kadane's Algorithm | Medium | Open ↗ | ||
| Next Permutation | Medium | Open ↗ |
Hashing
0 / 5
Binary Search
0 / 31
Fundamentals
0 / 3
Logic Building
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Search insert position | Easy | Open ↗ | ||
| Floor and Ceil in Sorted Array | Medium | Open ↗ | ||
| First and last occurrence | Medium | Open ↗ | ||
| Search in rotated sorted array-I | Medium | Open ↗ | ||
| Search in rotated sorted array-II | Medium | Open ↗ | ||
| Find minimum in Rotated Sorted Array | Medium | Open ↗ | ||
| Find out how many times the array is rotated | — | Open ↗ | ||
| Single element in sorted array | Medium | Open ↗ |
On answers
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Find square root of a number | Easy | Open ↗ | ||
| Find Nth root of a number | Medium | Open ↗ | ||
| Find the smallest divisor | Medium | Open ↗ | ||
| Koko eating bananas | Medium | Open ↗ | ||
| Minimum days to make M bouquets | Medium | Open ↗ | ||
| Capacity to Ship Packages Within D Days | Medium | Open ↗ | ||
| Kth Missing Positive Number | Easy | Open ↗ | ||
| Painter's Partition | Hard | Open ↗ |
FAQs
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Aggressive Cows | Medium | Open ↗ | ||
| Book Allocation Problem | Medium | Open ↗ | ||
| Find peak element | Medium | Open ↗ | ||
| Median of 2 sorted arrays | Hard | Open ↗ | ||
| Kth element of 2 sorted arrays | Medium | Open ↗ | ||
| Minimize Max Distance to Gas Station May require a platform subscription | Hard | Open ↗ | ||
| Split array - largest sum | Hard | Open ↗ |
Recursion
0 / 17
Implementation Problems
0 / 3
Subsequence Pattern Problems
0 / 2
FAQs (Medium)
0 / 5
Hard
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Letter Combinations of a Phone Number | Medium | Open ↗ | — |
Linked-List
0 / 39
Fundamentals (Single LL)
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Traversal in Linked List | — | Open ↗ | — | |
| Deletion of the head of LL | Medium | Open ↗ | ||
| Deletion of the tail of Linked List | Easy | Open ↗ | — | |
| Deletion of the Kth element of Linked List | — | Open ↗ | — | |
| Delete the element with value X | — | Open ↗ | — | |
| Insertion at the head of Linked List | — | Open ↗ | ||
| Insertion at the tail of Linked List | — | Open ↗ | — | |
| Insertion at the Kth position of Linked List | — | Open ↗ | — | |
| Insertion before the value X in Linked List | — | Open ↗ | — |
Fundamentals (Doubly LL)
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Convert Array to Doubly Linked List | Easy | Open ↗ | — | |
| Delete Tail of Doubly Linked List | — | Open ↗ | — | |
| Delete Kth Element of Doubly Linked List | — | Open ↗ | — | |
| Removing given node in Doubly Linked List | — | Open ↗ | — | |
| Insert node before head in Doubly Linked List | — | Open ↗ | ||
| Insert node before tail in Doubly Linked List | — | Open ↗ | — | |
| Insert node before (kth node) in Doubly Linked List | — | Open ↗ | — | |
| Insert before given node in Doubly Linked List | — | Open ↗ | — |
Logic Building
0 / 5
FAQs (Medium)
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Add one to a number represented by LL | — | Open ↗ | ||
| Find Middle of Linked List | Easy | Open ↗ | ||
| Delete the middle node in LL | Medium | Open ↗ | ||
| Check if LL is palindrome or not | Easy | Open ↗ | ||
| Find the intersection point of Y LL | Easy | Open ↗ | ||
| Detect a loop in LL | Easy | Open ↗ | ||
| Find the starting point in LL | Medium | Open ↗ | ||
| Length of loop in LL | Medium | Open ↗ |
FAQs (Hard)
0 / 6
Bit Manipulation
0 / 7
Problems
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Minimum Bit Flips to Convert Number | Easy | Open ↗ | ||
| Single Number - I | Easy | Open ↗ | ||
| Single Number - II | — | Open ↗ | — | |
| Single Number - III | — | Open ↗ | ||
| Divide two numbers without multiplication and division | Medium | Open ↗ | ||
| Power Set Bit Manipulation | Medium | Open ↗ | ||
| XOR of numbers in a given range | Easy | Open ↗ |
Greedy Algorithms
0 / 14
Easy
0 / 4
Scheduling and Interval Problems
0 / 7
Sliding Window / 2 Pointer
0 / 11
Constant Window
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Maximum Points You Can Obtain from Cards | Medium | Open ↗ |
Longest and Smallest Window Problems
0 / 6
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Longest Substring Without Repeating Characters | Medium | Open ↗ | ||
| Max Consecutive Ones III | Medium | Open ↗ | ||
| Fruit Into Baskets | Medium | Open ↗ | ||
| Longest Substring With At Most K Distinct Characters May require a platform subscription | Medium | Open ↗ | ||
| Longest Repeating Character Replacement | Medium | Open ↗ | ||
| Minimum Window Substring | Hard | Open ↗ |
Stack / Queues
0 / 22
Implementation
0 / 7
Monotonic Stack
0 / 6
FAQs
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Implement Min Stack | Medium | Open ↗ | ||
| Sliding Window Maximum | Hard | Open ↗ | ||
| Trapping Rainwater | Hard | Open ↗ | ||
| Largest rectangle in a histogram | Hard | Open ↗ | ||
| Maximum Rectangles | Hard | Open ↗ | ||
| Stock span problem | Medium | Open ↗ | ||
| Celebrity Problem May require a platform subscription | Medium | Open ↗ | ||
| LRU Cache | Medium | Open ↗ | — | |
| LFU Cache | Hard | Open ↗ |
Binary Trees
0 / 31
Theory/Traversals
0 / 5
Medium Problems
0 / 7
FAQs
0 / 13
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Zig Zag or Spiral Traversal | Medium | Open ↗ | ||
| Boundary Traversal May require a platform subscription | Medium | Open ↗ | ||
| Vertical Order Traversal | Hard | Open ↗ | ||
| Top View of BT | Medium | Open ↗ | ||
| Bottom view of BT | Medium | Open ↗ | ||
| Right/Left View of BT | Medium | Open ↗ | ||
| Print root to leaf path in BT | Medium | Open ↗ | ||
| LCA in BT | Medium | Open ↗ | ||
| Maximum Width of BT | Medium | Open ↗ | ||
| Print all nodes at a distance of K in BT | Medium | Open ↗ | ||
| Minimum time taken to burn the BT from a given Node | — | Open ↗ | ||
| Count total nodes in a complete BT | Medium | Open ↗ | ||
| Flatten Binary Tree to Linked List | Medium | Open ↗ |
Construction Problems
0 / 4
Binary Search Trees
0 / 13
Theory and Basics
0 / 2
Medium
0 / 7
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Insert a given node in BST | Medium | Open ↗ | ||
| Delete a node in BST | Medium | Open ↗ | ||
| Kth Smallest and Largest element in BST | Medium | Open ↗ | ||
| Check if a tree is a BST or not | Medium | Open ↗ | ||
| LCA in BST | Medium | Open ↗ | ||
| Construct a BST from a preorder traversal | Medium | Open ↗ | ||
| Inorder successor and predecessor in BST May require a platform subscription | Medium | Open ↗ |
Heaps
0 / 9
Theory and Implementation
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Heapify Algorithm | — | Open ↗ | — | |
| Build heap from a given Array | Easy | Open ↗ | — | |
| Implement Min Heap | Easy | Open ↗ | — | |
| Implement Max Heap | Easy | Open ↗ | — | |
| Check if an array represents a min heap | — | Open ↗ | — | |
| Convert Min Heap to Max Heap | Medium | Open ↗ | — | |
| Heap Sort | Medium | Open ↗ | — | |
| K-th Largest element in an array | — | Open ↗ | — |
FAQs
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Kth largest element in a stream of running integers | Easy | Open ↗ | — |
Graphs
0 / 42
Theory and traversals
0 / 2
Traversal Problems
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Number of provinces | Medium | Open ↗ | ||
| Number of islands | Medium | Open ↗ | ||
| Flood fill algorithm | Easy | Open ↗ | — | |
| Number of enclaves | Medium | Open ↗ | ||
| Rotten Oranges | Medium | Open ↗ | ||
| Distance of nearest cell having one | Medium | Open ↗ | ||
| Surrounded Regions | Medium | Open ↗ | ||
| Number of distinct islands | Medium | Open ↗ | — |
Cycles
0 / 4
Hard Problems
0 / 8
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Find eventual safe states | Medium | Open ↗ | ||
| Course Schedule I | Medium | Open ↗ | ||
| Course Schedule II | Medium | Open ↗ | ||
| Alien Dictionary May require a platform subscription | Hard | Open ↗ | ||
| Shortest path in DAG | Medium | Open ↗ | ||
| Shortest path in undirected graph with unit weights | — | Open ↗ | ||
| Word ladder I | Hard | Open ↗ | ||
| Word ladder II | Hard | Open ↗ |
Shortest Path Algorithms
0 / 10
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Dijkstra's algorithm | Medium | Open ↗ | ||
| Print Shortest Path | Medium | Open ↗ | — | |
| Shortest Distance in a Binary Maze | Medium | Open ↗ | ||
| Path with minimum effort | Medium | Open ↗ | ||
| Cheapest flight within K stops | Medium | Open ↗ | ||
| Minimum multiplications to reach end | Medium | Open ↗ | ||
| Number of ways to arrive at destination | Medium | Open ↗ | ||
| Bellman ford algorithm | Medium | Open ↗ | ||
| Floyd warshall algorithm | Medium | Open ↗ | ||
| Find the city with the smallest number of neighbors | Medium | Open ↗ |
Minimum Spanning Tree
0 / 2
Hard Problems II
0 / 5
Dynamic Programming
0 / 47
1D DP
0 / 5
2D DP
0 / 1
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Ninja's training | Medium | Open ↗ |
DP on grids
0 / 5
DP on stocks
0 / 5
DP on subsequences
0 / 11
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Subset sum equals to target | Medium | Open ↗ | ||
| Partition equal subset sum | Medium | Open ↗ | ||
| Partition a set into two subsets with minimum absolute sum difference | Hard | Open ↗ | ||
| Count subsets with sum K | Medium | Open ↗ | ||
| Count partitions with given difference | Medium | Open ↗ | ||
| 0 and 1 Knapsack | Medium | Open ↗ | ||
| Minimum coins | Medium | Open ↗ | ||
| Target sum | Medium | Open ↗ | ||
| Coin change II | Medium | Open ↗ | ||
| Unbounded knapsack | Medium | Open ↗ | ||
| Rod cutting problem | Medium | Open ↗ |
LIS
0 / 6
DP on strings
0 / 9
| Done | Problem | Level | Practice | Video |
|---|---|---|---|---|
| Longest common subsequence | Medium | Open ↗ | ||
| Longest common substring | Medium | Open ↗ | ||
| Longest palindromic subsequence | Medium | Open ↗ | ||
| Minimum insertions to make string palindrome | Hard | Open ↗ | ||
| Minimum insertions or deletions to convert string A to B | Medium | Open ↗ | ||
| Shortest common supersequence | Hard | Open ↗ | ||
| Distinct subsequences | Hard | Open ↗ | ||
| Edit distance | Medium | Open ↗ | ||
| Wildcard matching | Hard | Open ↗ |