Strivers A2Z DSA Sheet

The most widely-used A2Z DSA roadmap, from basics to advanced topics, in one structured path.

By Striver (TakeUForward) · 433 Problems

Total Problems: 433Difficulty Levels:BasicEasyMediumHard

–

Loading your progress…0/433

User Input / Output

TUF•Basic

Data Types

TUF•Basic

If Else statements

TUF•Basic

Switch Statement

TUF•Basic

For loops

TUF•Easy

While loops

TUF•Easy

Functions (Pass by Reference and Value)

HackerRank•Easy

What are arrays, strings?

TUF•Easy

Time Complexity [Learn Basics, and then analyse in next Steps]

TUF•Easy

Understand recursion by print something N times

TUF•Basic

Print name N times using recursion

TUF•Easy

Print 1 to N using recursion

TUF•Basic

Print N to 1 using recursion

TUF•Easy

Sum of first N numbers

TUF•Basic

Factorial of N numbers

TUF•Easy

Reverse an array

LeetCode•Easy

Check if a string is palindrome or not

LeetCode•Easy

Fibonacci Number

LeetCode•Easy

Largest Element in an Array

TUF•Basic

Second Largest Element in an Array without sorting

TUF•Easy

Check if the array is sorted

LeetCode•Easy

Remove duplicates from Sorted array

LeetCode•Easy

Left Rotate an array by one place

LeetCode•Medium

Move Zeros to end

LeetCode•Easy

Linear Search

TUF•Basic

Find the Union

TUF•Medium

Find missing number in an array

LeetCode•Easy

Maximum Consecutive Ones

LeetCode•Easy

Find the number that appears once, and other numbers twice.

LeetCode•Easy

Longest subarray with given sum K(positives)

TUF•Medium

2Sum Problem

LeetCode•Easy

Sort an array of 0's 1's and 2's

LeetCode•Medium

Majority Element (>n/2 times)

LeetCode•Easy

Kadane's Algorithm, maximum subarray sum

LeetCode•Medium

Print subarray with maximum subarray sum (extended version of above problem)

TUF•Medium

Stock Buy and Sell

LeetCode•Easy

Rearrange the array in alternating positive and negative items

LeetCode•Medium

Next Permutation

LeetCode•Medium

Leaders in an Array problem

TUF•Easy

Longest Consecutive Sequence in an Array

LeetCode•Medium

Set Matrix Zeros

LeetCode•Medium

Rotate Matrix by 90 degrees

LeetCode•Medium

Print the matrix in spiral manner

LeetCode•Medium

Count subarrays with given sum

LeetCode•Medium

Pascal's Triangle

LeetCode•Easy

Majority Element (n/3 times)

LeetCode•Medium

3-Sum Problem

LeetCode•Medium

4-Sum Problem

LeetCode•Medium

Largest Subarray with 0 Sum

TUF•Medium

Count number of subarrays with given xor K

InterviewBit•Medium

Merge Overlapping Subintervals

LeetCode•Medium

Merge two sorted arrays without extra space

LeetCode•Easy

Find the repeating and missing number

TUF•Easy

Count Inversions

TUF•Medium

Reverse Pairs

LeetCode•Hard

Maximum Product Subarray

LeetCode•Medium

Binary Search to find X in sorted array

LeetCode•Easy

Implement Lower Bound

TUF•Easy

Implement Upper Bound

TUF•Easy

Search Insert Position

LeetCode•Easy

Floor/Ceil in Sorted Array

TUF•Medium

Find the first or last occurrence of a given number in a sorted array

LeetCode•Medium

Count occurrences of a number in a sorted array with duplicates

TUF•Easy

Search in Rotated Sorted Array I

LeetCode•Medium

Search in Rotated Sorted Array II

LeetCode•Medium

Find minimum in Rotated Sorted Array

LeetCode•Medium

Find out how many times has an array been rotated

TUF•Easy

Single element in a Sorted Array

LeetCode•Medium

Find peak element

LeetCode•Medium

Find square root of a number in log n

TUF•Easy

Find the Nth root of a number using binary search

TUF•Medium

Koko Eating Bananas

LeetCode•Medium

Minimum days to make M bouquets

LeetCode•Medium

Find the smallest Divisor

LeetCode•Medium

Capacity to Ship Packages within D Days

LeetCode•Medium

Kth Missing Positive Number

LeetCode•Easy

Aggressive Cows

SPOJ•Easy

Book Allocation Problem

TUF•Medium

Split array - Largest Sum

LeetCode•Hard

Painter's partition

TUF•Medium

Minimize Max Distance to Gas Station

LeetCode•Hard

Median of 2 sorted arrays

LeetCode•Hard

Kth element of 2 sorted arrays

TUF•Medium

Remove outermost Paranthesis

LeetCode•Easy

Reverse words in a given string / Palindrome Check

LeetCode•Medium

Largest odd number in a string

LeetCode•Easy

Longest Common Prefix

LeetCode•Easy

Isomorphic String

LeetCode•Easy

check whether one string is a rotation of another

LeetCode•Easy

Check if two strings are anagram of each other

LeetCode•Easy

Sort Characters by frequency

LeetCode•Medium

Maximum Nesting Depth of Paranthesis

LeetCode•Easy

Roman Number to Integer and vice versa

LeetCode•Easy

Implement Atoi

LeetCode•Medium

Count Number of Substrings

LeetCode•Hard

Longest Palindromic Substring[Do it without DP]

LeetCode•Medium

Sum of Beauty of all substring

LeetCode•Medium

Reverse Every Word in A String

LeetCode•Medium

Introduction to LinkedList, learn about struct, and how is node represented

TUF•Easy

Inserting a node in LinkedList

TUF•Basic

Deleting a node in LinkedList

LeetCode•Medium

Find the length of the linkedlist [learn traversal]

TUF•Basic

Search an element in the LL

TUF•Easy

Middle of a LinkedList [TortoiseHare Method]

LeetCode•Easy

Reverse a LinkedList [Iterative]

LeetCode•Easy

Detect a loop in LL

LeetCode•Easy

Find the starting point in LL

LeetCode•Medium

Length of Loop in LL

TUF•Medium

Check if LL is palindrome or not

LeetCode•Easy

Segrregate odd and even nodes in LL

LeetCode•Medium

Remove Nth node from the back of the LL

LeetCode•Medium

Delete the middle node of LL

LeetCode•Medium

Sort LL

LeetCode•Medium

Sort a LL of 0's 1's and 2's by changing links

TUF•Medium

Find the intersection point of Y LL

LeetCode•Easy

Add 1 to a number represented by LL

TUF•Medium

Add 2 numbers in LL

LeetCode•Medium

Recursive Implementation of atoi()

LeetCode•Medium

Pow(x, n)

LeetCode•Medium

Count Good numbers

LeetCode•Medium

Sort a stack using recursion

TUF•Medium

Reverse a stack using recursion

TUF•Medium

Generate all binary strings

TUF•Easy

Generate Paranthesis

LeetCode•Medium

Print all subsequences/Power Set

LeetCode•Medium

Learn All Patterns of Subsequences (Theory)

LeetCode•Hard

Count all subsequences with sum K

TUF•Medium

Check if there exists a subsequence with sum K

TUF•Medium

Combination Sum

LeetCode•Medium

Combination Sum-II

LeetCode•Medium

Subset Sum-I

TUF•Medium

Subset Sum-II

LeetCode•Medium

Combination Sum - III

LeetCode•Medium

Letter Combinations of a Phone number

LeetCode•Medium

Introduction to Bit Manipulation [Theory]

TUF•Easy

Check if the i-th bit is set or not

TUF•Easy

Check if a number is odd or not

TUF•Basic

Check if a number is power of 2 or not

LeetCode•Easy

Count the number of set bits

TUF•Medium

Set/Unset the rightmost unset bit

HackerRank•Easy

Swap two numbers

TUF•Basic

Divide two integers without using multiplication, division and mod operator

LeetCode•Medium

Implement Stack using Arrays

TUF•Easy

Implement Queue using Arrays

TUF•Basic

Implement Stack using Queue

LeetCode•Easy

Implement Queue using Stack

LeetCode•Easy

Implement stack using Linkedlist

TUF•Easy

Implement queue using Linkedlist

TUF•Basic

Check for balanced paranthesis

LeetCode•Easy

Implement Min Stack

LeetCode•Medium

Next Greater Element

LeetCode•Easy

Next Greater Element 2

LeetCode•Medium

Next Smaller Element

InterviewBit•Easy

Number of NGEs to the right

TUF•Medium

Trapping Rainwater

LeetCode•Hard

Sum of subarray minimum

LeetCode•Medium

Asteroid Collision

LeetCode•Medium

Sum of subarray ranges

LeetCode•Medium

Remove k Digits

LeetCode•Medium

Largest rectangle in a histogram

LeetCode•Hard

Maximal Rectangles

LeetCode•Hard

Longest Substring Without Repeating Characters

LeetCode•Medium

Max Consecutive Ones III

LeetCode•Medium

Fruit Into Baskets

TUF•Medium

longest repeating character replacement

LeetCode•Medium

Binary subarray with sum

LeetCode•Medium

Count number of nice subarrays

LeetCode•Medium

Number of substring containing all three characters

LeetCode•Medium

Maximum point you can obtain from cards

LeetCode•Medium

Introduction to Priority Queues using Binary Heaps

TUF•Easy

Min Heap and Max Heap Implementation

TUF•Medium

Check if an array represents a min-heap or not

TUF•Easy

Convert min Heap to max Heap

TUF•Medium

Assign Cookies

LeetCode•Easy

Fractional Knapsack Problem

TUF•Medium

Greedy algorithm to find minimum number of coins

TUF•Easy

Lemonade Change

LeetCode•Easy

Valid Paranthesis Checker

LeetCode•Medium

N meetings in one room

TUF•Easy

Jump Game

LeetCode•Medium

Jump Game 2

LeetCode•Medium

Minimum number of platforms required for a railway

TUF•Medium

Job sequencing Problem

TUF•Medium

Candy

LeetCode•Hard

Program for Shortest Job First (or SJF) CPU Scheduling

TUF•Medium

Program for Least Recently Used (LRU) Page Replacement Algorithm

TUF•Easy

Insert Interval

LeetCode•Medium

Merge Intervals

LeetCode•Medium

Non-overlapping Intervals

LeetCode•Medium

Introduction to Trees

TUF•Easy

Binary Tree Representation in C++

TUF•Easy

Binary Tree Representation in Java

TUF•Easy

Binary Tree Traversals in Binary Tree

TUF•Easy

Preorder Traversal of Binary Tree

LeetCode•Easy

Inorder Traversal of Binary Tree

LeetCode•Easy

Post-order Traversal of Binary Tree

LeetCode•Easy

Level order Traversal / Level order traversal in spiral form

LeetCode•Medium

Preorder, Inorder, and Postorder Traversal in one Traversal

TUF•Medium

Height of a Binary Tree

LeetCode•Easy

Check if the Binary tree is height-balanced or not

LeetCode•Easy

Diameter of Binary Tree

LeetCode•Easy

Maximum path sum

LeetCode•Hard

Check if two trees are identical or not

LeetCode•Easy

Zig Zag Traversal of Binary Tree

LeetCode•Medium

Boundary Traversal of Binary Tree

LeetCode•Medium

Vertical Order Traversal of Binary Tree

LeetCode•Hard

Top View of Binary Tree

TUF•Medium

Bottom View of Binary Tree

TUF•Medium

Right/Left View of Binary Tree

LeetCode•Medium

Symmetric Binary Tree

LeetCode•Easy

Root to Node Path in Binary Tree

TUF•Medium

LCA in Binary Tree

LeetCode•Medium

Maximum width of a Binary Tree

LeetCode•Medium

Check for Children Sum Property

TUF•Medium

Print all the Nodes at a distance of K in a Binary Tree

LeetCode•Medium

Minimum time taken to BURN the Binary Tree from a Node

TUF•Hard

Count total Nodes in a COMPLETE Binary Tree

LeetCode•Easy

Requirements needed to construct a Unique Binary Tree | Theory

TUF•Easy

Construct Binary Tree from inorder and preorder

LeetCode•Medium

Construct the Binary Tree from Postorder and Inorder Traversal

LeetCode•Medium

Serialize and deserialize Binary Tree

LeetCode•Hard

Morris Preorder Traversal of a Binary Tree

LeetCode•Easy

Flatten Binary Tree to LinkedList

LeetCode•Medium

Introduction to Binary Search Tree

TUF•Easy

Search in a Binary Search Tree

LeetCode•Easy

Find Min/Max in BST

HackerRank•Basic

Ceil in a Binary Search Tree

TUF•Medium

Insert a given Node in Binary Search Tree

LeetCode•Medium

Delete a Node in Binary Search Tree

LeetCode•Medium

Find K-th smallest/largest element in BST

LeetCode•Medium

Check if a tree is a BST or BT

LeetCode•Medium

LCA in Binary Search Tree

LeetCode•Medium

Construct a BST from a preorder traversal

LeetCode•Medium

Inorder Successor/Predecessor in BST

LeetCode•Medium

Merge 2 BST's

LeetCode•Medium

Two Sum In BST | Check if there exists a pair with Sum K

LeetCode•Easy

Recover BST | Correct BST with two nodes swapped

LeetCode•Medium

Largest BST in Binary Tree

TUF•Medium

Graph and Types

TUF•Easy

Graph Representation | C++

TUF•Easy

Graph Representation | Java

HackerRank•Easy

Connected Components | Logic Explanation

LeetCode•Medium

BFS

TUF•Easy

Number of provinces (leetcode)

LeetCode•Medium

Connected Components Problem in Matrix

TUF•Medium

Rotten Oranges

LeetCode•Medium

Flood fill

LeetCode•Easy

Cycle Detection in unirected Graph (bfs)

TUF•Medium

0/1 Matrix (Bfs Problem)

LeetCode•Medium

Surrounded Regions (dfs)

LeetCode•Medium

Number of Enclaves [flood fill implementation - multisource]

LeetCode•Medium

Word ladder - 1

LeetCode•Hard

Word ladder - 2

LeetCode•Hard

Number of Distinct Islands [dfs multisource]

LeetCode•Hard

Bipartite Graph (DFS)

LeetCode•Medium

Cycle Detection in Directed Graph (DFS)

LeetCode•Medium

Shortest Path in UG with unit weights

TUF•Medium

Shortest Path in DAG

TUF•Medium

Djisktra's Algorithm

TUF•Medium

Shortest path in a binary maze

LeetCode•Medium

Path with minimum effort

LeetCode•Medium

Cheapest flights within k stops

LeetCode•Medium

Network Delay time

LeetCode•Medium

Number of ways to arrive at destination

LeetCode•Medium

Minimum steps to reach end from start by performing multiplication and mod operations with array elements

TUF•Medium

Bellman Ford Algorithm

TUF•Medium

Floyd Warshal Algorithm

TUF•Medium

Find the city with the smallest number of neighbors in a threshold distance

LeetCode•Medium

Dynamic Programming Introduction

TUF•Medium

Ninja's Training (DP 7)

TUF•Medium

Grid Unique Paths : DP on Grids (DP8)

LeetCode•Medium

Grid Unique Paths 2 (DP 9)

LeetCode•Medium

Minimum path sum in Grid (DP 10)

LeetCode•Medium

Minimum path sum in Triangular Grid (DP 11)

LeetCode•Medium

Minimum/Maximum Falling Path Sum (DP-12)

LeetCode•Medium

3-d DP : Ninja and his friends (DP-13)

TUF•Hard

Subset sum equal to target (DP- 14)

TUF•Medium

Partition Equal Subset Sum (DP- 15)

LeetCode•Medium

Partition Set Into 2 Subsets With Min Absolute Sum Diff (DP- 16)

LeetCode•Hard

Count Subsets with Sum K (DP - 17)

TUF•Medium

Count Partitions with Given Difference (DP - 18)

TUF•Medium

Assign Cookies

LeetCode•Easy

Minimum Coins (DP - 20)

LeetCode•Medium

Target Sum (DP - 21)

LeetCode•Medium

Coin Change 2 (DP - 22)

LeetCode•Medium

Unbounded Knapsack (DP - 23)

TUF•Medium

Rod Cutting Problem | (DP - 24)

TUF•Medium

Longest Common Subsequence | (DP - 25)

LeetCode•Medium

Print Longest Common Subsequence | (DP - 26)

TUF•Hard

Longest Common Substring | (DP - 27)

TUF•Medium

Longest Palindromic Subsequence | (DP-28)

LeetCode•Medium

Minimum insertions to make string palindrome | DP-29

LeetCode•Hard

Minimum Insertions/Deletions to Convert String | (DP- 30)

LeetCode•Medium

Shortest Common Supersequence | (DP - 31)

LeetCode•Hard

Distinct Subsequences| (DP-32)

LeetCode•Hard

Edit Distance | (DP-33)

LeetCode•Medium

Wildcard Matching | (DP-34)

LeetCode•Hard

Longest Increasing Subsequence |(DP-41)

LeetCode•Medium

Printing Longest Increasing Subsequence|(DP-42)

TUF•Medium

Longest Increasing Subsequence |(DP-43)

TUF•Medium

Largest Divisible Subset|(DP-44)

LeetCode•Medium

Longest String Chain|(DP-45)

LeetCode•Medium

Longest Bitonic Subsequence |(DP-46)

TUF•Medium

Number of Longest Increasing Subsequences|(DP-47)

LeetCode•Medium

Implement TRIE | INSERT | SEARCH | STARTSWITH

LeetCode•Medium

Frequently asked questions

What is the Striver A2Z DSA Sheet?

A structured roadmap of data structures and algorithms problems created by Striver (TakeUForward), organized into sequential topics from programming basics through arrays, recursion, trees, graphs, and dynamic programming.

How many problems does it have?

433 problems across 61 topic and sub-topic sections.

Are video solutions included?

Yes. Wherever Striver has published a YouTube walkthrough for a specific problem, a video icon appears next to it. Click it to watch the solution in a modal without leaving the page.

Is it free to use?

Yes. Browsing every problem on this page is completely free, with no account required. Creating a free DevsUnite account lets you save your checked-off progress, star favorites, and add personal notes that sync across devices.

Do I need an account to track my progress?

You can read and solve every problem without logging in. An account is only required to mark a problem as done, star it, or add a note. Those actions save to your account instead of resetting on refresh.