Upload Button Icon Add office photos
Engaged Employer

i

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

Mobikwik Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Mobikwik Software Developer Interview Questions, Process, and Tips

Updated 26 Sep 2024

Top Mobikwik Software Developer Interview Questions and Answers

  • 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 t ...read more
  • 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 ...read more
  • Q3. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array ...read more
View all 17 questions

Mobikwik Software Developer Interview Experiences

4 interviews found

I appeared for an interview 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

I appeared for an interview in Jan 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

The first round was an assessment round comprised of MCQ questions of DSA, RDBMS, MySQL questions and 2 coding questions to be written in java only

  • Q1. 

    Shortest Path in a Binary Matrix Problem Statement

    Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...

  • Ans. 

    Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

    • Use Breadth First Search (BFS) to explore all possible paths from the source cell to the destination cell.

    • Keep track of visited cells to avoid revisiting them.

    • Update the path length as you traverse through the matrix.

    • Return the shortest path length found or -1 if no valid path exists.

  • Answered by AI
  • Q2. 

    Kth Smallest Element Problem Statement

    You are provided with an array of integers ARR of size N and an integer K. Your task is to find and return the K-th smallest value present in the array. All elements...

  • Ans. 

    Find the K-th smallest element in an array of distinct integers.

    • Sort the array and return the element at index K-1.

    • Use a min-heap to find the K-th smallest element efficiently.

    • Implement quickselect algorithm for optimal performance.

  • Answered by AI
Round 2 - Telephonic Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

The basic data structure round duration 1 hour, in this Interviewer, was very friendly and asked some casual questions. After that, he asked me to code.

  • Q1. 

    Maximum Subarray Sum Problem Statement

    Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.

    Example:

    Input:
    array = [34, -50, 42, 14, -5, 86]
    Out...
  • Ans. 

    Find the maximum sum of any contiguous subarray within an array of integers.

    • Iterate through the array and keep track of the maximum sum of subarrays encountered so far.

    • At each index, decide whether to include the current element in the subarray or start a new subarray.

    • Update the maximum sum if a new maximum is found.

    • Example: For array [34, -50, 42, 14, -5, 86], the maximum sum is 137.

    • Example: For array [-5, -1, -8, -9]

  • Answered by AI
Round 3 - Telephonic Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

Advance data structure round duration 1 hour, in this Interviewer asked some basic questions on oops, puzzles and asked me to code them later.

  • Q1. 

    Reverse Linked List Problem Statement

    Given a singly linked list of integers, return the head of the reversed linked list.

    Example:

    Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
    Reversed link...
  • Ans. 

    Reverse a singly linked list of integers and return the head of the reversed linked list.

    • Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

    • Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

    • Update the head of the reversed linked list as the last node encountered during the reversal process.

  • Answered by AI
  • Q2. 

    Trapping Rain Water

    You are provided with an array ARR of integers representing an elevation map, where ARR[i] denotes the elevation of the ith bar. Determine the maximum amount of rainwater that can be t...

  • Ans. 

    Given an array representing an elevation map, find the maximum amount of rainwater that can be trapped between the bars.

    • Iterate through the array and calculate the maximum height on the left and right of each bar.

    • Calculate the trapped water by finding the minimum of the maximum heights on the left and right minus the current bar height.

    • Sum up the trapped water for all bars to get the total trapped rainwater.

    • Example: Fo...

  • Answered by AI
Round 4 - Telephonic Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Medium

Vice President interview round duration 30mins, in this round VP’s of different domains taking interview to the selected candidates.

  • Q1. 

    Buy and Sell Stock Problem Statement

    Imagine you are Harshad Mehta's friend, and you have been given the stock prices of a particular company for the next 'N' days. You can perform up to two buy-and-sell ...

  • Ans. 

    The task is to determine the maximum profit that can be achieved by performing up to two buy-and-sell transactions on a given set of stock prices.

    • Iterate through the array of stock prices to find the maximum profit that can be achieved by buying and selling stocks.

    • Keep track of the maximum profit that can be obtained by performing two transactions.

    • Consider all possible combinations of buying and selling stocks to maxim...

  • Answered by AI
Round 5 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

This round lasted for 30mins basic HR questions were asked

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Bharati Vidyapeeth's College of Engineering. Eligibility criteria7.5 CGPAMobiKwik interview preparation:Topics to prepare for the interview - Data Structures, OOPS, System Design, Algorithms, Dynamic Programming, Operating systems, DevelopmentTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare DSA well.
Tip 2 : Always remember and go through your all projects.
Tip 3 : Practice as many DSA questions as you can.

Application resume tips for other job seekers

Tip 1 : Resume should be one page only as being a fresher impacts a lot.
Tip 2 : Resumes should contain all the links for projects and certificates as it impresses the interviewer.

Final outcome of the interviewRejected

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Software Developer Interview Questions & Answers

user image Parul Mishra

posted on 26 Sep 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed before Sep 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Project discussion

I appeared for an interview 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

Mobikwik interview questions for designations

 Software Developer Intern

 (1)

 Android Developer

 (1)

 IOS Developer

 (1)

 Senior Software Engineer

 (2)

 Senior Software Engineer 2

 (1)

 Software Development Engineer 3

 (1)

 Lead Engineer

 (1)

 Security Analyst

 (1)

Interview questions from similar companies

Interview Preparation Tips

Round: Technical Interview
Experience: Finally, I got the offer from PayU. I was very Happy. Thanks AmbitionBox for helping me in my preparation

Skills: Algorithm, data structures
College Name: Na

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

Nice environment

  • Q1. 

    Zigzag Traversal of Binary Tree

    Given a binary tree with integer values in its nodes, your task is to print the zigzag traversal of the tree.

    Note:

    In zigzag order, level 1 is printed from left to right...
  • Ans. 

    Implement a function to print the zigzag traversal of a binary tree.

    • Traverse the tree level by level, alternating the direction of traversal for each level.

    • Use a queue to keep track of nodes at each level.

    • Print the nodes in zigzag order as per the given pattern.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

Nice Environment

  • Q1. 

    Prime Numbers Identification

    Given a positive integer N, your task is to identify all prime numbers less than or equal to N.

    Explanation:

    A prime number is a natural number greater than 1 that has no po...

  • Ans. 

    Identify all prime numbers less than or equal to a given positive integer N.

    • Iterate from 2 to N and check if each number is prime

    • Use the Sieve of Eratosthenes algorithm for better efficiency

    • Optimize by only checking up to the square root of N for divisors

  • Answered by AI
  • Q2. What was the use of DBMS in your project, and how did you handle the problems that arose?
  • Ans. 

    DBMS was used to store and manage data in the project, handled problems by optimizing queries and database design.

    • Used DBMS to store and manage project data efficiently

    • Optimized queries for better performance

    • Designed database schema to handle data effectively

    • Resolved concurrency issues by implementing proper locking mechanisms

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPayU interview preparation:Topics to prepare for the interview - Array ,DP ,Graph ,Recursion, Tree ,Queue,BSTTime required to prepare for the interview - 1.5 monthsInterview preparation tips for other job seekers

Tip 1 : Do atleast 1 good projects
Tip 2 : Practice Atleast 300 Questions
Tip 3 : Should be able to explain your project

Application resume tips for other job seekers

Tip 1 : Always be true with the resume
Tip 2 : Do not put false things on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Sort array of cards in color red , blue,green
  • Ans. 

    Sort array of cards in red, blue, green colors.

    • Use a custom sorting function to sort the array based on color order.

    • Assign a numerical value to each color (e.g. red: 0, blue: 1, green: 2) and sort based on these values.

    • Implement a sorting algorithm like bubble sort or quicksort to rearrange the array based on color order.

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Job Portal and was interviewed in Dec 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Find Target Element in a rotating sorted Array.
  • Ans. 

    Search for target element in a rotated sorted array.

    • Use binary search to find the pivot point where rotation happens.

    • Divide the array into two subarrays and perform binary search on the appropriate subarray.

    • Handle cases where the target element is on the left or right side of the pivot.

  • Answered by AI

I appeared for an interview in May 2022.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

DS/Algo Questions 
2 questions

  • Q1. 

    Hurdle Game Problem Statement

    Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).

    Given the total number ...

  • Ans. 

    The task is to determine the number of levels cleared by Kevin based on the total number of hurdles he has jumped.

    • Each level 'i' has 'i' hurdles, so Kevin can only reach level 'i' if he has cleared level 'i-1'.

    • Count the number of levels cleared by dividing the total number of hurdles by the sum of the first 'n' natural numbers.

    • The formula to calculate the sum of the first 'n' natural numbers is (n * (n + 1)) / 2.

  • Answered by AI
  • Q2. 

    Last Stone Weight Problem Explanation

    Given a collection of stones, each having a positive integer weight, perform the following operation: On each turn, select the two heaviest stones and smash them toge...

  • Ans. 

    This question is about finding the weight of the last stone after repeatedly smashing the two heaviest stones together.

    • Sort the array of stone weights in descending order.

    • Repeatedly smash the two heaviest stones together until there is at most 1 stone left.

    • If there is 1 stone left, return its weight. Otherwise, return 0.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

Live coding

  • Q1. 

    Rearrange Odd and Even Position Nodes in Linked List

    Rearrange a linked list such that all nodes at odd positions are together, followed by all nodes at even positions. You need to return the head of the ...

  • Ans. 

    The task is to rearrange a linked list such that all odd position nodes are together and all even position nodes are together.

    • Create two separate linked lists, one for odd position nodes and one for even position nodes.

    • Traverse the original linked list and add the nodes to their respective lists based on their position.

    • Join the two lists together by pointing the last node of the odd list to the head of the even list.

    • Re...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. How would you design a system like Zomato?
  • Ans. 

    Design Zomato - a food delivery platform

    • Zomato is a platform that connects users with restaurants for food delivery

    • Users can search for restaurants, view menus, and place orders

    • Restaurants can register, manage their menus, and receive orders

    • Delivery partners can sign up to deliver orders

    • Payment integration is required for seamless transactions

    • User reviews and ratings can be implemented for restaurant feedback

    • Location-b...

  • Answered by AI
Round 4 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

Cultural

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaHiring ChallengeRupeek interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Graph Theory, Python, Object Oriented ProgrammingTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Prepare for DA/Algo online consistently.
Tip 2 : During interviews, do not hesitate to clarify your doubts, if any. Be in constant communication, explain your thought process.
Tip 3 : Have strong grasp on domain and technologies. Quality over Quantity

Application resume tips for other job seekers

Tip 1 : Have super clear idea about the projects you've been part of in case of any cross questions.
Tip 2 : Along with your role do describe how you increased the throughput or reduced cost.

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. Basic DSA Question
Round 2 - Technical 

(1 Question)

  • Q1. Mobile Development Related Questions
Round 3 - HR 

(1 Question)

  • Q1. Basic HR Questions

Mobikwik Interview FAQs

How many rounds are there in Mobikwik Software Developer interview?
Mobikwik interview process usually has 1 rounds. The most common rounds in the Mobikwik interview process are Technical.
How to prepare for Mobikwik Software Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Mobikwik. The most common topics and skills that interviewers at Mobikwik expect are API, Algorithms, Data Structures, Distribution System and Java.

Tell us how to improve this page.

Mobikwik Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Mobikwik Software Developer Salary
based on 49 salaries
₹7.9 L/yr - ₹30.6 L/yr
111% more than the average Software Developer Salary in India
View more details

Mobikwik Software Developer Reviews and Ratings

based on 8 reviews

4.5/5

Rating in categories

4.8

Skill development

4.1

Work-life balance

4.1

Salary

4.4

Job security

4.3

Company culture

4.3

Promotions

4.3

Work satisfaction

Explore 8 Reviews and Ratings
Team Lead
69 salaries
unlock blur

₹2.2 L/yr - ₹7 L/yr

Assistant Manager
56 salaries
unlock blur

₹4.5 L/yr - ₹12.6 L/yr

Senior Executive
55 salaries
unlock blur

₹2.7 L/yr - ₹6.7 L/yr

Software Developer
49 salaries
unlock blur

₹7.9 L/yr - ₹30.6 L/yr

Software Development Engineer II
48 salaries
unlock blur

₹11 L/yr - ₹30 L/yr

Explore more salaries
Compare Mobikwik with

Paytm

3.3
Compare

Freecharge

3.8
Compare

HighRadius

2.9
Compare

Razorpay

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