## ABCO – Advisory Board Company (Acquired by OPTUM) Interview Experience

The eligibility criteria was 7.5+ CGPA with no standing arrears . Around 200 were eligible . Round 1: The first round was hosted in Hackerrank… Read More »

- Given an array A[] and a number x, check for pair in A[] with sum as x
- K'th Smallest/Largest Element in Unsorted Array | Set 1
- K'th Smallest/Largest Element in Unsorted Array | Set 2 (Expected Linear Time)
- K'th Smallest/Largest Element in Unsorted Array | Set 3 (Worst Case Linear Time)
- Find the Rotation Count in Rotated Sorted array
- ABCO - Advisory Board Company (Acquired by OPTUM) Interview Experience
- Abco Advisory Board Company | Set 1 (Internship + Full time Employee)
- ABCO Interview Experience | Set 4
- Abco Advisory Board Company | Set 3 (On-Campus Intern + FTE)
- ABCO Interview Experience | Set 5

The eligibility criteria was 7.5+ CGPA with no standing arrears . Around 200 were eligible . Round 1: The first round was hosted in Hackerrank… Read More »

Round 1 15 Technical Aptitude (predominantly DS), 3 Queries, 2 Coding Question hosted in HackerRank Round 2 (F2F Technical Interview) Find the number of rotations… Read More »

1st Round: Consisted of 20 questions out of which 15 were MCQ and 3 were DBMS queries and 2 were programming questions. Out of 260… Read More »

Consider an array of distinct numbers sorted in increasing order. The array has been rotated (clockwise) k number of times. Given such an array, find… Read More »

1st round:- first round consisted of 20 MCQ questions,2 coding and 5 DBMS query questions. 2nd round:- This was a written coding round.2 questions were… Read More »

Round 1: Technical aptitude 20 questions + 2 coding questions + 5 dbms queries Round 2: Technical interview Given a mxn matrix with elements sorted… Read More »

Started with 2 simple data structure programs and 30 aptitude questions; luckily cleared this round and qualified for the in-person interview. I was asked only data… Read More »

We recommend reading following posts as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1 K’th Smallest/Largest Element in Unsorted… Read More »

We recommend reading following post as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1 Given an array and a… Read More »

Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the… Read More »

Write a program that, given an array A[] of n numbers and another number x, determines whether or not there exist two elements in S… Read More »