# 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 Adding One to a Number Represented by an Array Medium % 1 4 Find The Minimum time difference Medium % 1 5 Departure and Destination Cities in a given itinerary Beginner % 1 6 Given an array, rank its elements Beginner % 1 7 Maximum Surpasser in the given array Hard % 0 8 Maximum CPU Load Problem in a jobs list Medium % 1 9 Check If Student is eligible for an Attendance Reward Beginner % 0 10 Maximum overlaps in a given list of time intervals Medium % 0 11 Maximum distance from the nearest person. Medium % 1 12 Design a data structure for Candidate Voting Problem Medium % 0 13 Design data structure for players and ranks Medium % 0 14 Maximum Bipartite Matching Problem - Java Hard % 0 15 Print Top 10 videos from List Beginner % 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 18 The number of cycles in a given array of integers. Hard % 0 19 Calculate (x^y)%z without using pow() function Medium % 0 20 Find subarray with a sum to given number-2 | Handle negative numbers Medium % 0 21 Sort the two dimensional (2D) array - In-place Medium % 0 22 Implement/Design the version control map system Medium % 0 23 Two Sum Problem Beginner % 0 24 Lexicographically next permutation With One swap Medium % 1 25 Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard % 0 26 Given an array, find three-element sum closest to Zero Medium % 1 27 Number of Intervals in which given value lies Beginner % 0 28 Articulation Points OR Cut Vertices in a Graph Hard % 0 29 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 30 Determine the given routing number belong to which bank Medium % 0 31 Check if interval is covered in given coordinates Medium % 0 32 Longest substring with at most K unique characters Medium % 2 33 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 34 Sort a given stack - Using Recursion Hard % 1 35 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 Converting to Non-Decreasing Array with One Change Maximizing Contiguous Ones with a Single Flip in a Binary Array Adding One to a Number Represented by an Array Find The Minimum time difference Departure and Destination Cities in a given itinerary Given an array, rank its elements Maximum Surpasser in the given array Maximum CPU Load Problem in a jobs list Check If Student is eligible for an Attendance Reward Maximum overlaps in a given list of time intervals Maximum distance from the nearest person. Design a data structure for Candidate Voting Problem Design data structure for players and ranks Maximum Bipartite Matching Problem - Java Print Top 10 videos from List Compare two version numbers of a software Minimum number of times String A is repeated to such that B is substring of A The number of cycles in a given array of integers. 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 Two Sum Problem Lexicographically next permutation With One swap Stable Marriage Problem - Gale–Shapley Algorithm - Java Given an array, find three-element sum closest to Zero Number of Intervals in which given value lies Articulation Points OR Cut Vertices in a Graph Print All Paths in Dijkstra's Shortest Path Algorithm Determine the given routing number belong to which bank Check if interval is covered in given coordinates Longest substring with at most K unique characters 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 1 2 3 4