Filter interviews by
Clear (1)
I was interviewed in Jul 2021.
Round duration - 120 Minutes
Round difficulty - Medium
This was a coding round conducted from 12 PM to 2 PM and it was not proctored but we could not switch the tabs. There were 2 coding questions each of 100 marks. The MCQ had HTML,CSS, JS, SQL, Coding and aptitutude questions.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.
Use backtracking algorithm to explore all possible configurations.
Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.
Generate valid configurations recursively and backtrack when a solution is not possible.
Given a string ‘S’, your task is to rearrange its characters so that no two adjacent characters are the same. If it's possible, return any such arrangement, otherwise re...
Given a string, rearrange its characters so that no two adjacent characters are the same. Return 'Yes' if possible, 'No' otherwise.
Iterate through the string and count the frequency of each character
Use a priority queue to rearrange characters based on frequency
Check if the rearranged string has no two adjacent characters the same
Return 'Yes' if possible, 'No' otherwise
Round duration - 60 minutes
Round difficulty - Easy
There were two interviewers. They started by asking me to introduce myself and asked me to explain any one of my projects in my resume and after that, they asked me about the ML algorithms used in my project and about the difficulties faced. What is NaN property in JavaScript? This took around 10 minutes. They also asked 2 coding questions.
It was conducted at 10 AM on CodePair and MS Teams. Interviewers were friendly.
Given an array/list of strings STR_LIST
, group the anagrams together and return each group as a list of strings. Each group must contain strings that are anagrams of each other.
Group anagrams in a list of strings together and return each group as a list of strings.
Iterate through the list of strings and sort each string alphabetically to create a key for grouping.
Use a hashmap to store the sorted string as key and the original string as value.
Return the values of the hashmap as the grouped anagrams.
The task is to determine the total number of ways to pair up 'N' friends or leave some of them single, following these rules:
The task is to determine the total number of ways to pair up 'N' friends or leave some of them single.
Use dynamic programming to solve the problem efficiently.
Consider the base cases when N is 1, 2, and 3 to derive the general formula.
The result should be computed modulo 10^9 + 7 to handle large outputs.
Round duration - 60 Minutes
Round difficulty - Medium
There were 2 questions based on data structures, the round started from 1.15 PM .Some SQL questions like What is a Subquery? What are its types? What are UNION, MINUS and INTERSECT commands?
You are given a binary tree, and the task is to perform a vertical order traversal of the values of the nodes in the tree.
For a node at position ('X', 'Y'), th...
Perform vertical order traversal of a binary tree based on decreasing 'Y' coordinates.
Traverse the binary tree level by level and maintain the position of each node
Use a map to store nodes at each position and sort them based on 'Y' coordinates
Print the nodes in sorted order for each position to get the vertical order traversal
You are given two integers dividend
and divisor
. Your task is to divide the integers without using multiplication, division, and modular operators. Return the quotien...
Divide two integers without using multiplication, division, and modular operators, returning the floored value of the quotient.
Implement division using bit manipulation and subtraction
Handle edge cases like negative numbers and overflow
Return the floored value of the quotient
Round duration - 30 Minutes
Round difficulty - Easy
The round was at 7.30 PM and I was asked to introduce myself and we had basic talk on where I live and my interests. I asked about the work culture and about the role at the end.
Tip 1 : Practice atleast 400 questions of leetcode topics wise.
Tip 2 : Participate in hackathons.
Tip 3 : Have 2 good projects atleast and be very good in project concepts.
Tip 1 : Have good projects in your resume and have clear idea of what you have done in those.
Tip 2 : Mention languages, frameworks, subjects only when you have proper hold on them, don't mention things you don't know properly.
I was interviewed in Dec 2017.
To find the maximum water pond formed between buildings.
Identify the lowest point between the buildings.
Calculate the area of the pond using the distance between the buildings and the depth of the pond.
Consider any obstacles or uneven ground that may affect the pond's shape.
Use a surveying tool or satellite imagery to get accurate measurements.
Take into account any drainage systems or natural water flow that may affect
Design a dictionary using trie with insert, update and delete operations.
Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word
For insert operation, traverse the trie and add nodes for each character in the word
For update operation, delete the existing word and insert the updated word
For delete operation, mark the end of word flag as false and delete the node if it ...
Find the odd repeating element from an array of strings
Use a hash table to count the frequency of each element
Iterate through the hash table to find the element with an odd count
Finding an element in a sorted 2D matrix
Start from the top right corner or bottom left corner
Compare the target element with the current element
Move left or down if the target is smaller, else move right or up
Repeat until the target is found or all elements are checked
SQL query to find Nth highest salary from table
Use ORDER BY and LIMIT clauses
Use subquery to get the Nth highest salary
Handle cases where there are less than N distinct salaries
Function to swap '3' and '4' without using if-else
Use XOR operator to swap the values
Convert the input to ASCII code and perform the swap
Use a lookup table to map the values
I am a software developer with experience in Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using Spring framework
Familiarity with database management systems like MySQL and MongoDB
PAYTM is a leading digital payment platform in India with a wide range of services.
PAYTM has a user-friendly interface and offers a seamless payment experience.
It provides a variety of services like mobile recharges, bill payments, and online shopping.
PAYTM has a strong focus on security and fraud prevention measures.
It has a large user base and is widely accepted by merchants across India.
PAYTM is constantly innovatin...
Yes, I am open to pursuing further studies in the future.
I believe in continuous learning and staying updated with the latest technologies.
Further studies can help me specialize in a particular field and enhance my skills.
I may consider pursuing a master's degree in computer science or a related field.
However, my immediate focus is on gaining practical experience and contributing to the organization.
PAYTM grew fast due to its innovative approach and early adoption of digital payments.
Early adoption of digital payments in India
Innovative approach with features like mobile recharges, bill payments, and cashback offers
Expansion into e-commerce and financial services
Strategic partnerships with major companies like Uber and Alibaba
I was interviewed before Sep 2020.
Round duration - 45 minutes
Round difficulty - Medium
I applied thorough LinkedIn and got a call from HR for the interview.
I went to their Noida Office.
First round was mainly focused on Javascript fundamentals.
Interviewer was also friendly.
Round duration - 1 hour
Round difficulty - Medium
Second round was after 15 minutes of the first round. The focus of this round was DS & Algorithms.
Given an array ARR
of N
integers and an integer S
, determine if there exists a subarray (of positive length) within the given array such that the sum of its elements equals S
....
Given an array and a target sum, find a subarray that sums up to the target sum.
Iterate through the array while keeping track of the running sum and the starting index of the subarray.
Use a hashmap to store the running sum and its corresponding index.
If the running sum - target sum is found in the hashmap, it means a subarray with the target sum exists.
Return the starting and ending indices of the subarray or [-1, -1]
You are provided with two arrays, AT
and DT
, representing the arrival and departure times of all trains arriving at a railway station.
Your task is to determine the m...
This question asks to find the minimum number of platforms required at a railway station so that no train needs to wait.
Sort the arrival and departure times arrays in ascending order.
Initialize a variable 'platforms' to 1 and 'maxPlatforms' to 1.
Iterate through the arrival and departure times arrays simultaneously.
If the current arrival time is less than or equal to the current departure time, increment 'platforms'.
If ...
Round duration - 30 minutes
Round difficulty - Easy
The interviewer asked about JavaScript questions and the work culture of the team during the managerial round.
JavaScript questions related to closures, prototypes, event handling, and asynchronous programming may have been asked.
Work culture may involve collaboration, innovation, agile methodologies, and continuous learning.
Examples of work culture could include regular team meetings, code reviews, hackathons, and ment
Round duration - 15 minutes
Round difficulty - Easy
Tip 1 : Be strong at your basics.
Tip 2 : Don't hesitate to ask questions to interviewer.
Tip 3 : Prepare good for DS & Algo as most companies have a separate round for it.
Tip 1: If possible make 1 page resume
Tip 2: Don't put too many things. Keep it simple. If you're a fresher and have good projects, do put them before your academic section.
Tip 3: Be ready to explain everything you have in your resume.
I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.
1hr aptitude + coding
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
Asked to write an in memory SQL database. Time was 1.5 hours. I made the mistake of choosing C++ and writing the code to make it very flexible and extensible. This led to me not being able to complete the task in the given time.
Tip: practice LLD round in a high level language like Python or Typescript. Speed is very important.
I was interviewed before Sep 2020.
Round duration - 90 mins
Round difficulty - Hard
There were questions related to DP and DFS.
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.
Round duration - 60 mins
Round difficulty - Medium
At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.
Implement methods for getting and setting key-value pairs in the cache.
When a new item is added to the cache, check if it exceeds the maximum capacity. I...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
If there are even elements, return the one that is farther from the head node
Handle edge cases like linked list of size 1 or empty list
Round duration - 60 mins
Round difficulty - Medium
It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.
Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions
Tip 3 : Know the complexities of the code that you’ve written.
Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume
based on 1 interview
Interview experience
Software Engineer2
305
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
259
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
236
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer III
228
salaries
| ₹0 L/yr - ₹0 L/yr |
Risk Analyst
166
salaries
| ₹0 L/yr - ₹0 L/yr |
Paytm
Razorpay
Visa
MasterCard