## Treasure and Cities

Given n cities: x1, x2, …… xn: each associated with T[i] (treasure) and C[i] (color). You can choose to visit a city or skip it.… Read More »

- Merge Sort
- Largest Sum Contiguous Subarray
- Binary Search
- HeapSort
- Detect Cycle in a Directed Graph
- KMP Algorithm for Pattern Searching
- AVL Tree | Set 1 (Insertion)
- Stock Buy Sell to Maximize Profit
- Queue using Stacks
- Check for balanced parentheses in an expression
- Detect and Remove Loop in a Linked List
- Print a given matrix in spiral form
- Detect cycle in an undirected graph
- Find minimum number of coins that make a given value
- Diameter of a Binary Tree
- Implement Stack using Queues
- Median in a stream of integers (running integers)
- Merge two sorted linked lists
- Remove duplicates from a sorted linked list
- Sort elements by frequency | Set 1
- Sudoku | Backtracking-7
- Connect nodes at same level
- Median of Stream of Running Integers using STL
- Queue | Set 2 (Linked List Implementation)
- Expression Evaluation
- Naive algorithm for Pattern Searching
- AVL Tree | Set 2 (Deletion)
- Root to leaf path sum equal to a given number
- Search in a row wise and column wise sorted matrix
- Diameter of a Binary Tree in O(n) [A new method]

Given n cities: x1, x2, …… xn: each associated with T[i] (treasure) and C[i] (color). You can choose to visit a city or skip it.… Read More »

A cricket player has to score N runs, with condition he can take either 1 or 2 runs only and consecutive runs should not be… Read More »

Given a mobile number and some conditions for a fancy number, find if the given number is fancy. A 10 digit mobile number is called… Read More »

Given an array of N elements. The task is to print the array elements in such a way that first two elements are in increasing… Read More »

There were 4 Rounds: ROUND 1 – ONLINE TEST ->Online test consisted of 2 major sections Aptitude and Technical ->Aptitude had 3 sections Quantitative, Verbal… Read More »

It was an on- campus placement drive at my college, consisted of a written test followed by two technical and final HR round. Round 1:… Read More »

The shortlisting for rounds are done by an online test held for approximately 2.5 hrs with 90 questions(MCQ). There are 4 sections, first one has… Read More »

https://www.geeksforgeeks.org/oracle-interview-experience-on-campus-for-ofss Round 1 was similar to above link. 36 students were shortlisted for next round. Round 2(F2F)(Technical Round-1)(30-35min) : The interviewer was very friendly.He took… Read More »

Interviewed in 2018. Online Test (Test Duration was 100 minutes): Aptitude Verbal Coding Skills Question: Output Questions in C, C++, and Java. Computer Science Knowledge:… Read More »

Oracle visited in our campus for recruiting Associate Application Developer, for Oracle’s part OFSS. There were 4 rounds for whole process Online Test Technical Round-1… Read More »

About the company Oracle a multinational computer technology specializes primarily in developing and marketing database software and technology, cloud engineered system. The company also build… Read More »

(Aug, 2018): Insight: It was on-campus, students from ME and BE computer science were only eligible. The cgpa cut off was 8.5, but later they… Read More »

I got invitation through naukri.com Round 1 It was pen paper round.Interviewer was sitting beside me. After basic introduction, he asked me what project I… Read More »

Round 1: It was an online test consisting of MCQ’s for 107 mins on Oracle platform. There were questions belonging to different sections in this… Read More »

Round 1: It was an online test consisting of MCQ’s for 1 hr 45 mins in Oracle platform There were around 4 sections each of… Read More »