AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Oracle
Compare
Filter interviews by
Oracle Member Technical Staff Interview Questions and Answers for Experienced
Oracle Member Technical Staff Interview Experiences for Experienced
6 interviews found
Sayan Mahanti
(2 Questions)
- Q1. Question 1(Medium)
- Q2. Question 2(medium)
DSA, java, previous projects
Anonymous
I appeared for an interview in Sep 2024, where I was asked the following questions.
- Q1. Encoding strings gfg
- Ans.
Encoding strings involves converting data into a specific format for efficient storage or transmission.
Encoding types: UTF-8, ASCII, Base64.
Example: UTF-8 can represent any character in the Unicode standard.
Base64 is often used for encoding binary data in text formats.
ASCII is limited to 128 characters, suitable for basic English text.
- Q2. Merge two sorted linked lists - gfg
- Ans.
Merge two sorted linked lists into a single sorted linked list.
Create a dummy node to simplify merging.
Use two pointers to traverse both lists.
Compare values of nodes from both lists.
Append the smaller node to the merged list.
Continue until one list is exhausted, then append the remainder of the other list.
Example: List1: 1 -> 3 -> 5, List2: 2 -> 4 -> 6 results in: 1 -> 2 -> 3 -> 4 -> 5 -> 6.
Selected
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
On Hackerrank - 3 coding questions for 2 hours.
(2 Questions)
- Q1. Technical Question on DSA and Previous Projects.
- Q2. Sliding Window, String Matching, DP
(1 Question)
- Q1. Behavioral Questions
I applied via LinkedIn and was interviewed before Jun 2021. There were 4 interview rounds.
(2 Questions)
- Q1. Basics of java programming
- Q2. Xpath and css for web elements
- Ans.
Xpath and CSS are used to locate web elements on a webpage.
Xpath is a language used to navigate through the XML structure of a webpage.
CSS selectors are used to target specific HTML elements on a webpage.
Xpath can be used to locate elements based on their attributes, text content, or position on the page.
CSS selectors can be used to locate elements based on their tag name, class, ID, or attributes.
Both Xpath and CSS ca...
(2 Questions)
- Q1. A bit more deep dive into oops and threading concepts
- Q2. About selenium framework
(2 Questions)
- Q1. About manaul testing process
- Ans.
Manual testing involves executing test cases without automation to identify defects in software applications.
Understand requirements: Review specifications to create test cases.
Test case design: Write detailed test cases covering all scenarios.
Test execution: Manually execute test cases and document results.
Defect reporting: Log any defects found with detailed information.
Regression testing: Re-test after fixes to ensu...
- Q2. Scrnario based questions
Interview Preparation Tips
- Java OOPS
- Selenium
- BDD
- Robot Framework
- Git
- Jenkins
Skills evaluated in this interview
What people are saying about Oracle
Monideepa Das
I applied via Campus Placement and was interviewed before Aug 2021. There were 4 interview rounds.
Maths,reasoning and Java questions
1. Program on lift technology
(1 Question)
- Q1. C program on pallindrome. A riddle. There is 8 matchbox and 7 matchbox are of equal weight and one is having less weight. Find the matchbox with less weight.
(2 Questions)
- Q1. Give your introduction.
- Q2. What is your hobby? Any question you would like to ask?
- Ans. Always ask about the type of projects company deals with. Or about the work culture.
Interview Preparation Tips
Somesh Gupta
I appeared for an interview before Sep 2016.
Interview Questionnaire
3 Questions
- Q1. Tell us about your projects
- Ans.
I have worked on various projects involving software development, data analysis, and machine learning.
Developed a web application for tracking personal fitness goals using React and Node.js
Implemented a machine learning model to predict customer churn for a telecom company
Analyzed data from a clinical trial to identify patterns in patient outcomes
- Q2. Discussed the approach for the questions solved in the problem statement
- Q3. You are given a list of n numbers. How would you find the median in this stream. You are given an array. Give an algorithm to randomly shuffle it.
- Ans.
Algorithm to find median in a stream of n numbers
Sort the list and find the middle element for odd n
For even n, find the average of middle two elements
Use a min-heap and max-heap to maintain the smaller and larger half of the stream respectively
Insert new elements into the appropriate heap and balance the heaps to ensure median is always at the top
Interview Preparation Tips
Experience: They came to recruit on campus in NIT Trichy. They had come for 4 profiles - Application Development, Server Technologies, MySQL and SUN microsystems
Tips: It's mostly about CGPA and your profile. Most of the people about CGPA of 7.00 we're shortlisted
Round: Problem Statement
Experience: 1) Reversing a linked list
2) K closest stars
3) Find the range of indices of occurrence of a duplicated number in a sorted array.
Tips: Easy questions. Do geeksforgeeks and leetcode and should be a breeze.
Round: Technical Interview
Experience: Explained in details about my projects and the reasoning behind the approaches followed.
Tips: Try to thoroughly know about your projects and the different approaches you took and then this round should be easy.
The interviewer does a lot of cross questioning so you should really know the project inside out.
Round: Technical Interview
Experience: Details discussion about the approach and the different ways of optimizing the space and time complexities.
Tips: It's a discussion where they are trying to gauge your ability to think through a problem and be able to discuss the complexities and why did you prefer your solution.
Round: Technical Interview
Experience: A median is the n/2th number in case n is odd or the average of (n/2 and (n+1)/2 ) numbers when n is even. So,for the first question I used two heaps. One minheap and one maxheap. The minheap is used to store the larger set of numbers and the max heap is used to store the smaller set of numbers. We try to maintain an even sized heaps. And then try to get the top of the max heap if n is odd, otherwise the average of the minheap and maxheap in case n is even. Had to code in C++.
Fisher-yates shuffle algorithm. Had to code in C++.
Tips: Standard Geeksforgeeks questions.
Skills: C++, MARKETING APTITUDE, SQL, Algorithmic Approach To Problem Solving, Data Structures
Skills evaluated in this interview
Interview questions from similar companies
R.Kaushik
Interview Preparation Tips
Skills:
College Name: NIT Surathkal
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
This was an online Coding+MCQ round. Both the coding questions were related to DP and were of Medium to Hard Difficulty.The MCQ's were of easy-medium level but one has to be fast in order to complete the section in the given time frame.
- Q1.
Maximum Sum Problem Statement
You are given an array
ARRof N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio... - Ans.
Given an array, select elements to maximize sum by removing adjacent elements.
Iterate through the array and keep track of the count of each element.
Select the element with the highest count first, then remove adjacent elements.
Repeat the process until the array is empty and sum the selected elements.
- Q2.
Longest Common Prime Subsequence Problem Statement
Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...
- Ans.
Find the length of the longest common prime subsequence between two arrays of integers.
Iterate through both arrays to find prime numbers
Use a set to keep track of common prime numbers
Return the size of the set as the length of the longest common prime subsequence
(4 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.
- Q1.
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...
- Ans.
Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
- Q2.
Stack using Two Queues Problem Statement
Develop a Stack Data Structure to store integer values using two Queues internally.
Your stack implementation should provide these public functions:
Explanation:
... - Ans.
Implement a stack using two queues to store integer values with specified functions.
Create a stack class with two queue data members.
Implement push(data), pop(), top(), size(), and isEmpty() functions.
Use one queue for pushing elements and another for temporary storage during operations.
Ensure proper handling of edge cases such as empty stack.
Example: If input is Q = 5, 1 42, 2, 3, 1 17, the output should be 42, -1, 17...
- Q3. What are Vtable and VPTR in C++?
- Ans.
Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.
Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch in C++ for virtual functions.
VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object, allowing dynamic binding of virtual functions at runtime.
Vtable is created for each class that has virtual functions, containing pointers t...
- Q4. What are friend functions in C++?
- Ans.
Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.
Friend functions are declared inside a class with the keyword 'friend'.
They can access private and protected members of the class.
They are not member functions of the class, but have the same access rights as member functions.
Example: friend void displayDetails(Student);
(4 Questions)
Round duration - 60 minutes
Round difficulty - Medium
This round had 3 preety good questions related to DSA and some questions revolving around Memory Management and Operating Systems.
- Q1.
Predecessor and Successor in Binary Search Tree (BST)
Given a binary search tree (BST) with 'N' nodes, find the predecessor and successor of a given 'KEY' node in the BST.
Explanation:
The predecessor o...
- Ans.
Find predecessor and successor of a given node in a binary search tree (BST).
Predecessor is the node visited just before the given node in an inorder traversal.
Successor is the node visited immediately after the given node in an inorder traversal.
Return -1 if predecessor or successor does not exist.
Implement inorder traversal to find predecessor and successor.
- Q2.
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...
- Ans.
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
Use dynamic programming to solve the problem efficiently.
The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.
Handle base cases for N=0 and N=1 separately.
Apply modulo operation to avoid overflow while calculating the result.
Consider using me...
- Q3.
Good Arrays Problem Statement
You are given an array 'A' of length 'N'. You must choose an element from any index in this array and delete it. After deleting the element, you will obtain a new array of le...
- Ans.
Given an array, find the number of 'good' arrays that can be formed by deleting one element.
Iterate through each element in the array and check if deleting it results in a 'good' array
Keep track of the sum of elements at odd and even indices to determine if the array is 'good'
Return the count of 'good' arrays
- Q4. What is memory protection in operating systems?
- Ans.
Memory protection in operating systems prevents one process from accessing or modifying the memory of another process.
Memory protection ensures that each process has its own isolated memory space.
It prevents unauthorized access to memory locations, improving system stability and security.
Operating systems use techniques like virtual memory and access control lists to enforce memory protection.
Examples include segmentat...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Questionnaire
15 Questions
- Q1. How to find a loop in a Linked List and how to remove it
- Ans.
To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.
Use two pointers, slow and fast, to detect if there is a loop in the Linked List
If the two pointers meet at some point, there is a loop
To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again
The meeting point is the start of the loop, set the next poi...
- Q2. Suppose there is an unsorted array. What will be the maximum window size, such that when u sort that window size, the whole array becomes sorted. Eg, 1 2 6 5 4 3 7 . Ans: 4 (6 5 4 3)
- Ans.
Find the maximum window size to sort an unsorted array.
Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end
Find the minimum and maximum element in the identified subarrays
Expand the identified subarrays until all elements in the array are covered
The length of the expanded subarray is the maximum window size
- Q3. How to find longest last occurring word in a sentence with multiple whitespace
- Ans.
Finding the longest last occurring word in a sentence with multiple whitespace.
Split the sentence into words using whitespace as delimiter
Reverse the list of words
Iterate through the list and find the first occurrence of each word
Calculate the length of each last occurring word
Return the longest last occurring word
- Q4. What is merge sort and Quick sort. Adv and Disadv of each and which one would u use to sort huge list and Y
- Ans.
Merge sort and Quick sort are sorting algorithms used to sort arrays of data.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.
Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.
Merge sort has a tim...
- Q5. Define Process &thread
- Ans.
Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.
A process is a program in execution
A process can have multiple threads
Threads share the same memory space as the process
Threads can run concurrently with other threads within the same process
Examples of processes include web browsers, word processors, and media players
Examples of threads include GUI th...
- Q6. What happens when an recursive function is called
- Ans.
A recursive function calls itself until a base case is reached, then returns the result to the previous call.
Each call creates a new instance of the function on the call stack
The function continues to call itself until a base case is reached
Once the base case is reached, the function returns the result to the previous call
The previous call then continues executing from where it left off
- Q7. Solve and code the problem of a ball falling from staircase. Each jump can be of 1 step or 2. Find the number of combination of reaching step N
- Ans.
Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.
Use dynamic programming to solve the problem
Create an array to store the number of ways to reach each step
Initialize the array with base cases for steps 0, 1, and 2
Use a loop to fill in the array for steps 3 to N
The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2
Retu...
- Q8. Puzzle: There is a grid of soldier standing. Soldier ‘A’ is chosen: The tallest men from every column and the shortest among them. Soldier ‘B’ is chosen: The shortest men from every row and the tallest amo...
- Q9. What’s priority queue. How will u make stack and queue with priority queue
- Ans.
Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.
Priority queue is implemented using a heap data structure.
Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.
Queue can be implemented using a priority queue by assigning higher priority to the oldest element.
- Q10. Implement stack using queue
- Ans.
Implementing stack using queue involves using two queues to simulate stack behavior.
Create two queues, q1 and q2.
Push operation: Enqueue the element to q1.
Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.
Swap the names of q1 and q2 after each pop operation.
Top operation: Return the last element of q1 without dequeuing it.
isEmpty operation: Check if both q1 a...
- Q11. About myself
- Q12. About my family. I mentioned my dad is my idol, so he asked y. M I more like my dad or my mom.
- Q13. My toughest moment in life and how I overcame it
- Ans.
I lost my job during the pandemic and struggled to find a new one
Applied to multiple job openings daily
Networked with former colleagues and industry professionals
Took online courses to improve skills
Maintained a positive attitude and stayed motivated
Eventually landed a new job in a different industry
- Q14. What had I been if I hadn’t been an engg
- Ans.
I would have pursued a career in music or writing.
I have always had a passion for music and writing.
I have played multiple instruments since childhood.
I have written and published short stories and poetry.
I believe creativity is an important aspect of any profession.
- Q15. What do I value most in life. (A real life example)
- Ans.
I value my relationships with loved ones the most.
Spending quality time with family and friends
Making an effort to stay in touch with long-distance loved ones
Prioritizing important events and milestones in their lives
Being there for them during difficult times
Forgiving and working through conflicts to maintain strong bonds
Interview Preparation Tips
Experience: He went
through my CV and asked me something about making an android app. (Note: I had
mentioned Android a couple of times in CV) I explained him how a basic app is
made with model (XML) and layout (Java). He told me about connector which
connects model to layout. Then he asked the two questions. For second ques, I gave a N square approach (dynamic).
He suggested a greedy approach of Order N. It was fitting most cases so I wrote
the code on greedy approach. Turned out, greedy wasn’t the solution anyway.
Doesn’t matter. (Note: Boss is always right!!!)
Round: Technical Interview
Experience: He went
through my CV and asked me about my dropped grades in 12th.In third question, interesting part was, he said me to answer only if I knew it. I replied that I know but the definition isn’t totally memorized and he said to let it go then. (PS: Learn basic defs)
Tips: Ans to 5) is Fibonacci and 6) is A is taller than B
Round: Technical Interview
Experience: He
went through my CV and asked my if I had done Intern in Amazon or Training.
Followed by, he asked me why I didn’t get a PPO there. He then asked me, which
subject I m more confident with: Algo types or OS types. I chose algo.
Tips: Keep your cool and code with confidence. Reason I am saying this is because, he was the senior most interviewer and somehow, he knew the art to stress test you.
Round: HR Interview
Experience: 1)
Be honest
2)
Sit with open palms
3)
Don’t cross your hands or legs(if legs can be
visible)
4)
Keep some back stories ready. Use any names, use your friends story anything to make it real. It will go a long way because nobody is
going to verify it.
5)
Most imp, Be confident about yourself. If you r not
sure of yourself, you would be useless to the company.
General Tips: Code Daily. Practise. Basics are important in such interviews.
Skill Tips: Do refer the previous question sets. It gives you pretty good idea of what's expected of you.
Skills: Algorithm, Puzzle solving, Technical Knowledge, Soft Skills, Data structures
College Name: IIT DHANBAD
Funny Moments: When in first round, I knew greedy approach isn't right, But I went on with it, because I could hear my dad whispering in my ears from behind, Rule 1: Boss is always Right
Rule 2: In case of doubt, refer Rule 1...
Skills evaluated in this interview
I appeared for an interview before Mar 2021.
(1 Question)
- Q1. 1 hour- basic question about DB, SQL, Cloud.
(1 Question)
- Q1. Case study on Data migration process and tools. 4- 5 question on solution
(1 Question)
- Q1. Trchnical question basics and advance both.
(1 Question)
- Q1. Scenario based questions on situation. Mostly problem solving skill.
Interview Preparation Tips
Go throug Microsoft documentaion at least basics and intermediate level.
Oracle Interview FAQs
The duration of Oracle Member Technical Staff interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
Oracle Interviews By Designations
- Oracle Software Developer Interview Questions
- Oracle Application Developer Interview Questions
- Oracle Software Engineer Interview Questions
- Oracle Senior Software Engineer Interview Questions
- Oracle Member Technical Staff Interview Questions
- Oracle Applications Engineer Interview Questions
- Oracle Senior Consultant Interview Questions
- Oracle Associate Consultant Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Member of Technical Staff Interview Questions
- Member Technical Interview Questions
- Senior Member Technical Interview Questions
- Team Member Interview Questions
- Associate Member Technical Staff Interview Questions
- Senior Team Member Interview Questions
- Member Technical Staff 1 Interview Questions
- Technical Staff Member Lead Interview Questions
- Show more
Overall Interview Experience Rating
based on 3 interview experiences
Difficulty level
Duration
Top Skills for Oracle Member Technical Staff
Member Technical Staff Interview Questions from Similar Companies
Oracle Member Technical Staff Reviews and Ratings
based on 123 reviews
Rating in categories
|
Senior Software Engineer
2.7k
salaries
|  ₹12 L/yr - ₹42 L/yr |
|
Principal Consultant
2.2k
salaries
| ₹10.9 L/yr - ₹38 L/yr |
|
Senior Consultant
2.2k
salaries
| ₹9.1 L/yr - ₹28.1 L/yr |
|
Senior Member of Technical Staff
1.9k
salaries
| ₹13.5 L/yr - ₹47 L/yr |
|
Software Engineer
1.5k
salaries
| ₹7.5 L/yr - ₹28 L/yr |
SAP
MongoDB
Salesforce
IBM
- Home >
- Interviews >
- Oracle Interview Questions >
- Oracle Member Technical Staff Interview Questions for Experienced
