arrow_back
HASHING
Introduction to Hashing
Hash function and collision
Frequency of Elements
Count Distinct Elements
Intersection of two arrays
Union of two arrays
Find Anagrams
Count Distinct elements in window of size k
Largest subarray with 0 sum
Count of zero sum subarray
Subarray sum equals K
Largest subarray with sum divisible by K
count subarray with sum divisible by K
Longest subarray with equal 0s and 1s
Count of subarrays with equal 0s and 1s
Longest subarray with equal 0s, 1s, and 2s
Count of subarrays with equal 0s, 1s and 2s
Longest substring without repeating characters
Count substrings without repeating characters
Longest substring with exactly k distinct characters
Longest substrings with at most k distinct substrings
Check if array pairs are divisible by K
Fraction to recurring decimal
rabbits in forest
Pairs with given sum in matrix
Binary Tree
Theory of Binary Trees
Construct Binary Tree from given inorder and preorder traversal
Mirror of a Tree
Sum root to leaf numbers
Right View of Binary Tree
Postorder Traversal of a Tree Using Recursion
Postorder Traversal of a Tree Without Recursion
Preorder Traversal of a Tree Using Recursion
Preorder Traversal of a Tree Without Recursion
path sum
Min. Depth of binary Tree
Level Order Traversal of a Tree updated
Left View of Binary Tree
LCA of a binary Tree
Inorder Traversal of a Tree Without Recursion
Inorder Traversal of a Tree Using Recursion
Height of a Tree Without Recursion
Height of a Tree Using Recursion
Diameter of a binary Tree
Top View of Binary Tree
Diagonal Traversal of Binary Tree
Cousins in a Tree
Convert binary tree into sum tree
Check if all leaf nodes are present on the same level or not
Check if a binary tree is a subtree of another tree
Bottom view of Binary Tree
Binary Search Tree
Binary Search Tree - Introduction
Check if a binary tree is a BST or not
Convert BST into balanced BST
Count BST nodes that lie in a given range
Count pairs from 2 BSTs such that given sum is equal to target
Deleting a node in BST
Find inorder predecessor in a Binary Search Tree
Find inorder successor in a Binary Search Tree
Find Median of BST
Floor of a number in BST
Insertion of a node in BST
Kth largest element in a BST
Kth smallest element in a BST
LCA of 2 nodes in a BST
Max value in BST
Merge two BSTs
Min value in BST
Searching a node in BST
Arrays and Matrices
Array Theory
Find the repeating and missing number
Rotate matrix by 90 degrees
Find the missing number
Zero matrix
Find row with maximum number of ones
Search an element in an array
Delete an element in an array
Majority element
Running Sum of 1d Array
Count Good Pairs
Largest three elements in an array
Find the duplicate number
Spiral traversal of a matrix
Count inversions
Move all negative elements to one end
Find Common elements in 3 sorted arrays
Search in a matrix
Search an element in sorted matrix
Cyclic rotation of array
Sort an array of 0s, 1s and 2s
Leaders in an array
Count number of occurrences of an element
Maximum and minimum element in array
Check if array is sorted or not