i
HDFC Bank
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Curd operation with SQL connectivity
I was interviewed before Mar 2016.
posted on 31 Oct 2022
I applied via Company Website and was interviewed before Oct 2021. There were 2 interview rounds.
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
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...
posted on 19 Apr 2020
I applied via Company Website and was interviewed in Oct 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2022. There were 2 interview rounds.
posted on 10 Jul 2024
LRU cache design involves maintaining a cache with limited capacity and removing the least recently used item when the cache is full.
Use a doubly linked list to maintain the order of items based on their usage.
Implement a hash map for fast access to items in the cache.
When a new item is accessed, move it to the front of the linked list to mark it as the most recently used.
When the cache is full, remove the item at the ...
Joins, Jobs, stored procedures,cursors.
posted on 16 Oct 2024
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
1)Buy and sell stock
2)2 sum
3) system design
4) Elastic search
5) deployment
I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 3 interview rounds.
Basic data structure related coding questions like creating a linked list and adding items to it median.
Max heap implementation.
Concurrency related questions.
Simple algorithm question about sorting
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.
based on 1 interview
Interview experience
based on 21 reviews
Rating in categories
Deputy Manager
15.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
10.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
9.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Manager
6.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
6.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
ICICI Bank
State Bank of India
Axis Bank
Kotak Mahindra Bank