Cabin4j interview experience Real time questions & tips from candidates to crack your interview

Web Developer

Cabin4j

2 rounds | 4 Coding problems

Vaibhav Kansal

Fresher | Apr 2021

Selected

Interview preparation journey

Preparation

Duration: 1 Month

Topics: DSA, HTML, CSS, JS, Operating System, DBMS

Tip

Tip 1 : You should have excellent problem solving skills.
Tip 2 : Code a lot.
Tip 3 : You should be thorough with your concepts of Data Structures and Algorithm.
Tip 4 : Know the complexities of the code that you’ve written.

Application process

Where: Campus

Eligibility: Above 8 CGPA

Resume tip

Tip 1 : Mention all your projects.
Tip 2 : Mention your experience and achievement in your resume.
Tip 3 : If you have a patent then it is plus point for you.
Tip 4 : Ensure proper spacing and font to maintain professionalism.

Interview rounds

Round

Medium

Online Coding Interview

Duration120

Interview date7 Apr 2021

Coding problem3

The test was in the morning from 10:00 to 12:00. It was a two-round test. There was a 45-minute MCQ-based Technical and Cognitive Assessment Round. Only those candidates who cleared this round could sit in the next round, a 45-minute coding test. There was a sectional cutoff that needed to be cleared in order to proceed to the coding round. The CoCubes test platform was fairly easy to understand and user-friendly.
The coding round was fairly simple. It had two very easy array-based questions.

1. Closest Leaf To Given Node In Binary Tree

Moderate

15m average time

85% success

0/80

Asked in companies

Ninja is stuck in a maze which is in a form of a binary tree. He needs your help in order to get out.

Ninja is presently at the node ‘X’. The only exit points of the maze are the leaf nodes of the tree. You need to tell him the distance to the nearest exit point from his current location. This will help him decide which path he should take in order to escape from the maze.

Example:

Suppose, Ninja is stuck at node 62. The possible exit points in the maze are: 40, 10, and 20. From all the possible exit points the closest ones are 10 and 20 which are at a distance of 1 unit.

Try solving now

2. Subarray With Given Sum

Moderate

15m average time

85% success

0/80

Asked in companies

Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.

Note:

If two or more such subarrays exist, return any subarray.

For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].

Try solving now

3. HTML and CSS questions

How do you enable Pagination using CSS3?

Problem approach

Tip 1:
Tip 2:
Tip 3:

Round

Medium

Online Coding Interview

Duration30

Interview date7 Apr 2021

Coding problem1

This was a HR interview. It was in the afternoon around 12 pm. As the role was Web Developer intern, the interviewer wanted to know whether or not I had built some projects related to this field. Most of the interview went by him asking questions based on my projects. First I was asked to explain about a project then a lot of follow-up questions were asked.