Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Sep 2024. There were 3 interview rounds.
2 Coding questions - medium to hard
Implement LFU cache using OOPs concepts
Create a class for LFU cache with methods like get, put, and remove
Use a hashmap to store key-value pairs and a hashmap to store frequency of each key
Implement a doubly linked list to store keys with the same frequency
I applied via Campus Placement and was interviewed in Jul 2024. There were 2 interview rounds.
Binary Search & Dynamic Programming
Projects and queries involve understanding and working on various software projects and related inquiries.
Projects involve developing, testing, and maintaining software applications.
Queries may include troubleshooting issues, optimizing performance, and implementing new features.
Examples of queries include debugging a software bug, improving code efficiency, and integrating a new API.
I applied via Approached by Company and was interviewed in May 2024. There was 1 interview round.
Use dynamic programming to find the longest strictly increasing path in a matrix.
Use dynamic programming to keep track of the longest increasing path ending at each cell.
Start from each cell and recursively explore all 4 directions to find the longest increasing path.
Update the length of the longest increasing path at each cell based on the maximum length from its neighbors.
Top trending discussions
I applied via Job Portal and was interviewed before Jun 2023. There was 1 interview round.
Array , strings linked list, dp
I applied via Campus Placement and was interviewed in May 2024. There was 1 interview round.
Hackerearth test 2 automata questions , 7 automata fix and 8 mcq
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.
I applied via Referral and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed before Oct 2019. There was 1 interview round.
based on 3 interviews
Interview experience
Analyst
165
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
146
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Lead
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
48
salaries
| ₹0 L/yr - ₹0 L/yr |
Goldman Sachs
Morgan Stanley
Citadel
Blackrock