i
Oracle
Filter interviews by
I appeared for an interview in Oct 2020.
Round duration - 107 minutes
Round difficulty - Medium
The test was active on (Oct 1, 2020) from 7:00 PM to 09:00 PM. The duration of the test is 107 minutes.
The candidate should have completed the test by 9:45 PM.
The camera and microphone was on all the time. There was time alotted for each section. After completing one section you cannot switch to the previous section. If you go off the camera you will get a warning.
The test contained several sections and all questions were MCQs. The sections were Coding ability, Computer Science theory, Advanced data structures like AVL Tree, Verbal and Quantitative ability, etc
Given an array or list PREORDER
representing the preorder traversal of a Binary Search Tree (BST) with N
nodes, construct the BST which matches the given preord...
Given a preorder traversal of a BST, construct the BST and print its inorder traversal.
Parse the input to get the number of test cases and preorder traversal for each case
Construct the BST using the preorder traversal by recursively building the tree
Print the inorder traversal of the constructed BST for each test case
Round duration - 30 minutes
Round difficulty - Medium
The Round started at 10:15 am and ended at 10:45 am approx. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer both camera and microphone was on. The interviewer was really supportive and hepled me in thinking different approches of a problem.
Determine if a given string of integers bin
represents a valid binary number. Return 'true'
if the string represents a valid binary number, otherwise return 'false'
. A binary n...
Check if a given string represents a valid binary number composed of 0s and 1s.
Iterate through each character in the string and check if it is either '0' or '1'.
If any character is not '0' or '1', return 'false'.
Return 'true' if all characters are '0' or '1'.
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
The task is to rearrange an array such that no two adjacent elements are the same.
Iterate through the array and check if any adjacent elements are the same.
If adjacent elements are the same, swap one of them with a different element.
Return 'YES' if a valid rearrangement is possible, 'NO' otherwise.
You are provided with a positive integer N
. Your task is to identify all numbers such that the sum of the number and its digits equals N
.
N = 21
Given a string STR
containing characters from [a-z], [A-Z], [0-9], and special characters, determine the reverse of the string.
The input starts with a single i...
The result of adding two binary numbers in a 64-bit and a 32-bit operating system will differ due to the different number of bits used for calculations.
In a 64-bit operating system, the result will be more accurate and can handle larger numbers compared to a 32-bit system.
Overflow may occur in a 32-bit system when adding large binary numbers, leading to incorrect results.
Example: Adding 1111 (15 in decimal) and 1111 (1...
Round duration - 30 minutes
Round difficulty - Medium
It took place at 11:30am(approx) and last for about 30 minutes
We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.
Round duration - 30 minutes
Round difficulty - Easy
It took place around 1:30pm and last for 30 minutes. We waited in breakout room in zoom and when the interviewer was free we entered in the zoom call with the interviewer. Both camera and microphone was on.
Tip 1 : Make your basics strong don't run after new technologies as a fresher companies wants your good command on DSA
Tip 2 : Focus more on competitive programming to get into a good organization don't indulge to much in development because the first step to reach to the interview round is to clear the coding round
Tip 3 : Do at least 2-3 Questions per day and practice daily
Tip 4 : Also practice basic aptitude questions
Tip 1 : Don't mention things in the resume that you don't have full command on you should have complete knowledge of what you mention in your resume
Tip 2 : Make your resume short and if you mention projects in your resume be clear about the details of the project even if you have done that in group because the interviewer will surely ask from it.
I applied via LinkedIn and was interviewed in Jan 2021. There were 3 interview rounds.
I appeared for an interview before Sep 2020.
Round duration - 140 minutes
Round difficulty - Hard
2 Separate online rounds were hosted on HackerRank . Online Aptitude Round consisted of 45 questions. Online Coding Round consisted of 3 questions.
You are given an array ARR
of 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...
The task is to maximize the sum of selected elements from an array by following specific rules.
Select elements strategically to maximize the sum
Remove occurrences of selected element, and its neighbors
Repeat the process until the array becomes empty
You are given an array/list 'NUM' of integers. Rearrange the elements of 'NUM' such that no two adjacent elements are the same in the rearranged array.
Round duration - 40 minutes
Round difficulty - Hard
The interview started of with questions about the online test, general questions on “tell me about yourself”
Then he asked me a relative velocity problem from physics section to warm things up.
It was Followed by discussion on topics taught in college, Questions on OS and DBMS.
Given the number of stairs, initially at the 0th stair, you need to reach the Nth stair. Each time, you can either climb one step or two steps. Determine the number of distinct way...
Calculate the number of distinct ways to climb N stairs by either taking one or two steps at a time.
Use dynamic programming to keep track of the number of ways to reach each stair
The number of ways to reach a stair is the sum of the number of ways to reach the previous two stairs
Return the result modulo 10^9+7
Given a binary tree of integers, return its level order traversal.
The first line contains an integer 'T' which represents the number of test cases. For each ...
Level Order Traversal of Binary Tree returns nodes in level order traversal.
Perform a level order traversal of the binary tree starting from the root node.
Visit nodes level by level, printing them in the order they are encountered.
Use a queue data structure to keep track of nodes at each level.
Round duration - 50 minutes
Round difficulty - Easy
The interviewer asked about my project – the idea of the project, the challenges I faced etc. She also asked some OS concepts like CPU scheduling, multi-queue scheduling, mutex, deadlocks.
Given a binary tree, your task is to print the left view of the tree.
The input will be in level order form, with node values separated by a...
Given a binary tree, your task is to print the Top View of the Binary Tree. The Top View is the set of nodes visible when the tree is viewed from the top. Please ...
The task is to print the Top View of a Binary Tree, which is the set of nodes visible when viewed from the top, in left to right order.
Traverse the binary tree in level order and maintain a map to store the horizontal distance of each node from the root.
For each node, if the horizontal distance is not already in the map, add the node's value to the result.
Print the values from the map in ascending order of horizontal d...
Design a system to store incoming characters in sorted manner and answer queries about character presence.
Use a data structure like a balanced binary search tree to store characters in sorted order.
Implement functions to insert characters into the tree and check for character presence.
Optimize search queries by using binary search or tree traversal techniques.
Consider edge cases like duplicate characters and handling s...
Tip 1 : Be solid with the basics of Ds, Algo. Good to have end to end projects which are hosted on cloud.
Tip 2 : Its always good to be presentable and have good communications skills
Tip 3 : Be honest, clear in approach and always walkthrough your thought process to the interviewer
Tip 1 : Mention your projects and experience at the top. Be clear on what was done, a brief on how it was done, language /tech stack involved. If possible try to host and make it accessible. You never know if you can present it with just one click.
Tip 2 : Choose a balance between, white spaces and text, it should be well indented, no grammatical errors.
Tip 3 : It takes less than 2 min to scan a resume. Don't mention things which are irrelevant.
I recently completed a project focused on developing a mobile app for tracking personal fitness goals and health metrics.
Conducted user research to identify key features, such as step tracking and calorie counting.
Collaborated with a team of developers to design an intuitive user interface.
Implemented a backend system for data storage and user authentication.
Launched a beta version and gathered user feedback for improv...
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 2 interview rounds.
1 hour 30 minutes, questions were based on coding, aptitude
I applied via Company Website and was interviewed before Oct 2019. There were 4 interview rounds.
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...
Count the number of distinct islands in a 2D array of 0s and 1s.
Identify islands by performing depth-first search (DFS) on the grid
Use a set to store the shape of each island and check for duplicates
Consider translations to determine distinct islands
Round duration - 50 minutes
Round difficulty - Easy
This was a Data Structural round.
You are tasked with arranging 'N' words of varying lengths such that each line contains at most 'M' characters, with each word separated by a space. The challenge is to minimiz...
The goal is to minimize the total cost of arranging 'N' words on each line with a maximum character limit 'M'.
Calculate the cost of each line as the cube of extra space characters needed to reach 'M'.
Minimize the total cost by arranging words to fit within the character limit on each line.
Ensure each word appears fully on one line without breaking across lines.
Round duration - 60 minutes
Round difficulty - Easy
This was a System Design round.
Design a system similar to Red Bus for handling bookings and onboarding vendors and customers.
Implement a user-friendly interface for customers to search and book tickets
Create a vendor portal for vendors to manage their offerings and availability
Include payment gateway integration for secure transactions
Develop a robust backend system for managing bookings, cancellations, and refunds
Utilize a database to store user in...
Round duration - 50 minutes
Round difficulty - Easy
This was a System Design round
Round duration - 50 minutes
Round difficulty - Easy
This was an HR round.
Tip 1 : Practice as much as you can.
Tip 2 : Prepare for company, not in general.
Tip 3 : Your past work should be objective and your contribution should be very clear
Tip 1 : Keep only relevant things for the job you are applying.
Tip 2 : Minimal data with measurable contribution and effect.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
Creating test cases for random scenarios ensures software reliability and robustness through diverse input validation.
Identify edge cases: Test with minimum and maximum input values, e.g., an empty array vs. a large array.
Use random data: Generate random inputs to simulate real-world usage, e.g., random user names or passwords.
Test invalid inputs: Ensure the system handles unexpected inputs gracefully, e.g., negative n...
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
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.
based on 4 reviews
Rating in categories
Senior Software Engineer
2.5k
salaries
| ₹19.8 L/yr - ₹36 L/yr |
Principal Consultant
2.3k
salaries
| ₹20 L/yr - ₹34.4 L/yr |
Senior Consultant
2.2k
salaries
| ₹12.8 L/yr - ₹23.5 L/yr |
Senior Member of Technical Staff
1.9k
salaries
| ₹23.9 L/yr - ₹41 L/yr |
Software Developer
1.5k
salaries
| ₹15.4 L/yr - ₹28 L/yr |
SAP
MongoDB
Salesforce
IBM