Filter interviews by
I applied via Naukri.com and was interviewed in Mar 2022. There were 2 interview rounds.
Linux, Bash script, Jenkins and Maven
Top trending discussions
During the coding round, I was asked a question about performing insertion sort using recursion. Additionally, there were theoretical questions regarding DBMS and some puzzles. The interview lasted for 45 minutes.
My college experience was enriching, I live in a bustling city, and my interests include coding, hiking, and playing the guitar.
College experience was enriching with challenging coursework and extracurricular activities
I live in a bustling city with access to diverse cultural events and opportunities
Interests include coding, hiking, and playing the guitar for relaxation and creativity
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 have a strong background in software engineering and a passion for innovation, making me a valuable asset to HSBC.
I have a proven track record of successfully delivering high-quality software solutions in previous roles.
I am highly skilled in various programming languages and technologies, including Java, Python, and SQL.
I have experience working in agile development environments, allowing me to adapt quickly to chan...
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 was interviewed before Jan 2023.
Trapping rainwater problem
The problem involves calculating the amount of rainwater that can be trapped between bars in an elevation map
Use two pointers approach to calculate the water trapped at each bar
Keep track of the maximum height on the left and right of each bar to calculate the trapped water
Search for a target value in a sorted n*n matrix.
Start from the top-right corner or bottom-left corner of the matrix.
Compare the target value with the current element and move left or down accordingly.
Repeat until the target value is found or the boundaries of the matrix are crossed.
Create a Binary Search Tree (BST) from an incoming stream of nodes.
Start with an empty BST
For each incoming node, compare it with the root node and insert it accordingly
Repeat the process until all nodes are inserted
I applied via Referral and was interviewed before Sep 2019. There were 3 interview rounds.
I approach dynamic objects by analyzing their behavior and adapting my approach accordingly.
I start by understanding the nature of the dynamic object and its expected behavior
I then analyze its movement patterns and any potential obstacles or hazards
Based on this analysis, I adapt my approach to ensure safe and efficient interaction with the dynamic object
For example, when working with a moving conveyor belt, I would e...
Implicit and explicit wait are two types of wait in Selenium used to synchronize the test execution with the application.
Implicit wait is used to set a default waiting time for the web elements to load before throwing an exception.
Explicit wait is used to wait for a specific condition to occur before proceeding with the test execution.
Implicit wait is set globally for the entire test script while explicit wait is set f...
I applied via Approached by Company and was interviewed in Aug 2021. There were 3 interview rounds.
Senior Associate
291
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate 1
249
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
209
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
168
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
77
salaries
| ₹0 L/yr - ₹0 L/yr |
Citi Group Global Markets
Morgan Stanley
Goldman Sachs
JP Morgan Securities