Filter interviews by
I was interviewed in Mar 2024.
Pattern question and .net basisc
I applied via Freshers world and was interviewed before Sep 2021. There were 2 interview rounds.
Reasoning, Quantitative aptitude,OOPS concepts, English
OOPS concepts of Java
Encapsulation - binding data and methods together
Inheritance - creating new classes from existing ones
Polymorphism - ability of objects to take many forms
Abstraction - hiding implementation details
Interfaces - defining a set of methods that a class must implement
Classes - blueprint for creating objects
posted on 1 May 2024
I applied via Campus Placement and was interviewed before May 2023. There were 5 interview rounds.
3 coding questions with 10 test cases each. For an hour.
I applied via Recruitment Consulltant and was interviewed before Jun 2023. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed in Feb 2022. There was 1 interview round.
posted on 7 Dec 2024
I applied via Approached by Company and was interviewed in Nov 2024. There were 3 interview rounds.
2 hard DSA questions
2 dsa questions were asked.
prefix search
binary tree camera
Parling lot low level design
Implement LRU cache
LRU stands for Least Recently Used
It is a cache eviction policy that removes the least recently used item
It can be implemented using a doubly linked list and a hash map
Newly accessed items are moved to the front of the list
When the cache is full, the item at the end of the list is removed
Virtual memory is a memory management technique that allows a computer to use more memory than it physically has.
Virtual memory uses a combination of RAM and hard disk space to store data.
It allows programs to use more memory than is physically available.
If a program tries to access memory that is not currently in RAM, it will be swapped in from the hard disk.
Even if we had infinite RAM, virtual memory would still be n...
Find maximum length of subarray where max <= 2*min.
Iterate through array and keep track of max and min values.
Update max length when condition is met.
Time complexity: O(n)
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions on DSA and OS.
Design and implement a data structure for a Least Recently Used (LRU) cache that supports the following operations:
get(key)
- Retrieve the value associated with the...Design and implement a Least Recently Used (LRU) cache data structure that supports get and put operations with a specified capacity.
Implement a doubly linked list to keep track of the order of keys based on their usage.
Use a hashmap to store key-value pairs for quick access and updates.
When a key is accessed or updated, move it to the front of the linked list to mark it as the most recently used.
When the cache reaches...
Given an array of non-negative integers and an integer K representing the length of a subarray, your task is to determine the maximum elements for each subarray of size ...
Find the maximum elements for each subarray of size K in a given array.
Iterate through the array and maintain a deque to store the indices of elements in decreasing order.
Pop elements from the deque that are out of the current window.
Keep track of the maximum element in each subarray of size K.
Return the maximum elements for each subarray.
Virtual memory is a memory management technique that allows a computer to compensate for physical memory shortages by temporarily transferring data from RAM to disk storage.
Virtual memory allows programs to use more memory than is physically available on the system.
It helps in multitasking by allowing multiple programs to run simultaneously without running out of memory.
Virtual memory uses a combination of RAM and disk...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Code for rand7 using rand5 function
Use rand5 twice to generate a number in [1,25] with equal probability
If the number is greater than 21, discard and try again
Otherwise, return (number mod 7) + 1
LRU cache is implemented using a doubly linked list and a hash map.
Create a doubly linked list to keep track of the order of elements in the cache.
Create a hash map to store the key-value pairs of the cache.
When a new element is added, check if the cache is full. If it is, remove the least recently used element from the linked list and the hash map.
When an element is accessed, move it to the front of the linked list to...
Function to randomly select pivot element in Quick Sort
Generate a random index within the range of the array
Return the element at the randomly generated index as the pivot
I was interviewed in Jun 2017.
based on 1 interview
Interview experience
Financial Advisor
97
salaries
| ₹0 L/yr - ₹0 L/yr |
Investment Specialist
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Back Office Executive
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Investment Advisor
6
salaries
| ₹0 L/yr - ₹0 L/yr |
HDB Financial Services
AU Small Finance Bank
Bajaj Finance
Equitas Small Finance Bank