# Status Problem video Level Completes Likes 496 Minimum number of times String A is repeated to such that B is substring of A Beginner % 1 489 The number of cycles in a given array of integers. Hard % 0 481 Calculate (x^y)%z without using pow() function Medium % 0 476 Find subarray with a sum to given number-2 | Handle negative numbers Medium % 0 475 Sort the two dimensional (2D) array - In-place Medium % 0 474 Implement/Design the version control map system Medium % 0 471 Two Sum Problem Beginner % 0 466 Lexicographically next permutation With One swap Medium % 1 462 Stable Marriage Problem - Gale–Shapley Algorithm Hard % 0 459 Given an array, find three-element sum closest to Zero Medium % 1 453 Number of Intervals in which given value lies Beginner % 0 444 Articulation Points OR Cut Vertices in a Graph Hard % 0 441 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 439 Determine the given routing number belong to which bank Medium % 0 438 Check if interval is covered in given coordinates Medium % 0 430 Longest substring with at most K unique characters Medium % 2 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 409 Minimum Boats Required to rescue people Medium % 0 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 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 Minimum Boats Required to rescue people 1 2 3 4 5 6
