Upload Button Icon Add office photos

Filter interviews by

Gupshup Product Marketing Manager Interview Questions and Answers

Updated 15 Mar 2023

Gupshup Product Marketing Manager Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I was interviewed in Feb 2023.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Case Study 

Basic experience related questions

Round 3 - Guesstimates 

(2 Questions)

  • Q1. No of petrol pumps in India
  • Ans. 

    There are approximately 69,000 petrol pumps in India.

    • India has one of the largest networks of petrol pumps in the world.

    • The number of petrol pumps in India has been steadily increasing over the years.

    • The government has been encouraging the setting up of more petrol pumps in rural areas.

    • Some of the major petrol pump chains in India include Indian Oil, Bharat Petroleum, and Hindustan Petroleum.

  • Answered by AI
  • Q2. Product launch knowledge

Interview Preparation Tips

Interview preparation tips for other job seekers - Two round of interviews which were done in a week or so. No response from the HR ever since, even after follow-ups. It's been 17 days when i am writing this.

Gives a good glimpse of the company culture. Well done! 👏🏻

Interview questions from similar companies

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on DSA were discussed.

  • Q1. 

    Ninja and Sorted Array Merging Problem

    Ninja is tasked with merging two given sorted integer arrays ARR1 and ARR2 of sizes 'M' and 'N', respectively, such that the merged result is a single sorted array w...

  • Ans. 

    Merge two sorted arrays into one sorted array within the first array.

    • Create a pointer for the last index of ARR1 and ARR2 to start merging from the end.

    • Compare elements from both arrays and place the larger element at the end of ARR1.

    • Continue this process until all elements are merged in sorted order within ARR1.

  • Answered by AI
  • Q2. 

    Reverse Alternate Levels of a Perfect Binary Tree Problem Statement

    Given a perfect binary tree consisting of 'N' nodes, reverse the nodes at alternate levels in the tree (i.e., reverse level 2, level 4, ...

  • Ans. 

    Reverse alternate levels of a perfect binary tree by reversing nodes at even levels starting from level 2.

    • Traverse the tree in level order and store nodes at even levels in a separate list.

    • Reverse the list of nodes at even levels.

    • Update the tree with the reversed nodes at even levels.

    • Repeat the process for alternate levels starting from level 2.

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical round with questions based on OS, Java were discussed.

  • Q1. What are the characteristics of distributed file systems?
  • Ans. 

    Characteristics of distributed file systems include scalability, fault tolerance, and data replication.

    • Scalability: Distributed file systems can easily scale to accommodate a large amount of data and users.

    • Fault tolerance: They are designed to continue functioning even if some components fail, ensuring high availability.

    • Data replication: Data is often replicated across multiple nodes to ensure reliability and performan...

  • Answered by AI
  • Q2. Design a file sharing mechanism between two users.
  • Ans. 

    Design a file sharing mechanism between two users.

    • Implement a secure login system for both users.

    • Allow users to upload files to a shared server.

    • Provide a way for users to view and download files shared by the other user.

    • Implement access control to ensure only authorized users can access the shared files.

  • Answered by AI
  • Q3. What is ConcurrentHashMap in Java?
  • Ans. 

    ConcurrentHashMap is a thread-safe implementation of the Map interface in Java.

    • ConcurrentHashMap allows multiple threads to read and write to the map concurrently without causing any issues like deadlocks or data corruption.

    • It achieves thread-safety by dividing the map into segments, each of which can be locked independently.

    • ConcurrentHashMap is more efficient than using synchronized maps for concurrent access.

    • Example:...

  • Answered by AI
  • Q4. How do you analyze the usage history of an application?
  • Ans. 

    Analyzing usage history involves tracking user interactions, patterns, and trends to improve application performance.

    • Collect and store user interaction data such as clicks, page views, and time spent on each feature.

    • Use analytics tools to generate reports and visualize usage patterns.

    • Identify popular features, user preferences, and areas for improvement based on usage data.

    • Implement A/B testing to compare different ver...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPS, Operating SystemsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. N a line where words are separated by spaces, , and capitalize first letter of the reversed word. Other letters of the word should be in small. Input : “how are you?” → Output: “Woh Era ?uoy”
  • Ans. 

    The program capitalizes the first letter of each reversed word in a sentence.

    • Split the sentence into an array of words using space as a delimiter.

    • Reverse each word in the array and capitalize the first letter.

    • Join the modified words back into a sentence.

  • Answered by AI
  • Q2. He second question reduced to finding maximum weight matching in a bipartite graph. Not many people would have done this (maybe none)
  • Q3. There are 2 sets of countries. One set will donate clothes (something of this sort) and anotherset will accept clothes. A country can be in only 1 of the sets. The amount of clothes donated is also given. ...

Interview Preparation Tips

Round: Test
Experience: There were about 20 MCQs (30 minutes) to be done after the coding section. MCQs were totally nonsense. Can be done in 10 mins.For coding section 60 mins.  It was hosted on Hackerrank.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: After this, selected candidates were interviewed that consists of 4 rounds and discussion was mostly on your CV and data structure problems.

General Tips: Be honest with your interviewer. If you are not comfortable in 1 topic, tell your interviewer honestly. Do well in other areas. Look for hints from the interviewer if you get stuck. They want to see how you approach a problem.
Skills: Algortihm, Data structure
College Name: IIT DELHI

I was interviewed in Dec 2017.

Interview Questionnaire 

3 Questions

  • Q1. You need to find the maximum water pond formed in bw the building
  • Ans. 

    To find the maximum water pond formed between buildings.

    • Identify the lowest point between the buildings.

    • Calculate the area of the pond using the distance between the buildings and the depth of the pond.

    • Consider any obstacles or uneven ground that may affect the pond's shape.

    • Use a surveying tool or satellite imagery to get accurate measurements.

    • Take into account any drainage systems or natural water flow that may affect

  • Answered by AI
  • Q2. On mars you have to place n robots and they are connected via GPS. now you need to move each robot such that the whole mars is visited and each robot visit the minimum area(meaning no overlapping of area)...
  • Q3. Design dictionary using trie....having operations of inserting a word, updating and deleting (needed to write full running code)
  • Ans. 

    Design a dictionary using trie with insert, update and delete operations.

    • Implement a Trie data structure with nodes containing a character and a boolean flag to indicate end of word

    • For insert operation, traverse the trie and add nodes for each character in the word

    • For update operation, delete the existing word and insert the updated word

    • For delete operation, mark the end of word flag as false and delete the node if it ...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Simple questions
Duration: 1 hour 10 minutes
Total Questions: 3

College Name: IIT Guwahati

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical interview round with questions based on DSA.

  • Q1. 

    Binary Tree Traversals

    Your task is to compute the In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes, where each node has an integer value.

    Input:
    T
    For each test cas...
  • Ans. 

    Compute In-Order, Pre-Order, and Post-Order traversals for a given Binary Tree with 'N' nodes.

    • Implement tree traversal algorithms: In-Order, Pre-Order, and Post-Order.

    • Use recursion to traverse the binary tree efficiently.

    • Handle null nodes represented by -1 in the input.

    • Follow the order of nodes as they appear in the level order traversal.

    • Ensure the output is space-separated lists for each traversal type.

  • Answered by AI
  • Q2. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly.

    • Ensure to handle cache capacity by evicting the least recently used item when the cache is full.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA, OS etc.

  • Q1. 

    Number of Islands II Problem Statement

    You have a 2D grid of dimensions 'N' rows by 'M' columns, initially filled with water. You are given 'Q' queries, where each query contains two integers 'X' and 'Y'....

  • Ans. 

    The task is to determine the number of islands present on a 2D grid after each query of converting water to land.

    • Create a function that takes the grid dimensions, queries, and coordinates as input.

    • For each query, convert the water at the given coordinates to land and update the grid.

    • Use depth-first search (DFS) to find connected lands and count the number of islands.

    • Return the number of islands after each query.

  • Answered by AI
  • Q2. Why are synchronized blocks needed in Java?
  • Ans. 

    Synchronized blocks are needed in Java to ensure thread safety by allowing only one thread to access a block of code at a time.

    • Prevents multiple threads from accessing critical sections of code simultaneously

    • Ensures data consistency and prevents race conditions

    • Improves performance by reducing contention for shared resources

    • Example: synchronized block in a method that updates a shared variable

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, OS, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This test has 2 sections :
Section 1 ( Technical objective questions) 
– 25 mcq’s mainly focusing on c , c++ , os , data structures , algorithms
Section 2 ( 2 Coding questions )
– Code was supposed to be written on paper.

  • Q1. 

    Next Greater Number Problem Statement

    Given a string S which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...

  • Ans. 

    Given a number represented as a string, find the smallest number greater than the original with the same set of digits.

    • Sort the digits in non-increasing order to find the next greater number.

    • Swap the last two digits to get the smallest greater number.

    • If no greater number exists, return -1.

  • Answered by AI
  • Q2. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string by reversing the order of words while maintaining spaces.

    • Split the input string by spaces to get individual words

    • Reverse the order of the words

    • Join the reversed words with a single space in between

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

First round of interview was based on basic data structures. Concepts related to binary search tree , uses and comparing complexity were asked. He also asked about Hashing , Collisions.

  • Q1. 

    K Largest Elements Problem Statement

    Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.

    Input:

    The fir...
  • Ans. 

    Find K largest elements in an unsorted array and return them in non-decreasing order.

    • Sort the array in non-decreasing order

    • Return the last K elements of the sorted array

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interview started with a programming question. Then he asked me a puzzle. There was a small discussion about my projects then .Then he started asking questions about operating system. The interviewer wanted to test my understanding about semaphores and asked some tricky and confusing questions .

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    Return the level order traversal of a binary tree given in level order with null nodes represented by -1.

    • Parse the input to create the binary tree using level order traversal

    • Use a queue to perform level order traversal and print the nodes in the order visited

    • Handle null nodes represented by -1 appropriately

  • Answered by AI
  • Q2. Explain the Producer-Consumer problem and how it can be solved using semaphores.
  • Ans. 

    Producer-Consumer problem involves multiple threads sharing a common buffer. Producers add items to the buffer while consumers remove them.

    • Producers and consumers need to synchronize their access to the shared buffer to avoid race conditions.

    • Semaphores can be used to control access to the buffer. Two semaphores are used - one to track the empty slots in the buffer and one to track the filled slots.

    • Producers increment t...

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA.

  • Q1. 

    Peak Element Finder

    For a given array of integers arr, identify the peak element. A peak element is an element that is greater than its neighboring elements. Specifically, if arr[i] is the peak, then both...

  • Ans. 

    Find the peak element in an array of integers.

    • Iterate through the array and check if the current element is greater than its neighbors.

    • Handle edge cases for the first and last elements of the array.

    • Return the peak element found.

  • Answered by AI
Round 5 - Telephonic Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

This round was a telephonic interview with the CTO of the company. The he started with a small discussion about my projects and research paper .He then moved on to data structures and asked me how to choose a relevant data structure for a given problem. I gave him advantages of every data structure and certain problems where specific data structures could be useful .Then he gave a question and asked me for what data structure should be used keeping time complexity in mind. He asked me a few HR questions in the end .

  • Q1. 

    Average Marks Problem Statement

    Given the initial letter of a student's name and three integer marks for that student, calculate and display the student's initial letter followed by the integer part of th...

  • Ans. 

    Calculate and display the student's initial letter followed by the integer part of their average marks.

    • Calculate the average of the three marks provided for each student.

    • Display the initial letter of the student's name followed by the integer part of the average marks.

    • Round down the average to the nearest integer to get the integer part.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.

  • Q1. 

    Running Median Problem

    Given a stream of integers, calculate and print the median after each new integer is added to the stream.

    Output only the integer part of the median.

    Example:

    Input:
    N = 5  
    Stre...
  • Ans. 

    Calculate and print the median after each new integer is added to the stream.

    • Use two heaps - a max heap to store the smaller half of the numbers and a min heap to store the larger half.

    • Keep the sizes of the two heaps balanced to efficiently calculate the median.

    • If the total number of elements is odd, the median will be the top element of the max heap.

    • If the total number of elements is even, the median will be the avera

  • Answered by AI
  • Q2. 

    Pair Sum in Binary Search Tree

    Given a Binary Search Tree (BST) and a target value 'K', determine if there exist two unique elements in the BST such that their sum equals the target 'K'.

    Explanation:

    A ...

  • Ans. 

    Given a BST and a target value, determine if there exist two unique elements in the BST such that their sum equals the target.

    • Traverse the BST in-order to get a sorted array of elements.

    • Use two pointers approach to find the pair sum in the sorted array.

    • Keep track of visited elements to ensure uniqueness.

    • Handle edge cases like null nodes and empty tree.

    • Example: For input BST [20, 10, 35, 5, 15, 30, 42, -1, 13, -1, -1, -

  • Answered by AI
  • Q3. 

    Statistics From A Large Sample Task

    Calculate various statistical measures given a large sample of integers in the range [0, 255]. For efficiency, you are provided with an array 'count' where the i-th ele...

  • Ans. 

    Calculate various statistical measures given a large sample of integers in the range [0, 255] using the provided frequency array.

    • Iterate through the 'count' array to calculate minimum and maximum values.

    • Calculate the mean by summing up all values and dividing by the total count.

    • Find the median by sorting the sample and determining the middle element(s).

    • Identify the mode by finding the element with the highest frequency...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA. A puzzle was also asked.

  • Q1. 

    LRU Cache Design Question

    Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:

    1. get(key) - Return the value of the key if it exists in the cache; otherw...

  • Ans. 

    Design a Least Recently Used (LRU) cache data structure that supports get and put operations with capacity constraint.

    • Use a combination of hashmap and doubly linked list to efficiently implement the LRU cache.

    • Keep track of the least recently used item and update it accordingly when inserting new items.

    • Ensure to handle the capacity constraint by evicting the least recently used item when the cache is full.

  • Answered by AI
  • Q2. 

    Sorting of a Rotated Sorted Array Problem Statement

    You are provided with a rotated sorted array of size N. Your task is to sort the given array in increasing order.

    Example:

    Input:
    N = 4
    Array = [2, 3,...
  • Ans. 

    Implement a function to sort a rotated sorted array in increasing order without using the sort() function.

    • Find the pivot element in the rotated sorted array.

    • Split the array into two subarrays based on the pivot element.

    • Sort each subarray separately.

    • Merge the sorted subarrays to get the final sorted array.

  • Answered by AI
  • Q3. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAHike interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: There were 3 Questions . One on String manipulation and two were on Binary Trees. All were easy but there was time constraint.
Tips: Practice as many question as possible.
Duration: 60 minutes
Total Questions: 3

Round: Technical Interview
Experience: I was given the problem to design a car pooling system complete with the required classes .. data structures which would be used ... how the database would look like etc..
Tips: General understanding of databases and OOP concepts would do.

Round: Technical Interview
Tips: Be thorough and have in-depth knowledge of each and every point of your resume.

College Name: BITS Pilani

Gupshup Interview FAQs

How many rounds are there in Gupshup Product Marketing Manager interview?
Gupshup interview process usually has 3 rounds. The most common rounds in the Gupshup interview process are Resume Shortlist, Case Study and Guesstimates.
What are the top questions asked in Gupshup Product Marketing Manager interview?

Some of the top questions asked at the Gupshup Product Marketing Manager interview -

  1. No of petrol pumps in In...read more
  2. Product launch knowle...read more

Tell us how to improve this page.

Gupshup Product Marketing Manager Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more

Interview Questions from Similar Companies

BYJU'S Interview Questions
3.1
 • 2.1k Interviews
Paytm Interview Questions
3.3
 • 749 Interviews
Swiggy Interview Questions
3.8
 • 425 Interviews
PolicyBazaar Interview Questions
3.6
 • 346 Interviews
Zomato Interview Questions
3.8
 • 311 Interviews
PhonePe Interview Questions
4.0
 • 298 Interviews
Freshworks Interview Questions
3.5
 • 155 Interviews
Ola Cabs Interview Questions
3.4
 • 138 Interviews
Vyapar Interview Questions
3.4
 • 53 Interviews
View all
Gupshup Product Marketing Manager Salary
based on 5 salaries
₹21.5 L/yr - ₹30 L/yr
33% more than the average Product Marketing Manager Salary in India
View more details
Software Engineer
87 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
63 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer Level 1
36 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
34 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer2
33 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Gupshup with

Twilio

3.9
Compare

Hike

3.6
Compare

InMobi

3.5
Compare

Paytm

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview