CIBIL Interview Questions and Answers

Q1. It was an MCQ Round and the questions were a mixture of CS fundamentals topics.
Add your answer

This round contained 2 coding questions.

Q1. This was a one on one coding round where I was asked 3 questions that were of Easy to Medium level of LeetCode.
Add your answer

Q1. HR round was more of a technical interview round where I was asked about my android projects and some core android topics since both me and my interviewer were Android Developers.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round was scheduled with the SDE-2, we started with the introduction than he jumped to the dsa questions. First question he asked me was leetcode 3 sum problem, we discussed the approach than I wrote the code for that problem. Second question was of arrays and maps I didn't remember the exact question but that was also some modified version of k sum subarray. Than he asked many questions related to oops, I answered most of them than he asked me for any qiuestions and we dropped the call.

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer
Q2. 
K Sum Subset Problem Statement
You are provided with an array arr of size N and an integer K. Your objective is to compute the maximum sum of a subset of the array such that this sum does not exceed K.
E...read more
Ans. Brute Force
In this approach, we will iterate over all the possible subsets of the given array, and then we will find the maximum sum subset whose sum is not greater than K.
The total number of subsets of an array is 2^N or 1 << N in the bitshift operator.
 
Algorithm:
• Set N as the size of the arr
• Iterate i from 0 to 1 << N
  • Set currSum as 0
  • Iterate j from 0 to N
    • If i AND (1 << j) is not 0
      • Add arr[j] to cu...read more
Answered Anonymously
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

This round was arranged with the Engineering Manager, we started with the introduction then he asked me to explain my project, I did that. After that he asked me one pattern question, I coded that than he asked me one more array question of finding mean, mode, median, I partially solved that question. Than he asked me for any questions and we dropped the call.

Q1. 
Diamond Pattern Grid Problem
Create a grid pattern of size R rows and C columns, where each cell contains a diamond-like shape of size S. The diamond shape is made with characters ‘/’ and ‘\’ for the bord...read more
Ans. Brute Force
Approach: Since each diamond’s size is (2 * s) * (2 * s). So the total size of the grid will be (2 * s * r) * (2 * s * c). So we will iterate in all the points on the grid and use some basic algebra(modular arithmetics) to find the diamond to which this point belongs. Then we can identify the type of location(i.e. either this point is a boundary or not) as we can divide the diamond into four equal parts(top-...read more
Answered Anonymously
Add your answer
Q2. 
Mean, Median, and Mode Problem Statement
Given an integer array ARR of size N, you need to compute the following three statistical measures:
1. Mean: Implement the function mean() to calculate the mean o...read more
Ans. 
I really didn't remember the eaxct approach that I used.
Answered Anonymously
Add your answer