Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Travclan Technology India Team. If you also belong to the team, you can get access from here

Travclan Technology India Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Travclan Technology India Associate Product Manager Interview Questions and Answers

Updated 22 May 2024

Travclan Technology India Associate Product Manager Interview Experiences

1 interview found

Interview experience
2
Poor
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Nov 2023. There was 1 interview round.

Round 1 - Technical 

(3 Questions)

  • Q1. My roles and responsibilities
  • Q2. 3 good thing about current company
  • Q3. 3 bad thing about current company

Interview questions from similar companies

Interview Questionnaire 

7 Questions

  • Q1. Basic Introduction and in-depth questions related to current job role
  • Q2. Case based interviews on payment solutions
  • Q3. Guesstimates on creating parking space for an airport
  • Ans. 

    Creating parking space for an airport

    • Determine the number of expected passengers and their mode of transportation

    • Calculate the average parking space required per vehicle type

    • Identify the available land and its capacity for parking

    • Consider the traffic flow and accessibility to the airport

    • Evaluate the cost and feasibility of constructing a parking structure

    • Explore alternative transportation options such as shuttle servic

  • Answered by AI
  • Q4. Problem solving approach and stakeholder management was judged via a case based interview
  • Q5. Submission of a case study on invoicing solutions and the feasibility of building the same
  • Q6. Reasons for looking for a switch
  • Ans. 

    Looking for new challenges and growth opportunities

    • Desire to work on more complex projects

    • Seeking a company with a strong culture and values

    • Want to learn new skills and technologies

    • Opportunity for career advancement

    • Geographical relocation

    • Better work-life balance

  • Answered by AI
  • Q7. Why Cashfree and why Fintech?
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Case Study 

As per prior work exp

Interview Preparation Tips

Interview preparation tips for other job seekers - Mostly the Interview questions are based on your previous experience
Interview experience
4
Good
Difficulty level
Easy
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Aug 2023. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Current work related questions
Round 2 - Technical 

(1 Question)

  • Q1. Current work related questions
Round 3 - HR 

(1 Question)

  • Q1. Current work related questions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Nov 2023. There was 1 interview round.

Round 1 - Aptitude Test 

1hr aptitude + coding

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. Experience and hobbies
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

OnlineCoding Test for 60 mins

Round 2 - Technical 

(1 Question)

  • Q1. 2 DSA question for 1 hour
Round 3 - Technical 

(1 Question)

  • Q1. Technical Question around CS concepts

I was interviewed in Mar 2021.

Round 1 - Video Call 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Started with projects discussion and internships and moved forward with coding problems.
It started at around 6:00 PM and lasted for 90 minutes approximately
The interviewer was very cool, he even gave me some tips on improving myself further at the end of the interview.

  • Q1. 

    Longest Substring with At Most K Distinct Characters

    Given a string S of length N and an integer K, find the length of the longest substring that contains at most K distinct characters.

    Input:

    The first...
  • Ans. 

    Find the length of the longest substring with at most K distinct characters in a given string.

    • Use a sliding window approach to keep track of the characters and their counts within the window.

    • Maintain a hashmap to store the characters and their frequencies.

    • Update the window size and characters count as you iterate through the string.

    • Return the maximum window size encountered for each test case.

  • Answered by AI
  • Q2. 

    Maximum Frequency Number Problem Statement

    Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.

    If multip...

  • Ans. 

    Find the number with the maximum frequency in an array of integers.

    • Iterate through the array and keep track of the frequency of each number using a hashmap.

    • Find the number with the maximum frequency and return it.

    • If multiple elements have the same maximum frequency, return the one that appears first.

  • Answered by AI
  • Q3. 

    Ninja and Bombs Problem Statement

    Ninja wants to travel from his house to his best friend's house. The locations of the houses are on a 2D coordinate plane, where Ninja's house is located at the origin (0...

  • Ans. 

    Determine if Ninja can reach his friend's house with even x-coordinate without using modulus operator.

    • Check if the x-coordinate is even or odd by using bitwise AND operation with 1.

    • Return 1 if x-coordinate is even, else return 0.

    • Handle multiple test cases by iterating through each input.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I was asked a coding question then, a system design question and some basic operating systems and oops questions

  • Q1. 

    Find Duplicates in an Array

    Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.

    Return the duplicate elements in any orde...

  • Ans. 

    Find duplicates in an array of integers within a specified range.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Return elements with count greater than 1 as duplicates.

    • Time complexity can be optimized to O(N) using a set to store seen elements.

  • Answered by AI
  • Q2. Can you design a Google Search Engine?
  • Ans. 

    Designing a Google Search Engine involves creating a web crawler, indexing system, and ranking algorithm.

    • Develop a web crawler to discover and retrieve web pages.

    • Implement an indexing system to store and organize the content of web pages.

    • Design a ranking algorithm to determine the relevance of search results.

    • Include features like autocomplete, spell check, and personalized search results.

    • Optimize for speed and scalabil...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaNo CriteriaMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, System Design, Operating SystemsTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice data structures problems
Tip 2 : Read about System Designs
Tip 3 : Study the popular algorithms

Application resume tips for other job seekers

Tip 1 : Mention your projects
Tip 2 : Mention your internships

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

Only Java allowed

  • Q1. 

    Sort 0 and 1 Problem Statement

    Given an integer array ARR of size N containing only integers 0 and 1, implement a function to sort this array. The solution should scan the array only once without using an...

  • Ans. 

    Sort an array of 0s and 1s in linear time without using additional arrays.

    • Iterate through the array and maintain two pointers, one for 0s and one for 1s.

    • Swap elements at the two pointers based on the current element being 0 or 1.

    • Continue this process until the entire array is sorted in place.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Basic intro and coding questions

  • Q1. 

    Valid Perfect Square Check

    An integer N is provided, and the task is to determine if N is a perfect square. A perfect square refers to an integer which can be expressed as the square of another integer.

    ...

  • Ans. 

    Implement a function to check if a given integer is a perfect square.

    • Create a function that takes an integer as input and returns true if it is a perfect square, false otherwise.

    • Iterate through possible square roots of the input integer and check if the square of the root equals the input.

    • Return true if a perfect square is found, false otherwise.

  • Answered by AI
  • Q2. 

    Merge Sort Problem Statement

    Given a sequence of numbers 'ARR', your task is to return a sorted sequence of 'ARR' in non-descending order using the Merge Sort algorithm.

    Example:

    Input:
    ARR = [5, 3, 8,...
  • Ans. 

    Implement Merge Sort algorithm to sort a given sequence of numbers in non-descending order.

    • Merge Sort is a divide-and-conquer algorithm that splits the array into two halves, recursively sorts each half, and then merges the sorted halves back together.

    • Time complexity of Merge Sort is O(n log n) in the worst case scenario.

    • It is a stable sorting algorithm, meaning that the relative order of equal elements is preserved.

    • Ex...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

More difficult than the previous round

  • Q1. 

    Bottom View of Binary Tree Problem Statement

    Given a binary tree, the task is to print its bottom view from left to right. Assume the left and the right child nodes make a 45-degree angle with their paren...

  • Ans. 

    The task is to print the bottom view of a binary tree from left to right.

    • Traverse the binary tree in level order and keep track of the horizontal distance of each node from the root.

    • Store the nodes at each horizontal distance in a map, updating it as you traverse the tree.

    • After traversal, extract the bottom-most nodes at each horizontal distance to get the bottom view sequence.

  • Answered by AI
Round 4 - Face to Face 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

There were no DSA questions. My interviews were based on android app development. The interviewer presented scenarios and asked how will you solve them. No particular correct answer was expected just the best approach as per me.

  • Q1. How would you implement multiple RecyclerViews on a magnified screen in an Android application?
  • Ans. 

    Implement multiple RecyclerViews on a magnified screen in an Android app by adjusting item sizes and spacing.

    • Adjust item sizes and spacing based on screen magnification level

    • Use nested RecyclerViews or custom layouts to display multiple lists

    • Implement custom item decorators to manage spacing between RecyclerViews

    • Consider using a GridLayoutManager with custom span sizes for each RecyclerView

  • Answered by AI
  • Q2. How would you implement various activities related to cart functionality in an e-commerce application?
  • Ans. 

    Implementing cart functionality in an e-commerce application involves managing user interactions, updating quantities, handling discounts, and processing orders.

    • Create a data structure to store cart items, quantities, and prices.

    • Implement add to cart, remove from cart, and update quantity functionalities.

    • Handle discounts, promotions, and coupon codes.

    • Calculate total price, including taxes and shipping costs.

    • Implement c...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

HR asked questions about why Mobikwik, what's your goal, how are you a good fit, etc.

Interview Preparation Tips

Eligibility criteriaCGPA - 7 & above, Active backlogs - NoneMobiKwik interview preparation:Topics to prepare for the interview - Basic DSA, Arrays, String, Trees, Problem SolvingTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Prepare advanced array questions
Tip 2 : Trees basic to medium questions
Tip 3 : Optimize solutions

Application resume tips for other job seekers

Tip 1 : Internship experience
Tip 2 : Personal Projects (remember proper details)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. How to improve chrome browser
  • Ans. 

    Improve Chrome browser by optimizing performance, enhancing security, and adding new features.

    • Optimize memory usage to improve performance

    • Enhance security by regularly updating security protocols

    • Add new features like built-in ad blocker or improved tab management

    • Improve compatibility with web standards and technologies

  • Answered by AI

Skills evaluated in this interview

Travclan Technology India Interview FAQs

How many rounds are there in Travclan Technology India Associate Product Manager interview?
Travclan Technology India interview process usually has 1 rounds. The most common rounds in the Travclan Technology India interview process are Technical.

Tell us how to improve this page.

Travclan Technology India Associate Product Manager Interview Process

based on 1 interview

Interview experience

2
  
Poor
View more

Interview Questions from Similar Companies

Paytm Interview Questions
3.3
 • 776 Interviews
Razorpay Interview Questions
3.6
 • 150 Interviews
BCD Travel Interview Questions
4.3
 • 111 Interviews
Mobikwik Interview Questions
4.1
 • 47 Interviews
Pickyourtrail Interview Questions
3.6
 • 20 Interviews
BillDesk Interview Questions
3.2
 • 14 Interviews
View all
Travclan Technology India Associate Product Manager Salary
based on 6 salaries
₹7.5 L/yr - ₹23 L/yr
15% more than the average Associate Product Manager Salary in India
View more details
Operations Associate
68 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Financial Associate
22 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Accounts Manager
21 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Development Associate
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Travclan Technology India with

Razorpay

3.6
Compare

Paytm

3.3
Compare

Cashfree Payments

3.5
Compare

Instamojo

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