Upload Button Icon Add office photos

Filter interviews by

CouponDunia Software Engineer Interview Questions, Process, and Tips

Updated 7 Jun 2015

Top CouponDunia Software Engineer Interview Questions and Answers

  • Q1. Given a binary tree how would you identify whether it is a Binary Search tree or not?
  • Q2. 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?
  • Q3. Given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase
View all 7 questions

CouponDunia Software Engineer Interview Experiences

2 interviews found

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

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

Software Engineer Interview Questions Asked at Other Companies

asked in Qualcomm
Q1. Bridge and torch problem : Four people come to a river in the nig ... read more
asked in Capgemini
Q2. In a dark room,there is a box of 18 white and 5 black gloves. You ... read more
asked in TCS
Q3. Find DuplicateYou have been given an integer array/list(ARR) of s ... read more
Q4. Tell me something about yourself. Define encapsulation. What is i ... read more
asked in Paytm
Q5. Puzzle : 100 people are standing in a circle .each one is allowed ... read more

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
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before May 2022. There were 2 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 

(3 Questions)

  • Q1. How python dictionary is implemented internally ?
  • Ans. 

    Python dictionary is implemented using hash tables.

    • Python dictionary is a collection of key-value pairs.

    • The keys in a dictionary must be unique and immutable.

    • The values in a dictionary can be of any data type.

    • Python dictionary is implemented using hash tables.

    • Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.

    • The hash function used in Python dictionary is based on the key's h...

  • Answered by AI
  • Q2. What is heap sort
  • Ans. 

    Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.

    • It divides the input into a sorted and an unsorted region.

    • It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.

    • It has a time complexity of O(n log n) and is not stable.

    • Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

  • Answered by AI
  • Q3. Coding question to sort array based on a custom filter

Skills evaluated in this interview

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
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Moderate Coding question

Round 2 - Technical 

(2 Questions)

  • Q1. On Java, OOPS concepts and coding logics
  • Q2. Data Structures and algorithms
Round 3 - Technical 

(2 Questions)

  • Q1. Mostly the same as Round 1
  • Q2. But question complexity is increased
Round 4 - HR 

(2 Questions)

  • Q1. Normal questions about us
  • Q2. Nothing major as I remember
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

It was a leetcode medium

Round 2 - Assignment 

It was a leetcode medium

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

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

Round 1 - Coding Test 

DSA questions asked in an interview

Interview experience
1
Bad
Difficulty level
Easy
Process Duration
6-8 weeks
Result
No response

I applied via Referral and was interviewed in Apr 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Aptitude Test 

Apptitude was pretty easy. They asked 2 programs that too was easy to medium level

Round 3 - Technical 

(2 Questions)

  • Q1. It was technical gd
  • Q2. I faced basic oops concepts, questions from RDBMS. Basic questions from data structures

Interview Preparation Tips

Interview preparation tips for other job seekers - Do not apply for this company and waste your time. I did all the rounds well. But they didn't gave any updates for almost 2 months then I asked them again and again and again they told that the position is closed. Still now I didn't get any feedback for my interview experience or whether I was rejected.... nothing. If the position is closed what is the reason for conducting a placement drive. Very poor management

CouponDunia Interview FAQs

What are the top questions asked in CouponDunia Software Engineer interview?

Some of the top questions asked at the CouponDunia Software Engineer interview -

  1. Given a binary tree how would you identify whether it is a Binary Search tree o...read more
  2. Given a BST, convert it to a binary tree such that each element is replaced by ...read more
  3. Given an array. find the pattern it follows? there can be 4 patterns only: incr...read more

Tell us how to improve this page.

Assistant Manager
5 salaries
unlock blur

₹6.5 L/yr - ₹9.5 L/yr

Sales Executive
3 salaries
unlock blur

₹390 L/yr - ₹390 L/yr

Senior Software Engineer
3 salaries
unlock blur

₹12 L/yr - ₹20 L/yr

Executive Accountant
3 salaries
unlock blur

₹3.5 L/yr - ₹3.5 L/yr

Software Development Engineer Test
3 salaries
unlock blur

₹5.2 L/yr - ₹12.5 L/yr

Explore more salaries
Compare CouponDunia with

Cashkaro.com

3.7
Compare

GrabOn

4.2
Compare

Nearbuy

4.6
Compare

MagicPin

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