Skip to content

Category Archives: Dynamic Programming

Given a matrix where every cell represents points. How to collect maximum points using two traversals under following conditions?Let the dimensions of given grid be… Read More
First Round : 1) 30 Aptitiude questions. 2) 2-Coding questions 2-a) Find Missing And Repeating 2-b) Word Break Problem 32 people were selected for second round. Second… Read More
1st round (Written Test) It was an online test of 90 minutes and was conducted on Hackerearth. It consisted of 10 MCQ’s and 3 coding… Read More
Given a number line from -infinity to +infinity. You start at 0 and can go either to the left or to the right. The condition… Read More
Given two strings str1 and str2, the task is to find the length of the shortest string that has both str1 and str2 as subsequences.… Read More
Given a number n, find count of all numbers from 1 to n that have 4 as a digit.Examples :  Input: n = 5 Output:… Read More
Given a number n, find the sum of digits in all numbers from 1 to n. Examples:  Input: n = 5 Output: Sum of digits in… Read More
Round 0 – Second max element in BST Sort an array of integers such that – – All odd numbers are in left side and… Read More
I got a chance to participate in walk-in drive at Paytm Headquarters. Went through the following process. Written test: It contained 20 objective questions having… Read More
Given an input number of sections and each section has 2 plots on either sides of the road. Find all possible ways to construct buildings… Read More
In daily share trading, a buyer buys shares in the morning and sells them on the same day. If the trader is allowed to make… Read More
Written MCQ There were 20 multiple choice questions to be done in 30 minutes time and most of the technical questions were from geeksquiz ,… Read More
This is a famous interview question asked in Google, Paytm and many other company interviews. Below is the problem statement. Imagine you have a special keyboard… Read More
There are N stations on route of a train. The train goes from station 0 to N-1. The ticket cost for all pair of stations… Read More
A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’… Read More