Search results
Jul 31, 2024 · In this HackerRank Short Palindrome in a Grid problem solution, we have given a string and we need to print the number of tuples that satisfy the conditions. we need to print the answer in 10 to power 9 plus 7 modulo.
Jul 31, 2024 · In this HackerRank Connected Cells in a Grid problem solution we have given an n x m matrix, find and print the number of cells in the largest region in the matrix. Note that there may be more than one region in the matrix.
Jul 30, 2024 · We can solve this problem through bottom-up table filling dynamic programming technique. The idea is to use a 2D dp array where dp [i] [j] represents the minimum initial points required to reach destination cell (m-1,n-1) starting from cell (i,j).
Jul 31, 2024 · In this HackerEarth Metro problem solution A city subway line has become huge and it is hard to take the shortest path through them. You have to find the shortest path in subway lines. In the second 0, you are in the station start and you want to go to the station end. The city has stations. The subway has m lines.
5 days ago · The idea is very basic run a nested loop, the outer loop which will mark the starting point of the subarray of length K, the inner loop will run from the starting index to index+K, and print the maximum element among these K elements. Follow the given steps to solve the problem:
Jul 29, 2024 · Where I post my solution to all the problems I have solved at https://www.hackerrank.com/domains/algorithms. All the problem is of difficulty Medium.
Aug 1, 2024 · We are given two arrays that represent the arrival and departure times of trains, the task is to find the minimum number of platforms required so that no train waits. Examples: Input: arr [] = {9:00, 9:40, 9:50, 11:00, 15:00, 18:00}, dep [] = {9:10, 12:00, 11:20, 11:30, 19:00, 20:00} Output: 3.
