Filter interviews by
I appeared for an interview before Mar 2023.
Round 1 was based on two sections.
First section was of multiple choice based on technical skills. Second section was coding round.
20 Mcqs and 2 coding questions
Sort zeroes to end of array
Iterate through the array and move all zeroes to the end
Use two pointers approach to swap elements
Maintain a count of zeroes encountered
I applied via Job Fair and was interviewed in Oct 2021. There were 2 interview rounds.
I applied via LinkedIn and was interviewed in Feb 2022. There were 2 interview rounds.
Coding content on hackerrank of 2 questions
I appeared for an interview in Dec 2016.
LRU (Least Recently Used) is a caching algorithm that removes the least recently used item when the cache is full.
LRU uses a combination of a doubly linked list and a hash map.
The doubly linked list keeps track of the order of recently used items.
The hash map allows for efficient lookup of items in the cache.
When a new item is accessed, it is moved to the front of the list.
If the cache is full, the item at the end of t
Pressing 'k' on Notepad triggers a series of events including key press event, character insertion, and potential text manipulation.
When 'k' is pressed, a key press event is triggered
The key press event is captured by the Notepad application
The character 'k' is inserted at the current cursor position
If any text is selected, it may be replaced by the character 'k'
The cursor position is updated to the next position
If aut
posted on 9 Sep 2020
I applied via Naukri.com and was interviewed in Aug 2020. There were 4 interview rounds.
posted on 20 Mar 2024
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
posted on 31 Jul 2024
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
HashMap internally uses an array of linked lists to store key-value pairs.
When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.
If multiple keys hash to the same index, a linked list is used to handle collisions.
To retrieve a value, the key is hashed a...
Java uses automatic memory management through garbage collection to allocate and deallocate memory.
Java uses garbage collection to automatically manage memory allocation and deallocation.
Garbage collection runs in the background to reclaim memory from objects that are no longer in use.
Java provides the 'finalize()' method to allow objects to perform cleanup before being garbage collected.
Python Developer
3
salaries
| ₹4.8 L/yr - ₹5.6 L/yr |
Intellect Design Arena
Cohesity
Celebal Technologies
NoBrokerHOOD