RECENT INTERVIEW QUESTIONS

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,
11
Jun
Printed a sorted multi-level linked list

Given a linked list, where each node has a pointer to the head of its child list (in addition to the next pointer). The child list is a normal linked list with each node having one data and one pointer to the next node in the child list. Let the lists be arranged (as above) […]

Posted in: Algorithms,
Tags: Linked List,
11
Jun
Traverse and print a linked list in forward and backward order

Given a linked list, write code to print the list in forward and backward order. Solution: This problem is discussed as an example in this post. A linked list is a data structure where address of next node is stored inside each node. Structure of Node Structure of Node of a list is as given […]

Posted in: Algorithms,
Tags: Linked List,
28
May
Find numbers with more than k-bits in their binary representations

Given an array of unsigned integers, print all the numbers that have more than k bits set in their binary representation. For example, if k = 2, and input array is: int arr[] = {2, 1, 15, 9, 7, 14, 32, 127}; Then the output should be: 15 7 14 127 Because all of these […]

Posted in: Algorithms,
Tags: Array, Bit twidling,
28
May
Remove all white spaces from a string

Given a string that may have white spaces, write code to remove all white spaces from than string. For example: Input String: “IT IS HOT OUTSIDE” Output String: “ITISHOTOUTSIDE” Input String: ” I T I S HOT ” Output String: “ITISHOT”

Posted in: Algorithms,
Tags: Sliding Window, String,
19
May
Difference between nodes of alternate vertical levels in a tree

The question below is given in the format in which questions are asked on coding interview Platforms like HackerRank, CodeChef, CodeJam, etc. PROBLEM STATEMENT Vertical level of a node is the vertical distance of that node from the root. Vertical level of the root node is 0. If a node is at vertical level k, […]

Posted in: Algorithms,
Tags: Binary Tree, HackerRank, Online Coding,

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