# Status Problem video Level Completes Likes
474

Implement/Design the version control map system

Medium % 0
473

Given an array, count the number of pairs with a given sum.

Beginner % 0
472

Sort Map as per values - Java Program

Medium % 0
471

Two Sum Problem

Beginner % 0
470

Find if any two intervals overlap in given intervals

Medium % 0
468

Unique subsets with a given sum with allowed repeated digits.

Medium % 0
465

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

Medium % 0
463

Combinations with sum K from a given number N with repetition

Medium % 0
462

Stable Marriage Problem - Gale–Shapley Algorithm

Hard % 0
461

Insert a node in the given sorted linked list.

Beginner % 1
460

Construct the largest number from the given array

Medium % 0
457

Given an array, print all unique subsets with a given sum.

Medium % 0
456

Subsets Elements less than K.

Medium % 0
455

Replace array elements with maximum element on the right.

Medium % 0
454

Find all unique combinations of numbers (from 1 to 9 ) with sum to N

Medium % 0
452

Activity Selection Problem

Medium % 0
451

Find the sum of overlapping elements in two sets

Beginner % 0
449

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

Hard % 0
447

Check If Given Undirected Graph is a tree

Medium % 0
444

Articulation Points OR Cut Vertices in a Graph

Hard % 0
443

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Medium % 0
442

Find the number of distinct Islands OR connected components.

Hard % 0
440

Given an array, Print sum of all subsets

Beginner % 1
439

Determine the given routing number belong to which bank

Medium % 0
438

Check if interval is covered in given coordinates

Medium % 0
437

Lexicographically previous permutation With One swap

Medium % 1
436

Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N

Medium % 0
431

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

Medium % 0
428

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

Medium % 0
427

Number of Islands using BFS

Medium % 0
426

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

Hard % 0
425

Check if the given binary tree is Full or not

Beginner % 1

Implement/Design the version control map system

Given an array, count the number of pairs with a given sum.

Sort Map as per values - Java Program

Two Sum Problem

Find if any two intervals overlap in given intervals

Unique subsets with a given sum with allowed repeated digits.

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

Combinations with sum K from a given number N with repetition

Stable Marriage Problem - Gale–Shapley Algorithm

Insert a node in the given sorted linked list.

Construct the largest number from the given array

Given an array, print all unique subsets with a given sum.

Subsets Elements less than K.

Replace array elements with maximum element on the right.

Find all unique combinations of numbers (from 1 to 9 ) with sum to N

Activity Selection Problem

Find the sum of overlapping elements in two sets

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

Check If Given Undirected Graph is a tree

Articulation Points OR Cut Vertices in a Graph

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Find the number of distinct Islands OR connected components.

Given an array, Print sum of all subsets

Determine the given routing number belong to which bank

Check if interval is covered in given coordinates

Lexicographically previous permutation With One swap

Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N

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

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

Number of Islands using BFS

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

Check if the given binary tree is Full or not