i
Paytm
Filter interviews by
I was interviewed in Aug 2021.
Round duration - 70 minutes
Round difficulty - Medium
The test started around 3 pm and was of 70 minutes. 3 coding questions were asked which were mainly on trees and number theory.
Develop a program to compute the factorial of a given integer 'n'.
The factorial of a non-negative integer 'n', denoted as n!
, is the product of all positive integ...
Program to compute factorial of a given integer 'n', with error handling for negative values.
Create a function to calculate factorial using a loop or recursion
Check if input is negative, return 'Error' if true
Handle edge cases like 0 and 1 separately
Return the calculated factorial value
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left
Use a stack to keep track of elements whose NGE is yet to be found
Pop elements from the stack until a greater element is found or the stack is empty
Assign the NGE as the top element of the stack or -1 if the stack is empty
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...
Ceil value of a key in a Binary Search Tree (BST) is the smallest integer greater than or equal to the given number.
Traverse the BST to find the closest integer greater than or equal to the given key.
Compare the key with the current node value and update the ceil value accordingly.
Recursively traverse left or right subtree based on the key value to find the ceil value.
Return the ceil value once found for each test case
Round duration - 60 minutes
Round difficulty - Medium
Interviewer was very friendly and supportive. My interview happened on google meet. What is a View? What is Denormalization? Difference between “==” and “===” operators in js.
You are given an integer array ARR
. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...
Determine the length of the shortest contiguous subarray that needs to be sorted to make the entire array sorted in ascending order.
Iterate from left to right to find the first element out of order.
Iterate from right to left to find the last element out of order.
Calculate the length of the subarray between the two out of order elements.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) to solve the problem efficiently.
Round duration - 60 minutes
Round difficulty - Medium
What are some of the advantages of Angular over other frameworks?
Determine if two nodes in a binary tree are cousins. Nodes are considered cousins if they are at the same level and have different parents.
In a binary tree, e...
Determine if two nodes in a binary tree are cousins based on level and parent nodes.
Traverse the binary tree to find the levels and parents of the given nodes.
Check if the nodes are at the same level and have different parents to determine if they are cousins.
Return 'YES' if the nodes are cousins, 'NO' otherwise.
Example: For input '1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1' and nodes 4 7, output is 'YES'.
Round duration - 10 minutes
Round difficulty - Easy
I got a call from HR in the evening around 6:30 pm.
Paytm is a leading Indian digital payment platform offering a wide range of services including mobile recharges, bill payments, and online shopping.
Founded in 2010 by Vijay Shekhar Sharma
Offers services like mobile recharges, bill payments, online shopping, and digital wallet
Acquired by One97 Communications in 2013
Expanded into financial services like Paytm Payments Bank and Paytm Money
One of the largest digital paymen
Tip 1 : Practice at least 350 questions to have good hold on data structures
Tip 2 : Practice at least 100 - 150 company specific coding questions.
Tip 3 : Try to give timing contests to build up your speed.
Tip 1 : Keep your resume only of 1 page
Tip 2 : Showcase your major projects on the top
I was interviewed in Aug 2021.
Round duration - 70 minutes
Round difficulty - Medium
There were 3 problems 1 was easy and 2 were of medium types.
Given a binary tree, the task is to compute the modulus of the difference between the sum of nodes at odd levels and the sum of nodes at even levels.
The first line...
The task is to compute the modulus of the difference between the sum of nodes at odd levels and the sum of nodes at even levels in a binary tree.
Traverse the binary tree level by level and calculate the sum of nodes at odd and even levels separately.
Find the absolute difference between the sums and return the modulus of this difference.
Handle null nodes by skipping them during the sum calculation.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find all rotten oranges and add them to the queue.
Simulate the rotting process by checking adjacent cells and updating their status.
Track the time taken to rot all fresh oranges and return the result.
Handle edge cases like unreachable fresh oranges or already
Round duration - 50 minutes
Round difficulty - Medium
the interviewer was very polite and straightforward, he didn't ask me to introduce myself and he directly jumps to the coding problems.
What is new about the relationship between the and tags in HTML5?
Explain Components, Modules and Services in Angular
You have a robot currently positioned at the origin (0, 0) on a two-dimensional grid, facing the north direction. You are given a sequence of moves in the form of a string ...
Determine if a robot's movement path is circular on a 2D grid given a sequence of moves.
Iterate through the move sequence and update the robot's position based on the moves ('L' - turn left, 'R' - turn right, 'G' - move forward).
Check if the robot returns to the starting position after completing the move sequence.
If the robot ends up at the starting position and facing the north direction, the movement path is circula
Round duration - 70 minutes
Round difficulty - Easy
What is a View in sql? What are the TRUNCATE, DELETE and DROP statements?
Given a square matrix 'MATRIX' of non-negative integers, rotate the matrix by 90 degrees in an anti-clockwise direction using only constant extra space.
Rotate a square matrix by 90 degrees in an anti-clockwise direction using constant extra space.
Iterate through each layer of the matrix from outer to inner layers
Swap elements in groups of 4 to rotate the matrix
Handle odd-sized matrices by adjusting the center element if needed
Given a string STR
of length N
, determine the minimum number of characters to be added to the front of the string to make it a palindrome.
The first...
The task is to find the minimum number of characters needed to be added to the front of a string to make it a palindrome.
Iterate through the string from both ends and count the number of characters that need to be added to make it a palindrome.
Use two pointers approach to compare characters from start and end of the string.
Keep track of the count of characters needed to be added to form a palindrome.
Round duration - 20 minutes
Round difficulty - Easy
Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice as many problems as you can from leetcode.
Tip 1 : mention 1 or 2 projects in your resume.
Tip 2 : don't put false things in your resume.
I was interviewed before Mar 2021.
Round duration - 70 minutes
Round difficulty - Easy
there was some coding questions and some mcqs related to js, html, css, java and aptitude.
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...
Find all the bridges in an undirected graph by identifying edges that, when removed, increase the number of connected components.
Use Tarjan's algorithm to find bridges in the graph.
Keep track of the discovery time and low time of each vertex during DFS traversal.
An edge (u, v) is a bridge if low[v] > disc[u].
Handle multiple test cases efficiently to find bridges in each graph.
Ensure the output contains the count of
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...
The task is to find the maximum amount of money Mr. X can rob from houses arranged in a circle without alerting the police.
The problem can be solved using dynamic programming.
Create two arrays to store the maximum amount of money robbed when considering the first house and when not considering the first house.
Iterate through the array and update the maximum amount of money robbed at each house.
The final answer will be
Tip 1 : Do 300+ questions on IB or leetcode or gfg
Tip 2 : Must do DSA course of coding ninjas for clear understanding
Tip 3 : Must complete CS subjects also
Tip 1 : not add too much things
Tip 2 : be confident that you write in CV
I was interviewed before Mar 2021.
Round duration - 90 Minutes
Round difficulty - Easy
MCQ based on web and oops.
Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.
Determine if one binary tree is a subtree of another binary tree based on their structure and node values.
Traverse through the main tree and check if any subtree matches the second tree
Use recursion to compare nodes of both trees
Handle edge cases like empty trees or null nodes
Check if the root node of the second tree exists in the main tree
Round duration - 50 Minutes
Round difficulty - Easy
This round involved a discussion of a project I had undertaken recently and a coding problem. How does an Angular application work? List out differences between AngularJS and Angular
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
The task is to find the number of distinct ways to climb from the 0th step to the Nth step, where each time you can climb either one step or two steps.
Use dynamic programming to solve this problem
Create an array to store the number of ways to reach each step
Initialize the first two elements of the array as 1 and 2
For each subsequent step, the number of ways to reach that step is the sum of the number of ways to reach t...
Round duration - 80 Minutes
Round difficulty - Medium
The interview mostly focused on coding problems and Java-related concepts.
A Linked List in Java is implemented using nodes with references to the next node. It is preferred over an ArrayList when frequent insertions and deletions are required.
In Java, a Linked List is implemented using a Node class with data and a reference to the next Node.
LinkedList class in Java provides methods like add(), remove(), and get() for manipulating the list.
Linked List is preferred over ArrayList when frequent...
Given a positive integer 'N', representing the number of tasks, and a list of dependency pairs, determine if it is possible to complete all tasks considering thes...
Determine if it is possible to complete all tasks considering prerequisites.
Create a graph representation of the tasks and dependencies.
Use topological sorting to check if there is a cycle in the graph.
Return 'Yes' if no cycle is found, 'No' otherwise.
You are provided with an array 'Arr' containing 'N' distinct integers and a positive integer 'K'. Your task is to find the Kth smallest and Kth largest e...
Find the Kth smallest and largest elements in an array.
Sort the array to easily find the Kth smallest and largest elements.
Ensure K is within the array's size to avoid errors.
Handle multiple test cases efficiently.
Consider edge cases like when N is small or K is at the extremes.
Round duration - 30 Minutes
Round difficulty - Easy
This was the Hiring Manager Round. What is a Primary Key? What is a Cross-Join? What is the difference between Clustered and Non-clustered index?
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...
Given a sorted N * N matrix, find the position of a target integer 'X'.
Iterate over rows and columns to search for the target integer 'X'.
Utilize the sorted nature of the matrix to optimize the search process.
Return the position of 'X' if found, else return '-1 -1'.
Tip 1 : Practice Standard Dynamic Programming and Graph Theory Questions
Tip 2 : If you know Java, Be well versed with Fundamentals
Tip 3 : Have atleast one Good Project you can talk about
Tip 1 : Keep it Concise
Tip 2 : Only Mention Stuff you know
Paytm interview questions for designations
I was interviewed before Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
It was in the evening, at around 3 - 4 PM. There were 3 coding questions. One easy, two moderate ones. The platform had autocomplete feature too.
You have an array of integers, and your task is to modify the array by moving all even numbers to the beginning while placing all odd numbers at the end. The order within ev...
Move all even numbers to the beginning and odd numbers to the end of an array.
Iterate through the array and swap even numbers to the front and odd numbers to the back.
Use two pointers, one starting from the beginning and one from the end, to achieve the desired arrangement.
Return the modified array with even numbers at the start and odd numbers at the end.
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...
Determine if two strings are anagrams of each other by checking if they have the same characters in different order.
Create a character frequency map for both strings and compare them.
Sort both strings and compare if they are equal.
Use a hash table to store character counts and check if they are the same for both strings.
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...
Find the Lowest Common Ancestor (LCA) of two nodes in a Binary Search Tree (BST).
Traverse the BST from the root node to find the LCA of the given nodes.
Compare the values of the nodes with the values of P and Q to determine the LCA.
If the values of P and Q are on opposite sides of the current node, then the current node is the LCA.
Round duration - 50 Minutes
Round difficulty - Medium
They asked 2 coding questions and 2 sql queries in this round
Given a string ‘S’ composed of lowercase English letters, your task is to identify the longest palindromic substring within ‘S’.
If there are multiple longest palin...
Find the longest palindromic substring in a given string, returning the rightmost one if multiple exist.
Iterate through each character in the string and expand around it to find palindromes
Keep track of the longest palindrome found and its starting index
Return the substring starting from the index of the longest palindrome found
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
A nested SQL query is a query within another query, used to retrieve data from multiple tables in a single query.
Nested queries are enclosed within parentheses and can be used in SELECT, INSERT, UPDATE, or DELETE statements.
They are commonly used to perform subqueries to filter results based on the output of the inner query.
Example: SELECT * FROM table1 WHERE column1 IN (SELECT column2 FROM table2 WHERE condition);
Round duration - 50 Minutes
Round difficulty - Medium
This round was about OS, networking and my projects. What are the different ways to style a React component?
Name a few techniques to optimize React app performance.
Round duration - 30 Minutes
Round difficulty - Easy
It was a fun round, in which they ask about your preferences about programming languages, technologies or your hobbies. If you reach this round, it means that your chances of selection are 99%.
Tip 1 : If weak in coding, enroll for Coding Ninjas eminence course
Tip 2 : Practice everyday, atleast 2- 3 questions
Tip 3 : Participate in weekly coding contests on leetcode
Tip 1 : Keep in One page
Tip 2 : Don't mention your hobbies, recruiters are not interested in them and moreover hobbies take up space
Tip 3 : Have some unique projects on your resume. The projects should be self made, not from code-along sessions from youtube.
Get interview-ready with Top Paytm Interview Questions
I was interviewed in Sep 2020.
I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.
Find subset of numbers in array that sum up to zero.
Use a nested loop to iterate through all possible subsets.
Calculate the sum of each subset and check if it equals zero.
Store the subset if the sum is zero.
Optimize the solution by using a hash set to store the cumulative sum of elements.
BFS (Breadth-First Search) is a graph traversal algorithm that explores all the vertices of a graph in breadth-first order.
BFS starts at a given vertex and explores all its neighbors before moving to the next level of vertices.
It uses a queue data structure to keep track of the vertices to be visited.
BFS guarantees that it visits all the vertices of a connected graph.
It can be used to find the shortest path between two
In 5 years, I see myself as a highly skilled software developer, leading a team and contributing to innovative projects.
Continuously improving my technical skills through learning and hands-on experience
Taking on leadership roles and mentoring junior developers
Contributing to the development of cutting-edge software solutions
Building strong relationships with clients and stakeholders
Staying updated with the latest indu...
I applied via Campus Placement
Object Oriented Programming is a programming paradigm that uses objects to represent real-world entities.
Encapsulation: bundling data and methods that operate on that data within one unit
Inheritance: creating new classes from existing ones, inheriting their properties and methods
Polymorphism: ability of objects to take on multiple forms or behaviors
Abstraction: hiding complex implementation details and providing a simp...
Abstraction is hiding implementation details while polymorphism is using a single interface for multiple types.
Abstraction: Encapsulation, Interfaces, Abstract classes
Polymorphism: Method Overloading, Method Overriding, Interfaces
Abstraction Example: Car - we don't need to know how the engine works to drive it
Polymorphism Example: Animal - different animals have different sounds but they all have a 'makeSound' method
PayPal is an online payment system that allows individuals and businesses to transfer funds electronically.
Allows users to make payments and money transfers online
Offers a secure and convenient way to pay for goods and services
Provides a platform for businesses to accept payments online
Offers buyer and seller protection for eligible transactions
Can be used to send and receive money internationally
I am excited to join PayPal because of its innovative culture and impact on the global economy.
PayPal's commitment to innovation aligns with my passion for staying up-to-date with the latest technologies.
I am impressed by PayPal's global reach and impact on the economy, and I want to be a part of that.
I appreciate PayPal's focus on diversity and inclusion, and I believe in the importance of working for a company with s...
I was interviewed before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
I couldn't find an optimal approach to the first question, so she skipped that question and proceeded to next questions. Remaining questions I have answered satisfactorily.
Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Provide true
if such a subset exists, otherwise r...
Given an array of positive integers and an integer K, determine if there exists a subset whose sum equals K.
Use dynamic programming to solve this problem efficiently
Create a 2D array to store if a subset with a particular sum exists
Iterate through the array and update the 2D array accordingly
Check if the value at the end of the iteration is true for the given K
Given an undirected and disconnected graph G(V, E) where V vertices are numbered from 0 to V-1, and E represents edges, your task is to output the BFS traversal starting from the ...
BFS traversal in a disconnected graph starting from vertex 0.
Implement BFS algorithm to traverse the graph starting from vertex 0.
Use a queue to keep track of visited nodes and their neighbors.
Ensure to print the traversal sequence in the correct order.
Handle disconnected components by checking for unvisited nodes.
Follow the BFS approach of exploring neighbors before moving to the next level.
Round duration - 60 minutes
Round difficulty - Easy
I told that my strength is problem solving and I can always find a way when there is a bottle-neck. Gave some examples of my experiences while doing my assignments.
Given a string STR
consisting of words separated by spaces, your task is to replace all spaces between words with the characters "@40".
The first line contains an integ...
Replace spaces in a string with '@40'.
Iterate through each character in the string
Replace spaces with '@40'
Return the modified string
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 review
Rating in categories
Team Lead
2.3k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
1.4k
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
972
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
899
salaries
| ₹0 L/yr - ₹0 L/yr |
BharatPe
Zerodha
Razorpay
Mobikwik