# Status Problem video Level Completes Likes
549

Dynamic Programming - Minimum Cost for Climbing Stairs

Medium % 0
548

Minimum Number of Halls Required for Lecture Scheduling

Hard % 1
545

Maximizing Contiguous Ones with a Single Flip in a Binary Array

Medium % 3
544

Counting the Largest Number Groups by Digit Sum

Medium % 2
538

Find The Minimum time difference

Medium % 1
528

Minimum Increments to make all array elements unique

Medium % 0
503

Minimum Deletions to make the occurrence of each character unique.

Hard % 1
468

Unique subsets with a given sum with allowed repeated digits.

Medium % 0
466

Lexicographically next permutation With One swap

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

Articulation Points OR Cut Vertices in a Graph

Hard % 0
442

Find the number of distinct Islands OR connected components.

Hard % 0
439

Determine the given routing number belong to which bank

Medium % 0
436

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

Medium % 0
426

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

Hard % 0
421

Sort a given stack - Using Recursion

Hard % 1
416

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
410

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
402

Check if Arithmetic Expression contains duplicate parenthesis

Medium % 0
401

Introduction to Bipartite Graphs OR Bigraphs

Medium % 0
398

Smallest Number after Removing K digits

Hard % 0
396

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

Medium % 0
392

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

Hard % 1
390

Convert Prefix to Postfix Expression

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

Grouping of Anagrams

Medium % 0
377

Convert Postfix to Infix Expression

Medium % 0
371

Convert Infix to Prefix Expression

Medium % 0

Dynamic Programming - Minimum Cost for Climbing Stairs

Minimum Number of Halls Required for Lecture Scheduling

Maximizing Contiguous Ones with a Single Flip in a Binary Array

Counting the Largest Number Groups by Digit Sum

Find The Minimum time difference

Minimum Increments to make all array elements unique

Minimum Deletions to make the occurrence of each character unique.

Unique subsets with a given sum with allowed repeated digits.

Lexicographically next permutation With One swap

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

Construct the largest number from the given array

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

Articulation Points OR Cut Vertices in a Graph

Find the number of distinct Islands OR connected components.

Determine the given routing number belong to which bank

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

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

Sort a given stack - Using Recursion

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Check if Arithmetic Expression contains duplicate parenthesis

Introduction to Bipartite Graphs OR Bigraphs

Smallest Number after Removing K digits

Optimizing Test Execution: Managing Test Dependencies for Sequential Order

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

Convert Prefix to Postfix Expression

Sort a given stack - Using Temporary Stack

Convert Postfix to Prefix Expression

Convert Integer to Roman

Grouping of Anagrams

Convert Postfix to Infix Expression

Convert Infix to Prefix Expression