Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Oracle Team. If you also belong to the team, you can get access from here

Oracle Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Oracle SDE Interview Questions and Answers

Updated 5 Mar 2024

Oracle SDE Interview Experiences

4 interviews found

SDE Interview Questions & Answers

user image Anonymous

posted on 5 Mar 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Feb 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Leetcode- Climb stairs (medium)
  • Q2. Reverse linkedlist
Round 2 - Technical 

(1 Question)

  • Q1. Leetcode- Rotten oranges matrix

SDE Interview Questions & Answers

user image kilari harshavardhan

posted on 13 Oct 2023

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Assignment 

Basic dp and graph questions

Round 2 - Technical 

(2 Questions)

  • Q1. Left leaf nodes sum in a binary tree
  • Ans. 

    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

  • Answered by AI
  • Q2. About my past projects
Round 3 - HR 

(1 Question)

  • Q1. Discussion about myself and my projects

Interview Preparation Tips

Interview preparation tips for other job seekers - keep grinding on dsa and dbms to crack it.

Skills evaluated in this interview

SDE Interview Questions Asked at Other Companies

asked in Infosys
Q1. Return Subsets Sum to K Problem Statement Given an integer array ... read more
asked in Nagarro
Q2. Partition to K Equal Sum Subsets Problem Given an array of intege ... read more
asked in Nagarro
Q3. Sort a "K" Sorted Doubly Linked List Given a doubly-linked list w ... read more
asked in Nagarro
Q4. Maximum Meetings Selection You are tasked with scheduling meeting ... read more
asked in Amazon
Q5. There is a 12 km road and a contractor who is in-charge of repair ... read more

SDE Interview Questions & Answers

user image Anonymous

posted on 29 Dec 2022

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Nov 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

General questions like reasoning and maths

Round 3 - Coding Test 

General DSA questions were asked like Linked list etc

Interview Preparation Tips

Interview preparation tips for other job seekers - Dont panic and give yr best to achieve a goal in your life

SDE Interview Questions & Answers

user image Anonymous

posted on 22 Oct 2023

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Aptitude and technical questions

Round 3 - Coding Test 

2 coding questions with choice of language

Round 4 - Technical 

(2 Questions)

  • Q1. Technical questions
  • Q2. Programming questions

Oracle interview questions for designations

 SDE (Software Development Engineer)

 (3)

 Applications Engineer

 (21)

 Consultant

 (11)

 Business Analyst

 (7)

 Intern

 (6)

 Senior Application Engineer

 (6)

 Senior Analyst

 (5)

 Analyst

 (5)

Interview questions from similar companies

SDE Interview Questions & Answers

Adobe user image Anonymous

posted on 5 Jun 2015

Interview Questionnaire 

18 Questions

  • Q1. Detail questions on copy constructors were asked
  • Q2. Deep copy, shallow copy (need for explicitly writing copy constructor)
  • Q3. Operating system concepts such as memory Management and semaphores, critical section
  • Q4. Overloading, Overriding(Function and operator both)
  • Q5. Virtual Functions
  • Q6. Resume based interview
  • Q7. Some more discussions on virtual classes and functions, overloading, overriding, copy constructors
  • Q8. Puzzles such as no of 0s in 100!, and water- jug problem
  • Q9. Merge two double linked list. What will be the difference if they are singly linked list
  • Ans. 

    To merge two double linked lists, traverse to the end of the first list and connect it to the head of the second list.

    • Traverse to the end of the first list

    • Connect the last node of the first list to the head of the second list

    • If the lists are singly linked, we need to traverse to the end of the first list and connect it to the head of the second list. But we also need to keep track of the last node of the first list to ...

  • Answered by AI
  • Q10. Make a data structure such that it can store an image dynamically
  • Ans. 

    A dynamic data structure for storing images as arrays of strings.

    • Use a 2D array of strings to represent the image pixels.

    • Implement resizing methods to adjust the size of the image.

    • Include methods for adding, removing, and modifying pixels.

    • Consider using compression techniques to reduce memory usage.

    • Support various image formats such as JPEG, PNG, and BMP.

  • Answered by AI
  • Q11. Copy fixed no of bytes from source to destination and its test cases( ex: copy(source, destination,bytes) so now command copy(a,a+3,8) will not give correct results in some cases and copy(a,a-4,8) will n...
  • Ans. 

    Copying fixed number of bytes from source to destination and its test cases.

    • Ensure source and destination are not overlapping

    • Check if the number of bytes to be copied is greater than the available space in the destination

    • Handle cases where source or destination is NULL

    • Test cases should cover all possible scenarios including edge cases

  • Answered by AI
  • Q12. Some puzzles like weighing problem..N Balls given all of same weight except one..What is the max value of N so that u can figure out the ball with less weight in 2 rounds or 3 rounds
  • Q13. Some HR questions about family and yourself
  • Q14. Detail discussion on virtual functions
  • Q15. Optimized fibonacci program
  • Ans. 

    An optimized Fibonacci program computes Fibonacci numbers efficiently.

    • Use memoization to store previously computed values.

    • Use iterative approach instead of recursive approach.

    • Use bitwise operators to perform arithmetic operations faster.

    • Use matrix exponentiation to compute Fibonacci numbers in logarithmic time.

  • Answered by AI
  • Q16. Solution for solving problems generated by virtual functions
  • Ans. 

    Virtual functions can cause problems due to their dynamic nature, but can be solved using various techniques.

    • Use pure virtual functions to ensure all derived classes implement the function

    • Use interface classes to define a common interface for all derived classes

    • Use smart pointers to manage memory and avoid memory leaks

    • Use virtual destructors to ensure proper destruction of objects

    • Avoid excessive use of virtual function

  • Answered by AI
  • Q17. Some good questions on compile time error check, link time error check and run time error check
  • Q18. One Image puzzle

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

6 Questions

  • Q1. Find a equilibrium index in array
  • Ans. 

    Find an index in array where sum of elements on left side is equal to sum of elements on right side.

    • Loop through array and calculate sum of all elements

    • Then loop through array again and check if sum of elements on left side is equal to sum of elements on right side

    • Return the index if found, else return -1

  • Answered by AI
  • Q2. Find the minimum no of jumps required to reach the end of array.where element at each index represent how many max moves you will take in right
  • Ans. 

    Find minimum number of jumps required to reach end of array with max moves in right direction at each index.

    • Use dynamic programming approach to solve the problem

    • Maintain an array to store minimum number of jumps required to reach each index

    • Traverse the array and update the minimum number of jumps for each index

    • Return the minimum number of jumps required to reach the end of array

  • Answered by AI
  • Q3. Tournament tree puzzle and write code for that
  • Ans. 

    Tournament tree is a binary tree where each node represents a match between two players/teams.

    • Tournament tree is used in sports tournaments to determine the winner.

    • The leaf nodes represent the players/teams and the internal nodes represent the matches.

    • The winner of each match is the node with the higher score.

    • Code can be written using a recursive function to traverse the tree and determine the winner.

  • Answered by AI
  • Q4. Find the 2 maximum elements in array in O(n+log(n)) comparison
  • Ans. 

    Find 2 maximum elements in array in O(n+log(n)) comparison

    • Use divide and conquer approach

    • Divide array into two halves

    • Recursively find max elements in each half

    • Compare the two max elements to find the overall max elements

  • Answered by AI
  • Q5. Celebrity Problem puzzle and write code for that
  • Q6. Given a 2D array of 0 and 1. where each row is sorted. find the row with maximum no of 1 in minimum time complexcity
  • Ans. 

    Find row with maximum 1s in a sorted 2D array of 0s and 1s.

    • Use binary search to find the first occurrence of 1 in each row.

    • Calculate the number of 1s in each row using the index found in step 1.

    • Keep track of the row with maximum number of 1s.

    • Time complexity: O(m log n), where m is the number of rows and n is the number of columns.

  • Answered by AI

Interview Preparation Tips

College Name: IIT GANDHINAGAR

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
  • Ans. 

    Efficiently check if a number is present in an array where each element differs by 1.

    • Use binary search to find the element in the array

    • Calculate the difference between the middle element and the first element

    • If the difference is equal to the index of the middle element minus the index of the first element, then the left half of the array is consecutive

    • If the difference is not equal, then the right half of the array is ...

  • Answered by AI
  • Q2. Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5
  • Ans. 

    Microsoft Excel

    • Add more chart types (p1)

    • Improve collaboration features (p2)

    • Enhance data analysis tools (p3)

    • Integrate with more external data sources (p4)

    • Improve error handling and debugging (p5)

  • Answered by AI
  • Q3. A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square
  • Ans. 

    Program to rearrange shuffled 16 squares to get original big square

    • Create a 4x4 matrix to represent the big square and fill it with shuffled squares

    • Loop through the matrix and check if each square is in the correct position

    • If a square is not in the correct position, swap it with the square in the correct position

    • Repeat until all squares are in the correct position

  • Answered by AI
  • Q4. There are 9 identical Marbels out of which 1 is heavy. find out that Marbel
  • Q5. Given 3 sorted arrays, array a, b, c. find all pairs where a[i] + b[j] = c[k] note : a, b , c are sorted arrays
  • Q6. What is the difference between the two declarations? int p=*(int*)i; int p=*(int*)&i;
  • Ans. 

    The first declaration casts i to int pointer and dereferences it, while the second declaration casts the address of i to int pointer and dereferences it.

    • The first declaration assumes i is already an int pointer.

    • The second declaration takes the address of i and casts it to an int pointer.

    • The first declaration may cause a segmentation fault if i is not an int pointer.

    • The second declaration may cause unexpected behavior i...

  • Answered by AI
  • Q7. Given an unsorted array of size 5. How many minimum comparisons are needed to find the median? then he extended it for size n
  • Ans. 

    Minimum comparisons needed to find median in unsorted array of size n

    • For odd n, median is the middle element. For even n, median is the average of middle two elements

    • Minimum comparisons needed for odd n is (n-1)/2. For even n, it is n/2

    • Various sorting algorithms can be used to find median in an unsorted array

  • Answered by AI
  • Q8. Given an array which is alternatively sorted. What will be the time complexity to find out an element in it. e.g. 14,3,16,6,22,7,24,11,27
  • Ans. 

    Time complexity to find an element in an alternatively sorted array.

    • The time complexity will be O(log n) using binary search.

    • Check the middle element and compare with the target element.

    • If the middle element is greater than the target, search in the left half of the array.

    • If the middle element is smaller than the target, search in the right half of the array.

    • Repeat until the target element is found or the array is exha

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: #Given an array A[n] such that A[i+1] = A[i]+1 OR A[i]-1, and a number k, find out whether k is present in A[n] or not, in most efficient way?
#Name any 1 microsoft product that you have been using and suggest 5 improvements in it alongwith priority assignments p1....p5.
#A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.
#There are 9 identical Marbels out of which 1 is heavy. find out that Marbel.
#given 3 sorted arrays, array a, b, c.
find all pairs where a[i] + b[j] = c[k]
note : a, b , c are sorted arrays.
#What is the difference between the two declarations?
int p=*(int*)i;
int p=*(int*)&i;
#Given an unsorted array of size 5.
How many minimum comparisons are needed to find the median? then he extended it for size n.
#Given an array which is alternatively sorted. What will be the time complexity to find out an element in it.
e.g. 14,3,16,6,22,7,24,11,27

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 24 May 2015

Interview Questionnaire 

5 Questions

  • Q1. What happens when we type amazon.com ?
  • Ans. 

    Typing amazon.com in the browser's address bar takes you to Amazon's website.

    • The browser sends a request to the DNS server to resolve the domain name 'amazon.com' to an IP address.

    • The browser establishes a TCP connection with the server at the resolved IP address.

    • The browser sends an HTTP request to the server for the homepage of Amazon's website.

    • The server responds with the HTML code for the homepage, which the browse

  • Answered by AI
  • Q2. Describe transaction process in detail if we want to transfer from one account to other. Also design scheme for it
  • Ans. 

    The transaction process involves transferring funds from one account to another. A scheme is designed to ensure secure and accurate transfers.

    • Verify the availability of sufficient funds in the sender's account

    • Authenticate the sender's identity and authorization for the transaction

    • Deduct the transfer amount from the sender's account balance

    • Initiate a request to transfer the funds to the recipient's account

    • Validate the r...

  • Answered by AI
  • Q3. What happens on server side on receiving HTTP requests and how operating system interacts and then discussion related with threading, thread pool ,synchronization, hashing etc
  • Ans. 

    When a server receives an HTTP request, it interacts with the operating system, handles threading, thread pooling, synchronization, and hashing.

    • Upon receiving an HTTP request, the server creates a new thread to handle the request.

    • The operating system manages the allocation of system resources to the server process.

    • Thread pooling is used to efficiently manage and reuse threads for handling multiple requests.

    • Synchronizat...

  • Answered by AI
  • Q4. Describe ACID properties in detail
  • Ans. 

    ACID properties ensure reliability and consistency in database transactions.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that a transaction is treated as a single unit of work, either all or none of its operations are executed.

    • Consistency ensures that a transaction brings the database from one valid state to another.

    • Isolation ensures that concurrent transactions do not interfere w...

  • Answered by AI
  • Q5. How to find kth- smallest element in BST? -----/
  • Ans. 

    To find kth-smallest element in BST, perform inorder traversal and return the kth element.

    • Perform inorder traversal of the BST

    • Maintain a counter variable to keep track of the number of nodes visited

    • When the counter reaches k, return the current node's value

    • If k is greater than the number of nodes in the BST, return null or throw an exception

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Online Round: (Duration – 90 minutes)

20 MCQs and 2 coding questions. MCQs were on Algorithms, Time Complexity, Quantitative Aptitude, Probability, Operating Systems, Graphs, Data Structures, Recursion outputs etc.

Coding Questions:

1. In one of Amazon fulfillment centers, there are a no. of empty boxes kept in increasing order in a row. Kiva robots are designed to put a product in a box. The product size is given. Design a program to find the best fit box for given product size. First line contains no. of empty boxes and next line contains size of boxes with space. The next line contains size of given product. The output shows the best fit box size and -1 otherwise.For example, Input: 6

2 7 9 11 13 16

12

Output: 13 2. You have to find a string in two-dimensional array. The input contains 2-D array of characters and given string. You can move in one of eight directions . The output contains location of first letter of string if string found completely, otherwise return -1. Any one out of multiple answers is accepted, if possible.

For example, Input:

b t g

p a d

r k jString: rat

Output: (2,0)

Round: TECHNICAL INTERVIEW
Experience: Brief introduction about myself and my project.

1. Given an array of positive and negative integers, rearrange positive and negative numbers in 0(n) time .

First, I solved it using 2 arrays,each for positive and negative integers and place elements of array in these 2 arrays and them combine them back by taking one element from each array. Then he told me to do without extra space. I then segregated positive and negative elements using quicksort .Below is the link:

-----. Program to check whether strings are rotation of each other or not. I approached as below:

-----/

He then told to solve without using strstr. I used naive searching method.

Round: HR INTERVIEW
Experience: Brief introduction and some behavioral questions.

Given a BST and a key sum, design an algorithm to find all pairs of integers whose sum equal to key.

I first approached using an array and placing elements into it in inorder fashion and then find pairs. He told to do in-place and I solved with 2 traversals (inorder and reverse- inorder

Round: Technical Interview
Experience: Based on CS Fundamentals and also had 15 minutes discussion on my internship project.
Q.Given a Binary tree, full_path_sum is sum of all nodes from root to leaf in a path. Given a min_sum value, delete nodes if path has full_path_sum less than min_sum . Delete all such nodes . For example,Given min_sum =8 1
2 3
4 5 6 7

College Name: NA

Skills evaluated in this interview

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 25 May 2015

Interview Preparation Tips

Round: Test
Experience: Online Round :(Duration – 90 minutes)20 MCQs to solve and 2 coding questions. 20MCQs were on Algorithms,Data Structures, C Output, Quantitative Aptitude, etc.

Coding questions were of 10 marks each.

MCQ’s had negative marking.

Correct : +1

Wrong : -0.25Q1– Given an array of numbers, arrange them in an alternate fashion such that every number is followed by a number of opposite sign. Also the order was to be maintained. If the count of negative numbers is more keep the extra at last in array and same for positive numbers.Example :

Input: -3 -2 6 0 7 -1 -8

Output: -3 6 -2 0 -1 7 -8Q2– String of characters as arranged in a cellphone i.e.

1- NULL

2-a,b,c

3-d,e,f

4-g,h,i

.

.

.

9-w,x,y,z

0-NULLPrint all combinations for given number of digits(k) in lexicographical order .

Constraint : 1<=k<4

For Example : Input = 234

Output : adg adh adi aeg aeh aei afg afh afi bdg bdh bdi beg beh bei bfg bfh bfi cdg cdh cdi ceg che dei cfg cfh cfi

Round: TECHNICAL INTERVIEW
Experience: Q1– Design a shuffle function which would play songs randomly in your device (unique song_id) and code it.

After i gave him a solution with hash function , he asked me to improve the algorithm such that once a song is played it should be played only when all the other songs are played,

Solution’s Complexity : Space – O(n) , Time – O(1) ; n—> number of songs

After that he asked me to improve my solution and do it without using extra space.

Solution’s Complexity : Space – O(1) , Time – O(n) ; n—>number of songs

Hint : Maintain indices and once a song is played shift it in range of played songs index.

After that i was asked about each part of the hash function and how i came up with that.Q2– Add two linked lists. And code it.Input : 1->2->3->4->NULL

8->2->NULL

Output : 1->3->1->6->NULLFirst he asked to do it without recursion and then with recursion.We also talked about theproblem we face if we store the value of the linked list in an integer or long if the number of digits were above certain limits in the non-recursive function.

Round: TECHNICAL INTERVIEW
Experience: Q1 – Find the largest sub tree which is binary search tree in a given Binary Tree. Then to optimize it and then asked me to code it.
Q2 – Given a linked list with a next pointer and an arbitrary pointer pointing to any node in the list , copy the linked list.After i gave him a solution which changed the links of the initial linked list, he asked me to do without changing the links.So i gave him a O(n^2) solution . He asked me to give another way or optimize my solution.He helped me to figure out the solution.Hint – Hash map.The interviewers were really helping and supporting and were more interested in seeing the efforts you make and the way you get to the logic.They help throughout by giving hints.

College Name: NA

SDE Interview Questions & Answers

Amazon user image Anonymous

posted on 4 Jun 2015

Interview Questionnaire 

7 Questions

  • Q1. In a binary tree, a random pointer is given in each node. If this pointer pointing other than any successor of the node then set it as NULL. Otherwise let it remain untouched. Write code
  • Q2. You will be given the number of pairs of parenthesis. Find out the total possible valid unique combinations and there should not be any duplicity. Write code
  • Ans. 

    Find total possible valid unique combinations of given number of pairs of parenthesis without duplicity.

    • Use recursion to generate all possible combinations

    • Check for validity of each combination using a stack

    • Use a set to avoid duplicity

  • Answered by AI
  • Q3. Given an in-order traversal of a special binary tree having property that the node is always greater than its left and right child. Construct the tree and write code
  • Ans. 

    Construct a binary tree from in-order traversal with nodes greater than left and right child.

    • The root node will be the maximum value in the in-order traversal

    • Recursively construct the left and right subtrees using the left and right portions of the in-order traversal

    • Repeat until all nodes are added to the tree

  • Answered by AI
  • Q4. Find top 10 trending words inserted by users in sites like twitter. Only algorithm
  • Ans. 

    An algorithm to find top 10 trending words inserted by users in sites like Twitter.

    • Collect a large dataset of tweets

    • Tokenize the tweets into individual words

    • Remove stop words and punctuation

    • Count the frequency of each word

    • Sort the words by frequency in descending order

    • Select the top 10 words

  • Answered by AI
  • Q5. Write an efficient code to find the first occurrence of 1 in a sorted binary array
  • Ans. 

    Find the first occurrence of 1 in a sorted binary array.

    • Use binary search to find the first occurrence of 1.

    • If the mid element is 1, check if it's the first occurrence or if the element before it is 0.

    • If the mid element is 0, search in the right half of the array.

    • If the mid element is 1 and the element before it is also 1, search in the left half of the array.

  • Answered by AI
  • Q6. Remove duplicated from a string in O(n) without using hash
  • Ans. 

    Remove duplicates from a string in O(n) without using hash

    • Use an array of boolean values to keep track of characters already seen

    • Iterate through the string and mark characters as seen in the array

    • If a character has already been seen, remove it from the string

  • Answered by AI
  • Q7. Ind the first occurrence of 1 in a sorted infinite binary tree
  • Ans. 

    Find the first occurrence of 1 in a sorted infinite binary tree.

    • Use binary search to traverse the tree.

    • If the current node is 1, check if its left child is also 1. If yes, move to the left subtree, else return the current node.

    • If the current node is 0, move to the right subtree.

    • Repeat until the first occurrence of 1 is found or the tree is exhausted.

  • Answered by AI

Interview Preparation Tips

Round: Telephonic
Experience: Q1. For a given number, find the next greatest number which is just greater than previous one and made up of same digits.

Q2. Find immediate ancestor of a given Node

Q3. Clone the linked list having an extra random pointer in nodes which is pointing random node in the list.

Round: HR Interview
Experience: Amazon has many visitors to its site. And it tracks what pages the customers visited, etc and other stuff.Make an efficient data structure for storing 3 days of information of all those customers who have visited site exactly two different days and searched more than 3 unique pages of the site in those 2 days.So whoever visited site exactly two days out of these three days and visited more then 3 unique pages should be in the contact list.

College Name: NA

Skills evaluated in this interview

Oracle Interview FAQs

How many rounds are there in Oracle SDE interview?
Oracle interview process usually has 3-4 rounds. The most common rounds in the Oracle interview process are Technical, Resume Shortlist and Aptitude Test.
What are the top questions asked in Oracle SDE interview?

Some of the top questions asked at the Oracle SDE interview -

  1. left leaf nodes sum in a binary t...read more
  2. Leetcode- Rotten oranges mat...read more
  3. Leetcode- Climb stairs (medi...read more

Tell us how to improve this page.

Oracle SDE Interview Process

based on 4 interviews

1 Interview rounds

  • Resume Shortlist Round
View more

SDE Interview Questions from Similar Companies

Amazon SDE Interview Questions
4.1
 • 44 Interviews
Google SDE Interview Questions
4.4
 • 15 Interviews
TCS SDE Interview Questions
3.7
 • 12 Interviews
Accenture SDE Interview Questions
3.8
 • 10 Interviews
ION Group SDE Interview Questions
3.5
 • 4 Interviews
Amadeus SDE Interview Questions
3.9
 • 3 Interviews
IBM SDE Interview Questions
4.0
 • 2 Interviews
Adobe SDE Interview Questions
3.9
 • 2 Interviews
Amdocs SDE Interview Questions
3.7
 • 2 Interviews
View all
Oracle SDE Salary
based on 13 salaries
₹8.8 L/yr - ₹30.8 L/yr
At par with the average SDE Salary in India
View more details

Oracle SDE Reviews and Ratings

based on 2 reviews

2.3/5

Rating in categories

3.0

Skill development

3.0

Work-life balance

3.7

Salary

3.7

Job security

3.7

Company culture

3.7

Promotions

3.7

Work satisfaction

Explore 2 Reviews and Ratings
Senior Software Engineer
2.3k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Consultant
2.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Principal Consultant
2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Member of Technical Staff
1.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Application Engineer
1.4k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Oracle with

SAP

4.2
Compare

MongoDB

3.7
Compare

Salesforce

4.0
Compare

IBM

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview