Adyen Assessment

Posted
23 Jun 2025
371 reads

Summary

I had an assessment with Adyen where I was given 120 minutes to solve two technical questions: LRU Cache and a Bellman-Ford variant.

How it went

2 Questions - 120 Mins

  1. LRU Cache
  2. Bellman ford Algorithm (k length span to reach destination)

Questions asked (2)

  1. 01

    LRU Cache

    Data Structures & Algorithms

    Implement an LRU Cache.

  2. 02

    Bellman-Ford with K-Length Span

    Data Structures & Algorithms

    Implement the Bellman-Ford algorithm to find the shortest path with a constraint on the number of edges (k length span) to reach a destination.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Adyen recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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