Premium Employer

i

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

Prodapt Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Prodapt Customer Support Executive Interview Questions and Answers

Updated 22 Aug 2023

Prodapt Customer Support Executive Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
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 - HR 

(1 Question)

  • Q1. Self Information
Round 3 - Technical 

(1 Question)

  • Q1. Email technical writing

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2022. There were 3 interview rounds.

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 - Aptitude Test 

In the apptitude test you will have to answer 5 questions related to customer support

Round 3 - One-on-one 

(2 Questions)

  • Q1. Tell me about yourself
  • Q2. Why do you wanna work in customer support?

Interview Preparation Tips

Interview preparation tips for other job seekers - Try to give as much interview as you can, and join the organisation/ company which suited you the best.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2022. There were 3 interview rounds.

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 - Aptitude Test 

You will be asked 5 questions related to customer support in the aptitude test

Round 3 - One-on-one 

(2 Questions)

  • Q1. Tell me something about yourself.
  • Q2. Why do you want to work in customer support?

Interview Preparation Tips

Interview preparation tips for other job seekers - Try to give as many interviews as you can, and join and good/ reputed organisation.

I applied via Naukri.com and was interviewed in Jun 2021. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. I was asked about my experiences and skills.

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on communication skills.

I appeared for an interview in Sep 2020.

Interview Questionnaire 

1 Question

  • Q1. Oops concept, solid principles, filters in MVC, basics of Angular,life cycle hook

Interview Preparation Tips

Interview preparation tips for other job seekers - 2 rounds- both are technical.

I appeared for an interview before Oct 2021.

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 - Technical 

(2 Questions)

  • Q1. What is Nested List with example
  • Ans. 

    A nested list is a list that contains other lists as its elements.

    • Nested lists can be created using square brackets and separating the elements with commas.

    • Elements of a nested list can be accessed using indexing and slicing.

    • Example: my_list = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]

    • Accessing element 5: my_list[1][1]

  • Answered by AI
  • Q2. What is queue , explain with example
  • Ans. 

    A queue is a data structure that follows the First In First Out (FIFO) principle.

    • Elements are added to the back of the queue and removed from the front.

    • Example: A line of people waiting for a movie ticket.

    • Operations: Enqueue (add element to back), Dequeue (remove element from front), Peek (view front element)

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Data Structure should be stong
Basic python
Coding skills

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in Apr 2020. There was 1 interview round.

Interview Questionnaire 

3 Questions

  • Q1. Questions on spring boot
  • Q2. Questions on docker
  • Q3. Questions on java concepts and collections

Interview Preparation Tips

Interview preparation tips for other job seekers - I had to give one online test, two technical and one managerial which was also a bit technical. All my interview went well. They asked me my expectation before proceeding for managerial round as well as before first technical round. Once i was done with managerial round, they did not inform anything and when i queried they said my profile is on hold and looked like budget issues. I don't understand if budget is concerned, I should have been informed before itself as I gave alot of effort in that process.

I really think once a person clears the technical rounds and in last phase of interviews, this should be a little transparent.

Interview Questionnaire 

1 Question

  • Q1. Java multithreading, oops

I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Very basic technical questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Saudyaat basic well

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

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

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    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 while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd 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

Prodapt Interview FAQs

How many rounds are there in Prodapt Customer Support Executive interview?
Prodapt interview process usually has 3 rounds. The most common rounds in the Prodapt interview process are Resume Shortlist, HR and Technical.
How to prepare for Prodapt Customer Support Executive 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 Prodapt. The most common topics and skills that interviewers at Prodapt expect are non voice, chat, chat support, Email Support and customer support.

Tell us how to improve this page.

Prodapt Customer Support Executive Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
Join Prodapt Our name Prodapt comes from Proactively Adapting

Interview Questions from Similar Companies

ITC Infotech Interview Questions
3.6
 • 338 Interviews
CitiusTech Interview Questions
3.4
 • 274 Interviews
Altimetrik Interview Questions
3.8
 • 220 Interviews
Cybage Interview Questions
3.8
 • 194 Interviews
ValueLabs Interview Questions
3.7
 • 191 Interviews
Xoriant Interview Questions
4.1
 • 183 Interviews
Globant Interview Questions
3.8
 • 175 Interviews
ThoughtWorks Interview Questions
3.9
 • 149 Interviews
3i Infotech Interview Questions
3.5
 • 145 Interviews
View all

Prodapt Customer Support Executive Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

4.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Software Engineer
1.5k salaries
unlock blur

₹2.5 L/yr - ₹8.8 L/yr

Senior Software Engineer
843 salaries
unlock blur

₹3.8 L/yr - ₹15 L/yr

Associate Software Engineer
781 salaries
unlock blur

₹2.4 L/yr - ₹5.5 L/yr

Lead Engineer
470 salaries
unlock blur

₹6.9 L/yr - ₹23.1 L/yr

Senior Process Associate
270 salaries
unlock blur

₹1.4 L/yr - ₹5 L/yr

Explore more salaries
Compare Prodapt with

ITC Infotech

3.6
Compare

3i Infotech

3.5
Compare

Cybage

3.8
Compare

Xoriant

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