nCr table | HackerRank Solution [Medium]
Jim is doing his discrete maths homework which requires him to repeatedly calculate nCr(n choose r) for different values of n
Category: Algorithms
Common Child | Algorithms | HackerRank Solution [Medium]
Given two strings p and q of equal length, what’s the longest string that can be constructed such that it is a child of both?
Counting Bits O(n) Solution – LeetCode [Easy] | Brian Kernighan’s Algorithm
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
Substring Diff | HackerRank (Algorithms) | Longest Common Substring
Given two strings and an integer, determine the length of the longest common substrings of the two strings that differ in no more than k positions.
Hotel Bytelandia Solution
Hotel Bytelandia Solution – A number of guests have made reservations. Each reservation consists of an arrival time, and a departure time
Carvans Solution
You’re given the maximum speed of N cars in the order they entered the long straight segment of the circuit. Each car prefers to move at its maximum speed. If that’s not possible because of the front car being slow, it might have to lower its speed. It still moves at the fastest possible speed while avoiding any collisions.
Ciel and Receipt Solution
Tomya like a positive integer p, and now she wants to get a receipt of Ciel’s restaurant whose total price is exactly p. Note that the i-th menu has the price 2i-1 (1 ≤ i ≤ 12). Find the minimum number of menus whose total price is exactly p.
Rat in the maze | Minimum number of steps
Given a maze with obstacles, find the minimum number of steps the rat needs to take to reach the destination.
Print Binary tree in vertical order
Given a Binary tree, print it in vertical order from left to right.
We could solve this problem by performing a breadth-first or level order traversal on the given tree.
Rat in the maze
Given a NxN matrix with 0s and 1s. A block with value 1 can be used to travel ahead in the matrix. Now, consider mat[0][0] as the starting point for the rat.