Oracle | Associate SDE (6M Internship + Full time) | Bangalore/Hyderabad/NCR | Sep 2024 [Selected]
Online Assessment
Questions:
- 1 DSA question: Given an array of numbers, we can swap any number of adjacent element pairs. But each element can be swapped only once. Maximize sum of
i*arr[i]. Solved this with 1D DP. - 20 Technical MCQs from core subjects, data structures, and output prediction.
- 15 Aptitude + Communication MCQs.
Candidate's Approach
The candidate utilized a 1D dynamic programming approach to solve the DSA question, focusing on maximizing the sum of the product of indices and values in the array.
Interviewer's Feedback
No feedback provided.
Technical Round 1
Questions:
- Sort an array of 0s and 1s.
- Find the nth node from the end of a singly linked list.
- Given a node of a singly linked list, insert a node before it.
- Given a singly linked list, remove all duplicates.
- Puzzle question: Two trains moving towards one another at some speeds and at start are at some distance away. A light beam of given speed bouncing between them. Total distance travelled by beam before trains collide.
- Multiple OOPs questions related to the behavior when initializing a child class with a parent class reference.
Candidate's Approach
- For sorting the array of 0s and 1s, the candidate used a two-pointer approach, achieving O(n) time and O(1) space complexity.
- The nth node from the end was found using a two-pointer technique, also O(n) time and O(1) space.
- For inserting a node before a given node, the candidate added a node after and swapped values, maintaining O(1) time and space complexity.
- To remove duplicates from a singly linked list, a hashset was utilized, resulting in O(n) time and O(n) space complexity.
- The puzzle was solved using concepts of relative motion.
- The candidate answered multiple OOPs questions regarding class initialization.
Interviewer's Feedback
No feedback provided.
Technical Round 2
Questions:
- Clarifying questions about all parts of the resume with some HR-type questions.
- What data structures do I know with real-life examples and usage?
- Write code for finding the shortest path between A and B in an undirected unweighted graph.
- What would I do if the graph was weighted and to give the total number of shortest paths?
- How to implement multi-language support on a web app?
- Provide a flowchart and explain one of my projects.
Candidate's Approach
- The candidate discussed various data structures and provided a BFS solution for finding the shortest path, achieving O(n) time and O(n) space complexity.
- For weighted graphs, the candidate explained the Dijkstra approach, achieving O(n log n) time and O(n) space complexity.
- The candidate also discussed multi-language support and provided a flowchart for a project.
Interviewer's Feedback
No feedback provided.
Technical Round 3
Questions:
- Technical discussion related to the resume.
- What is CI/CD and how does it help?
- How to test APIs?
- How to accommodate accessibility on a web app, and how to test it?
- How to track and improve the performance of a web app?
- What is lazy loading and how is it implemented?
- How to test the responsiveness of a web app?
- Difference between OpenVPN and WireGuard.
Candidate's Approach
The candidate answered all questions related to CI/CD, API testing, web accessibility, performance tracking, lazy loading, and responsiveness. They also discussed their project involving OpenVPN and WireGuard, explaining the differences and advantages of each.
Interviewer's Feedback
No feedback provided.
HR Round
Questions:
- Basic questions like would I be open for relocating, plans for further studies, etc.
- No "HR type" questions.
Candidate's Approach
The candidate answered basic HR questions regarding relocation and future studies.
Interviewer's Feedback
No feedback provided.