Gupshup Senior Sdet Engineer Interview Questions and Answers

Q1. Coding round with senior software engineer
Add your answer

Q1. Resume based discussion with lead software engineer
Add your answer

Q1. Resume based and coding round with hiring manager
Add your answer

Q1. Cross team resume based and coding round with a staff engineer
Add your answer

Q1. Attitude and culture fit
Add your answer

Very basic problem solving round

Q1. Medium level DSA problem solving round
Add your answer

Write a program that solves sudoku

Q1. How do you build a tiny URL Application?
Ans. 
A tiny URL application is built by generating short aliases for long URLs, storing them in a database, and redirecting users to the original URL when the alias is accessed.
• Generate a unique short alias for each long URL

• Store the alias and corresponding long URL in a database

• Implement a redirect mechanism to redirect users from the alias to the original URL

• Handle edge cases like duplicate URLs, expired aliases, and inva
Answered by AI
Add your answer

Two questions asked:
1. Partition equal sum
2. find length largest region boolean matrix

Q1. Immediate higher number to right
Ans. 
The immediate higher number to the right of each element in an array
• Iterate through the array from right to left

• For each element, compare it with the elements to its right to find the immediate higher number

• Store the immediate higher number in a new array
Answered by AI
Add your answer
Q2. Count pair whose sum is perfect square.
Ans. 
Count pairs in an array whose sum is a perfect square.
• Iterate through the array and calculate the sum of each pair.

• Check if the sum is a perfect square using a function.

• Increment a counter if the sum is a perfect square.

• Return the final count of pairs.
Answered by AI
Add your answer
Q3. Parking lot LLD
Add your answer
Q4. E Commerce HLD and LLD
Add your answer
Q5. Kth largest number in BST
Ans. 
To find the Kth largest number in a Binary Search Tree (BST), we can perform an in-order traversal and keep track of the Kth largest element.
• Perform an in-order traversal of the BST to get the elements in non-decreasing order.

• Keep track of the Kth largest element while traversing the BST.

• Return the Kth largest element once found.
Answered by AI
Add your answer

Hacker rank evaluation with three questions

Q1. Android fundamentals
Add your answer
Q2. Lifecycle methods and synchronization
Add your answer

Q1. Comparator based problem solving
Add your answer
Q2. Binary tree based Hashmap question
Add your answer

Q1. Usual behavior fit questions
Add your answer

Q1. System Design question on designing a Tiny URL
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
The task is to identify all distinct triplets within an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Keep track of the sum of each triplet and compare it with the target sum.

• Print the triplet if the sum matches the target sum, else print -1.
Answered by AI
Add your answer
Q2. 
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...read more
Ans. 
Find the K-th largest element in a BST.
• Perform reverse in-order traversal of the BST to find the K-th largest element.

• Keep track of the count of visited nodes to determine the K-th largest element.

• Return -1 if there is no K-th largest element in the BST.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Can you design a database schema for a support ticketing system, such as Freshdesk?
Ans. 
Designing a database schema for a support ticketing system like Freshdesk.
• Create a 'Tickets' table with fields like ticket ID, subject, description, status, priority, etc.

• Include a 'Users' table for customer and agent information.

• Establish a 'Categories' table for ticket categorization.

• Implement a 'Comments' table to track communication history.

• Utilize foreign keys to establish relationships between tables.
Answered by AI
Add your answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. 
The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.
• Use dynamic programming to solve this problem efficiently.

• The number of ways to reach the Nth stair is equal to the sum of ways to reach (N-1)th stair and (N-2)th stair.

• Handle modulo 10^9+7 to avoid overflow issues.

• Consider base cases for 0th and 1st stair.

• Optimize the solution by using constant space instead of
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Can you design the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow?
Ans. 
Designing the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow.
• For HLD, identify main components like user interface, booking system, payment gateway, and database.

• For LLD, break down each component into detailed modules and their interactions.

• Consider scalability, security, and performance in both designs.

• Example: HLD - User selects movie -> Booking system checks availability -> Pa...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was hiring manager round

Round duration - 20 Minutes
Round difficulty - Easy

This was culture fit round