i
Oracle
Filter interviews by
I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.
Basic dp and graph questions
Calculate the sum of all left leaf nodes in a binary tree.
Traverse the binary tree using depth-first search (DFS)
Check if a node is a leaf node and if it is a left child
Add the value of the left leaf node to the sum
Recursively traverse the left and right subtrees
I applied via LinkedIn and was interviewed in Nov 2022. There were 3 interview rounds.
General questions like reasoning and maths
General DSA questions were asked like Linked list etc
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
Aptitude and technical questions
2 coding questions with choice of language
Oracle interview questions for designations
Top trending discussions
posted on 12 Nov 2024
I applied via Approached by Company and was interviewed in May 2024. There was 1 interview round.
To make an array of strings unique, count the number of duplicate elements and increment them accordingly.
Iterate through the array and keep track of the frequency of each element.
For each duplicate element, increment it to make the array unique.
Return the total number of increment operations needed.
Sum all numbers formed from root to leaf paths in a binary tree
Traverse the tree from root to leaf nodes, keeping track of the current number formed
Add the current number to the sum when reaching a leaf node
Recursively explore left and right subtrees
It consisted of both technical programming and theoretical concepts. C++ and SQL
Sorting algorithms differ in their approach to sorting elements in an array.
Bubble Sort - compares adjacent elements and swaps them if they are in the wrong order
Merge Sort - divides the array into two halves, sorts them, and then merges them
Quick Sort - picks a pivot element and partitions the array around the pivot
Selection Sort - repeatedly selects the minimum element and swaps it with the current element
Insertion S...
DSA,COMPUTER FUNDAMENTALS
Tree traversals are methods used to visit each node in a tree data structure in a specific order.
Inorder traversal: Visit left subtree, then root, then right subtree
Preorder traversal: Visit root, then left subtree, then right subtree
Postorder traversal: Visit left subtree, then right subtree, then root
posted on 19 Sep 2022
Go through the basics of all the topics the electronics part of the exam will be tough
I applied via Job Portal and was interviewed before Apr 2023. There were 3 interview rounds.
Puzzle based questions and Math problems
Given a laptop and problem statement. Had to solve problems at eclipse.
based on 2 reviews
Rating in categories
Senior Software Engineer
2.3k
salaries
| ₹10 L/yr - ₹40 L/yr |
Senior Consultant
2.1k
salaries
| ₹9 L/yr - ₹24.4 L/yr |
Principal Consultant
2k
salaries
| ₹10.9 L/yr - ₹36 L/yr |
Senior Member of Technical Staff
1.8k
salaries
| ₹12 L/yr - ₹45 L/yr |
Senior Application Engineer
1.4k
salaries
| ₹9.4 L/yr - ₹29 L/yr |
SAP
MongoDB
Salesforce
IBM