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
4

Find a Missing Number From a Sequence of Consecutive Numbers

Beginner % 0
2

Merge Sort - Updated - Most Efficient ways to Implement

Medium % 1
552

Stock Single Sell Problem - Divide and Conquer

Medium % 0
506

Maximum Bipartite Matching Problem

Hard % 0
504

What is a Pascal Triangle?

Beginner % 0
501

Valid Pickup and Delivery options

Hard % 0
491

Unresolved references error - Django in PyCharm and IntelliJ

Beginner % 0
490

Given an array, Find the number of all pairs with even sum

Beginner % 0
481

Calculate (x^y)%z without using pow() function

Medium % 0
476

Find subarray with a sum to given number-2 | Handle negative numbers

Medium % 0
475

Sort the two dimensional (2D) array - In-place

Medium % 0
474

Implement/Design the version control map system

Medium % 0
472

Sort Map as per values - Java Program

Medium % 0
465

Find all subsets of size K from a given number N (1 to N)

Medium % 0
462

Stable Marriage Problem - Gale–Shapley Algorithm

Hard % 0
460

Construct the largest number from the given array

Medium % 0
453

Number of Intervals in which given value lies

Beginner % 0
452

Activity Selection Problem

Medium % 0
451

Find the sum of overlapping elements in two sets

Beginner % 0
450

Given two coordinates, Print the line equation

Beginner % 0
449

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

Hard % 0
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

Find a Missing Number From a Sequence of Consecutive Numbers

Merge Sort - Updated - Most Efficient ways to Implement

Stock Single Sell Problem - Divide and Conquer

Maximum Bipartite Matching Problem

What is a Pascal Triangle?

Valid Pickup and Delivery options

Unresolved references error - Django in PyCharm and IntelliJ

Given an array, Find the number of all pairs with even sum

Calculate (x^y)%z without using pow() function

Find subarray with a sum to given number-2 | Handle negative numbers

Sort the two dimensional (2D) array - In-place

Implement/Design the version control map system

Sort Map as per values - Java Program

Find all subsets of size K from a given number N (1 to N)

Stable Marriage Problem - Gale–Shapley Algorithm

Construct the largest number from the given array

Number of Intervals in which given value lies

Activity Selection Problem

Find the sum of overlapping elements in two sets

Given two coordinates, Print the line equation

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

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