Filter interviews by
I appeared for an interview before Sep 2023.
I am a software engineer with experience in developing web applications and a passion for problem-solving.
Experienced in developing web applications using languages such as Java, Python, and JavaScript
Proficient in using frameworks such as Spring, Django, and React
Skilled in problem-solving and troubleshooting
Strong communication and collaboration skills
Passionate about learning new technologies and keeping up with ind...
I have experience in software development and have worked on various projects using different technologies.
Started my career as a software developer at XYZ company
Developed web applications using Java and Spring framework
Worked on a project for a client in the healthcare industry, developing a patient management system
Implemented RESTful APIs using Node.js and Express
Contributed to open source projects on GitHub
Current...
BST is a binary tree where left child is smaller and right child is greater. Add/delete ops maintain this property.
BST is a data structure used for searching, sorting, and storing data
Add operation: Traverse the tree and find the appropriate position to insert the new node
Delete operation: Find the node to be deleted, replace it with its inorder successor or predecessor, and delete the successor/predecessor node
Time co...
Copy a linked list with random pointers to random nodes in the list.
Create a new node for each node in the original list
Map the original nodes to their corresponding new nodes
Copy the value of the original node to the new node
Copy the random pointer of the original node to the new node using the mapping created earlier
Top trending discussions
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Array: [2,1,5,6,3,8], K ...
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
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.
I appeared for an interview in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl...
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit...
Construct a binary tree of height h and merge bottom nodes to create a cone-like structure.
A binary tree of height h has 2^h - 1 nodes.
Start combining leaf nodes from the bottom level upwards.
Each combination can be visualized as merging two nodes into one.
For example, if h=3, the tree has 7 nodes, and you combine nodes at levels 2 and 1.
The final structure resembles a cone as nodes are merged.
Some of the top questions asked at the Times Internet Software Engineer interview -
based on 2 interview experiences
Duration
based on 9 reviews
Rating in categories
Senior Software Engineer
148
salaries
| ₹11 L/yr - ₹40 L/yr |
Product Manager
108
salaries
| ₹12.9 L/yr - ₹36.8 L/yr |
Software Developer
99
salaries
| ₹7.5 L/yr - ₹27 L/yr |
Manager
74
salaries
| ₹7.5 L/yr - ₹30 L/yr |
Accounts Manager
68
salaries
| ₹4 L/yr - ₹14.5 L/yr |
Amazon
Flipkart
Indiamart Intermesh
BigBasket