Sheets/StriverA2Z

143 problems

StriverA2Z

Follow the StriverA2Z sheet end-to-end — a proven, ordered set of problems.

141Total problems

0Solved

0%Completion

51/69/23Easy/Med/Hard

Longest Consecutive Sequence· Hashing

Arrays · Hashing

Medium

25m

Subarray with given XOR· Hashing

Arrays · Hashing · Bit Manipulation

Medium

25m

Merge Sort Implementation· Sorting

Sorting · Arrays · Recursion

Medium

25m

Quick Sort Implementation· Sorting

Sorting · Arrays · Recursion

Medium

25m

Largest Element· Arrays

Arrays

Easy

10m

Second Largest Element· Arrays

Arrays

Easy

15m

Check if an Array is Sorted· Arrays

Arrays

Easy

10m

Remove Duplicates from Sorted Array· Arrays

Arrays · Two Pointers

Easy

15m

Left Rotate an Array by 1 Place· Arrays

Arrays

Easy

10m

Left Rotate an Array by K Places· Arrays

Arrays · Two Pointers

Medium

20m

Move Zeros to the End of an Array· Arrays

Arrays · Two Pointers

Easy

15m

Union of Two Sorted Arrays· Arrays

Arrays · Two Pointers

Easy

20m

Finding the Missing Number in an Array· Arrays

Arrays · Hashing · Bit Manipulation

Easy

15m

Maximum Consecutive Ones in an Array· Arrays

Arrays · Sliding Window

Easy

10m

Finding the Single Element in an Array· Arrays

Arrays · Bit Manipulation

Easy

15m

Longest Sub-Array of Positive Integers with Sum K· Arrays

Arrays · Two Pointers · Sliding Window

Medium

25m

Longest Sub-Array with Sum K· Arrays

Arrays · Hashing · Prefix Sum

Medium

25m

Majority Element· Arrays

Arrays · Hashing · Greedy

Easy

15m

Array Rearrangement· Arrays

Arrays · Two Pointers

Medium

25m

Find the Next Permutation· Arrays

Arrays · Two Pointers · Backtracking

Medium

25m

Merge Two Sorted Array· Arrays

Arrays · Two Pointers · Sorting

Medium

20m

Grid Rotation· Arrays

Arrays · Matrix

Medium

25m

Spiral Matrix· Arrays

Arrays · Matrix · Simulation

Medium

25m

Pascal's Triangle· Arrays

Arrays · Maths · Dynamic Programming

Easy

20m

Majority Element II· Arrays

Arrays · Hashing

Medium

25m

Missing and Repeating Elements· Arrays

Arrays · Hashing · Maths

Medium

25m

Count The Inversions· Arrays

Arrays · Sorting · Divide and Conquer

Hard

40m

Lower Bound· Binary Search

Binary Search · Arrays

Easy

15m

Upper Bound· Binary Search

Binary Search · Arrays

Easy

15m

Ceil The Floor· Binary Search

Binary Search · Arrays

Easy

15m

First and Last Occurrence· Binary Search

Binary Search · Arrays

Medium

20m

Number of Occurrences· Binary Search

Binary Search · Arrays

Easy

15m

Search Element in Rotated Sorted Array· Binary Search

Binary Search · Arrays

Medium

25m

Search Element in Rotated Sorted Array II· Binary Search

Binary Search · Arrays

Medium

25m

Find Minimum in Rotated Sorted Array· Binary Search

Binary Search · Arrays

Medium

20m

Find Single Element· Binary Search

Binary Search · Arrays · Bit Manipulation

Medium

20m

Find Peak Element· Binary Search

Binary Search · Arrays

Medium

25m

Find Square root of N· Binary Search

Binary Search · Maths

Easy

15m

Find Nth root of M· Binary Search

Binary Search · Maths

Medium

20m

Monkey Eating Bananas· Binary Search

Binary Search · Arrays · Greedy

Medium

25m

Bouquet Formation· Binary Search

Binary Search · Arrays · Greedy

Medium

25m

Minimum Positive Divisor· Binary Search

Binary Search · Arrays · Greedy

Medium

25m

Minimum Capacity to Transport Parcels· Binary Search

Binary Search · Arrays · Greedy

Medium

25m

K-th Missing Number· Binary Search

Binary Search · Arrays

Easy

20m

Aggressive Cows· Binary Search

Binary Search · Arrays · Greedy

Hard

35m

Book Allocation· Binary Search

Binary Search · Arrays · Greedy

Hard

35m

Painters Partition· Binary Search

Binary Search · Arrays · Greedy

Hard

35m

Minimize Maximum Distance· Binary Search

Binary Search · Arrays · Greedy

Hard

35m

Median of Two Sorted Arrays· Binary Search

Binary Search · Arrays

Hard

45m

K-th element of Two Arrays· Binary Search

Binary Search · Arrays

Hard

40m

Row with Maximum 1's· Binary Search

Binary Search · Arrays · Matrix

Medium

20m

Search in a 2D Sorted Matrix· Binary Search

Binary Search · Arrays · Matrix

Medium

20m

Search in a 2D Sorted Matrix II· Binary Search

Binary Search · Arrays · Matrix

Medium

25m

Find Peak Element II· Binary Search

Binary Search · Arrays · Matrix

Hard

35m

Median in a row-wise sorted Matrix· Binary Search

Binary Search · Arrays · Matrix

Hard

30m

Bit Manipulation Techniques I· Bit Manipulation

Bit Manipulation

Easy

15m

Fractional Knapsack· Greedy Algorithms

Greedy · Arrays · Sorting

Medium

20m

Minimum Coins· Greedy Algorithms

Greedy · Dynamic Programming

Medium

20m

Stack Implementation Using Arrays· Stacks & Queues

Stack · Arrays

Easy

15m

Queue Implementation Using Array· Stacks & Queues

Queue · Arrays

Easy

15m

Implement Stack Using Queue· Stacks & Queues

Stack · Queue

Easy

15m

Implement Queue Using Stack· Stacks & Queues

Stack · Queue

Easy

15m

Stack Implementation Using Linked List· Stacks & Queues

Stack · Linked List

Easy

15m

Queue Implementation Using Linked List· Stacks & Queues

Queue · Linked List

Easy

15m

Next Greater Element· Stacks & Queues

Stack · Monotonic Stack · Arrays

Easy

20m

Next Greater Element II· Stacks & Queues

Stack · Monotonic Stack · Arrays

Medium

25m

Nearest Smaller Element· Stacks & Queues

Stack · Monotonic Stack · Arrays

Medium

20m

Trapping Rainwater· Stacks & Queues

Arrays · Stack · Two Pointers

Hard

40m

Largest Rectangle in Histogram· Stacks & Queues

Arrays · Stack · Monotonic Stack

Hard

40m

Stock Span· Stacks & Queues

Stack · Monotonic Stack · Design

Medium

25m

Convert Array To Linked List· Linked List

Linked List · Arrays

Easy

10m

Insertion At Head· Linked List

Linked List

Easy

10m

Insertion At Tail· Linked List

Linked List

Easy

10m

Insertion At Kth Position· Linked List

Linked List

Easy

15m

Insertion Before a Node With Value X· Linked List

Linked List

Easy

15m

Delete Head· Linked List

Linked List

Easy

10m

Delete Tail· Linked List

Linked List

Easy

10m

Delete Kth Node· Linked List

Linked List

Easy

15m

Delete Node With Value X· Linked List

Linked List

Easy

15m

Length of Linked List· Linked List

Linked List

Easy

10m

Search In Linked List· Linked List

Linked List

Easy

10m

Convert Array To Doubly Linked List· Linked List

Linked List · Arrays

Easy

10m

Insertion At Head (DLL)· Linked List

Linked List

Easy

10m

Insertion At Tail (DLL)· Linked List

Linked List

Easy

10m

Insert Before Kth Node (DLL)· Linked List

Linked List

Easy

15m

Deletion At Head (DLL)· Linked List

Linked List

Easy

10m

Deletion at Tail (DLL)· Linked List

Linked List

Easy

10m

Delete Kth Node (DLL)· Linked List

Linked List

Easy

15m

Reverse a Doubly Linked List· Linked List

Linked List

Easy

15m

Middle of the Linked List· Linked List

Linked List · Two Pointers

Easy

15m

Even and Odd Linked List· Linked List

Linked List

Medium

20m

Sort a LinkedList of 0's 1's and 2's· Linked List

Linked List · Two Pointers · Sorting

Medium

25m

Add 1 to Linked List· Linked List

Linked List · Recursion · Maths

Medium

20m

Delete All Occurrences in a DLL· Linked List

Linked List

Medium

20m

Finding Pairs with Given Sum in a DLL· Linked List

Linked List · Two Pointers

Medium

25m

Removing Duplicates From A Sorted DLL· Linked List

Linked List

Easy

15m

Rotate the Linked List· Linked List

Linked List

Medium

25m

Flatten a Linked List· Linked List

Linked List · Recursion · Sorting

Hard

40m

Level Order Traversal· Binary Trees

Trees · BFS · Queue

Medium

20m

Height of a Binary Tree· Binary Trees

Trees · Recursion · DFS

Easy

15m

Boundary Traversal of Binary Tree· Binary Trees

Trees · DFS · Recursion

Medium

30m

Vertical Order Traversal of Binary Tree· Binary Trees

Trees · BFS · Hashing

Hard

35m

Top View of a Binary Tree· Binary Trees

Trees · BFS · Hashing

Medium

25m

Bottom View of a Binary Tree· Binary Trees

Trees · BFS · Hashing

Medium

25m

Left View of Binary Tree· Binary Trees

Trees · DFS · BFS

Medium

20m

Flattening a Binary Tree into a Right-Skewed List· Binary Trees

Trees · Recursion · DFS

Medium

25m

BFS Traversal· Graphs

Graph · BFS · Queue

Easy

20m

DFS Traversal· Graphs

Graph · DFS · Recursion

Easy

20m

Detect Cycle in Undirected Graph (BFS)· Graphs

Graph · BFS

Medium

25m

Detect Cycle in Undirected Graph (DFS)· Graphs

Graph · DFS

Medium

25m

Detect Cycle In A Directed Graph· Graphs

Graph · DFS · Topological Sort

Medium

25m

Topological Sort· Graphs

Graph · DFS · Topological Sort

Medium

25m

Kahn's Algorithm· Graphs

Graph · BFS · Topological Sort

Medium

25m

Shortest Path in Undirected Graph· Graphs

Graph · BFS

Medium

25m

Shortest Path DAG· Graphs

Graph · Topological Sort · Dynamic Programming

Medium

30m

Dijkstra's Algorithm· Graphs

Graph · Heap · BFS

Medium

30m

Bellman-Ford Algorithm· Graphs

Graph · Dynamic Programming

Medium

30m

Floyd Warshall· Graphs

Graph · Dynamic Programming

Medium

30m

Prim's Algorithm Implementation· Graphs

Graph · Heap · Greedy

Medium

30m

Disjoint Sets Implementation· Graphs

Union Find · Graph

Medium

30m

Kruskal's Algorithm Implementation· Graphs

Graph · Union Find · Greedy

Medium

30m

Find Bridges· Graphs

Graph · DFS

Hard

40m

Articulation Points· Graphs

Graph · DFS

Hard

40m

Strongly Connected Components· Graphs

Graph · DFS · Topological Sort

Hard

40m

Frog Jump I· Dynamic Programming

Dynamic Programming · Recursion

Easy

20m

Frog Jump II· Dynamic Programming

Dynamic Programming · Recursion

Medium

25m

Subset Sum· Dynamic Programming

Dynamic Programming · Arrays · Recursion

Medium

25m

Partition with Minimum Difference· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Counting Subsets with Target Sum· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Count Partitions with Given Difference· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Unbounded Knapsack· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Print the Longest Common Subsequence· Dynamic Programming

Dynamic Programming · Strings

Medium

25m

Longest Common Substring· Dynamic Programming

Dynamic Programming · Strings

Medium

25m

Minimum Insertions to Make Palindrome· Dynamic Programming

Dynamic Programming · Strings

Hard

30m

Counting Subsequences· Dynamic Programming

Dynamic Programming · Strings

Hard

30m

Print the Longest Increasing Subsequence· Dynamic Programming

Dynamic Programming · Arrays

Medium

25m

Minimum Matrix Multiplication Cost· Dynamic Programming

Dynamic Programming · Recursion

Hard

40m

Minimum Cost to Divide a Rod· Dynamic Programming

Dynamic Programming · Recursion

Hard

35m

Distinct Substrings in a String· Tries

Trie · Strings

Hard

35m

Pattern Searching (Rabin-Karp Algorithm)· Strings — Advanced Algorithms

Strings · Rabin Karp · Hashing

Hard

35m

KMP Pattern Matching Algorithm· Strings — Advanced Algorithms

Strings · KMP

Hard

35m