Skip to content

Tag Archives: Oracle

I was referred by a friend and all the interviews are held at Oracle office, Hyderabad. None of the expenses would be reimbursed by Oracle.… Read More
1st there was a online assessment. Oracle finance and oracle server, both had almost the same paper..4 sections.. 1) eng 2) apti 3) basic technical… Read More
In the previous post, we introduced Queue and discussed array implementation. In this post, linked list implementation is discussed. The following two main operations must… Read More
Given a sorted array arr[] of n elements, write a function to search a given element x in arr[].A simple approach is to do a… Read More
Pattern: written + 3 Tech Interview + 1HR Type: Online cgpa criteria: NO Written exam Modules: 2hrs (no -ve marking) 1. Coding skills(comprehension oriented) 2.… Read More
My on campus interview experience of Oracle Server Technology. Online Round: At first we had an online exam for shortlisting for final interview process. This… Read More
Given an undirected graph, how to check if there is a cycle in the graph? Example,  Input: n = 4, e = 4 Output: Yes Explanation: 0 1, 1… Read More
Oracle Interview-Server Tech. ========== Round 1: ========== 1. Explain Tree traversals. Given a inorder and postorder construct a tree 2. What is fork? How many… Read More
  Evaluate an expression represented by a String. The expression can contain parentheses, you can assume parentheses are well-matched. For simplicity, you can assume only… Read More
Given an array of integers, sort the array according to frequency of elements. For example, if the input array is {2, 3, 2, 4, 5,… Read More
Given an integer, write a function that returns true if the given number is palindrome, else false. For example, 12321 is palindrome, but 1451 is… Read More
  The cost of a stock on each day is given in an array, find the max profit that you can make by buying and… Read More
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the minimum… Read More
Like QuickSort, Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and… Read More
Write code to convert a given number into words. For example, if “1234” is given as input, output should be “one thousand two hundred thirty… Read More

Start Your Coding Journey Now!