Question

Difficulty

Majority Element

Repeat & missing number

Merge 2 sorted array

Single Number

Stock Buy & Sell

Compute Pow X^N

Kadane's Algorithm

Search in 2d matrix 

Container with most water

Sort array of 0s, 1s & 2s

3Sum

4Sum

Next Permutation

Merge Overlapping Intervals

Longest Substring without Repeating

Set Matrix Zeroes

Word Search

Product of Array except Self

Subarray sum equals K

Find Duplicate

Spiral Matrix

Search in Sorted matrix II

Count Inversions

Trapping Rainwater

Sliding Window Maximum

Reverse Pairs

Largest Rectangle in a Histogram

Valid Palindrome

Valid Anagram

Reverse Words in String

Remove All Occurrences

Permutation in String

String Compression

Reverse Words in String

Longest Common Prefix

Group Anagrams

Minimum Window Substring

KMP algorithm

Robin-Karp Algorithm

Peak Index in Mountain Array

Search in Rotated Sorted

Single Element in Sorted Array

Aggressive Cows

Allocate Minimum Pages

Painter’s Partition

Single Element in Sorted Array

Median of 2 Sorted Arrays

Combination Sum I

Combination Sum II

Palindrome Partitioning

N Queens

Sudoku Solver

M-Coloring Problem

Subsets II

Knights Tour

rat in a maze

merge sort

count inversions

Reverse Linked List I

Middle of a Linked List

Merge 2 Sorted LL

Detect Cycle in a LL

Remove Cycle in a LL

Flatten a Linked List

Is LL a Palindrome or Not

Clone List with Random Pointers

Add 2 Numbers

Reverse Linked List II

Rotate a Linked List

Reverse Nodes in K Groups

Implement Stack using Queue

Implement Queue using Stack

Next Greater Element

Valid Parenthesis

1st Non Repeating in Stream

Reverse 1st K Elements of Queue

Time needed to Buy Tickets 

Next Smaller Element

LRU Cache

Celebrity Problem 

Get Min Element from Stack

Sort a Stack

Circular Tour / Gas Station

Rotten Oranges

Stock Span

Max Area in Histogram

Inorder Traversal

Preorder Traversal

Postorder Traversal

Level Order Traversal

Symmetric Tree

Minimum Distance between Nodes

Are 2 Trees Identical or Not

Morris Inorder Traversal

Diameter of a Tree

Is Tree Height Balanced

Subtree of Another Tree

Check if BT Mirror of itself or not

Top View of a Tree

Bottom View of a Tree

Kth Level of Tree

Lowest Common Ancestor (LCA)

Transform to Sum Tree

Construct BT from Inorder & Preorder

Construct BT from Inorder & Postorder

Flatten BT to LL

Max Width of BT

Zig Zag Traversal of BT

Max Path Sum

Kth Ancestor

Kth largest in BST

Sorted Array to Balanced BST

Validate BST

Kth Smallest in BST

LCA in BST

Populate Next Right Pointers

Recover BST

Construct from Preorder

BST Iterator

Flatten BST to Sorted list

Serialize & Deserialize BST

Merge 2 BSTs

Inorder Successor

Inorder Predecessor

Largest BST in BT 

Merge K Sorted Arrays

K most Frequent Elements

Heap Sort

Kth Smallest Element

Median from Stream

Smallest Range in K Sorted List

Longest Common Prefix

Word Break Problem

Implement a Phone Directory

Implement a Trie

Longest String with All Prefix

BFS : Breadth First Search

DFS : Depth First Search

Detect Cycle in Undirected using DFS

Detect Cycle in Undirected using BFS

Detect Cycle in Directed using DFS

Detect Cycle in Directed using BFS

Flood Fill Algorithm

Topological Sorting (DFS)

Topological Sorting (BFS)

Course Schedule II

Dijkstra's Algorithm

Cheapest Flights within K Stops

Prim's Algorithm (MST)

Kruskal's Algorithm (MST)

Bellman Ford Algorithm

Floyd Warshall Algorithm

Rotting Oranges

01 Matrix

Clone a Graph

Number of Islands

Is Graph Bipartite?

Strongly Connected Components (Kosaraju's)

Most Stones Removed

Number of Provinces

Number of Ways to Arrive at Destination

Alien Dictionary

Buy & Sell Stocks I

0-1 Knapsack

Target Sum Subset

Unbounded Knapsack

Coin Change

Longest Common Subsequence

Longest Common Substring

Longest Increasing Subsequence

Longest Palindromic Subsequence

Edit Distance

Buy & Sell Stocks II

Nth Catalan

Unique BSTs

MCM

Palindromic Partitioning

Rod Cutting

Max Product Subarray

Minimum Partitioning

Wildcard Pattern Matching

Egg Dropping

Longest Bitonic Subsequence

Assign Cookies

Indian Coins

Fractional Knapsack

Job Scheduling

Activity Selection

Max Length of Pair Chain

Power Set

Max XOR of Two Nums

Power of Two

XOR Beauty of Array

Watering Plants