Skip to content

Tag Archives: ABCO

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 HackerRankHey geek! It's time to become a success story instead of… 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 asked. 1.Design a… Read More
Round 1: Technical aptitude 20 questions + 2 coding questions + 5 dbms queriesHey geek! It's time to become a success story instead of reading… 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 Array |… Read More
We recommend reading the following post as a prerequisite of this post. K’th Smallest/Largest Element in Unsorted Array | Set 1Attention reader! Don’t stop learning… Read More
  Given an array and a number k where k is smaller than the size of the array, we need to find the k’th smallest… 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 A[]… Read More

Start Your Coding Journey Now!