## Minimum cost to reach the top of the floor by climbing stairs

Given N non-negative integers which signifies the cost of the moving from each stair. Paying the cost at i-th step, you can either climb one… Read More »

Given N non-negative integers which signifies the cost of the moving from each stair. Paying the cost at i-th step, you can either climb one… Read More »

Given an array of N positive integers write an efficient function to find the sum of all those integers which can be expressed as the… Read More »

Nutanix Technologies came to our campus BITS Goa for On-Campus Recruitment process. They conducted multiple rounds of screening to finally select 3 Candidates. Online Test:… Read More »

An online test was conducted on hackerrank. Out of 10, 000 girls, around 70 girls were selected for the FTE & internship interview held at… Read More »

Given a N x N matrix where value at cell (i, j) is the cost of moving from a cell (i, j) to cell (i… Read More »

In standard Edit Distance where we are allowed 3 operations, insert, delete and replace. Consider a variation of edit distance where we are allowed only… Read More »

Given two strings s1 and s2, the task is to find the length of longest common subsequence present in both of them. Examples: Input: s1… Read More »

Given a tetrahedron(vertex are A, B, C, D), the task is to find the number of different cyclic paths with length n from a vertex.… Read More »

Round 1: Round 1 was for 200 marks. 25 MCQs and 2 coding questions .The MCQs were mostly on aptitude and some were Technical (C++… Read More »

Given a N x N binary matrix. The problem is finding the maximum area sub-matrix having a count of 1’s one more than count of… Read More »

Given a square chessboard of N x N size, the position of Knight and position of a target is given, the task is to find… Read More »

Given as an input two strings, = , and = , output the alignment of the strings, character by character, so that the net penalty… Read More »

Given an array of integers, find number of subsequence such that the sum of the subsequence is divisible by m. It is given that sum… Read More »

Prerequisite: Dynamic Programming | Set 5 (Edit Distance) Given two strings str1 and str2, the task is to print the all possible ways to convert… Read More »

Given three integers N, M and X, the task is to find the number of ways to form an array, such that all consecutive numbers… Read More »