Kotak Mahindra Bank Software Developer 1 Interview Questions and Answers

Q1. Design patterns that you have followed in your past projects.
Ans. 
I have followed the MVC, Singleton, and Factory design patterns in my past projects.
• MVC pattern for separating concerns and improving maintainability

• Singleton pattern for ensuring only one instance of a class is created

• Factory pattern for creating objects without exposing the instantiation logic
Answered by AI
View 1 more answer
Q2. How to secure the applications?
Ans. 
Applications can be secured by implementing various security measures such as authentication, authorization, encryption, and regular updates.
• Implement strong authentication mechanisms such as multi-factor authentication

• Use authorization to restrict access to sensitive data and functionalities

• Encrypt sensitive data both in transit and at rest

• Regularly update the application and its dependencies to patch security vulnera...read more
Answered by AI
View 1 more answer

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

Behavioural and culture fit

Joins, Jobs, stored procedures,cursors.

Q1. What is my package
Add your answer

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

Basic data structure related coding questions like creating a linked list and adding items to it median.
Max heap implementation.
Concurrency related questions.

Q1. Senior developer was taking the round, covering all design and architecture related questions. I was able to give a satisfactory solution.
Add your answer

Q1. Just some behavioural question along with a lil bit technical questions. Asked me about my current projects and problems faced, how i gave a proper solution and how i help my team to grow.
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