HDFC Bank Software Engineer Interview Questions and Answers

HackerEarth / Hacker rank Test

Q1. Find the lowest cost when given days you want to use metro if you have cost of a day 1 ,7 and 30 day pass. DP Problem
Ans. 
Using dynamic programming to find the lowest cost for metro passes based on given days.
• Create an array to store the minimum cost for each day.

• Iterate through each day and calculate the minimum cost based on 1, 7, or 30 day pass.

• Update the minimum cost for each day using dynamic programming.

• Return the minimum cost for the total number of days needed.
Answered by AI
Add your answer

Q1. Normal HR Questions
Add your answer

Q1. System design , HLD, LLD , coding question
Add your answer

Q1. How to find out prime number
Ans. 
Prime numbers are numbers that are only divisible by 1 and themselves.
• Start by checking if the number is less than 2, as prime numbers start from 2.

• Iterate from 2 to the square root of the number and check if the number is divisible by any of these numbers.

• If the number is not divisible by any number in the range, then it is a prime number.
Answered by AI
Add your answer

Q1. Coding round java
Add your answer
Q2. Spring boot and devops activities
Add your answer

DSA , LLD on bar raiser

DSA, SQL and discussions around projects

Q1. Design a notification system
Ans. 
A notification system to alert users of important events or updates.
• Define types of notifications (e.g. email, SMS, push notifications)

• Implement a user preference setting for notification frequency

• Include a notification history for users to review past alerts
Answered by AI
Add your answer

Simple algorithm question about sorting

Q1. Algorith question about quick sort
Add your answer
Q2. Nlonn run time of the sort
Ans. 
The time complexity of the quicksort algorithm is O(n log n).
• Quicksort has an average time complexity of O(n log n).

• The best case time complexity of quicksort is O(n log n) when the pivot element divides the array into two equal halves.

• The worst case time complexity of quicksort is O(n^2) when the pivot element is the smallest or largest element in the array.
Answered by AI
Add your answer