Suryoday Small Finance Bank
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed before Dec 2023. There was 1 interview round.
Fragment life cycle includes various states like created, started, resumed, paused, stopped, and destroyed.
onAttach() - Fragment is associated with an activity
onCreate() - Fragment is being created
onCreateView() - Fragment creates its user interface
onStart() - Fragment is visible to the user
onResume() - Fragment is interacting with the user
onPause() - Fragment is partially visible but still running
onStop() - Fragment i...
Add adds a fragment on top of existing fragments, while replace replaces the existing fragment with a new one.
Add adds a fragment on top of existing fragments in the back stack
Replace removes the existing fragment and adds a new fragment in its place
Add does not remove the existing fragment from the view hierarchy, while replace does
Top trending discussions
I was interviewed before Mar 2016.
I applied via Naukri.com and was interviewed in Apr 2022. There were 2 interview rounds.
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.
posted on 16 Sep 2022
I applied via Campus Placement and was interviewed before Sep 2021. There were 2 interview rounds.
It had more than 30 aptitude questions and 2 coding 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.
Joins, Jobs, stored procedures,cursors.
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 ...
Topic wt is ms office
Eassys dscover the basic structure of all essaysand see what a goo d essay introduction and conclusion look like
I applied via Job Fair and was interviewed in Jun 2023. There were 3 interview rounds.
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
based on 1 interview
Interview experience
Assistant Manager
354
salaries
| ₹0 L/yr - ₹0 L/yr |
Relationship Officer
210
salaries
| ₹0 L/yr - ₹0 L/yr |
Branch Manager
182
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
142
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
116
salaries
| ₹0 L/yr - ₹0 L/yr |
Ujjivan Small Finance Bank
Equitas Small Finance Bank
AU Small Finance Bank
Bandhan Bank