Filter interviews by
I applied via Campus Placement and was interviewed in Aug 2022. There were 3 interview rounds.
Deep data structure is required. Most of the questions are based on graphs and trees. Linked list stack and priority queue is helpful.
Codding round is tough.
I applied via Campus Placement and was interviewed in Mar 2023. There were 3 interview rounds.
4 coding questions which were very difficult which even a expert with 10 years industry experience would not crack it
I applied via Campus Placement and was interviewed before Aug 2022. There were 3 interview rounds.
40 MINS,DSA AND OFFLINE PLATFORM
Led a team project in college, coordinating tasks and fostering collaboration to achieve our goal successfully.
Organized a study group for a challenging course, ensuring everyone understood the material.
Delegated tasks based on individual strengths, enhancing team efficiency.
Facilitated open communication, encouraging team members to share ideas and concerns.
Motivated the team during stressful periods, helping us stay ...
I appeared for an interview in Dec 2021.
Round duration - 60 minutes
Round difficulty - Easy
You are provided with an array/list 'prices', where each element signifies the prices of a stock as of yesterday and the indices represent minutes. The task is to d...
Given stock prices, find the maximum profit from a single buy and sell action.
Iterate through the array and keep track of the minimum price seen so far and the maximum profit achievable.
Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.
Return the maximum profit obtained after iterating through the array.
Example: For prices = [2, 100, 150, 120], buy at 2...
Round duration - 20 Minutes
Round difficulty - Easy
Tip 1 : Work hard
Tip 2 : Prepare resume well
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
I applied via Campus Placement and was interviewed in Jun 2022. There were 2 interview rounds.
It needed hard core DSA
I could not qualify for 2nd round
I appeared for an interview before May 2021.
Round duration - 60 minutes
Round difficulty - Medium
Two DSA problems of difficulty rating of 1500-1800 on Codeforces.
Given a sorted array 'A' of length 'N', and two integers 'K' and 'X', your task is to find 'K' integers from the array closest to 'X'. If two integers are at the same distance, pre...
Find K closest elements to X in a sorted array A.
Use binary search to find the closest element to X in the array.
Maintain two pointers to expand around the closest element to find K closest elements.
Handle cases where two elements are equidistant by choosing the smaller one.
Return the K closest elements in a new array.
Mr. Schrodinger needs to generate points that are uniformly distributed inside a specific circle for testing his hypothesis. Your task is to implement a function that ge...
Implement a function to generate random points uniformly distributed inside a circle.
Generate random points using polar coordinates
Ensure points fall within the circle by checking if distance from center is less than or equal to radius
Check if points are uniformly distributed by running statistical tests
Return 1 if points are uniformly distributed, else return 0
Round duration - 45 minutes
Round difficulty - Medium
This round was majorly based on my resume discussion. It was with a senior VP. We had an in-depth discussion on my past interview experiences, my projects etc.
Tip 1 : Give regular programming contests. Try to achieve Codeforce Candidate Master level or equivalent
Tip 2 : Learn/Practice DSA.
Tip 3 : Do at least 2 projects on your resume, on topics such as ML, NLP, Dev etc
Tip 1 : Mention atleast 2 good projects and be thorough with them.
Tip 2 : Mention CP contest rankings or ratings
I applied via Naukri.com and was interviewed in Feb 2022. There were 2 interview rounds.
2hr coding round test and questions were based on DSA
1 hr Aptitude test which was average base but I got rejected after that.
Top trending discussions
I appeared for an interview before Sep 2016.
I appeared for an interview before Sep 2020.
Round duration - 120 minutes
Round difficulty - Hard
You are provided with 'N' processes, each having a process ID ranging from 1 to 'N'. Each process has an arrival time and a burst time. Additionally, you're given ...
Implement a round-robin scheduling algorithm to determine completion time for each process.
Implement a round-robin scheduling algorithm with the given time quantum.
Execute processes based on arrival time and process ID if arrival times are the same.
Calculate completion time for each process based on burst time and time quantum.
Tip 1 : Strong Ds Algo Fundamentals
Tip 2 : Competitive Programming
Tip 3 : Projects are a plus to test your overall skills
Tip 1 : Should be clear and easy to go through
Tip 2 : Links should be present to validate your projects
based on 3 interview experiences
Difficulty level
Duration
based on 3 reviews
Rating in categories
Software Developer
9
salaries
| ₹30 L/yr - ₹36 L/yr |
Software Development Engineer
5
salaries
| ₹29 L/yr - ₹36.5 L/yr |
SDE (Software Development Engineer)
4
salaries
| ₹36 L/yr - ₹36.5 L/yr |
Sde1
4
salaries
| ₹30 L/yr - ₹36 L/yr |
HR Operation Manager
4
salaries
| ₹10 L/yr - ₹12.7 L/yr |
TCS
Accenture
Wipro
Cognizant