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 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 273 Graph – Detect Cycle in a Directed Graph Medium % 1 271 Snake and Ladder Problem Hard % 1 270 Weighted Graph Implementation – JAVA Beginner % 1 269 Graph – Depth First Search in Disconnected Graph Medium % 1 268 Topological Sort Medium % 1 267 Graph – Depth First Search using Recursion Beginner % 1 266 Graph Implementation – Adjacency Matrix | Set 3 Beginner % 1 258 Graph – Print all paths between source and destination Medium % 1 253 Print all subarrays of a given array Medium % 1 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 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 236 Find three elements in an array that sum to a given value Beginner % 1 228 Find the only element in array which appears only once Beginner % 1 227 Algorithm to calculate power(k,n). Beginner % 1 224 Number of 1’s in bit representation of a number Beginner % 1 220 Find the right most unset bit OR zero bit of a number Beginner % 1 219 Find the two repeating elements in a given array | 6 Approaches Medium % 1 218 Find the right most set bit of a number Beginner % 1 217 Find two elements whose sum is closest to zero Medium % 1 209 Find longest Snake sequence in a given matrix Medium % 1 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 207 Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Medium % 1 205 Print All Diagonals of a given matrix Medium % 1 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 188 Shortest Range in K-sorted Lists Hard % 1 184 Get the Sum of all left leaves in a Binary tree Beginner % 1 183 Convert binary tree to its Sum tree Medium % 1 177 Tree Traversals Beginner % 1 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 Graph – Detect Cycle in a Directed Graph Snake and Ladder Problem Weighted Graph Implementation – JAVA Graph – Depth First Search in Disconnected Graph Topological Sort Graph – Depth First Search using Recursion Graph Implementation – Adjacency Matrix | Set 3 Graph – Print all paths between source and destination Print all subarrays of a given array Find two non-repeating numbers in an array in O(n) time and O(1) space 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 three elements in an array that sum to a given value Find the only element in array which appears only once Algorithm to calculate power(k,n). Number of 1’s in bit representation of a number Find the right most unset bit OR zero bit of a number Find the two repeating elements in a given array | 6 Approaches Find the right most set bit of a number Find two elements whose sum is closest to zero Find longest Snake sequence in a given matrix Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix Print All Diagonals of a given matrix Kadane's Algorithm - Maximum Subarray Problem Shortest Range in K-sorted Lists Get the Sum of all left leaves in a Binary tree Convert binary tree to its Sum tree Tree Traversals 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
