Kotak Mahindra Bank Software Development Engineer II 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

Behavioural and culture fit

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

Ms office,Core Java , Tally , C,

In my Opinion,view , If you ask me, As far as I can see/I am Concerned , It seems to me that , I think /feel/reckon/ belive , If you want my option , What we have to decide

Q1. Currant project compononts Dependancy injection,diffrence between temp table and temp variable, diffrent stored procedure,diffrent sql queries, small coding program
Add your answer

Q1. 1. Power BI, 2. SQL,
Add your answer
Q2. 3. Azure and 4. Excel.
Add your answer