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
448

Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm

Medium % 0
444

Articulation Points OR Cut Vertices in a Graph

Hard % 0
439

Determine the given routing number belong to which bank

Medium % 0
438

Check if interval is covered in given coordinates

Medium % 0
431

Check the completeness of given binary tree | Set 1 - Using Node Count

Medium % 0
429

Find all the Armstrong numbers in the given range

Beginner % 0
428

Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.

Medium % 0
426

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Hard % 0
423

Given Graph - Remove a vertex and all edges connect to the vertex

Medium % 0
418

Social Network Problem

Hard % 0
417

Maximum number edges to make Acyclic Undirected/Directed Graph

Beginner % 0
416

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
414

Breadth-First Search in Disconnected Graph

Medium % 0
412

Check if Number is divisible by its digits

Beginner % 0
411

Check if the given number is Armstrong number or not

Beginner % 0
410

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
409

Minimum Boats Required to rescue people

Medium % 0
407

Integer Replacement Problem

Medium % 0
406

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Medium % 0
405

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Medium % 0
404

Find all the numbers in the range which has prime set bits.

Beginner % 0
403

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Hard % 0
402

Check if Arithmetic Expression contains duplicate parenthesis

Medium % 0
401

Introduction to Bipartite Graphs OR Bigraphs

Medium % 0
400

Reverse the Directed Graph

Beginner % 0
399

Round Price Problem

Hard % 0
398

Smallest Number after Removing K digits

Hard % 0
395

Implement Graph Using Map or dictionary

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
381

K-Means Algorithm

Hard % 0

Numbers with prime set bits in a given range using Sieve of Eratosthenes Algorithm

Articulation Points OR Cut Vertices in a Graph

Determine the given routing number belong to which bank

Check if interval is covered in given coordinates

Check the completeness of given binary tree | Set 1 - Using Node Count

Find all the Armstrong numbers in the given range

Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Given Graph - Remove a vertex and all edges connect to the vertex

Social Network Problem

Maximum number edges to make Acyclic Undirected/Directed Graph

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Breadth-First Search in Disconnected Graph

Check if Number is divisible by its digits

Check if the given number is Armstrong number or not

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Minimum Boats Required to rescue people

Integer Replacement Problem

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 2

Evaluation of Postfix Expressions (Polish Postfix notation) | Set 1

Find all the numbers in the range which has prime set bits.

Check if Graph is Bipartite - Adjacency Matrix using Depth-First Search(DFS)

Check if Arithmetic Expression contains duplicate parenthesis

Introduction to Bipartite Graphs OR Bigraphs

Reverse the Directed Graph

Round Price Problem

Smallest Number after Removing K digits

Implement Graph Using Map or dictionary

Convert Prefix to Postfix Expression

Convert Roman Number to Integer

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

K-Means Algorithm