Candidatei-me por meio de uma faculdade ou universidade. O processo levou 1 semana. Fui entrevistado pela Oracle (Hyderābād) em set. de 2025
Entrevista
Round 1 : aptitude+coding 2 questions
Round 2-Interview many focus on dsa ,may ask sysyetm desgin,puzzles
my friend was asked about lru cache,uber system desgin,overlapping array,puzzle of cutting rod,all who went for hr around are selected
Perguntas de entrevista [1]
Pergunta 1
Round 2: Technical
Binary tree maximum path sum
Least common ancestor
Process vs threads
What is garbage collector
2 Sum
Missing element in array
Stack vs queue
N floors K eggs recursion explanation
Explained project .
Round 3 : Technical
DSA question based on bit manipulation (not a standard question)
Process vs threads
Starvation
Ageing
This round went only 25 mins for me
Round 4 : Technical
Allocate memory for 10 integer dynamically
What is segmentation fault
Segmentation combined with Operating system questions
What is constructor, what happens to class variables when default constructor is revoked
Explain binary search and derive mathematical derivation of its time complexity
Explain binary search tree and all time complexities (best, average,worst)
About project
What is special in your project
or HR round
decent amount of DSA and System design were asked, and behavioral questions. so prepare leetcode level questions and good amount knowledge in sql, java and also mostly oracle sql. overall it was good
First online assessment. Then 2 interview rounds + 1 hr round. This was during campus placement. In interviews they mainly asked about dsa, os concepts, logical questions and some system design questions also.
Candidatei-me de outra forma. Fiz uma entrevista na empresa Oracle (Seattle, WA).
Entrevista
i got a return offer from internship, and I had to do one additional technical interview because I was switching branch. He first asked me a OOP question, and then leetcode medium level question.
Perguntas de entrevista [1]
Pergunta 1
What is BST? Write a function that verifies if it is a BST.
