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 316 Print First N Prime Numbers Beginner % 0 315 Print My IP Address Beginner % 0 314 Find the Circumference of a Circle Beginner % 0 313 Check if two Strings are equal without using built-in function Beginner % 0 312 Remove Vowels from a given String Beginner % 0 311 Linear Search Algorithm Beginner % 0 310 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Hard % 0 309 Floyd’s Triangle Beginner % 0 308 Print Numbers from 1 to N without using loop Beginner % 0 307 Swap two numbers using Bitwise XOR Operator Medium % 1 306 Determine if Given Year is Leap Year Beginner % 0 305 Find number of Distinct Permutations of a String Medium % 0 304 Find the Area of a Circle Beginner % 0 303 Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Hard % 0 302 Fizz Buzz Challenge Beginner % 0 301 Bitwise Trick: Divide by Powers of 2 Without Operators Beginner % 1 300 Find the Largest Gap Between Elements in an Array Beginner % 0 299 Minimum number of guesses needed to find a number Beginner % 0 298 Left Shift (<<) and Right Shift (>>) Operators Beginner % 1 297 Dijkstra's – Shortest Path Algorithm (SPT) Hard % 0 Print First N Prime Numbers Print My IP Address Find the Circumference of a Circle Check if two Strings are equal without using built-in function Remove Vowels from a given String Linear Search Algorithm Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Floyd’s Triangle Print Numbers from 1 to N without using loop Swap two numbers using Bitwise XOR Operator Determine if Given Year is Leap Year Find number of Distinct Permutations of a String Find the Area of a Circle Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation Fizz Buzz Challenge Bitwise Trick: Divide by Powers of 2 Without Operators Find the Largest Gap Between Elements in an Array Minimum number of guesses needed to find a number Left Shift (<<) and Right Shift (>>) Operators Dijkstra's – Shortest Path Algorithm (SPT) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
