Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
Top trending discussions
I appeared for an interview in Aug 2021.
Round duration - 90 Minutes
Round difficulty - Easy
1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and updates.
When capacity is reached, evict the least recently used item before inserting a new one.
Update the order of keys in the linked list whenever a ke
Round duration - 90 Minutes
Round difficulty - Easy
easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Check if a given string is a palindrome considering only alphanumeric characters.
Remove non-alphanumeric characters from the input string.
Compare the string with its reverse to check for palindrome.
Handle edge cases like empty string or single character input.
Use two pointers approach for efficient comparison.
normalization, indexing
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Indexing is a technique to quickly retrieve data from a database.
Normalization helps in reducing data redundancy by breaking down tables into smaller, related tables.
Indexing is used to quickly retrieve data by creating indexes on columns in a table.
Normalization ensures data integrity by minimizing data dupli...
Round duration - 120 Minutes
Round difficulty - Hard
late at 8.00 pm
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...
Implement Priority CPU Scheduling algorithm to compute waiting time and turn-around time for processes.
Implement a function that takes in burst times, priorities, and number of processes as input
Sort the processes based on priority, with lower process ID as tiebreaker
Calculate waiting time and turn-around time for each process based on the scheduling algorithm
Data spooling is a process where data is temporarily stored in a buffer before being sent to an output device.
Data spooling helps in managing the flow of data between different devices by storing it temporarily.
It allows for efficient processing of data by decoupling the input/output operations.
Examples of data spooling include print spooling, where print jobs are stored in a queue before being sent to the printer.
Inheritance is a relationship between a superclass and subclass, while generalization is a relationship between entities with common characteristics.
Inheritance involves a parent-child relationship where the child class inherits attributes and methods from the parent class.
Generalization involves grouping entities with common attributes into a higher-level entity.
Inheritance is a specific form of generalization in obje...
Tip 1 : be confident
Tip 2 : make sure to talk less
Tip 3 : give precise answer
Tip 1 : mention only relevant things
Tip 2 : be precise
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 appeared for an interview 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 appeared for an interview 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 ...
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
I appeared for an interview in Feb 2022.
Round duration - 75 minutes
Round difficulty - Easy
There are 4 easy brute force question.
You are given an array of integers ARR
with a length of N
. Your task is to determine whether it's possible to construct at least one non-degenerate triangle using the val...
Determine if it's possible to form a non-degenerate triangle using array elements as sides.
Check if the sum of any two sides is greater than the third side to form a triangle.
If any such combination exists, return 'YES'; otherwise, return 'NO'.
Example: For input [3, 4, 5], sum of 3 + 4 > 5, so 'YES'. For [1, 10, 12, 30], no such combination exists, so 'NO'.
Round duration - 90 minutes
Round difficulty - Medium
There are 3 DS question, all are easy medium and medium level
Round duration - 90 minutes
Round difficulty - Medium
There are 3 coding problems asked which need to coded and compiled
Given an 'N' x 'M' grid, find the minimum number of moves required to collect all keys when starting at a specified point. Each move allows you to travel to an adjacent c...
Find the minimum number of moves required to collect all keys in a grid starting from a specified point.
Use breadth-first search (BFS) to explore all possible paths from the starting point to collect keys.
Keep track of keys collected, locks encountered, and the number of moves taken in each path.
Avoid revisiting cells, and consider the movement rules while traversing the grid.
Return the minimum number of moves to colle
Round duration - 60 minutes
Round difficulty - Medium
There are back to back many question are asked, one have to give approach and pseudo, no need for compilable code
You are required to implement an AVL Tree from scratch. Given 'N' values representing nodes, insert these values into the AVL Tree and return its root after all ins...
Implement an AVL Tree from scratch and insert given values to balance the tree.
Implement AVL Tree with rotation operations for balancing.
Maintain balance factor for each node to ensure AVL property.
Perform rotations (single or double) based on balance factor to balance the tree.
Update heights of nodes after insertion to maintain AVL property.
Ensure tree remains balanced after each insertion operation.
You have a briefcase secured by a lock with 4 circular wheels. The password is a sequence of 4 digits. Each wheel has 10 slots labeled ‘0’ through ‘9’. The wheels ca...
Find the minimum number of rotations required to unlock a briefcase with a given target code, considering dead-end codes.
Iterate through all possible combinations of rotations to find the shortest path to the target code.
Use a queue to efficiently explore all possible combinations.
If the target code is a dead-end code, return -1 as it is not feasible to unlock the briefcase.
Round duration - 60 minutes
Round difficulty - Easy
it was hiring manager round, most discussion is based on my resume and previous work
Tip 1 : Go through basics of data structure and algorithm.
Tip 2 : Focus specially on tree, graph and DP( 2D max).
Tip 3 : Detail understanding of everything written in resume
Tip 1 : Keep it clean, no need to use any styles or colour.
Tip 2 : Focus more on projects and experience.
Tip 3 : Use bullets, single lines to explain your work and project, don't be too lengthy, make is brief.
Tip 4 : one page resume is good, you can cut down things like unnecessary achievements
based on 1 interview
Interview experience
Relationship Manager
450
salaries
| ₹1.1 L/yr - ₹5.7 L/yr |
Cluster Manager
397
salaries
| ₹2.3 L/yr - ₹8.2 L/yr |
Claims Manager
332
salaries
| ₹1.9 L/yr - ₹7.5 L/yr |
Agency Manager
280
salaries
| ₹2.1 L/yr - ₹4.3 L/yr |
Branch Manager
256
salaries
| ₹4 L/yr - ₹8.5 L/yr |
Star Health & Allied Insurance
HDFC Ergo General Insurance
ICICI Lombard General Insurance Company
Niva Bupa Health Insurance Company