Filter interviews by
I applied via Campus Placement
90 mins, easy, Data structures and algorithm basics
Remove duplicates from array of strings in place
Use a HashSet to keep track of unique elements
Iterate through the array and remove duplicates by checking if element is already in the HashSet
Update the array in place by shifting elements to fill in the removed duplicates
Caching is the process of storing data in a temporary location to reduce access time and improve performance.
Caching helps reduce the load on servers by serving frequently accessed data quickly
It can improve performance by reducing the time needed to retrieve data from the original source
Examples include browser caching, CDN caching, and database caching
I applied via Campus Placement and was interviewed before Oct 2019. There were 4 interview rounds.
Twitter system design involves multiple components such as servers, databases, caching, and APIs.
Use sharding to distribute data across multiple servers
Implement caching to reduce database load
Use message queues for handling high traffic
Implement APIs for user authentication and data retrieval
Use load balancers to distribute traffic evenly
Implement a search engine for efficient search functionality
The minimum number of platforms needed to avoid train crashes based on arrival and departure times.
Sort the arrival and departure arrays in ascending order.
Initialize a variable to keep track of the maximum number of platforms needed.
Iterate through the arrival and departure arrays simultaneously.
If the current arrival time is less than or equal to the current departure time, increment the platform count.
If the current...
I was interviewed in Jan 2016.
To find the right view of a binary tree, we need to traverse the tree and keep track of the rightmost node at each level.
Traverse the tree using level order traversal
At each level, keep track of the rightmost node
Add the rightmost node to the result array
Return the result array
Find two missing numbers from an unsorted array in O(n) time complexity.
Calculate the sum of all numbers from 1 to n using the formula n*(n+1)/2
Calculate the sum of all numbers in the given array
Subtract the sum of array from the sum of all numbers to get the sum of missing numbers
Use the sum of missing numbers and the sum of squares of all numbers from 1 to n to calculate the missing numbers using simultaneous equatio
To find average salary without disclosing any one salary
Collect salaries of all employees
Add all salaries and divide by total number of employees
Do not disclose any individual salary
Divide a golden brick into minimum parts to pay daily salary to a worker.
The number of parts needed will depend on the daily salary of the worker.
The size of the parts should be equal.
The parts should be small enough to cover the daily salary but large enough to minimize the number of parts.
The formula to calculate the number of parts is: number of parts = total value of the golden brick / daily salary
Top trending discussions
I applied via Naukri.com and was interviewed in Aug 2024. There was 1 interview round.
I was interviewed in Jul 2024.
2 Graph question of leetcode
Machine coding round
Developed a web application for managing inventory and sales for a retail store
Used React.js for front-end development
Implemented Node.js for back-end functionality
Utilized MongoDB for database management
I am a passionate software developer with experience in Java, Python, and web development.
Experienced in Java, Python, and web development technologies
Strong problem-solving skills
Team player with excellent communication skills
I applied via campus placement at Pondicherry University and was interviewed in May 2024. There were 2 interview rounds.
Basic aptitude with tracing program
3 problem with easy to hard
I was interviewed in May 2024.
It was having english and maths questions
Code was easy kindly do pratice
I haven't appeared but this website asking me everytime that's why giving review but I wanted to know what are the ratings for this company
Launch modes on Android determine how a new instance of an activity is associated with the current task.
Standard: Creates a new instance of the activity in the task's stack
SingleTop: If an instance of the activity already exists at the top of the stack, it will not be recreated
SingleTask: Activity is always at the root of the task and no other activities can be on top of it
SingleInstance: Similar to SingleTask, but the
Questios based on Activity backstacks
Some of the top questions asked at the Carwale Software Developer interview -
based on 3 interviews
Interview experience
based on 8 reviews
Rating in categories
Accounts Manager
133
salaries
| ₹3 L/yr - ₹5.5 L/yr |
Key Account Manager
91
salaries
| ₹3 L/yr - ₹8 L/yr |
Product Manager
28
salaries
| ₹12 L/yr - ₹25 L/yr |
Regional Manager
28
salaries
| ₹4.5 L/yr - ₹10.2 L/yr |
Software Developer
23
salaries
| ₹7 L/yr - ₹15 L/yr |
MagicBricks
Impact Guru
Netmeds.com
Tracxn