i
Info
Edge
Work with us
Filter interviews by
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
I have greep on python
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This round was held during university hours and consisted of 2 coding questions.
Round duration - 120 minutes
Round difficulty - Easy
Make sure you do no cutting and are clear about the approach you'd be following.
Running median of an input stream is the median value of the numbers seen so far in a continuous stream of data.
Maintain two heaps - a max heap for the lower half of the numbers and a min heap for the upper half.
Keep the number of elements in the two heaps balanced or differ by at most 1.
If the total number of elements is odd, the median is the root of the max heap. If even, it is the average of the roots of the two he...
Prepare for company-wise interview questions according to the company in which you are applying. Try to write the code yourself and if got stuck in between then take help from the internet. I recommend you Codezen of Coding Ninjas for practicing Data Structures and Algorithms based questions.
Application resume tips for other job seekersBe sure 100% of what you write in your resume and prepare for that before the interview what is written on resume.
Final outcome of the interviewSelectedI applied via Job Portal and was interviewed in Jun 2021. There were 3 interview rounds.
Sorts an array of strings in ascending order.
Use a sorting algorithm like bubble sort, selection sort, or merge sort.
Compare adjacent elements and swap them if they are in the wrong order.
Repeat the process until the array is sorted.
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
Medium level competitive programming question. Interviewer looked for the approach and working code.
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.
Track the time taken to burn each node based on its distance from the starting node.
Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Round duration - 40 minutes
Round difficulty - Medium
Timing : Evening
Interviewer was frank. He checked for indepth knowledge of the subject.
Tip 1 : Leave a subject to prepare, but never leave a topic.
Tip 2 : Must go through previous years questions / interview experiences.
Tip 3 : Atleast 4 projects in CV
Tip 1 : At least 4 projects (working)
Tip 2 : Never put false things on resume.
I applied via Company Website and was interviewed in Aug 2021. There were 2 interview rounds.
E-commerce
I appeared for an interview before Dec 2015.
I am excited to join the company because of its reputation for innovation and commitment to employee growth.
I am impressed by the company's track record of developing cutting-edge software solutions.
I appreciate the company's focus on fostering a culture of learning and development.
I am excited about the opportunity to work with a talented team of developers and contribute to the company's success.
I believe that the co...
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.
posted on 30 Nov 2015
I applied via Campus Placement
based on 1 interview experience
Difficulty level
Duration
based on 1 review
Rating in categories
Senior Executive
761
salaries
| ₹3.4 L/yr - ₹8 L/yr |
Sales Executive
658
salaries
| ₹6 L/yr - ₹15 L/yr |
Assistant Manager
621
salaries
| ₹4.4 L/yr - ₹9.5 L/yr |
Associate Senior Executive
602
salaries
| ₹2.8 L/yr - ₹6.2 L/yr |
Senior Software Engineer
369
salaries
| ₹15 L/yr - ₹26.1 L/yr |
TCS
Amazon
Flipkart
Indiamart Intermesh