Adyen Assessment
June 23, 2025 · 90 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
- LRU Cache
- Bellman ford Algorithm (k length span to reach destination)
Interview Questions (2)
1.
LRU Cache
Data Structures & Algorithms
Implement an LRU Cache.
2.
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.