Filter interviews by
I was interviewed in Sep 2021.
Round duration - 60 minutes
Round difficulty - Medium
It was Data Structures plus computer fundamentals round.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and updates.
When capacity is reached, evict the least recently used item before inserting a new item.
Update the position of a key in the linked list whenever
Mutex and Semaphore are synchronization mechanisms used in operating systems to control access to shared resources.
Mutex is used to provide mutual exclusion, allowing only one thread to access a resource at a time.
Semaphore is used to control access to a resource by multiple threads, with a specified number of permits available.
Mutex is binary in nature (locked or unlocked), while Semaphore can have a count greater tha...
Round duration - 60 minutes
Round difficulty - Medium
Had some coding questions. Asked me about my projects. What is html. What is dom and how do we manipulate it.
Given a list of integers of size N
, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X
is the firs...
The task is to find the Next Greater Element for each element in a list of integers.
Iterate through the list of integers from right to left.
Use a stack to keep track of elements whose NGE is yet to be found.
Pop elements from the stack until a greater element is found or the stack is empty.
Assign the NGE as the top element of the stack or -1 if the stack is empty.
You are given a non-empty grid MAT
with 'N' rows and 'M' columns, where each element is either 0 or 1. All rows are sorted in ascending order.
Your task is to ...
Find the row with the maximum number of 1's in a grid of 0's and 1's, returning the index of the row with the most 1's.
Iterate through each row of the grid and count the number of 1's in each row
Keep track of the row index with the maximum number of 1's seen so far
Return the index of the row with the maximum number of 1's
Round duration - 60 minutes
Round difficulty - Medium
Interview with Engineering Manager
Tip 1 : Practice from Leetcode, solve Leetcode medium level problems.
Tip 2 : Brush up computer fundamentals from subjects like OS, DBMS and CN.
Tip 3 : Have a good project or good internship experience and have in-depth knowledge regarding what you have done.
Tip 1 : Have at least one good internship as preference were given to people having some experience.
Tip 2 : Mention your achievements (Competitive Coding, ICPC, GSOC) and some projects or open source experience.
I was interviewed before Apr 2021.
Round duration - 45 Minutes
Round difficulty - Medium
It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...Merge two sorted linked lists into a single sorted linked list without using additional space.
Create a dummy node to start the merged list
Compare the values of the two linked lists and add the smaller value to the merged list
Move the pointer of the merged list and the pointer of the smaller value list
Continue this process until one of the lists is fully traversed
Append the remaining elements of the other list to the me
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Round duration - 60 Minutes
Round difficulty - Medium
It was more of a in depth round on the framework I'm working on and problem solving.
The event loop is a mechanism in programming that allows for asynchronous execution of code.
The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.
It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.
The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...
Output-based questions in JavaScript using browser APIs
Example 1: Write a script that uses the Geolocation API to display the user's current location on a map
Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked
Example 3: Develop a web page that uses the Canvas API to draw a simple animation
Designing a system to support localization in a mobile app
Use resource files to store localized strings for different languages
Implement a language selection feature for users to choose their preferred language
Utilize localization libraries or frameworks to streamline the process
Consider cultural differences when localizing content, such as date formats and currency symbols
Round duration - 75 Minutes
Round difficulty - Hard
It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.
To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.
Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.
Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.
Keep track of the results and compare the timings to d
To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.
Analyze code to identify any inefficient algorithms or operations causing lag.
Check for memory leaks that could be impacting performance.
Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.
Use profiling tools like Xcode Instruments or Android Profiler to identify p
The app I recently worked on is a social media platform for sharing photos and connecting with friends.
The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.
The client side is built using React Native for cross-platform compatibility.
The server side is implemented using Node.js with a MongoDB database for storing user data and photos.
The a...
Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)
Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
2 questions Medium Leetcode
I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.
There were 2 questions.
1. Knapsack
2. Median in an array
An immutable class is a class whose instances cannot be modified after creation.
Use final keyword for class declaration to prevent inheritance
Make all fields private and final to prevent modification
Do not provide setter methods, only getter methods should be used
Implement a Springboot service to intercept HTTP requests.
Create a Springboot application with necessary dependencies.
Implement a custom interceptor by extending HandlerInterceptorAdapter.
Override preHandle and postHandle methods to intercept requests and responses.
Register the interceptor in the WebMvcConfigurerAdapter configuration class.
LRU cache is a data structure that stores the most recently used items, discarding the least recently used items when full.
Use a doubly linked list to keep track of the order of items based on their usage.
Use a hash map to quickly access items in the cache.
When a new item is accessed, move it to the front of the linked list. If the cache is full, remove the item at the end of the list.
HashMap is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
HashMap is implemented using an array of linked lists or a balanced tree to handle collisions.
It uses a hash function to map keys to indices in the array.
Example: HashMap
I applied via Job Portal and was interviewed in May 2024. There was 1 interview round.
Dsa question based on dp
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
3 coding question
2 medium 1 hard
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
3 Medium level dsa questions
The Low Level Design (LLD) of a cab booking system involves detailing the system architecture and components at a lower level of abstraction.
Identify the main components of the system such as user interface, booking engine, payment gateway, and driver allocation algorithm.
Define the interactions between these components and how data flows between them.
Specify the data structures and algorithms used for efficient bookin...
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
2 medium - question 1 array and 1 dp
1 med to hard - dynamic programming
Concurrency in software development allows multiple tasks to run simultaneously, improving performance and responsiveness.
Use multithreading to execute multiple tasks concurrently
Implement asynchronous programming to handle tasks that may take longer to complete
Use synchronization techniques like locks and semaphores to manage access to shared resources
Consider using thread pools to manage and reuse threads efficiently
Assistant Manager
61
salaries
| ₹0 L/yr - ₹0 L/yr |
Engagement Manager
55
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
51
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer II
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Manager
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Netflix
Amazon Prime Video
SonyLIV
ZEE5