Filter interviews by
I was interviewed in Aug 2021.
Round duration - 180 Minutes
Round difficulty - Medium
It had some coding questions related to graph.
You are given an undirected graph with V
vertices (numbered from 0 to V-1) and E
edges. Each edge connects two nodes u
and v
and has an associated weight represe...
The question is about finding the shortest path distance from a source node to all vertices in an undirected graph.
The graph is represented by the number of vertices and edges, followed by the edges and their distances.
The task is to find the shortest path distance from the source node (0) to all other nodes.
If a node is disconnected from the source node, print the maximum positive integer value (2147483647).
Implement ...
Given a directed and unweighted graph characterized by vertices 'V' and edges 'E', determine if a path exists from a specified 'source' vertex to a 'destination' vertex. T...
The task is to check if there exists a path from a given source vertex to a destination vertex in a directed and unweighted graph.
Read the number of test cases.
For each test case, read the number of vertices and edges.
Read the edges of the graph.
Read the source and destination vertices.
Implement a graph traversal algorithm (e.g., BFS or DFS) to check if a path exists from the source to the destination.
Print 'true' if a
Round duration - 180 Minutes
Round difficulty - Hard
The round was really tough only 1 coding question was asked
You are provided with an N-ary tree constituted of 'N' nodes, where node '1' is the head of the tree. Your task is to encode this N-ary tree into a binar...
The task is to encode an N-ary tree into a binary tree and then decode the binary tree back into the original N-ary tree.
Encode the N-ary tree by representing each node as a binary tree node with its first child as the left child and subsequent children as the right child.
To decode the binary tree, traverse the binary tree and for each node, create a new N-ary tree node with its left child as the first child and subseq...
Tip 1 : Do atleast 2 projects
Tip 2 : Complete competitive programming
Tip 3 : Practice more interview Questions particular to the company applying to
Tip 1 : Don't lie on resume
Tip 2 : Try to wrap resume in one page
Top trending discussions
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.
Divide the array into two halves recursively
Sort each half using merge sort recursively
Merge the sorted halves back together
I applied via Referral and was interviewed in Oct 2024. There were 3 interview rounds.
Was asked to create a UI component keeping in mind scalability and reuseability.
General discussion about resume and projects, and then some basic JS coding questions like implement throttling and memoization.
I applied via Company Website and was interviewed before Oct 2023. There were 3 interview rounds.
It was on hackerrank, it was given to solve 3 questions in JS along with quiz on js concepts
It was a js fundamental round, was asked similar JS problems asked in the hackerrank test
Developed a responsive e-commerce website for a local boutique selling handmade jewelry
Used HTML, CSS, and JavaScript to create a visually appealing and user-friendly interface
Implemented a product carousel to showcase different jewelry collections
Integrated a payment gateway for secure online transactions
Stay updated by regularly reading tech blogs, attending conferences, taking online courses, and networking with other professionals.
Read tech blogs regularly (e.g. TechCrunch, Mashable)
Attend tech conferences and workshops
Take online courses and tutorials (e.g. Udemy, Coursera)
Network with other professionals in the field (e.g. LinkedIn, Meetup)
I do not try every new framework that comes in the market, but I do stay updated on the latest trends and evaluate them based on project requirements.
I prioritize learning frameworks that align with the project needs
I assess the pros and cons of new frameworks before deciding to use them
I stay updated on industry trends and experiment with new frameworks in personal projects
Optimizing code involves identifying and fixing bottlenecks to improve performance and efficiency.
Identify and remove unnecessary code or functions
Use efficient algorithms and data structures
Minimize network requests and optimize asset loading
Implement caching mechanisms
Profile and analyze code performance
I was interviewed 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
I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.
1hr aptitude + coding
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
based on 1 interview
Interview experience
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Softwaretest Engineer
20
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Razorpay
Paytm
PhonePe
Payed