# Status Problem Level Completes Likes 1 Dynamic Programming - Minimum Cost for Climbing Stairs Medium % 0 2 Maximum Contiguous ones after one deletion Medium % 0 3 Converting to Non-Decreasing Array with One Change Medium % 0 4 Maximizing Contiguous Ones with a Single Flip in a Binary Array Medium % 3 5 Counting the Largest Number Groups by Digit Sum Medium % 2 6 Adding One to a Number Represented by an Array Medium % 1 7 Find The Minimum time difference Medium % 1 8 Maximum Depth of Valid Nested Parentheses in an arithmetic expression Medium % 0 9 Minimum Increments to make all array elements unique Medium % 0 10 Maximum CPU Load Problem in a jobs list Medium % 1 11 Maximum overlaps in a given list of time intervals Medium % 0 12 Count number of pairs in an array with sum = K Medium % 0 13 Maximum distance from the nearest person. Medium % 1 14 Design a data structure for Candidate Voting Problem Medium % 0 15 Find the Number of Contiguous Parking Areas Medium % 1 16 Get specific row K in a Pascal Triangle Medium % 0 17 Design data structure for players and ranks Medium % 0 18 Compare two version numbers of a software Medium % 1 19 Minimum number of times String A is repeated to such that B is substring of A Medium % 1 20 Print all nested directories and files in a given directory - Recursion Medium % 0 21 Maximum meetings in one room Medium % 0 22 Check if given sudoku is valid or not Medium % 0 23 Sort the indexes of the array as per the elements of the array Medium % 0 24 Print all subarrays using recursion Medium % 1 25 Calculate (x^y)%z without using pow() function Medium % 0 26 Job Sequencing algorithm - Java Medium % 1 27 Find subarray with a sum to given number-2 | Handle negative numbers Medium % 0 28 Sort the two dimensional (2D) array - In-place Medium % 0 29 Implement/Design the version control map system Medium % 0 30 Sort Map as per values - Java Program Medium % 0 31 Find if any two intervals overlap in given intervals Medium % 0 32 Given an array, find the number of all pairs with odd sum. Medium % 0 33 Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium % 0 34 Print all steps to convert one string to another string Medium % 0 35 Lexicographically next permutation With One swap Medium % 1 Dynamic Programming - Minimum Cost for Climbing Stairs Maximum Contiguous ones after one deletion 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 Print all nested directories and files in a given directory - Recursion 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 Print all subarrays using recursion 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. Print all steps to convert one string to another string Lexicographically next permutation With One swap 1 2 3 4 5 6 7
