Filter interviews by
I am a passionate software engineer with experience in developing web applications using various technologies.
Experienced in developing web applications using HTML, CSS, JavaScript, and frameworks like React and Angular
Proficient in backend development with Node.js and databases like MySQL and MongoDB
Familiar with version control systems like Git and deployment tools like Docker
I am a software engineer with 5 years of experience in developing web applications using Java, Spring Boot, and Angular.
5 years of experience in software development
Proficient in Java, Spring Boot, and Angular
Strong problem-solving skills
Experience working in Agile development environment
Passionate about learning new technologies
Top trending discussions
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.
posted on 25 Sep 2020
I applied via Company Website and was interviewed before Sep 2019. There were 5 interview rounds.
posted on 11 Nov 2019
I applied via Naukri.com and was interviewed in May 2019. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Mar 2021. There were 3 interview rounds.
2 moderate data structure problems
Fibonacci series is a sequence of numbers where each number is the sum of the two preceding ones.
Declare variables for first two numbers of the series
Use a loop to generate the series by adding the previous two numbers
Store the series in an array or print each number as it is generated
Join two tables on a key column using SQL
Use the JOIN keyword followed by the name of the second table
Specify the key column in both tables using the ON keyword
Choose the type of join (INNER, LEFT, RIGHT, FULL) based on your requirement
I applied via LinkedIn and was interviewed in Mar 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Jan 2021. There were 4 interview rounds.
Generic topics that were trending at the time
To find the frequency of each word in a sentence.
Split the sentence into words
Create a dictionary to store word frequency
Iterate through the words and update the dictionary
Return the dictionary
based on 1 interview
Interview experience
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Fidelity Investments
Vanguard
Morgan Stanley
Goldman Sachs