Paytm Interview Experience | Set 7 (Written Test Hyderabad)
Written Test: Two Sections : 1. CS and Fundamentals Easy fundamental questions and program output from Recursion / OS / Linux, Concurrency threading. 2.… Read More »
Tag Archives: Paytm
Paytm Interview Experience | Set 6 (Recruitment Drive)
I would like to share recent recruitment drive I attended from Paytm CS + Programming + Coding – Screening round 20 MCQ realted to C,… Read More »
Paytm Interview Experience | Set 5 (Recruitment Drive)
I attended a Paytm recruitment drive. The requirement was for both Front-end and Backend Developers. I applied for Backend. First there was a written round.… Read More »
Convert array into Zig-Zag fashion
Given an array of DISTINCT elements, rearrange the elements of array in zig-zag fashion in O(n) time. The converted array should be in form a… Read More »
Find minimum number of coins that make a given value
Given a value V, if we want to make change for V cents, and we have infinite supply of each of C = { C1,… Read More »
Count frequencies of all elements in array in O(1) extra space and O(n) time
Given an unsorted array of n integers which can contain integers from 1 to n. Some elements can be repeated multiple times and some other… Read More »
Paytm Interview Experience | Set 4 (Walk-in Drive)
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 »
One97 Interview Experience | Set 3 (Backend/Node js Developer)
Round 1 Q1. Multiply two 2d matrices Q2 You are given a stack in which element are filled at runtime. And normal push and pop… Read More »
How to print maximum number of A’s using given four keys
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… Read More »
Find the missing number in Arithmetic Progression
Given an array that represents elements of arithmetic progression in order. One element is missing in the progression, find the missing number. Examples: Input: arr[]… Read More »
Bottom View of a Binary Tree
Given a Binary Tree, we need to print the bottom view from left to right. A node x is there in output if x is… Read More »
Minimum Number of Platforms Required for a Railway/Bus Station
Given arrival and departure times of all trains that reach a railway station, the task is to find the minimum number of platforms required for… Read More »
One97 Interview Experience | Set 2
My Interview Experience with One97 My Experience: 1.5+ year. I am from a premium engineering college of India. Apart from the regular job I do… Read More »
Print Nodes in Top View of Binary Tree
Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »
Serialize and Deserialize a Binary Tree
Serialization is to store tree in a file so that it can be later restored. The structure of tree must be maintained. Deserialization is reading… Read More »
