Filter interviews by
I applied via Internshala and was interviewed in May 2021. There were 4 interview rounds.
Top trending discussions
I appeared for an interview before Sep 2020.
Round duration - 90 mins
Round difficulty - Hard
There were questions related to DP and DFS.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
Round duration - 60 mins
Round difficulty - Medium
At first, I was asked about the different projects that I have done so far. We had a detailed discussion on the same.
He also checked my OOP concepts
Designing an LRU Cache involves implementing a data structure that stores a fixed number of items and removes the least recently used item when full.
Start by defining the data structure for the cache, typically using a combination of a hashmap and a doubly linked list.
Implement methods for getting and setting key-value pairs in the cache.
When a new item is added to the cache, check if it exceeds the maximum capacity. I...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
If there are even elements, return the one that is farther from the head node
Handle edge cases like linked list of size 1 or empty list
Round duration - 60 mins
Round difficulty - Medium
It is HR + Technical round
asked about the Behavioural questions and how you justify yourself in an argument .questions related to current technology.
They gave me feedback on how well I had performed so far and gave me suggestions on what more can I do to further improve myself.
Tip 1 : Be thorough about your projects
Tip 2 : Prepare Ds and Algo and Practice all standard questions
Tip 3 : Know the complexities of the code that you’ve written.
Tip 1 : Mention at least 2 projects.
Tip 2 : Don't make any silly spelling mistakes on resume
Basic DSA and android questions
Live coding round for android
I applied via Company Website and was interviewed in Jan 2021. There were 5 interview rounds.
Object-Oriented Programming (OOP) is a programming paradigm based on objects and classes, promoting code reusability and organization.
Encapsulation: Bundling data and methods that operate on the data within one unit (e.g., a class).
Inheritance: Mechanism to create a new class using properties and methods of an existing class (e.g., a 'Dog' class inheriting from an 'Animal' class).
Polymorphism: Ability to present the sa...
Blood relation, coding and decoding, number system , percentage
There were DSA questions and time limit was 1 hr
Factorial calculation using tabulation in dynamic programming
Create an array to store factorial values up to n
Initialize the array with base cases (0! = 1, 1! = 1)
Iterate from 2 to n and calculate factorial using previous values in the array
Return the factorial value at index n
Wildcard matching checks if a string matches a pattern with '*' and '?' as wildcards.
Use '*' to match any sequence of characters. Example: 'a*b' matches 'ab', 'aXb', 'a123b'.
'?' matches any single character. Example: 'a?c' matches 'abc', 'axc', but not 'ac'.
Implement using dynamic programming for efficiency, especially for longer strings.
Consider edge cases like empty strings and patterns.
Basic DS Question, Medium level difficulty , followed with some puzzles
Designing an in-memory database involves optimizing data storage and retrieval for fast performance.
Use data structures like hash tables or B-trees for efficient indexing and searching
Implement caching mechanisms to reduce disk I/O and improve read/write speeds
Consider data durability and consistency mechanisms to prevent data loss in case of system failures
Design a social media app with users, posts, comments, likes, and admin functionalities.
Class User: Represents a user with attributes like userId, username, and methods to create posts and comments.
Class Post: Represents a post with attributes like postId, content, userId, and methods for liking and commenting.
Class Comment: Represents a comment with attributes like commentId, content, userId, and methods to like comme...
Design a user-to-user chat application similar to WhatsApp focusing on scalability, security, and real-time messaging.
Use a client-server architecture with mobile and web clients communicating with a central server.
Implement WebSocket for real-time communication to ensure instant message delivery.
Utilize a NoSQL database like MongoDB for storing user profiles and chat history.
Incorporate user authentication using JWT (...
I applied via Campus Placement and was interviewed in Jul 2023. There was 1 interview round.
Collections Executive
35
salaries
| ₹2 L/yr - ₹4 L/yr |
Software Engineer
25
salaries
| ₹4.8 L/yr - ₹15 L/yr |
Data Scientist
24
salaries
| ₹7.2 L/yr - ₹17 L/yr |
Sales Executive
23
salaries
| ₹2.7 L/yr - ₹3.8 L/yr |
Assistant Manager
22
salaries
| ₹3.9 L/yr - ₹12.5 L/yr |
Rupeek
Razorpay
ACKO
Revolut