Menu

Earn Premium with Referrals

Invite your friends and earn Premium rewards through our referral program.

See how it works and start inviting friends.

💻 Playlist

Top SWE Sheet Interview Questions

Pattern-based coding interview preparation

0%

Overall Progress

0 solved / 0 total

Easy0/0
Medium0/0
Hard0/0
Two Sum
Contains Duplicate
Majority Element
Majority Element II
Medium
Missing Number
Find the Duplicate Number
Medium
Sort Colors
Medium
Best Time to Buy and Sell Stock
Maximum Subarray
Medium
Maximum Product Subarray
Medium
Maximum Sum Circular Subarray
Medium
Next Permutation
Medium
Rearrange Array Elements by Sign
Medium
Leaders in an Array
Product of Array Except Self
Medium
Kth Largest Element in an Array (Quickselect)
Medium
Subarray Sum Equals K
Medium
Continuous Subarray Sum
Medium
Longest Subarray With Sum 0
Medium
Count Subarrays With XOR K
Medium
Subarray Sums Divisible by K
Medium
Longest Consecutive Sequence
Medium
Two Sum II - Input Array Is Sorted
Medium
Valid Palindrome
Remove Duplicates From Sorted Array
Move Zeroes
Container With Most Water
Medium
3Sum
Medium
4Sum
Medium
Trapping Rain Water
Boats to Save People
Medium
Partition Labels
Medium
Backspace String Compare
Maximum Average Subarray I
Maximum Sum Subarray of Size K
First Negative Number in Every Window
Permutation in String
Medium
Find All Anagrams in a String
Medium
Longest Substring Without Repeating Characters
Medium
Longest Repeating Character Replacement
Medium
Minimum Size Subarray Sum
Medium
Fruit Into Baskets
Medium
Max Consecutive Ones III
Medium
Minimum Window Substring
Longest Subarray With At Most K Distinct
Sliding Window Median
Sliding Window Maximum
Binary Search
Search Insert Position
Lower Bound & Upper Bound
Find First and Last Position of Element in Sorted Array
Medium
Search in Rotated Sorted Array
Medium
Search in Rotated Sorted Array II
Medium
Find Minimum in Rotated Sorted Array
Medium
Single Element in a Sorted Array
Medium
Find Peak Element
Medium
Koko Eating Bananas
Medium
Capacity To Ship Packages Within D Days
Medium
Split Array Largest Sum
Minimum Number of Days to Make m Bouquets
Medium
Allocate Minimum Number of Pages
Aggressive Cows
Medium
Painter's Partition
Nth Root of an Integer
Medium
Search a 2D Matrix
Medium
Search a 2D Matrix II
Medium
Matrix Median
Kth Smallest Element in a Sorted Matrix
Medium
Median of Two Sorted Arrays
Kth Element of Two Sorted Arrays
Merge Intervals
Medium
Insert Interval
Medium
Non-overlapping Intervals
Medium
Meeting Rooms
Meeting Rooms II
Medium
Minimum Number of Platforms
Medium
Minimum Number of Arrows to Burst Balloons
Medium
The Skyline Problem
Reverse Words in a String
Medium
Longest Common Prefix
Valid Anagram
Roman to Integer
Integer to Roman
Medium
String to Integer (atoi)
Medium
Compare Version Numbers
Medium
Count and Say
Medium
Implement strStr()
KMP Algorithm / Prefix Function
Medium
Z Algorithm
Medium
Rabin-Karp Algorithm
Medium
Reverse Linked List
Middle of the Linked List
Remove Nth Node From End of List
Medium
Delete Node in a Linked List
Medium
Add Two Numbers
Medium
Remove Duplicates From Sorted List
Rotate List
Medium
Linked List Cycle
Linked List Cycle II
Medium
Palindrome Linked List
Reverse Linked List II
Medium
Reverse Nodes in K-Group
Reorder List
Medium
Merge Two Sorted Lists
Merge K Sorted Lists
Sort List
Medium
Intersection of Two Linked Lists
Copy List With Random Pointer
Medium
Flatten a Linked List
Reverse Doubly Linked List
Flatten Multilevel Doubly Linked List
Medium
Next Greater Element I
Next Greater Element II
Medium
Next Smaller Element
Medium
Previous Greater Element
Medium
Previous Smaller Element
Medium
Stock Span Problem
Medium
Largest Rectangle in Histogram
Maximal Rectangle
Sum of Subarray Minimums
Medium
Maximum of Minimums of Every Window
Valid Parentheses
Evaluate Reverse Polish Notation
Medium
Basic Calculator
Basic Calculator II
Medium
Infix to Postfix
Medium
Prefix to Infix Conversion
Medium
Postfix to Prefix Conversion
Medium
Sort a Stack Recursively
Medium
Reverse a Stack Recursively
Medium
Subsets
Medium
Subsets II
Medium
Subset Sums
Medium
Subsequences With Given Sum
Medium
Combination Sum
Medium
Combination Sum II
Medium
Combination Sum III
Medium
Letter Combinations of a Phone Number
Medium
Permutations
Medium
Permutations II
Medium
K-th Permutation Sequence
N-Queens
Sudoku Solver
Rat in a Maze
Medium
M-Coloring Problem
Medium
Word Search
Medium
Word Search II
N Meetings in One Room / Activity Selection
Job Sequencing Problem
Medium
Jump Game
Medium
Jump Game II
Medium
Gas Station
Medium
Candy
Assign Cookies
Lemonade Change
Fractional Knapsack
Medium
Connect N Ropes With Minimum Cost
Medium
Huffman Coding
Medium
Kth Smallest Element in an Array
Medium
Top K Frequent Elements
Medium
Top K Frequent Words
Medium
K Closest Points to Origin
Medium
Kth Largest Element in a Stream
Merge K Sorted Arrays
Smallest Range Covering Elements From K Lists
Task Scheduler
Medium
Reorganize String
Medium
IPO
Find Median From Data Stream
Binary Tree Inorder Traversal
Binary Tree Preorder Traversal
Binary Tree Postorder Traversal
Binary Tree Level Order Traversal
Medium
Binary Tree Zigzag Level Order Traversal
Medium
Vertical Order Traversal of a Binary Tree
Boundary Traversal of Binary Tree
Medium
Top View of Binary Tree
Medium
Bottom View of Binary Tree
Medium
Left View of Binary Tree
Right Side View of Binary Tree
Medium
All Traversals in One Pass
Medium
Maximum Depth of Binary Tree
Diameter of Binary Tree
Balanced Binary Tree
Binary Tree Maximum Path Sum
Symmetric Tree
Same Tree
Maximum Width of Binary Tree
Medium
Children Sum Property
Medium
Binary Tree Paths
Path Sum II
Medium
Count Paths With Given Sum
Medium
Construct Binary Tree From Preorder and Inorder Traversal
Medium
Construct Binary Tree From Postorder and Inorder Traversal
Medium
Serialize and Deserialize Binary Tree
Flatten Binary Tree to Linked List
Medium
Lowest Common Ancestor of a Binary Tree
Medium
Distance Between Two Nodes
Medium
Search in a Binary Search Tree
Insert Into a Binary Search Tree
Medium
Delete Node in a BST
Medium
Validate Binary Search Tree
Medium
Construct BST From Preorder Traversal
Medium
Floor & Ceil in BST
Medium
Kth Smallest Element in a BST
Medium
Kth Largest Element in BST
Medium
BST Iterator
Medium
Inorder Successor in BST
Medium
Inorder Predecessor in BST
Medium
Lowest Common Ancestor of a Binary Search Tree
Medium
Two Sum IV - Input Is a BST
Recover Binary Search Tree
Medium
Largest BST in Binary Tree
Convert Sorted Array to Binary Search Tree
BFS of Graph
DFS of Graph
Number of Provinces
Medium
Number of Islands
Medium
Flood Fill
Clone Graph
Medium
Connected Components in Undirected Graph
Medium
Cycle in Undirected Graph
Medium
Cycle in Directed Graph
Medium
Topological Sort
Medium
Course Schedule
Medium
Course Schedule II
Medium
Alien Dictionary
Medium
Eventual Safe States
Medium
Shortest Path in Unweighted Graph
Medium
Word Ladder
01 Matrix
Medium
Minimum Genetic Mutation
Medium
Dijkstra's Algorithm
Medium
Network Delay Time
Medium
Path With Minimum Effort
Medium
Cheapest Flights Within K Stops
Medium
Number of Ways to Arrive at Destination
Medium
Bellman-Ford Algorithm
Medium
Floyd-Warshall Algorithm
Medium
0-1 BFS / Deque BFS
Disjoint Set Union (DSU)
Medium
Prim's Algorithm
Medium
Kruskal's Algorithm
Medium
Min Cost to Connect All Points
Medium
Accounts Merge
Medium
Number of Operations to Make Network Connected
Medium
Most Stones Removed With Same Row or Column
Medium
Kosaraju's Algorithm
Medium
Tarjan's Algorithm
Bridges in Graph
Reconstruct Itinerary
Climbing Stairs
Frog Jump
House Robber
Medium
House Robber II
Medium
Word Break
Medium
Unique Paths
Medium
Unique Paths II
Medium
Minimum Path Sum
Medium
Triangle
Medium
Cherry Pickup
Dungeon Game
0/1 Knapsack Problem
Medium
Unbounded Knapsack
Medium
Subset Sum Problem
Medium
Partition Equal Subset Sum
Medium
Count Subsets With Given Sum
Medium
Target Sum
Medium
Coin Change
Medium
Coin Change II
Medium
Rod Cutting
Medium
Longest Increasing Subsequence
Medium
Number of Longest Increasing Subsequence
Medium
Longest Divisible Subset
Medium
Longest String Chain
Medium
Longest Common Subsequence
Medium
Longest Common Substring
Medium
Shortest Common Supersequence
Minimum Insertions/Deletions for Palindrome
Medium
Distinct Subsequences
Edit Distance
Medium
Wildcard Matching
Regular Expression Matching
Longest Palindromic Subsequence
Medium
Palindrome Partitioning II
Interleaving String
Medium
Matrix Chain Multiplication
Burst Balloons
Minimum Cost to Cut a Stick
Boolean Parenthesization
Egg Dropping Problem
Best Time to Buy and Sell Stock II
Medium
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock IV
Best Time to Buy and Sell Stock With Cooldown
Medium
Best Time to Buy and Sell Stock With Transaction Fee
Medium
Implement Trie (Prefix Tree)
Medium
Implement Trie II
Medium
Longest Word With All Prefixes
Medium
Replace Words
Medium
Number of Distinct Substrings
Medium
Maximum XOR of Two Numbers in an Array
Medium
Maximum XOR With an Element From Array
Range Sum Query - Mutable
Medium
Count of Smaller Numbers After Self
Power of Two
Set, Clear & Toggle Bit
Count Set Bits (Kernighan's Algorithm)
Counting Bits
XOR From L to R
Medium
Single Number I
Single Number II
Medium
Two Non-Repeating Numbers (Single Number III)
Medium
Power Set
Medium
Implement Stack Using Arrays
Implement Queue Using Arrays
Implement Stack Using Queues
Implement Queue Using Stacks
Design Min Stack
Medium
Design Circular Queue
Medium
Design Circular Deque
Medium
Implement Min Heap
Medium
Implement Max Heap
LRU Cache
Medium
LFU Cache
Insert Delete GetRandom O(1)
Medium
Time Based Key-Value Store
Medium
Design Frequency Stack