My Interview Experience at Coupa Software for ASDE (FTE 2026)

coupa software logo
coupa software
· Associate Software Engineer
February 3, 2026 · 39 reads

Summary

I appeared for an Associate Software Engineer (FTE 2026) role at Coupa Software. The interview process included an Online Assessment and three rounds covering DSA, projects, CS fundamentals, and system design, all conducted on the same day. I was successfully selected after the process.

Full Experience

I appeared for Coupa Software – Associate Software Engineer (FTE 2026).

The process consisted of 1 OA and 3 interview rounds, all interviews conducted on the same day.

Online Assessment (OA)

The OA had two sections:

  • 3 coding questions based on arrays, strings, sorting, and mapping, to be solved in 45 minutes
  • 8 logical reasoning questions on patterns, graphs, etc., to be solved in 15 minutes

After around 3 days, the interview rounds were scheduled.

L1 Round

(Taken by an interviewer with ~3.5 years of experience)

This round was majorly focused on DSA. The topics and questions were decided by the interviewer.

There were 4–5 DSA questions to be solved in 1 hour (my round lasted around 1 hour 20 minutes).

Questions asked:

  • Merge sort logic with pseudo code
  • Reverse a string
  • Remove duplicates from an array
  • In-order traversal of a BST using a stack
  • Longest substring with no repeating characters

There was also a short discussion about my work experience.

L2 Round

(Taken by an interviewer with 15+ years of experience)

This round started around 10 minutes after L1 and mainly focused on:

  • Previous internship
  • Projects
  • CS fundamentals

We started with introductions. I was asked about my work during my previous internship, the challenges I faced, and a deeper understanding of my role and responsibilities.

Then we moved to a detailed theoretical discussion on my projects:

  • High-level schema and workflow
  • What I implemented
  • What I would improve or work on in the future

Later, I was asked about my favorite subject and hobbies. I mentioned Computer Networks, which led to questions like:

  • DNS explained in depth
  • Flow of a URL shortener
  • How it works and why
  • What a URL comprises of (protocol, domain name, route, query)

Some generic CN questions followed.

This round felt more like a discussion and debate rather than an interview. I honestly told what I knew and what I didn’t.

Duration: ~1 hour

L3 Round

(Taken by an interviewer with 20+ years of industry experience)

This round started after another 10-minute gap and lasted around 1 hour 40 minutes.

We began with:

  • Basic introduction
  • Discussion about my work experience and projects
  • How my day had been so far

Then we moved into an in-depth discussion of my project, followed by a High-Level Design (HLD) question:

Design an API Gateway

I was asked to:

  • Design various components and entities
  • Estimate the number of schemas required (roughly)

This lasted around 40 minutes, with several follow-up scenarios:

  • What if Redis goes down?
  • What if the logging worker goes down?
  • What happens in the celebrity problem?
  • How would you invalidate cache if the service is hosted on the cloud and IPs change frequently?

He seemed happy with my approach.

After that, we moved to DSA (Trees). Around 5–6 questions were asked, where I had to code only the solution function and dry run it.

Questions included:

  • DFS vs BFS (advantages and disadvantages)
  • Calculate the number of edges to reach a key
  • Maximum height of a tree
  • Minimum height of a tree
  • Sum of all heights from the root nodes of a BST
  • How to calculate LCA of two nodes

Most questions were linked, so updating the existing code was enough to solve them.

Finally, there were some general questions:

  • About my family Why I chose IIIT Nagpur (CSE) over NIT (non-IT branch) or Gen-3 IIT with a lower branch

I answered honestly: I enjoy building systems, writing code, solving problems daily, and reading tech articles, which was clearly reflected in my projects.

He said he was happy with the discussion and asked me to wait for the recruiter.

Interview Questions (14)

1.

Merge Sort Logic

Data Structures & Algorithms·Medium

Implement merge sort logic and provide pseudo code.

2.

Reverse a String

Data Structures & Algorithms·Easy

Reverse a given string.

3.

Remove Duplicates from Array

Data Structures & Algorithms·Easy

Remove duplicate elements from an array.

4.

In-order Traversal of BST using Stack

Data Structures & Algorithms·Medium

Perform an in-order traversal of a Binary Search Tree (BST) using an iterative approach with a stack.

5.

Longest Substring Without Repeating Characters

Data Structures & Algorithms·Medium

Find the length of the longest substring in a given string that does not contain any repeating characters.

6.

Explain DNS in Depth

System Design

Explain the Domain Name System (DNS) in detail.

7.

URL Shortener Workflow

System Design·Medium

Describe the high-level flow and working mechanism of a URL shortener, including how it works, why it works, and what a URL comprises of (protocol, domain name, route, query).

8.

Design an API Gateway

System Design·Hard

Design an API Gateway. I was asked to design various components and entities, estimate the number of schemas required (roughly), and discuss follow-up scenarios: What if Redis goes down? What if the logging worker goes down? What happens in the celebrity problem? How would you invalidate cache if the service is hosted on the cloud and IPs change frequently?

9.

DFS vs BFS Comparison

Data Structures & Algorithms·Easy

Discuss the advantages and disadvantages of Depth-First Search (DFS) and Breadth-First Search (BFS) algorithms.

10.

Edges to Reach Key in Tree

Data Structures & Algorithms·Easy

Given a tree and a key, calculate the number of edges required to reach that key from the root.

11.

Maximum Height of a Tree

Data Structures & Algorithms·Easy

Calculate the maximum height of a given tree.

12.

Minimum Height of a Tree

Data Structures & Algorithms·Easy

Calculate the minimum height of a given tree.

13.

Sum of All Heights from Root Nodes of BST

Data Structures & Algorithms·Medium

Calculate the sum of all heights from the root nodes of a Binary Search Tree (BST).

14.

Lowest Common Ancestor (LCA) of Two Nodes

Data Structures & Algorithms·Medium

Explain how to calculate the Lowest Common Ancestor (LCA) of two nodes in a tree.

Preparation Tips

Throughout all 3 interviews, I stayed calm and composed. I answered what I knew and clearly said what I didn’t know. Don’t bluff—they are experts in their field, and we are freshers.

Have at least two solid projects:

  1. One that solves a real problem you genuinely faced
  2. One production-grade project (not just UI and CRUD operations)

If you’ve read till here, do like and comment. I’ll try to respond to as many queries as possible—it motivates me to write more experiences.

ALL THE BEST. YOU CAN DO IT.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!