i
Filter interviews by
I was interviewed before Nov 2020.
Round duration - 90 Minutes
Round difficulty - Medium
You are given 'n' fruit trees planted along a road, numbered from 0 to n-1. Each tree bears a fruit type represented by an uppercase English alphabet. A Ninja walking ...
The problem is to find the maximum number of fruits the Ninja can put in both baskets after satisfying given conditions.
The Ninja can start at any tree and end at any tree, but cannot skip a tree.
He can pick one fruit from each tree until he cannot, i.e., when he has to pick a fruit of the third type.
The restriction is that each basket can have only one type of fruit.
We need to find the maximum number of fruits that ca
Round duration - 30 Minutes
Round difficulty - Medium
Was Shortlisted For this round with in total of 22 students, 7 in my profile.
It was Technical round with 30 mins of time allotted.
The interviewer was friendly, started with basic questions about me followed by project specific and then a puzzle.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
The problem requires sorting an array of 0s, 1s, and 2s in a single scan.
Use three pointers to keep track of the positions of 0s, 1s, and 2s.
Initialize the low pointer at the beginning of the array and the high pointer at the end.
Iterate through the array using a current pointer and swap elements based on their values.
Move the pointers accordingly until the array is sorted.
The time complexity of this solution is O(N) a
Round duration - 20 Minutes
Round difficulty - Hard
The interview was scheduled for 15 mins and 12 students were shortlisted for this round. 5 in my profile.
The interviewer didn't on his video whereas mine was, the interviewer was friendly and maintained a poker voice.
Asked Basic HR questions but crossed questioned several times.
Tip 1 :Practice at least 3-4 coding questions daily. Start from basics of Pointers and Array and progress to Algo and Data structure specific like DP and Graphs. Try to time your sessions into 15-20 mins.
Tip 2 : Have Patience don't rush into problem solving, understand the Algo/Data structure first and then look for common problems for a particular Algo/Data structure.
Tip 3 : Have Basic Knowledge about all CS subjects, no need for in depth. Just cover Top 100 interview questions for each subject and topics covered in GFG and CodeStudio.
Tip 1 : Have at least 3-4 Projects in your resume but on diverse bases, like 1 ML based, 1-2 DBMS 1 with Computer vision/ Frontend. Don't obsess over internships so much.
Tip 2 : Be well verse with projects you put in resume, and specify your particular job role if a team project.
Tip 3 : Mention some extra curricular activities or Interests and hobbies (Non Tech) , if you sync with interviewer then it could be beneficial.
Top trending discussions
3 Interview rounds
based on 30 reviews
Rating in categories
Data Engineer
406
salaries
| ₹5 L/yr - ₹17.9 L/yr |
Senior Data Engineer
396
salaries
| ₹8 L/yr - ₹31 L/yr |
Senior Business Analyst
330
salaries
| ₹9.5 L/yr - ₹28 L/yr |
Business Analyst
318
salaries
| ₹6.5 L/yr - ₹14 L/yr |
Machine Learning Engineer
313
salaries
| ₹5 L/yr - ₹16 L/yr |
Fractal Analytics
Tiger Analytics
LatentView Analytics
Mu Sigma