IDFC FIRST BANK | Online Assessment | On campus

Posted
18 Jul 2026
121 reads

Summary

I completed the IDFC First Bank online assessment, which consisted of aptitude MCQs, technical MCQs, and two coding problems.

How it went

Question pattern

SectionQuestionsDuration
Aptitude15 MCQs20 minutes
Technical Questions25 MCQs25 minutes
Coding Problems2 Problems45 minutes
Total42 Questions90 minutes

Aptitude

  • Mostly based on logical thinking and puzzle-solving.
  • Traditional aptitude topics such as Percentages, Ratios & Proportions, Time & Work, Profit & Loss, etc., were not included.
  • The section primarily tested your ability to think quickly and accurately under time constraints rather than formula-based calculations.

Technical Questions

  • The questions were not very straightforward and required a good understanding of core Computer Science concepts.
  • Having knowledge of Computer Networks (especially protocols like Stop-and-Wait ARQ), OOP concepts, DBMS, and Operating Systems was helpful.
  • A few questions involved debugging code snippets, so being able to quickly identify logical or syntax errors was important.
  • Overall, the section was moderately difficult and quite manageable if you have a solid grasp of the fundamentals.

Coding Questions

1. Minimum Cake Cuts

Given two integers N (number of cakes) and M (number of people), determine the minimum number of cuts required so that each person receives an equal share of the cake.

Example:

Input:
N = 2
M = 6

Output:
4

Explanation:

  • First cake -> cut into 3 equal pieces (2 cuts).
  • Second cake -> cut into 3 equal pieces (2 cuts).
  • Total cuts = 4.

Constraints:

1 <= N, M <= 1000

2. Smallest Concatenated Adjacent Number

Given an array of positive integers, concatenate every pair of adjacent elements and return the smallest concatenated number. If the array size is odd, consider the last element as a single number.

Example:

Input:
[15, 24, 34, 10, 12, 21, 45, 67]

Output:
1221

Explanation:

Concatenated pairs:
15 + 24 = 1524
34 + 10 = 3410
12 + 21 = 1221
45 + 67 = 4567

Smallest = 1221

Constraints:

1 <= arr.size() <= 100000
1 <= arr[i] <= 10000

Disclaimer: AI was used only to enhance the readability, grammar, and formatting of this post. The content and assessment experience described here are based on my personal recollection.

Questions asked (2)

  1. 01

    Minimum Cake Cuts

    Data Structures & Algorithms

    Given two integers N (number of cakes) and M (number of people), determine the minimum number of cuts required so that each person receives an equal share of the cake.

    Example:

    Input:
    N = 2
    M = 6
    
    Output:
    4
    

    Explanation:

    • First cake -> cut into 3 equal pieces (2 cuts).
    • Second cake -> cut into 3 equal pieces (2 cuts).
    • Total cuts = 4.

    Constraints:

    1 <= N, M <= 1000
    
  2. 02

    Smallest Concatenated Adjacent Number

    Data Structures & Algorithms

    Given an array of positive integers, concatenate every pair of adjacent elements and return the smallest concatenated number. If the array size is odd, consider the last element as a single number.

    Example:

    Input:
    [15, 24, 34, 10, 12, 21, 45, 67]
    
    Output:
    1221
    

    Explanation:

    Concatenated pairs:
    15 + 24 = 1524
    34 + 10 = 3410
    12 + 21 = 1221
    45 + 67 = 4567
    
    Smallest = 1221
    

    Constraints:

    1 <= arr.size() <= 100000
    1 <= arr[i] <= 10000
    

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Idfc First Bank recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!