fbpx

RECENT INTERVIEW QUESTIONS

14
Oct
1
Maximum consecutive integers present in an array

Given an array of integers. Find the maximum number of consecutive integers present in the array. For example, if the array is: int arr[] = { 2, 24, 22, 60, 56, 23, 25}; Then the answer should be 4, because there are 4 consecutive integers present in the array (22, 23, 24, 25).

Posted in: Algorithms,
Tags: Array, hashing,
14
Oct
Recursive Bubble Sort

Give the recursive implementation of the Bubble Sort algorithm

Posted in: Algorithms,
Tags: Array, Sorting,
13
Oct
String Matching Algorithms

Given a string of characters, search for a pattern (another smaller string) in the string. For example, if given string is Ritambhara Technologies for Coding Interviews and the pattern is Tech, then the pattern is present in the string. If the pattern that we are looking for is Moksha, then this pattern is not present […]

Posted in: Algorithms,
Tags: String, String Matching,
05
Sep
Add numbers given in the form of Linked List

Two numbers are given in the form of linked list (with each node storing one digit). Write an algorithm which will compute the sum of these two linked lists. The result should be a linked list as below:

Posted in: Algorithms,
Tags: Linked List,
04
Sep
Find Merge-Point of two Linked Lists

Given two linked lists that merge at some point as shown below: Last four nodes are common to both the lists. Given pointers to the header nodes of each list, find the first common node.

Posted in: Algorithms,
Tags: Linked List,
22
Jul
Find two elements in an array whose sum is x

Given an array of integers and a number x. check if there exists two elements in the array whose sum = x.

Posted in: Algorithms,
Tags: Array, Searching,
18
Jul
DATABASE FOR PLACEMENT PREPARATION. PART_2

This is the first videos in a series of videos meant for B.Tech students who want to prepare database for placement (either campus placement or off-campus). If you want to brush up your database concepts, you may like the video. B.Tech students from other streams (Electrical, Mech., Civil, etc.) who want to sit in the […]

Posted in: DBMS,
Tags: Database,
18
Jul
Database for placement preparation. Part_1

This is the first videos in a series of videos meant for B.Tech students who want to prepare database for placement (either campus placement or off-campus). If you want to brush up your database concepts, you may like the video. B.Tech students from other streams (Electrical, Mech., Civil, etc.) who want to sit in the […]

Posted in: DBMS,
Tags: Database,
15
Jun
Implementing Genric queue data structure in Java

Given the linked list implementation of a generic queue in Java.

Posted in: Algorithms,
Tags: Queue,
11
Jun
Search in a sorted multi-level linked list

Given a multi-level linked list as shown in this post. Write code to search in such a list.

Posted in: Algorithms,
Tags: Linked List,

COURSES OFFERED

Big-O

Online course covering everything needed to crack the interviews of companies like Google, Facebook, Microsoft, Amazon, etc.

  • Duration: 30 days
  • Mode: Online
  • Classes: Daily
  • Test: Daily

Campus Ladders

Prepare for best placements within the college. This works in partnership with the college, inside the campus

  1. Core Computer Science Concepts
  2. Advance Technology
  3. Logic, Aptitude, Puzzle Solving
  • Duration: 3 Months

2-days Workshop

This workshop is a quick brush up and last minute revision of all the things that each must be prepared with, starting from how to improve your resume to the strategy used to prepare and scope of each topic for written test and interviews.

  • Duration: 15 hrs

3 Months Class-room Coaching

This unique course help students ace in programming interviews of top tech companies by honing their problem-solving abilities.

We do not work just toward getting them placed. Our vision is to transform students into confident, informed and skilled professionals.

  • Duration: 3 Months

ADVANTAGE RITAMBHARA

BEST TEACHERS

We have best of trainers from across the world who are in decision making of top companies and passionate about technology.

GREAT CONTENT

Our content is created by subject experts from Industry.  They are ones who define the selection process of companies.

ABLE MENTORS

Approachable, empowering and genuine mentorship from top performers of industry to set your career on right track.

GET A SEMINAR IN YOUR COLLEGE FOR FREE

ATTEND OUR WEEKEND WORKSHOP ON CRACKING CODING INTERVIEWS