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

Software Engineer Trainee

IDFC Bank
upvote
share-icon
2 rounds | 14 Coding problems

Interview preparation journey

expand-icon
Journey
IDFC FIRST Bank provides comprehensive personal banking services tailored to your needs. It was a pool campus drive, in which various college students participated for the profile of Software Engineer Trainee. It conducted 2 rounds as a selection process: HackerEarth test and interview.
Application story
It was a pool campus drive, in which various college students participated for the profile of Software Engineer Trainee. It conducted 2 rounds as a selection process: HackerEarth test and interview.
Why selected/rejected for the role?
I was rejected for this role after the HackerEarth test as I could not answer all the questions due to a lack of knowledge. Also, it was a pool campus drive so the test standards were too high.
Preparation
Duration: 4 months
Topics: Data Structures, Operating System, Database, Coding Questions, Java/ Python
Tip
Tip

Tip 1: Read the data structures and operating system MCQs available on net
Tip 2: Prepare the coding questions 
Tip 3: Make strong projects

Application process
Where: Campus
Eligibility: 6+ CGPA
Resume Tip
Resume tip

Tip 1: Mention strong projects in your resume
Tip 2: Don't mention skills, you don't know, in your resume

Interview rounds

01
Round
Hard
Online Coding Interview
Duration180 mins
Interview date5 Apr 2022
Coding problem9

This test was conducted on the HackerEarth platform. For this test, we were given an entire day, and we can attempt that test anytime between those 24 hours. This test comprised MCQs as well as coding questions.

1. Puzzle

Two trains of equal lengths take 10 seconds and 15 seconds respectively to cross a telegraph post. If the length of each train is 120 meters, in what time (in seconds) will they cross each other traveling in opposite directions?

Problem approach

Tip 1: Read the aptitude MCQs available on net
Tip 2: Keep pen and paper by your side

2. Puzzle

What decimal of an hour is a second?

Problem approach

Tip 1: Read the aptitude MCQs available on net
Tip 2: Keep pen and paper by your side

3. Puzzle

A tank is filled by three pipes with uniform flow. The first two pipes operating simultaneously fill the tank in the same time during which the tank is filled by the third pipe alone. The second pipe fills the tank 5 hours faster than the first pipe and 4 hours slower than the third pipe. What is the time required by the first pipe?

Problem approach

Tip 1: Read the aptitude MCQs available on net
Tip 2: Keep pen and paper by your side

4. Puzzle

The banker's gain of a certain sum due 2 years hence at 10% per annum is Rs. 24. What is the present worth?

Problem approach

Tip 1: Read the aptitude MCQs available on net
Tip 2: Keep pen and paper by your side

5. OS Questions

Name the memory which allocates space for DOS and application?

Which mode loads minimal set of drivers when starting Windows?

What scheduling algorithm allows processes that are logical runnable to be temporarily suspended?

The operating system of a computer serves as a software interface between the user and?

Problem approach

Tip 1: Study the operating system MCQs available on net
Tip 2: Read the question carefully

6. Java Questions

What is the use of “this” keyword in Java?

Which of these keywords is used to define interfaces in Java?

Problem approach

Tip 1: Study data structures in detail
Tip 2: Read the question carefully

7. Guess Output

What will be the output of the following Java code snippet?

import java.util.*;
class Arraylists 
{
public static void main(String args[]) 
{
ArrayLists obj = new ArrayLists();
obj.add("A");
obj.add("B");
obj.add("C");
obj.add(1, "D");
System.out.println(obj);
}
}

Problem approach

Tip 1: Study data structures in detail
Tip 2: Read the question carefully

8. OOPs MCQ

Which one of the following is not an access modifier?

Problem approach

Tip 1: Study data structures in detail
Tip 2: Read the question carefully

9. Ninja And Flowers

Moderate
10m average time
90% success
0/80
Asked in companies
SamsungSigmoid

Ninja has ‘N’ gardens labeled from [1, N] under his supervision. He created an array that stores bidirectional paths between I1 and I2, where I1 and I2 are gardens stored at the position I in the array. In each garden, he wants to plant 4 types of flowers.

You need to choose a flower type for each garden such that any two gardens connected by a path, have different types of flowers.

Note:
1. All gardens have at most three paths coming into or leaving the garden. 
2. There can be more than one possible answer to this question. You need to print the smallest valid answer when all possible answers are sorted in lexicographical order.
Try solving now
02
Round
Hard
Video Call
Duration40 mins
Interview date27 Apr 2022
Coding problem5

This round was much more complex. It was a 40-minute interview based on data structures, operating systems, and programming.

1. Data Structure Question

What is the difference between stack and heap? (Learn)

Problem approach

Tip 1: Study stack and heap in any programming language
Tip 2: Hear the question carefully

2. OOPs Question

Explain the concept of constructor overloading. (Learn)

Problem approach

Tip 1: Study constructors in any programming language
Tip 2: Hear the question carefully

3. OS Questions

What do you mean by RTOS? (Learn)

What is the difference between process and thread? (Learn)

Problem approach

Tip 1: Study RTOS in detail in the operating system
Tip 2: Hear the question carefully

4. DBMS Question

What is normalization? Explain types of normalization. (Learn)

Problem approach

Tip 1: Study database in detail
Tip 2: Hear the question carefully

5. 0 1 Knapsack

Moderate
0/80
Asked in companies
AmazonTwitterInnovaccer

A thief is robbing a store and can carry a maximum weight of ‘W’ into his knapsack. There are 'N' items available in the store and the weight and value of each item is known to the thief. Considering the constraints of the maximum weight that a knapsack can carry, you have to find the maximum profit that a thief can generate by stealing items.

Note: The thief is not allowed to break the items.

For example, N = 4, W = 10 and the weights and values of items are weights = [6, 1, 5, 3] and values = [3, 6, 1, 4]. Then the best way to fill the knapsack is to choose items with weight 6, 1 and 3. The total value of knapsack = 3 + 6 + 4 = 13.

Problem approach

Step 1: The maximum value obtained from ‘N’ items is the max of the following two values. 
Step 2: Maximum value obtained by N-1 items and W weight (excluding nth item)
Step 3: Value of nth item plus maximum value obtained by N-1 items and (W – weight of the Nth item) [including Nth item].
Step 4: If the weight of the ‘Nth‘ item is greater than ‘W’, then the Nth item cannot be included.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
961 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes