Filter interviews by
I applied via LinkedIn and was interviewed before Jan 2023. There were 2 interview rounds.
What is a join in SQL, git commands
How to write a python script to join all elements of a list
Top trending discussions
I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.
I applied via Naukri.com
I applied via Campus Placement and was interviewed in May 2021. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Mar 2021. There were 3 interview rounds.
posted on 14 Mar 2015
I appeared for an interview before Jun 2016.
Brownian motion is the random motion of particles in a fluid due to collisions with other particles.
Brownian motion was first observed by Robert Brown in 1827.
It is named after the botanist Robert Brown.
The motion is caused by the random movement of fluid molecules.
Brownian motion is a continuous-time stochastic process.
It is often used to model various phenomena in physics, finance, and biology.
Properties of Brownian ...
A Martingale is a mathematical concept used in probability theory and statistics. Markov Processes are stochastic processes that satisfy the Markov property.
A Martingale is a sequence of random variables where the expected value of the next variable, given the current and past variables, is equal to the current variable.
Markov Processes are stochastic processes where the future state depends only on the current state a...
I appeared for an interview in Jun 2017.
I appeared for an interview 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 Campus Placement and was interviewed before Jan 2021. There were 4 interview rounds.
Generic topics that were trending at the time
based on 1 interview
Interview experience
HDB Financial Services
AU Small Finance Bank
Bajaj Finance
Equitas Small Finance Bank