## Paytm Interview Experience | Set 16

I was contacted by the HR on LinkedIn about the opening of Full Stack Developer at PayTM Noida. 1st Round (Duration – 2 hours) 1.… Read More »

- Quick Sort vs Merge Sort
- Find the Missing Number in a sorted array
- Modular exponentiation (Recursive)
- Largest perfect square number in an Array
- Dynamic Programming vs Divide-and-Conquer
- Binary Search In JavaScript
- Binary Search (bisect) in Python
- Kth Smallest sum of continuous subarrays of positive numbers
- Find Nth term (A matrix exponentiation example)
- Minimum in an array which is first decreasing then increasing
- Queries to check whether a given digit is present in the given Range
- Minimum K such that every substring of length atleast K contains a character c
- Search in a sorted 2D matrix (Stored in row major order)
- Java 8 | Arrays parallelSort() method with Examples
- Range and Update Sum Queries with Factorial
- Minimum operations of the given type required to make a complete graph
- Cut all the rods with some length such that the sum of cut-off length is maximized
- Merge K sorted arrays | Set 3 ( Using Divide and Conquer Approach )
- Minimum number N such that total set bits of all numbers from 1 to N is at-least X
- Search element in a Spirally sorted Matrix
- First strictly greater element in a sorted array in Java
- Numbers that are bitwise AND of at least one non-empty sub-array
- Find element position in given monotonic sequence
- First strictly smaller element in a sorted array in Java
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Generate a random permutation of elements from range [L, R] (Divide and Conquer)
- Number of ways to divide a given number as a set of integers in decreasing order
- Search equal, bigger or smaller in a sorted array in Java

I was contacted by the HR on LinkedIn about the opening of Full Stack Developer at PayTM Noida. 1st Round (Duration – 2 hours) 1.… Read More »

Round 1 (Online Test): Four Programming Questions- a) Given a string find number of different substrings that are palindromes. b) In a matrix we can… Read More »

We are given a sorted array A[] of n elements. We need to find if x is present in A or not.In binary search we… Read More »

Given two integers m & n, find the number of possible sequences of length n such that each of the next element is greater than… Read More »

Given two sorted arrays. There is only 1 difference between the arrays. First array has one element extra added in between. Find the index of… Read More »

A convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified by their x and y… Read More »

Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the k’th position of… Read More »

Given many stacks of coins which are arranged adjacently. We need to collect all these coins in the minimum number of steps where in one… Read More »

An element is a peak element if it is greater than or equal to its four neighbors, left, right, top and bottom. For example neighbors… Read More »

Given a sorted matrix mat[n][m] and an element ‘x’. Find position of x in the matrix if it is present, else print -1. Matrix is… Read More »

Given a set of points, a Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified… Read More »

Given an array representing n positions along a straight line. Find k (where k <= n) elements from the array such that the maximum distance… Read More »

Given number of pages in n different books and m students. The books are arranged in ascending order of number of pages. Every student is… Read More »

I have applied for Graphics Software Engineer position through LinkedIn. I was called for interview after 2 weeks of applying. Interview took place in Bangalore… Read More »

Strassen’s matrix is a Divide and Conquer method that helps us to multiply two matrices(of size n X n). You can refer to the link,… Read More »