i
Paisabazaar.com
Filter interviews by
I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.
What people are saying about Paisabazaar.com
Count the number of islands in a 2D grid of 1s and 0s.
Use DFS or BFS to traverse the grid and mark visited cells.
Count the number of times traversal starts from an unvisited 1.
Consider edge cases like empty grid, all 0s or all 1s.
I applied via Campus Placement and was interviewed before Apr 2023. There was 1 interview round.
It was on-campus placement interview.
Two rounds of interview were there and both were of DSA (DP and sorting algo).
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
Given two soted arrays merge them from a single sorted array with all items in non-decreassing order
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
3 Leetcode style questions , 2 medium , 1 hard .
A cab booking system designed using OOP principles
Create classes for Cab, Customer, Driver, and Booking
Use inheritance and polymorphism to handle different types of cabs and bookings
Implement methods for booking a cab, assigning a driver, and calculating fare
Use encapsulation to protect data and ensure data integrity
I applied via Walk-in and was interviewed in May 2021. There was 1 interview round.
I appeared for an interview before Sep 2020.
Round duration - 60 Minutes
Round difficulty - Easy
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.
Iterate through each item and update the array based on whether including the item would increase the total value.
The final value in the array at index W will be the maximum value that can be stolen.
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
ARR = [2,...
Find the second largest element in an array of integers.
Iterate through the array to find the largest and second largest elements.
Handle cases where all elements are identical.
Return -1 if a second largest element does not exist.
Round duration - 60 Minutes
Round difficulty - Easy
System Design Round
Design a scalable system for Twitter with key components and architecture.
Use microservices architecture for scalability and fault isolation.
Key components include user service, tweet service, timeline service, and notification service.
Use a distributed database like Cassandra for storing tweets and user data.
Implement a message queue like Kafka for handling real-time updates and notifications.
Use a caching layer like ...
Round duration - 30 Minutes
Round difficulty - Easy
It is just a formality
Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.
Tip 1 : Mention what you know
Tip 2 : Good previous work to showcase
Sales Executive
824
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
Associate Sales Consultant
708
salaries
| ₹1.4 L/yr - ₹3.8 L/yr |
Team Lead
225
salaries
| ₹2.6 L/yr - ₹8.5 L/yr |
Senior Executive
211
salaries
| ₹2 L/yr - ₹5 L/yr |
Sales Consultant
192
salaries
| ₹1.2 L/yr - ₹4.5 L/yr |
Udaan
Swiggy
CARS24
BlackBuck