Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed in Jun 2024. There were 3 interview rounds.
Three coding problems were asked one was to print frequency of each character in a string, second was also similar to this problem unable to recall it and third problem was given an array of string and range from L to R find the nth character if all strings from L to R is concatenated and sorted. Apart from these three coding problems there were 10 easy MCQ's.
I applied via Instahyre and was interviewed before Aug 2022. There were 5 interview rounds.
Use a loop to iterate through the string and build a new reversed string.
Create an empty string to store the reversed result.
Iterate through the original string from the end to the beginning.
Append each character to the new string.
Return the reversed string.
Behavioural questions related to organisations
Gupshup interview questions for designations
Top trending discussions
I applied via Referral
I applied via Referral and was interviewed before Jun 2022. There were 6 interview rounds.
I applied via Company Website and was interviewed before Sep 2022. There were 2 interview rounds.
Very basic problem solving round
I applied via Approached by Company and was interviewed before Jan 2023. There were 2 interview rounds.
Write a program that solves sudoku
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
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Two questions asked:
1. Partition equal sum
2. find length largest region boolean matrix
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
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.
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.
Some of the top questions asked at the Gupshup Senior Software Engineer interview -
based on 5 interviews
Interview experience
based on 6 reviews
Rating in categories
Software Engineer
88
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer Level 1
38
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
33
salaries
| ₹0 L/yr - ₹0 L/yr |
Twilio
Hike
InMobi
Paytm