RxLogix Corporation Oracle Database Administrator Interview Questions and Answers

Normal 3 leetcode medium questions

Machine coding round to design tail -f

Q1. Questions on internal working of os
Add your answer
Q2. Questions on projects
Add your answer

MCQ based Questions from topics of DSA , web development

Q1. Asked us to live code tail -f unix command
Add your answer

Machine coding round

Q1. TCP/IP related questions, what happens when you search a webpage?
Add your answer
Q2. Past projects discussions
Add your answer

Q1. Behavioural questions on how would you tackle a particular scenario
Add your answer

Round duration - 140 minutes
Round difficulty - Medium

Test timing was at 2:00 pm , it was conducted in a college and the environment was good for the test. Camera was a primary part of test, so no suspicious activity.

Q1. 
Sum of Two Numbers Represented as Arrays
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...read more
Ans. 
Given two numbers represented as arrays, calculate their sum and return the result as an array.
• Iterate through the arrays from right to left, adding digits and carrying over if necessary

• Handle cases where one array is longer than the other by considering the remaining digits

• Ensure the final sum array does not have any leading zeros
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

The round was conducted at around 12 p.m. I was called at the college location and then it was conducted. The interviewer was quite polite and frank.

Round duration - 8 minutes
Round difficulty - Easy

This round was conducted right after finishing and clearing the technical round at the same place and on the same day.

Round duration - 180 minutes
Round difficulty - Easy

It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an array of integers from 0 to (N-2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number with a frequency greater than 1 as the duplicate number.

• Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
Answered by AI
Add your answer
Q2. 
Reverse String Operations Problem Statement
You are provided with a string S and an array of integers A of size M. Your task is to perform M operations on the string as specified by the indices in array A...read more
Ans. 
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
• Iterate through the array of indices and reverse the substrings accordingly

• Ensure the range specified by each index is non-empty

• Return the final string after all operations are completed
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.