Skip to content
CodePrime
DSA
LeetCode
Project Euler+
System Design
Blog
Search
Ctrl
K
Cancel
GitHub
Select theme
Dark
Light
Auto
Menu
0
Overview
Bit Manipulation
Prerequisites
Longest Consecutive 1s in Binary Representation
Inclusive Exclusive Principle
Sets bits from 1 to N
Number Theory
Exponentiation
Modular Exponentiation
Trees
Maximum Binary Tree
1
Overview
Company interview lists
Overview
Amazon
Facebook
Google
LinkedIn
Top 50 Interview questions
Striver SDE Sheet
Arrays
Pascal's Triangle
Next Permutation
Set Matrix Zeroes
Best Time to Buy and Sell Stock
Maximum Subarray
Sort Colors
Arrays Part-II
Merge Intervals
Merge Sorted Array
Repeat and Missing Number Array
Rotate Image
Count Inversions
Find the Duplicate Number
Arrays Part-III
Reverse Pairs
Search a 2D Matrix
Pow(x, n)
Majority Element II
Unique Paths
Majority Element
Arrays Part-IV
4Sum
Longest Consecutive Sequence
Subarray with given XOR
Longest Subarray Zero Sum
Two Sum
Longest Substring Without Repeating Characters
Linked List
Add Two Numbers
Delete Node in a Linked List
Reverse Linked List
Middle of the Linked List
Merge Two Sorted Lists
Remove Nth Node From End of List
Linked List Part-II
Palindrome Linked List
Flattening a Linked List
Linked List Cycle
Reverse Nodes in k-Group
Intersection of Two Linked Lists
Linked List Cycle II
Linked List and Arrays
Trapping Rain Water
Max Consecutive Ones
Remove Duplicates from Sorted Array
3Sum
Copy List with Random Pointer
Rotate List
Greedy Algorithm
Minimum Platforms
Job Sequencing Problem
Number of Coins
Maximum Meetings
Fractional Knapsack
Recursion
Combination Sum II
Subset Sums
Permutation Sequence
Combination Sum
Subsets II
Palindrome Partitioning
Recursion and Backtracking
Sudoku Solver
Word Break
Rat in a Maze Problem I
N-Queens
M-Coloring Problem
Permutations
Binary Search
Allocate Books
K-th element of two sorted Arrays
Median of Two Sorted Arrays
The N-th root of an integer
Single Element in a Sorted Array
Matrix Median
Search in Rotated Sorted Array
Chess Tournament
Heaps
Merge K Sorted Arrays
Kth Largest Element in an Array
Top K Frequent Elements
Maximum Sum Combinations
Find Median from Data Stream
Stack and Queue
Implement a Queue using array
Next Greater Element I
Implement Stack using Queues
Implement Stack Using Arrays
Implement Queue using Stacks
Sort a Stack
Valid Parentheses
Stack and Queue Part-II
Sliding Window Maximum
Nearest Smaller Element
Rotting Oranges
LFU Cache
Online Stock Span
Min Stack
LRU Cache
Largest Rectangle in Histogram
The Celebrity Problem
String
Reverse Words in a String
Repeated String Match
String to Integer (atoi)
Roman to Integer
Longest Palindromic Substring
Longest Common Prefix
String-II
Valid Anagram
Minimum Characters required to make a String Palindromic
Implement strStr()
Compare Version Numbers
Count and Say
Binary Tree
Binary Tree Preorder Traversal
Left View of Binary Tree
Tree Traversals
Maximum Width of Binary Tree
Binary Tree Postorder Traversal
Binary Tree Preorder Traversal
Path to Given Node
Vertical Order Traversal of a Binary Tree
Binary Tree Inorder Traversal
Top View of Binary Tree
Bottom View of Binary Tree
Binary Tree Inorder Traversal
Binary Tree Part-II
Binary Tree Zigzag Level Order Traversal
Binary Tree Level Order Traversal
Boundary Traversal of binary tree
Lowest Common Ancestor of a Binary Tree
Same Tree
Maximum Depth of Binary Tree
Balanced Binary Tree
Diameter of Binary Tree
Binary Tree part-III
Construct Binary Tree from Preorder and Inorder Traversal
Construct Binary Tree from Inorder and Postorder Traversal
Symmetric Tree
Flatten Binary Tree to Linked List
Children Sum Property
Binary Tree Maximum Path Sum
Mirror Tree
Binary Search Tree
Lowest Common Ancestor of a Binary Search Tree
Search in a Binary Search Tree
Construct Binary Search Tree from Preorder Traversal
Validate Binary Search Tree
Convert Sorted Array to Binary Search Tree
Populating Next Right Pointers in Each Node
Binary Search Tree Part-II
Two Sum IV - Input is a BST
Kth largest element in BST
Maximum Sum BST in Binary Tree
Binary Search Tree Iterator
Ceil from BST
Kth Smallest Element in a BST
Serialize and Deserialize Binary Tree
Floor in BST
Binary Trees[Miscellaneous]
Kth Largest Element in an Array
Flood Fill
Distinct Numbers in Window
Flatten Binary Tree to Linked List
Kth Largest Element in a Stream
Find Median from Data Stream
Graph
Is Graph Bipartite?
Number of Islands
Course Schedule
Clone Graph
DFS of Graph
Topological sort
BFS of graph
Graph Part-II
Maximum Number of Non-Overlapping Substrings
Dijkstra Algorithm
Floyd Warshall Algorithm
Bellman-Ford Algorithm
Minimum Spanning Tree
Dynamic Programming
Longest Increasing Subsequence
Longest Common Subsequence
Ones and Zeroes
Matrix Chain Multiplication
Edit Distance
Maximum sum increasing subsequence
Maximum Product Subarray
Dynamic Programming Part-II
Word Break
Partition Equal Subset Sum
Maximum Profit in Job Scheduling
Minimum Path Sum
Coin Change
Palindrome Partitioning
Minimum Cost to Cut a Stick
Super Egg Drop
Trie
Subsets
Maximum XOR of Two Numbers in an Array
Implement Trie (Prefix Tree)
Maximum XOR With an Element From Array
Striver DP Sheet
1D DP
Climbing Stairs
Frog with k jumps
Maximum sum of non-adjacent elements
House Robber
House Robber II
Blind 75
Arrays
Two Sum
Best Time to Buy and Sell Stock
Contains Duplicate
Product of Array Except Self
Maximum Subarray
Maximum Product Subarray
Find Minimum in Rotated Sorted Array
Find Minimum in Rotated Sorted Array II
Search in Rotated Sorted Array
3Sum
Container With Most Water
More problems
Add Binary
Course Schedule II
Group Anagrams
K Closest Points to Origin
Merge k Sorted Lists
Most Common Word
Multiply Strings
Top K Frequent Words
Valid Number
Word Break II
Word Search
Word Search II
2
All problems
001 · Multiples of 3 or 5
002 · Even Fibonacci numbers
239 · Twenty-two Foolish Primes
3
Overview
Case studies
GitHub
Select theme
Dark
Light
Auto
Heap(Priority_Queue)
4 problems tagged
Heap(Priority_Queue)
.
All topics →
Dijkstra Algorithm
Graph · Dynamic Programming
Maximum Sum Combinations
Heap(Priority Queue)
Merge K Sorted Arrays
Heap(Priority Queue)
Minimum Spanning Tree
Graph · Dynamic Programming
