Upload Button Icon Add office photos

Filter interviews by

CouponDunia Interview Questions and Answers

Updated 7 Jun 2015

17 Interview questions

A Software Engineer was asked
Q. Given an employee table with employee name and salary, find the 2nd highest salary in SQL.
Ans. 

Find the 2nd highest salary from an employee table in SQL.

  • Use the SELECT statement to retrieve the salaries in descending order.

  • Use the LIMIT keyword to limit the result set to the second row.

  • Use a subquery to exclude the highest salary from the result set.

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given an array of distinct positive numbers, find the maximum sum of elements such that no two elements occurring in the maximum sum set are adjacent to each other.
Ans. 

Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.

  • Use dynamic programming to keep track of the maximum sum at each index

  • At each index, choose between including the current element or skipping it

  • The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i

  • Return the maximum sum at the last index

View all Software Engineer interview questions
A Software Engineer was asked
Q. How can you improve coupon suggestions for users?
Ans. 

Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.

  • Collect user data such as purchase history, search history, and demographics

  • Use machine learning algorithms to analyze the data and identify patterns

  • Create personalized coupon suggestions based on the identified patterns

  • Regularly update and refine the algorithm to improve accuracy

  • Allow users to provide feedback...

View all Software Engineer interview questions
A Software Engineer was asked
Q. Solve it without using an array (in case the solution is - Inorder traversal should be in sorted order)?
Ans. 

Solution for inorder traversal in sorted order without using array

  • Implement a binary search tree and perform inorder traversal

  • Use a stack to simulate the recursive function call stack

  • Maintain a variable to keep track of the previously visited node

  • Compare the current node with the previously visited node to check if it is in sorted order

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given an array, determine the pattern it follows. The possible patterns are: increasing, decreasing, increase then decrease, and decrease then increase.
Ans. 

Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.

  • Iterate through the array and compare each element to the previous one.

  • If all elements are increasing, it follows the increasing pattern.

  • If all elements are decreasing, it follows the decreasing pattern.

  • If there is a point where the elements start decreasing after increasing, it f...

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given a binary tree, how would you identify whether it is a Binary Search Tree or not?
Ans. 

To identify whether a binary tree is a Binary Search Tree or not.

  • Check if the left subtree is a Binary Search Tree

  • Check if the right subtree is a Binary Search Tree

  • Check if the root node is greater than all the nodes in the left subtree

  • Check if the root node is less than all the nodes in the right subtree

View all Software Engineer interview questions
A Software Engineer was asked
Q. Given a BST, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?
Ans. 

Convert a BST to a binary tree with each element replaced by sum of all greater elements.

  • Traverse the BST in reverse inorder and keep track of the sum of all greater elements.

  • Replace each node's value with the sum and update the sum.

  • Recursively perform the above steps on left and right subtrees.

  • Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.

View all Software Engineer interview questions
Are these interview questions helpful?
A Software Developer was asked
Q. Given a string, find the length of the longest substring where no character repeats twice.
Ans. 

Find length of longest string with no repeating characters.

  • Use a hash set to keep track of seen characters.

  • Iterate through the string and update the hash set and length.

  • Return the maximum length found.

A Software Developer was asked
Q. Write a function to add two numbers without using arithmetic operators.
Ans. 

Adding two numbers without arithmetic operators.

  • Use bitwise operators like XOR, AND, and left shift.

  • Add the two numbers using XOR and AND, then left shift the carry and add again until there is no carry.

  • Example: 5 + 3 = 8. 5 in binary is 101, 3 in binary is 011. XOR gives 110, AND gives 001, left shift gives 010.

  • Example continued: XOR 110 and 010 gives 100, AND 110 and 010 gives 010, left shift gives 1000. No carr...

A Software Developer was asked
Q. Given a binary tree, print its bottom view.
Ans. 

Print the bottom view of a tree.

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

  • Store the horizontal distance and node value in a map.

  • Print the node values in the map for the minimum and maximum horizontal distance for each level.

CouponDunia Interview Experiences

5 interviews found

Interview Preparation Tips

Round: Round 1:
Experience: It was 5 question screening round which was meant to know about my expectations from the organization.

Round: Round 2:
Experience: Online Coding round on Hackerrank3 coding coding questions:
– Run length Encoding of string with slight modification
– Finding buying day and selling day for a given set of days such that the profit of the buyer is maximum .
– Given a set of keywords and a long string, break the long string such that the split words are from the keywords onlyQuestions were fairly simple but test cases were very nice.

Round: Round 3:
Experience: 1st InterviewThe interview went for about 1 hr and was completely technical. The questions asked were:
– Given a binary tree how would you identify whether it is a Binary Search tree or not?
I gave the answer using inorder traversal.– given a bst, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?– Given an employee table with employee name and salary find the 2nd highest salary.
I gave the vague answer of using inner query then he asked if instead of 2nd its nth highest then what would I do. After sometime I asked for the keyword (which was LIMIT) and then I wrote the query which was almost syntactically correct.– The answer to the question of binary tree, he asked me if I could solve it without using any space (my previous solution took O(n) space)?
I was writing the solution and in between he said to stop and asked me if I have any question.

Round: Round 4: Java application development
Experience: Imagine we have an Email Queue table in our database with each row representing an email that needs sending. Table Name: EmailQueue Columns: id, from_email_address, to_email_address, subject, body (you can also add columns as you wish, but at minimum it should have these columns). Write a java program that will read from this table and send the emails over an SMTP server (not local unix mail). For the SMTP sending you can use a pre-existing library of your choice, if you wish. Please take into consideration the following:Speed is of the utmost concern. Imagine we have 1 million emails to send. Your code should not sequentially send one email after another.Your solution should scale. In other words, if we determine the fastest we can send emails from a single server is 300 emails/second I should be able to run the same Java program on another server and be able to send another 300 emails/second.Your code should be careful to ensure that it is not possible for the same email to be sent twice (especially when running multiple processes of the program).Don’t worry about whether the SMTP server can handle the load. It can.Order emails are sent is not necessarily important. In other words, even though I’m calling this a “queue” it’s not important to guarantee that emails are sent in the order they arequeued.Comment your code extensively.Once again, speed is the primary concern. So do remember to think about what the slow points in the email sending process could be and take efforts to minimize those pain points.Send me instructions on how to compile/run/test your code along with the code itself. Also the sql statements for me to create the table that you are working with and the sql statements to insert a few test emails.

Round: Round 5: Final interview
Experience: It was of about 1 hr on soft and technical skills. Questions asked include:– Tell be about yourself?
– given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase.
– Given an array of distinct positive numbers find the maximum sum of elements such that no 2 elements occurring in the maximum sum set is adjacent to each other.
I gave an incorrect answer and then I realised it, so I asked to rectify and she allowed me to do so.
– How can you improve suggestions of coupons to the users?
This discussion went for about 20 mins.

College Name: NA

Interview Questions & Answers

user image Anonymous

posted on 9 May 2015

Interview Preparation Tips

Round: Online Coding Test on Hacker Rank
Experience: This round consist of 3 question out of which two was easy and one was mediumQ1. Run length Encoding of string with slight modificationQ2. It was easy question dint rememberQ3. A DP question variation of word break problemI did all the 3 questions and get call for the telephonic interview.

Round: Telephonic with real time coding with code pair
Experience: Q1. -----. ----- sql query to find 2nd highest salary and 6th highest salaryQ4 6 pirate problem

College Name: NA

Interview Questions & Answers

user image Anonymous

posted on 11 May 2015

Interview Questionnaire 

8 Questions

  • Q1. Tell me about yourself?
  • Ans. 

    I am a highly motivated individual with a passion for learning and achieving my goals.

    • I have a Bachelor's degree in Computer Science

    • I have completed several internships in software development

    • I am proficient in multiple programming languages including Java and Python

    • I enjoy working in a team environment and collaborating with others to solve problems

    • I am always looking for new challenges and opportunities to grow

  • Answered by AI
  • Q2. Print the bottom view of the tree?
  • Ans. 

    Print the bottom view of a tree.

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

    • Store the horizontal distance and node value in a map.

    • Print the node values in the map for the minimum and maximum horizontal distance for each level.

  • Answered by AI
  • Q3. Given a bst, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it+ its own sum?
  • Ans. 

    Convert a BST to a binary tree with each element replaced by the sum of all greater elements + its own sum.

    • Traverse the BST in reverse order (right, root, left)

    • Keep track of the sum of all greater elements seen so far

    • Update the current node's value with the sum of all greater elements seen so far + its own value

    • Recursively convert the right and left subtrees

  • Answered by AI
  • Q4. Add two numbers without using arithmetic operators?
  • Ans. 

    Adding two numbers without arithmetic operators.

    • Use bitwise operators like XOR, AND, and left shift.

    • Add the two numbers using XOR and AND, then left shift the carry and add again until there is no carry.

    • Example: 5 + 3 = 8. 5 in binary is 101, 3 in binary is 011. XOR gives 110, AND gives 001, left shift gives 010.

    • Example continued: XOR 110 and 010 gives 100, AND 110 and 010 gives 010, left shift gives 1000. No carry, so...

  • Answered by AI
  • Q5. Quicksort takes O(n2) when elements are sorted what is the solution to reduce it to O(nlogn)?the interview was quite easy. GUYS I WOULD LIKE TO FOCUS THAT PREPARE “tell me about yourself” VERY WELL. Tell t...
  • Ans. 

    Use randomized pivot selection to avoid worst-case scenario

    • Randomly select a pivot element instead of always choosing the first or last element

    • This reduces the likelihood of selecting a pivot that is already in its correct position

    • Example: Instead of always choosing the first element as pivot, randomly select an element between the first and last element

    • This ensures that the worst-case scenario of O(n^2) is avoided and...

  • Answered by AI
  • Q6. Given a string, find the length of longest string where no character repeats twice?
  • Ans. 

    Find length of longest string with no repeating characters.

    • Use a hash set to keep track of seen characters.

    • Iterate through the string and update the hash set and length.

    • Return the maximum length found.

  • Answered by AI
  • Q7. There is a dictionary with few words each of length 3 and start and finish word is given. You can reach from one word to another word by changing only one digit. Like from cat, you can reach to hat or bat ...
  • Ans. 

    Minimum number of steps to reach finish word from start word in a dictionary with words of length 3 and changing only one digit.

    • Use BFS algorithm to find the shortest path

    • Create a graph with words as nodes and edges between words that differ by only one character

    • Start BFS from the start word and stop when the finish word is found

    • Return the length of the path from start to finish word

  • Answered by AI
  • Q8. Given an array. find the pattern it follows?
  • Ans. 

    Finding pattern in an array of strings.

    • Look for common prefixes or suffixes

    • Check for repeating patterns

    • Analyze the length of strings

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Q1. fishes of different length are given. you have to find out how many fishes can she get of length 10 by making cuts on fish, where number of cuts are limited? ex. 20 30 15(lengths) and number of cuts=3

Ans. : 5 (20—-2(one cut of 10 10) and 30—-(2 cuts of 10 10 10))Q2. minimum jump to reach the destination problem.
Duration: 90 minutes
Total Questions: 3

Round: Technical Interview
Tips: there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase.

College Name: NA

Skills evaluated in this interview

Interview Questions & Answers

user image Anonymous

posted on 12 May 2015

Interview Questionnaire 

9 Questions

  • Q1. Tell me about yourself
  • Ans. 

    I am a highly motivated individual with a passion for learning and growth.

    • I have a degree in computer science and have worked as a software developer for 3 years.

    • I am proficient in several programming languages including Java, Python, and C++.

    • I am a quick learner and enjoy taking on new challenges.

    • In my free time, I enjoy hiking and playing guitar.

  • Answered by AI
  • Q2. What is AJAX?
  • Ans. 

    AJAX stands for Asynchronous JavaScript and XML. It is a technique used for creating fast and dynamic web pages.

    • AJAX allows web pages to update asynchronously by exchanging small amounts of data with the server behind the scenes.

    • It uses XMLHttpRequest object to communicate with the server.

    • AJAX can be used to create interactive web applications that can update data without reloading the entire page.

    • Examples of AJAX-base...

  • Answered by AI
  • Q3. About my projects (in detail)
  • Q4. Given an array, print the Next Greater Element (NGE) for every element. If it doesn’t exceed then print -1. They asked me to write full code
  • Ans. 

    Print the Next Greater Element (NGE) for every element in an array. If it doesn’t exceed then print -1.

    • Iterate through the array and for each element, find the next greater element using a stack.

    • If the next greater element is found, print it. Otherwise, print -1.

    • Time complexity: O(n)

  • Answered by AI
  • Q5. Explain the working of AJAX in detail
  • Ans. 

    AJAX is a technique for creating fast and dynamic web pages without reloading the entire page.

    • AJAX stands for Asynchronous JavaScript and XML

    • It allows for asynchronous communication between the client and server

    • Data is sent and received in the background without interrupting the user's experience

    • AJAX is commonly used for auto-suggest search boxes, real-time updates, and form submissions

    • Examples of AJAX frameworks inclu...

  • Answered by AI
  • Q6. There is a dictionary with few words each of length 3 and start and finish word is given. You can reach from one word to another word by changing only one digit. Like from cat, you can reach to hat or bat ...
  • Ans. 

    Find the minimum number of steps to reach a finish word from a start word by changing only one digit at a time.

    • Use breadth-first search algorithm to find the shortest path.

    • Create a graph with words as nodes and edges between words that differ by one character.

    • Start from the start word and explore all its neighbors, then move to their neighbors and so on until the finish word is found.

    • Keep track of visited nodes to avoi...

  • Answered by AI
  • Q7. Here is a hotel with 100 rooms in it and some check in and check outs of different guests are given. You do not want to use all the rooms. So you have to make the arrangement in minimum number of rooms. Wh...
  • Q8. You have a database table and a search box. As you type in the search box, it should show the suggestions from that database table. How will you do that? Explain in detail
  • Q9. Explain Auto Complete system (like Google search suggestion)
  • Ans. 

    Auto Complete system suggests possible search queries as the user types.

    • Uses algorithms to predict and suggest search queries based on user input

    • Saves time and effort for users by providing relevant suggestions

    • Can be based on user history, location, and other factors

    • Examples include Google search suggestion, YouTube search suggestion, and Amazon search suggestion

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Coding Test on HackerRank.Three question in 90 minutes.
Duration: 90 minutes

Round: TECHNICAL INTERVIEW
Experience: Imagine we have an Email Queue table in our database with each row representing an email that needs sending. Table Name: EmailQueue Columns: id, from_email_address, to_email_address, subject, body (you can also add columns as you wish, but at minimum it should have these columns). Write a java program that will read from this table and send the emails over an SMTP server (not local unix mail). For the SMTP sending you can use a pre-existing library of your choice, if you wish. Please take into consideration the following:Speed is of the utmost concern. Imagine we have 1 million emails to send. Your code should not sequentially send one email after another.Your solution should scale. In other words, if we determine the fastest we can send emails from a single server is 300 emails/second I should be able to run the same Java program on another server and be able to send another 300 emails/second.Your code should be careful to ensure that it is not possible for the same email to be sent twice (especially when running multiple processes of the program).Don’t worry about whether the SMTP server can handle the load. It can.Order emails are sent is not necessarily important. 
In other words, even though I’m calling this a “queue” it’s not important to guarantee that emails are sent in the order they arequeued.Comment your code extensively.Once again, speed is the primary concern. So do remember to think about what the slow points in the email sending process could be and take efforts to minimize those pain points.Send me instructions on how to compile/run/test your code along with the code itself. Also the sql statements for me to create the table that you are working with and the sql statements to insert a few test emails.

Round: Technical Interview
Experience: Outptu: 5, 5Difference between program, process and threads.How will you display the most popular coupons on the CouponDunia website? What approach will you follow?Let’s say that you have 25 horses, and you want to pick the fastest 3 horses out of those 25. In each race, only 5 horses can run at the same time because there are only 5 tracks. What is the minimum number of races required to find the 3 fastest horses without using a stopwatch? (-----.php/puzzles/25-horses-3-fastest-5-races-puzzle)Implement queue with the help of two stacks.Given a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number.What is left join. Give example.What is magic functions and autoloading in PHP?What is SQL injection?Given three arrays sorted in non-decreasing order, print all common elements in these arrays.

Examples:

ar1[] = {1, 5, 10, 20, 40, 80}

ar2[] = {6, 7, 20, 80, 100}

ar3[] = {3, 4, 15, 20, 30, 70, 80, 120}

Output: 20, 80

ar1[] = {1, 5, 5}

ar2[] = {3, 4, 5, 5, 10}

ar3[] = {5, 5, 10, 20}

Outptu: 5, 5Difference between program, process and threads.How will you display the most popular coupons on the CouponDunia website? What approach will you follow?

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

8 Questions

  • Q1. Given a binary tree how would you identify whether it is a Binary Search tree or not?
  • Ans. 

    To identify whether a binary tree is a Binary Search Tree or not.

    • Check if the left subtree is a Binary Search Tree

    • Check if the right subtree is a Binary Search Tree

    • Check if the root node is greater than all the nodes in the left subtree

    • Check if the root node is less than all the nodes in the right subtree

  • Answered by AI
  • Q2. Solve it without using array (in case the solution is - Inorder traversal should be in sorted order)?
  • Ans. 

    Solution for inorder traversal in sorted order without using array

    • Implement a binary search tree and perform inorder traversal

    • Use a stack to simulate the recursive function call stack

    • Maintain a variable to keep track of the previously visited node

    • Compare the current node with the previously visited node to check if it is in sorted order

  • Answered by AI
  • Q3. Given a BST, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?
  • Ans. 

    Convert a BST to a binary tree with each element replaced by sum of all greater elements.

    • Traverse the BST in reverse inorder and keep track of the sum of all greater elements.

    • Replace each node's value with the sum and update the sum.

    • Recursively perform the above steps on left and right subtrees.

    • Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.

  • Answered by AI
  • Q4. Given an employee table with employee name and salary find the 2nd highest salary in sql?
  • Ans. 

    Find the 2nd highest salary from an employee table in SQL.

    • Use the SELECT statement to retrieve the salaries in descending order.

    • Use the LIMIT keyword to limit the result set to the second row.

    • Use a subquery to exclude the highest salary from the result set.

  • Answered by AI
  • Q5. Tell be about yourself?
  • Ans. 

    I am a software engineer with experience in developing web applications and a passion for problem-solving.

    • Experienced in developing web applications using languages such as Java, Python, and JavaScript

    • Proficient in using frameworks such as Spring, Django, and React

    • Strong problem-solving skills and ability to work in a team environment

    • Passionate about learning new technologies and keeping up with industry trends

  • Answered by AI
  • Q6. Given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase
  • Ans. 

    Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.

    • Iterate through the array and compare each element to the previous one.

    • If all elements are increasing, it follows the increasing pattern.

    • If all elements are decreasing, it follows the decreasing pattern.

    • If there is a point where the elements start decreasing after increasing, it follow...

  • Answered by AI
  • Q7. Given an array of distinct positive numbers find the maximum sum of elements such that no 2 elements occurring in the maximum sum set is adjacent to each other
  • Ans. 

    Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.

    • Use dynamic programming to keep track of the maximum sum at each index

    • At each index, choose between including the current element or skipping it

    • The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i

    • Return the maximum sum at the last index

  • Answered by AI
  • Q8. How can you improve suggestions of coupons to the users?
  • Ans. 

    Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.

    • Collect user data such as purchase history, search history, and demographics

    • Use machine learning algorithms to analyze the data and identify patterns

    • Create personalized coupon suggestions based on the identified patterns

    • Regularly update and refine the algorithm to improve accuracy

    • Allow users to provide feedback on t...

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Tips: - Keep your resume as compact as possible- Try to keep requirements of the profile in your resume- Survey on how much the company is paying in the market and then state your expected CTC in the range of +/- 2 LPA.

Round: Test
Experience: 2 questions were a bit easy and the 3rd one was a little tricky for the people who are afraid of recursive programming. All the questions are provided in the link here: -----/
Tips: - Programming experience or programmer's help ( :p ) was the only way out of it.- Try to solve problems which you can solve first rather than hanging on any tough problem, because people solving 2/3 questions were also selected for the next round.
Duration: 90 minutes
Total Questions: 3

Round: Technical Interview
Experience: The interviewer was very helpful in guiding, motivating and giving me time to solve the problems. It went quite smoothly and within days I was selected for the next interview.
Tips: - Never speak without thinking unless said to speak what you are thinking.- Try to clarify your doubts before you jump into solving questions asked.- If you are taking any assumption, forget not to notify it to the interviewer.

Round: App development
Experience: I was made to develop a Java application within a week and submit it with proper documentation. It was very interesting app and I learned tons of things while developing.
Tips: - Try to do your task by yourself.- Keep your code as clean and OOP-like as possible- Make your friend read your documentation you prepared to know if it is understandable.- Use git or any other VCS while developing to ensure fallback in case the application breaks down (which usually happens during development).

Round: Technical Interview
Experience: This was exactly like a last gateway to cross for entering into the company. The interviewer was modest and calm, watching all my steps that I take while solving the problem. Twisting problems and guiding me to unwind the twists. At the end...a great experience!
Tips: Same as the above interview tips, nothing much is required for any technical interview (if you ask me).

Skills: Programming, Java application development, Learning/Grabbing new skills, SQL knowledge
College Name: NIT DURGAPUR
Motivation: Few points that motivated me: - Web development related work which is my area of interest.
- Company was a startup so a lot of work => lot of learning (crucial for starting career).- Pay was decent, so I can sustain my living and save something.
Funny Moments: It was my last interview and while I was solving a problem I wrote something wrong, and by mistake " f**k " came out of my mouth. The interviewer was on the phone and for some time I was just wondering if she heard that word, whether it would affect my interview result and all sort of things, rather than about the problem.
A suggestion: Please mind what comes out of your mouth ;)

Skills evaluated in this interview

Top trending discussions

View All
Salary Discussions, Hike & Promotions
2w
a senior executive
GF salary Vs. My salary
Me and my gf have been dating for 5 years. Back in 2020, I started my career with a package of ₹5 LPA. Over the years, I’ve reached ₹22 LPA in 2025. She started her journey with ₹3 LPA(2020) and is now earning ₹8 LPA(2025). We’ve been in a live-in relationship for around 2 years, and the idea was to share expenses equally. But, equal sharing never really happened. If we go to a café she likes, especially with friends, I will pay the entire bill. We only split the house rent and grocery bills. I told her lots of time to cut down these costly cafe expenses or earn more money, increase your package, study and work hard, but.....she is now in her comfort zone. Being from a tech background, I have seen people upgrade their skills and package for a good life in metro cities. I am ready to support her in her studies, but she is like I am earning enough for myself.... No, you are not. I love her, but I don't know how to overcome this issue between us. Please suggest!
Got a question about CouponDunia?
Ask anonymously on communities.

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Quantiative Aptitude

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions related to basic DSA, Searching, sorting, SQL Queries based on aggregate functions, Basic puzzle (GFG)
Round 3 - One-on-one 

(1 Question)

  • Q1. Resume based, Discussion about projects mentioned on the resume.
Round 4 - HR 

(1 Question)

  • Q1. Strength, Weakness,

Interview Preparation Tips

Interview preparation tips for other job seekers - Be calm during the process
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Round 1 - Coding Test 

Core HTML, CSS and JS

Round 2 - Coding Test 

JS deep dive and react

Round 3 - Behavioral 

(1 Question)

  • Q1. Mimic Promise.all, Array.flat, OTP Component etc

Interview Preparation Tips

Interview preparation tips for other job seekers - Study core JS concepts and be strong in react fundamentals
Are these interview questions helpful?

Software Engineer Interview Questions & Answers

Meddo user image Nishant Srivastava

posted on 31 May 2021

Interview Questionnaire 

1 Question

  • Q1. JS questions are asked
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Jul 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 - One-on-one 

(2 Questions)

  • Q1. Previous Experience
  • Q2. Suitability for this job
Round 3 - One-on-one 

(2 Questions)

  • Q1. Since your past experience is different, how will you fit in here
  • Ans. 

    I believe my diverse experience will bring fresh perspectives and new ideas to the team, enhancing overall performance.

    • I have a track record of quickly adapting to new environments and excelling in different roles.

    • My varied background has equipped me with a range of skills that can be applied in this position.

    • I am eager to learn and contribute to the team, bringing a unique perspective to the table.

  • Answered by AI
  • Q2. Will you perform outside KRA also
  • Ans. 

    Yes, I am willing to perform outside my Key Result Areas (KRAs) if needed.

    • I believe in going above and beyond my assigned responsibilities to contribute to the overall success of the team and organization.

    • I have previous experience taking on additional tasks outside my KRA, such as assisting with project management or training new team members.

    • I am flexible and adaptable, willing to step in and help wherever needed to ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared for out of syllabus questions also

Senior Associate Interview Questions & Answers

Elevate user image Shital Santosh Badgujar

posted on 13 May 2024

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Nov 2023. There were 2 interview rounds.

Round 1 - Assignment 

Contracts review and abstraction

Round 2 - One-on-one 

(1 Question)

  • Q1. Contracts and essential elements

CouponDunia Interview FAQs

How to prepare for CouponDunia 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 CouponDunia. The most common topics and skills that interviewers at CouponDunia expect are Digital Marketing, SEO, Google Analytics, Campaign Management and SEM.
What are the top questions asked in CouponDunia interview?

Some of the top questions asked at the CouponDunia interview -

  1. There is a dictionary with few words each of length 3 and start and finish word...read more
  2. here is a hotel with 100 rooms in it and some check in and check outs of differ...read more
  3. Given a binary tree how would you identify whether it is a Binary Search tree o...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

InsanelyGood Interview Questions
4.1
 • 19 Interviews
Vegrow Interview Questions
4.0
 • 17 Interviews
Shine Interview Questions
2.7
 • 16 Interviews
STARZ Ventures Interview Questions
4.8
 • 16 Interviews
Pepper Content Interview Questions
2.5
 • 13 Interviews
Elevate Interview Questions
3.4
 • 10 Interviews
Mogli labs Interview Questions
3.5
 • 9 Interviews
ParallelDots Interview Questions
4.1
 • 9 Interviews
Meddo Interview Questions
3.1
 • 8 Interviews
PromptCloud Interview Questions
4.6
 • 7 Interviews
View all

CouponDunia Reviews and Ratings

based on 9 reviews

4.5/5

Rating in categories

4.6

Skill development

4.7

Work-life balance

3.4

Salary

3.6

Job security

4.4

Company culture

3.0

Promotions

4.4

Work satisfaction

Explore 9 Reviews and Ratings
Design Interns

Mumbai

0-1 Yrs

Not Disclosed

Sr Search Engine Optimization Execuitve

Mumbai

2-4 Yrs

Not Disclosed

Sr. Executive / Asst. Manager - Marketing

Mumbai

2-4 Yrs

Not Disclosed

Explore more jobs
Assistant Manager
5 salaries
unlock blur

₹6.5 L/yr - ₹9.8 L/yr

Executive Accountant
3 salaries
unlock blur

₹3.5 L/yr - ₹3.8 L/yr

Explore more salaries
Compare CouponDunia with

InsanelyGood

4.1
Compare

Mogli labs

3.5
Compare

Vegrow

4.0
Compare

Shine

2.7
Compare
write
Share an Interview