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
397

Find Third Smallest elements in a given array

Beginner % 0
396

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Medium % 0
395

Implement Graph Using Map or dictionary

Medium % 0
394

Find the maximum number present in a String

Beginner % 0
393

Count number of subgraphs in a given graph

Beginner % 0
392

Reverse a Stack using recursion - In Place (Without using extra memory)

Hard % 1
391

Check if given an edge is a bridge in the graph

Medium % 0
390

Convert Prefix to Postfix Expression

Medium % 0
389

Convert Roman Number to Integer

Beginner % 0
388

Sort a given stack - Using Temporary Stack

Medium % 0
387

Convert Postfix to Prefix Expression

Medium % 0
386

Convert Integer to Roman

Medium % 0
385

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Medium % 0
384

Grouping of Anagrams

Medium % 0
380

Count the number of nodes in a given binary tree

Beginner % 0
379

Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2

Medium % 0
378

Longest contiguous character in a given String - O(N) Solution

Beginner % 0
377

Convert Postfix to Infix Expression

Medium % 0

Find Third Smallest elements in a given array

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Implement Graph Using Map or dictionary

Find the maximum number present in a String

Count number of subgraphs in a given graph

Reverse a Stack using recursion - In Place (Without using extra memory)

Check if given an edge is a bridge in the graph

Convert Prefix to Postfix Expression

Convert Roman Number to Integer

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

Convert Integer to Roman

String to Integer (AtoI - ASCII to Integer) - Recursive Solution

Grouping of Anagrams

Count the number of nodes in a given binary tree

Sieve of Eratosthenes - Find all Prime Numbers less than equal to N | Set 2

Longest contiguous character in a given String - O(N) Solution

Convert Postfix to Infix Expression