Featured Lists Top 20 Problems on Dynamic programming Top 10 Problems on Backtracking Top 20 Problems on Graph Top 25 Problems on Trees Top 10 Problems on Bits Manipulation Top 15 Problems in LinkedList All Problems # Status Problem video Level Completes Likes 351 Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Hard % 1 350 Find first three largest elements in a given array Beginner % 0 344 Given two strings validate the output string Beginner % 0 339 Multiply with power of 2 without using pow() or * operator Beginner % 1 338 Find Number of reverse pairs in an array Hard % 1 334 Dijkstra Algorithm Implementation – TreeSet Hard % 0 330 Check if Given Number is power of 2 Beginner % 1 318 Calculate Log2n without using built-in function Beginner % 1 313 Check if two Strings are equal without using built-in function Beginner % 0 312 Remove Vowels from a given String Beginner % 0 305 Find number of Distinct Permutations of a String Medium % 0 301 Bitwise Trick: Divide by Powers of 2 Without Operators Beginner % 1 293 Convert Number to base 3 String Representation Beginner % 1 290 Reverse a String using Recursion Beginner % 0 277 Graph – Count all paths between source and destination Medium % 1 273 Graph – Detect Cycle in a Directed Graph Medium % 1 272 Graph – Software Installation Problem Medium % 0 269 Graph – Depth First Search in Disconnected Graph Medium % 1 268 Topological Sort Medium % 1 266 Graph Implementation – Adjacency Matrix | Set 3 Beginner % 1 264 Graph Implementation – Adjacency List - Better| Set 2 Beginner % 0 262 Count and print all Subarrays with product less than K in O(n) Hard % 0 261 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 258 Graph – Print all paths between source and destination Medium % 1 256 Print all sub sequences of a given array Hard % 0 253 Print all subarrays of a given array Medium % 0 252 Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Hard % 0 251 Dynamic Programming - Egg Dropping Problem Hard % 0 244 Dynamic programming - Remove Boxes Problem | leetcode Hard % 0 242 Find the Bit Flips Needed: Convert One Binary Number to Another Beginner % 1 240 All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Hard % 1 239 Find local minimum or local maximum in O(1) Medium % 0 231 Check if array is sorted using recursion Beginner % 0 227 Algorithm to calculate power(k,n). Beginner % 1 224 Number of 1’s in bit representation of a number Beginner % 1 Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Find first three largest elements in a given array Given two strings validate the output string Multiply with power of 2 without using pow() or * operator Find Number of reverse pairs in an array Dijkstra Algorithm Implementation – TreeSet Check if Given Number is power of 2 Calculate Log2n without using built-in function Check if two Strings are equal without using built-in function Remove Vowels from a given String Find number of Distinct Permutations of a String Bitwise Trick: Divide by Powers of 2 Without Operators Convert Number to base 3 String Representation Reverse a String using Recursion Graph – Count all paths between source and destination Graph – Detect Cycle in a Directed Graph Graph – Software Installation Problem Graph – Depth First Search in Disconnected Graph Topological Sort Graph Implementation – Adjacency Matrix | Set 3 Graph Implementation – Adjacency List - Better| Set 2 Count and print all Subarrays with product less than K in O(n) Sliding Window Algorithm (Track the maximum of each subarray of size k) Graph – Print all paths between source and destination Print all sub sequences of a given array Print all subarrays of a given array Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Dynamic Programming - Egg Dropping Problem Dynamic programming - Remove Boxes Problem | leetcode Find the Bit Flips Needed: Convert One Binary Number to Another All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space Find local minimum or local maximum in O(1) Check if array is sorted using recursion Algorithm to calculate power(k,n). Number of 1’s in bit representation of a number 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
