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 484 Print all subarrays using recursion Medium % 1 477 Job Sequencing algorithm Medium % 1 466 Lexicographically next permutation With One swap Medium % 1 461 Insert a node in the given sorted linked list. Beginner % 1 459 Given an array, find three-element sum closest to Zero Medium % 1 446 Print all middle elements of the given matrix/2D array. Beginner % 1 445 Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Beginner % 1 440 Given an array, Print sum of all subsets Beginner % 1 437 Lexicographically previous permutation With One swap Medium % 1 435 Hamming Distance between two given integers Beginner % 1 434 Print boundary of given matrix/2D array. Beginner % 1 432 Breadth-First Search (BFS) in 2D Matrix/2D-Array Beginner % 1 425 Check if the given binary tree is Full or not Beginner % 1 421 Sort a given stack - Using Recursion Hard % 1 420 Number's Complement - 2 Approaches Medium % 1 408 Number of Islands Medium % 1 392 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 375 String to Integer (AtoI - ASCII to Integer) Beginner % 1 372 Monotone Increasing Digits Medium % 1 357 Count Set bits in a given Number Beginner % 1 354 Valid Multiple Parentheses Medium % 1 353 Reverse a given number Beginner % 1 351 Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Hard % 1 339 Multiply with power of 2 without using pow() or * operator Beginner % 1 338 Find Number of reverse pairs in an array Hard % 1 330 Check if Given Number is power of 2 Beginner % 1 325 Find no of reverse pairs in an array which is sorted in two parts in O(N) Medium % 1 321 Bubble Sort and Optimized Bubble Sort Beginner % 1 318 Calculate Log2n without using built-in function Beginner % 1 307 Swap two numbers using Bitwise XOR Operator Medium % 1 301 Bitwise Trick: Divide by Powers of 2 Without Operators Beginner % 1 298 Left Shift (<<) and Right Shift (>>) Operators Beginner % 1 293 Convert Number to base 3 String Representation Beginner % 1 283 Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Hard % 1 277 Graph – Count all paths between source and destination Medium % 1 Print all subarrays using recursion Job Sequencing algorithm Lexicographically next permutation With One swap Insert a node in the given sorted linked list. Given an array, find three-element sum closest to Zero Print all middle elements of the given matrix/2D array. Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Given an array, Print sum of all subsets Lexicographically previous permutation With One swap Hamming Distance between two given integers Print boundary of given matrix/2D array. Breadth-First Search (BFS) in 2D Matrix/2D-Array Check if the given binary tree is Full or not Sort a given stack - Using Recursion Number's Complement - 2 Approaches Number of Islands Reverse a Stack using recursion - In Place (Without using extra memory) String to Integer (AtoI - ASCII to Integer) Monotone Increasing Digits Count Set bits in a given Number Valid Multiple Parentheses Reverse a given number Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1 Multiply with power of 2 without using pow() or * operator Find Number of reverse pairs in an array Check if Given Number is power of 2 Find no of reverse pairs in an array which is sorted in two parts in O(N) Bubble Sort and Optimized Bubble Sort Calculate Log2n without using built-in function Swap two numbers using Bitwise XOR Operator Bitwise Trick: Divide by Powers of 2 Without Operators Left Shift (<<) and Right Shift (>>) Operators Convert Number to base 3 String Representation Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap Graph – Count all paths between source and destination 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
