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
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
300

Maximum Difference between two elements in array – Largest Gap Problem

Beginner % 0
299

Minimum number of guesses needed to find a number

Beginner % 0
297

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
296

Replace all vowels with next consonant in a given string

Medium % 0
295

Find the Area of a Triangle Using coordinates

Beginner % 0
294

Find if Triangle can be formed using given 3 sides

Beginner % 0
292

Find the Area of a Triangle Given Three Sides – Heron’s Formula

Beginner % 0
291

Find Factorial of a given Number

Beginner % 0
290

Reverse a String using Recursion

Beginner % 0
289

Find Sum of all Digits of a Number

Beginner % 0
287

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Implementation

Hard % 0
286

Introduction to Minimum Spanning Tree (MST)

Medium % 0
285

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Hard % 0
284

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key

Hard % 0
282

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Hard % 0
281

Prim’s Algorithm - Minimum Spanning Tree (MST)

Hard % 0
280

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Hard % 0
279

Disjoint Set | Union-Find Algorithm - Union by rank and path compression

Hard % 0
278

Disjoint Set Data Structure - Union Find Algorithm

Hard % 0
276

Graph – Find Number of non reachable vertices from a given vertex

Medium % 0
275

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
274

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
272

Graph – Software Installation Problem

Medium % 0
265

Java Pair Class

Beginner % 0
264

Graph Implementation – Adjacency List - Better| Set 2

Beginner % 0
263

Minimum Copy Paste Operations

Medium % 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

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

Maximum Difference between two elements in array – Largest Gap Problem

Minimum number of guesses needed to find a number

Dijkstra's – Shortest Path Algorithm (SPT)

Replace all vowels with next consonant in a given string

Find the Area of a Triangle Using coordinates

Find if Triangle can be formed using given 3 sides

Find the Area of a Triangle Given Three Sides – Heron’s Formula

Find Factorial of a given Number

Reverse a String using Recursion

Find Sum of all Digits of a Number

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Implementation

Introduction to Minimum Spanning Tree (MST)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Prim’s Algorithm - Minimum Spanning Tree (MST)

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Disjoint Set | Union-Find Algorithm - Union by rank and path compression

Disjoint Set Data Structure - Union Find Algorithm

Graph – Find Number of non reachable vertices from a given vertex

Graph – Detect Cycle in a Directed Graph using colors

Graph – Detect Cycle in an Undirected Graph using DFS

Graph – Software Installation Problem

Java Pair Class

Graph Implementation – Adjacency List - Better| Set 2

Minimum Copy Paste Operations

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)