CouponDunia

16 posts

C++ Program To Find Next Greater Element

Last Updated: 25 August 2026

Given an array, the Next Greater Element (NGE) for an element is the first element greater than it on its right side. If no greater element exists, the NGE is -1.For the r...read more

C Program To Find Next Greater Element

Last Updated: 23 July 2025

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element on the right side of x in th...read more

Java Program To Find Next Greater Element

Last Updated: 23 July 2025

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element on the right side of x in th...read more

PHP Program To Find Next Greater Element

Last Updated: 23 July 2025

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element on the right side of x in th...read more

Javascript Program To Find Next Greater Element

Last Updated: 23 July 2025

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element on the right side of x in th...read more

CouponDunia Recruitment Process

Last Updated: 21 May 2024

This article will give you information about the company, its recruitment process, sample questions that have been asked previously, lots of experiences shared by other as...read more

Interview Experiences

CouponDunia

Recruitment Process

CouponDunia Interview Experience | Set 5 (For full time Software Engineer)

Last Updated: 12 April 2015

I applied here from their career page and was asked to attend 5 rounds and I cleared all of them and landed into a full time Software Engineer job :)Round 1:It was 5 quest...read more

Interview Experiences

CouponDunia

Experiences

CouponDunia Interview Experience | Set 4 (Off-Campus for Internship)

Last Updated: 23 July 2025

I applied of off campus for the internship. Selection consist of five rounds. I cleared all the rounds.Round 1:(Online Coding Test on Hacker Rank)This round consist of 3 q...read more

Interview Experiences

Internship

CouponDunia

Experiences

CouponDunia Interview Experience | Set 3 (For Android Developer)

Last Updated: 11 March 2015

These are questions asked for Coupondunia Android Developer InterviewPrimarily an email to get to estimate you.Then a task is given for you to solve. Then comes the techni...read more

Interview Experiences

CouponDunia

Experiences

CouponDunia Interview Experience | Set 2 (Fresher)

Last Updated: 05 March 2015

Since there is only one interview experience of CouponDunia i think this gonna help students who will opt for it. You must be good enough in writing the codes at the mome...read more

Interview Experiences

CouponDunia

Experiences

CouponDunia Interview Experience

Last Updated: 23 July 2025

I recently got an offer from CouponDunia, here is my interview experience: There were four rounds.Round 1: Coding Test on HackerRank.Three question in 90 minutes.Round 2: ...read more

Interview Experiences

CouponDunia

Experiences

Implement Stack using Queues

Last Updated: 25 July 2026

Implement a stack using queue(s). Only queue operations are allowed to perform stack operations. The stack should support the following operations:push(x): Insert element ...read more

Next Greater Element in Array

Last Updated: 10 September 2025

Given an array arr[] of integers, determine the Next Greater Element (NGE) for every element in the array, maintaining the order of appearance.The Next Greater Element for...read more

Run Length Encoding and Decoding

Last Updated: 09 May 2026

Given a string s, implement a function encode that performs run-length encoding on the string. Run-length encoding is a form of compression where consecutive occurrences o...read more

String-Run Length Encoding

Root to leaf path sum equal to a given number

Last Updated: 28 August 2026

Given a binary tree and a sum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. Return false if no s...read more

1 2