Adyen Assessment

adyen logo
adyen
June 23, 20257 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.

Full Experience

2 Questions - 120 Mins

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

Interview Questions (2)

Q1
LRU Cache
Data Structures & Algorithms

Implement an LRU Cache.

Q2
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.

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!