# Status Problem Level Completes Likes
1

Converting to Non-Decreasing Array with One Change

Medium % 0
2

Maximizing Contiguous Ones with a Single Flip in a Binary Array

Medium % 2
3

Counting the Largest Number Groups by Digit Sum

Medium % 2
4

Adding One to a Number Represented by an Array

Medium % 1
5

Find The Minimum time difference

Medium % 1
6

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Medium % 0
7

Minimum Increments to make all array elements unique

Medium % 0
8

Maximum CPU Load Problem in a jobs list

Medium % 1
9

Maximum overlaps in a given list of time intervals

Medium % 0
10

Count number of pairs in an array with sum = K

Medium % 0
11

Maximum distance from the nearest person.

Medium % 1
12

Design a data structure for Candidate Voting Problem

Medium % 0
13

Find the Number of Contiguous Parking Areas

Medium % 1
14

Get specific row K in a Pascal Triangle

Medium % 0
15

Design data structure for players and ranks

Medium % 0
16

Compare two version numbers of a software

Medium % 1
17

Minimum number of times String A is repeated to such that B is substring of A

Medium % 1
19

Maximum meetings in one room

Medium % 0
20

Check if given sudoku is valid or not

Medium % 0
21

Sort the indexes of the array as per the elements of the array

Medium % 0
23

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

Medium % 0
24

Job Sequencing algorithm - Java

Medium % 1
25

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

Medium % 0
26

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

Medium % 0
27

Implement/Design the version control map system

Medium % 0
28

Sort Map as per values - Java Program

Medium % 0
29

Find if any two intervals overlap in given intervals

Medium % 0
30

Given an array, find the number of all pairs with odd sum.

Medium % 0
31

Given an array, find all unique subsets with a given sum with allowed repeated digits.

Medium % 0
33

Lexicographically next permutation With One swap

Medium % 1
34

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

Medium % 0
35

Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed

Medium % 0

Converting to Non-Decreasing Array with One Change

Maximizing Contiguous Ones with a Single Flip in a Binary Array

Counting the Largest Number Groups by Digit Sum

Adding One to a Number Represented by an Array

Find The Minimum time difference

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Minimum Increments to make all array elements unique

Maximum CPU Load Problem in a jobs list

Maximum overlaps in a given list of time intervals

Count number of pairs in an array with sum = K

Maximum distance from the nearest person.

Design a data structure for Candidate Voting Problem

Find the Number of Contiguous Parking Areas

Get specific row K in a Pascal Triangle

Design data structure for players and ranks

Compare two version numbers of a software

Minimum number of times String A is repeated to such that B is substring of A

Maximum meetings in one room

Check if given sudoku is valid or not

Sort the indexes of the array as per the elements of the array

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

Job Sequencing algorithm - Java

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 if any two intervals overlap in given intervals

Given an array, find the number of all pairs with odd sum.

Given an array, find all 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)

Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed