Adyen - SWE Interview Experience May 2026

adyen logo
adyen
· Software Engineer· Bengaluru, Hybrid· 3.83y exp
September 3, 2026 · 0 reads

Summary

I interviewed for a Java Backend Software Engineer role at Adyen, completed an online assessment and a DSA round but was ultimately rejected.

Full Experience

YoE: 3 years 10 months Current Job: SWE2 at a PBC (FinTech sector) MNC Tech Stack: Java / Spring Boot Backend Location: Hyderabad, Hybrid

Applied on Adyen careers portal on 3rd May 2026. It was specific to Java Backend only. HR contacted on 6th May 2026 shortlisting my profile for interviews. Location: Bengaluru, Hybrid (3 days wfo + 2 days wfh)

R-0 - HR Screening call and OA

Date: 14th May 2026 30 mins

  1. Why looking for a change
  2. Current role and responsibilities
  3. Best project so far and most challenging work done by me in that
  4. Current tech stack and How do I make use of AI in day to day work
  5. Discussion on relocation, cctc vs ectc, offered position of swe role
  6. Asked to complete an OA with 2 coding questions (in 65 mins), within next 2 days, to be done in Java Questions were:

R-1 - DSA

Date: 22nd May 2026 1hr 15mins duration 2 interviewers panel Expectation was to solve 2 DSA problems But could not go to 2nd question in time. Q1: https://leetcode.com/discuss/post/3796460/oracle-oa-on-campus-by-anonymous_user-8ker/ or same as https://cses.fi/problemset/task/1750 (with a variation that you start on 1 always)

Result: Rejected I re-applied on 28th July 2026 and profile got selected this time too, HR scheduled a screening call on 5th August and gave a OA link too. but later HR got to know the past and said there is a "6 months cool-off" period. Rejected again.

Interview Questions (3)

1.

REST API: Retrieve TV Shows by Genre

Data Structures & Algorithms

Implement a REST API using HTTP GET to retrieve information about recent television shows in a specified genre.

2.

Swap Adjacent Elements and Maximize Sum

Data Structures & Algorithms

Given an array, you can swap adjacent elements. Find the maximum possible sum of the array after performing zero or more adjacent swaps.

3.

CSES Problem 1750 (Variation Starting at 1)

Data Structures & Algorithms

Solve the problem from CSES problem set 1750, but with the added constraint that you always start at node 1.

📣 Found this helpful? Please share it with friends who are preparing for interviews!

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!