Join us for all the latest offcampus job updates, webinar, hackathons, resume review and a lot more β€οΈβ€οΈ
- Check if pair with the given Sum exists in Array - π’ Easy
- Best Time to Buy and Sell Stock - π’ Easy
- Find duplicates - π‘ Medium
- Product of Array Except Self - π‘ Medium
- Maximum Subarray - π’ Easy
- Maximum Product Subarray - π‘ Medium
- Find Minimum in Rotated Sorted Array - π‘ Medium
- Search in Rotated Sorted Array - π‘ Medium
- 3 Sum - π‘ Medium
- Container With Most Water - π‘ Medium
- Trapping Rain Water - π΄ Hard
- Chocolate Distribution Problem - π’ Easy
- Insert Interval - π΄ Hard
- Merge Intervals - π‘ Medium
- Non-overlapping Intervals - π‘ Medium
- Set Matrix Zeroes - π‘ Medium
- Spiral Matrix - π‘ Medium
- Program to find the transpose of a matrix - π’ Easy
- Word Search - π‘ Medium
- Longest Substring Without Repeating Characters - π‘ Medium
- Longest Repeating Character Replacement - π‘ Medium
- Smallest window in a String containing all characters of another String - π΄ Hard
- Check whether two Strings are anagram of each other - π’ Easy
- Print all anagrams together - π‘ Medium
- Check if given Parentheses expression is balanced or not - π’ Easy
- Sentence Palindrome - π’ Easy
- Longest Palindromic Substring - π‘ Medium
- Palindromic Substrings - π‘ Medium
- Longest Common Prefix - π’ Easy
- Reverse a Linked List - π’ Easy
- Detect Cycle in a Linked List - π’ Easy
- Merge Two Sorted Lists - π’ Easy
- Merge K Sorted Lists - π΄ Hard
- Remove Nth Node From End Of List - π‘ Medium
- Reorder List - π‘ Medium
- Add 1 to a number represented as a linked list - π‘ Medium
- Find the middle of a given linked list - π’ Easy
- Delete last occurrence of an item from a linked list - π‘ Medium
- Valid Parentheses - π’ Easy
- Convert Infix expression to Postfix expression - π‘ Medium
- Next Greater Element - π’ Easy
- Delete middle element of a stack - π‘ Medium
- Check mirror in an n-ary tree - π’ Easy
- The Celebrity Problem - π‘ Medium
- Length of the longest valid substring - π΄ Hard
- Print Right View of a Binary Tree - π‘ Medium
- Find the first circular tour that visits all petrol pumps - π‘ Medium
- Maximum Depth of Binary Tree - π’ Easy
- Check if two trees have the same structure - π’ Easy
- Invert/Flip Binary Tree - π’ Easy
- Binary Tree Maximum Path Sum - π΄ Hard
- Binary Tree Level Order Traversal - π‘ Medium
- Serialize and Deserialize Binary Tree - π΄ Hard
- Subtree of Another Tree - π’ Easy
- Construct Binary Tree from Preorder and Inorder Traversal - π‘ Medium
- Validate Binary Search Tree - π‘ Medium
- Kth Smallest Element in a BST - π‘ Medium
- Lowest Common Ancestor of BST - π’ Easy
- Implement Trie (Prefix Tree) - π‘ Medium
- Add and Search Word - π‘ Medium
- Top K Frequent Elements - π‘ Medium
- Find Median from Data Stream - π΄ Hard
- Largest triplet product in a stream - π’ Easy
- Connect n ropes with minimum cost - π‘ Medium
- Clone Graph - π‘ Medium
- Course Schedule - π‘ Medium
- Pacific Atlantic Water Flow - π‘ Medium
- Number of Islands - π‘ Medium
- Longest Consecutive Sequence - π΄ Hard
- Snake and Ladder Problem - π‘ Medium
- Detect Cycle in a Directed Graph - π‘ Medium
- Bridges in a graph - π΄ Hard
- Check whether a given graph is Bipartite or not - π‘ Medium
- Find size of the largest region in a Boolean Matrix - π‘ Medium
- Flood fill Algorithm - π’ Easy
- Strongly Connected Components - π΄ Hard
- Topological Sorting - π‘ Medium
- Count ways to reach the nβth stair - π’ Easy
- Coin Change - π‘ Medium
- 0/1 Knapsack Problem - π‘ Medium
- Longest Increasing Subsequence - π‘ Medium
- Longest Common Subsequence - π‘ Medium
- Word Break Problem - π‘ Medium
- Dice Throw - π‘ Medium
- Egg Dropping Puzzle - π΄ Hard
- Matrix Chain Multiplication - π‘ Medium
- Combination Sum - π‘ Medium
- Subset Sum Problem - π‘ Medium
- Find maximum possible stolen value from houses - π’ Easy
- Count Possible Decodings of a given Digit Sequence - π‘ Medium
- Unique paths in a Grid with Obstacles - π‘ Medium
- Jump Game - π‘ Medium
- Cutting a Rod - π‘ Medium
- Maximum Product Cutting - π‘ Medium
- Count number of ways to cover a distance - π’ Easy
- Number of 1 Bits - π’ Easy
- Counting Bits - π‘ Medium
- Missing Number - π’ Easy
- Reverse Bits - π’ Easy
- Find XOR of all subsets of a set - π‘ Medium
- Remove All Adjacent Duplicates In String | Stack
- Maximum Number of Occurrences of a Substring | Strings
- Longest Palindromic Subsequence | Dynamic Programming
- Intersecting Chords in a Circle | Dynamic Programming
- Network Delay Time | Dikstra, Graph, Bellman Ford
- Permutations | Backtracking
- Maximum Subarray | Dynamic Programming
- Wildcard Matching | Dynamic Programming
- Subtree of Another Tree | DFS, Recursion
- Copy List with Random Pointer | Linked List, Map
- Merge Two Sorted Lists | Linked List, Recursion
- Two Sum - Unique Pairs | Map, Set
- Search a 2D Matrix | Arrays, Binary Search
- Maximum Points You Can Obtain from Cards | Dynamic Programming, Sliding Window
- Basic Calculator | Stack, Math
- URLify a given string | Arrays, Strings
- Verifying an Alien Dictionary | Map
- Longest Common Subsequence | Dynamic Programming
- Number of Dice Rolls With Target Sum | Dynamic Programming
- Subarray Sum Equals K | Map, Prefix Sum
- Favorite Genres | Map, String
- Critical Connections in a Network | DFS, Tarjan's Algo
- Valid Parentheses | String, Stack
- Minimum Number of Taps to Open to Water a Garden | Greedy, Dynamic Programming
- Spiral Matrix | Arrays
- Snakes and Ladders | BFS
- Maximum Profit in Job Scheduling | Binary Search, Dynamic Programming, Sort
- Course Schedule | DFS, BFS, Graph, Topological Sort
- Minesweeper | DFS, BFS
- Find Minimum in Rotated Sorted Array | Binary Search
- Find Minimum in Rotated Sorted Array | DFS, BFS
- Minimum Number of Days to Eat N Oranges | Dynamic Programming
- Distinct Subsequences | Strings, Dynamic Programming
- Minimum Number of Days to Make m Bouquets | Arrays, Binary Search
- Add Digits | Maths
- Pacific Atlantic Water Flow | DFS, BFS
- Next Permutation | Arrays
- Binary numbers | String Manipulation
- Smallest Good Base | Binary Search
- Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Kruskal, MST, DSU
- Merge Intervals | Arrays, Sorting
- Average of Levels in Binary Tree | BFS
- Find the City With the Smallest Number of Neighbors at a Threshold Distance | Graph, Floyd Warshall
- Min Adj Swaps to Make Palindrome | 2 Pointers
- Maximum value at index k | Binary Search
- Microsoft Campus Hiring Coding Test Online | Deque
- Consecutive Numbers Sum | Maths
- Find the maximum product of two non overlapping palindromic subsequences | Dynamic Programming
- Activate Fountain | Greedy, 2 Pointer
- Maximum Subarray Min-Product | Stack
- Construct Binary Search Tree from Preorder Traversal | Tree
- Find All Duplicates in an Array | Map, Array
- Sum of Left Leaves | DFS, BFS, Binary Trees
- Number of distinct subsequences | Dynamic Programming
- Minimum Number of Refueling Stops | Heap, Dynamic Programming
- Contiguous Array | Hashmap
- Longest Common Subsequence | Dynamic Programming
- Max Points on a Line | Maths
- Maximum Gap | Arrays, Linear Time Sorting
- Number of Islands | DFS, BFS, DSU
- Product of Array Except Self | Array
- Best Time to Buy and Sell Stock with Cooldown | Dynamic Programming
- Bus Routes | BFS
- Bitwise AND of Numbers Range | Bit Manipulation
- Count Vowels Permutation | Dynamic Programming
- Split the array | Brute Force
- Minimum-Knight-Moves | BFS, DFS
- Pairs of Songs With Total Durations Divisible by 60 | Map
- Office Building placement | BFS
- Encode and Decode TinyURL | Math, Map
- Remove Element | 2 Pointer, Arrays
- Maximum Product of Word Lengths | Bit Manipulation
- Maximum Subarray Sum with One Deletion | Arrays, Dynamic Programming
- Median of all non-empty subset sums | Dynamic Programming
- Number of Subsequences That Satisfy the Given Sum Condition | Sliding Window
- Find And Replace in String | Strings
- Brick Wall | Map
- Sorted Arrangements | Segment Tree
- Max Consecutive Ones III | Sliding Window, Strings
- Can Make Palindrome from Substring | Prefix Sum
- Unique Paths II | Dynamic Programming
- City Attractions | Can you make Palindrome | DFS
- Maximal Square | Dynamic Programming
- Count Binary Substrings | String
- Cherry Pickup | DP, Dynamic Programming
- Prison Break | Arrays
- Longest Increasing Subsequence | Dynamic Programming
- Best Time to Buy and Sell Stock III | Dynamic Programming
- Russian Doll Envelopes | Binary Search
- Jump Game II | Greedy
- Coin Change | Dynamic Programming, Arrays
- Find Pivot Index | Arrays
- Minimum Size Subarray Sum | 2 Pointers
- Longest subsequence which matches the regex 0101 | Dynamic Programming
- Smallest Subsequence of Distinct Characters | Strings, Stack, Greedy
- XOR Queries of a Subarray | Bit Manipulation
- Course Schedule III | Greedy
- Count Numbers with Unique Digits | Maths, Dynamic Programming
- Maximum Number of Vowels in a Substring of Given Length | Slding Window, Strings
- House Robber | Dynamic Programming
Join us for all the latest offcampus job updates, webinar, hackathons, resume review and a lot more β€οΈβ€οΈ