I applied through college or university. I interviewed at Oracle (Nueva Delhi) in Sep 2020
Interview
The interview had multiple technical rounds with all the rounds focused on coding and data structures knowledge.... I cleared the 1st round but got rejected after I was not able to answer one c question on data structures.
Interview questions [1]
Question 1
Brief introduction, projects, job experience, trainings,5 easy codes in python
I applied through college or university. The process took 4 days. I interviewed at Oracle (Bengaluru) in Aug 2020
Interview
I applied through my college training and placements cell. The process was as follows:
Online test followed by two rounds of technical interviews then final hr round.
The environment or the interview was very friendly.
I was testing for the case if the tree contains only one node i.e root before creating queue. So the interviewer asked me about the effect of this extra if statement on the over all performance and asked me for the justification of the my decision and then amortized analysis ot time complexity.
In HR round i was asked to introduce myself. Then he asked some questions related to my resume. Then he asked me what i have done one thing in my life for which I feel most proud. Then he asked me some computer network questions.
I applied through college or university. The process took 1 day. I interviewed at Oracle in Sep 2020
Interview
1. Online round : 90 minutes test in 4 sections.
*Quantitative Aptitude, English & Vocabulary, Data Interpretation, Technical (C/C++, Java, Data Structures, Algorithm, OS, DBMS, Networking)
Questions required focus and speed.
2. Technical round I : Java basics, DBMS basics, Project
3. Technical round II : Project, 1 Problem solving, 2 Puzzles
4. Technical round III + HR : Project brief, Software development process, System design basics on how to handle large amounts of requests. HR questions - Strength,Weaknesses, Team player, etc.
Interview questions [2]
Question 1
Q1 > Implement binary search tree in language you are comfortable in.
Q2 > Given two sorted arrays A and B, a pair is defined as ( a, b ), where a belongs to A and b belongs to B. Find the pair with K th largest sum ( a+b ).