Skip to content

Tag Archives: ABCO

This article will give you information about the company, their recruitment process, sample questions that have been asked previously, lots of experiences shared by other… Read More
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
Given an array arr[] of size N having distinct numbers sorted in increasing order and the array has been right rotated (i.e, the last element… 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 asked. 1.Design a… 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 the following posts as a prerequisite for this post.K’th Smallest/Largest Element in Unsorted Array K’th Smallest/Largest Element in Unsorted Array | Expected Linear… Read More
We recommend reading the following post as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1 Given an array and… Read More
Given an array and a number K where K is smaller than the size of the array. Find the K’th smallest element in the given… Read More
Given an array A[] of n numbers and another number x, the task is to check whether or not there exist two elements in A[]… Read More

Start Your Coding Journey Now!