barclays | Software Engineer | Interview Experience
Interview Date: Not specified
Result: Not specified
Difficulty: Not specified
Interview Process
The interview consisted of two main questions. The first question was a simple simulation problem, which was categorized as an easy level question on LeetCode. The second question involved concepts from the Unbounded Knapsack problem and greedy algorithms, which ranged from medium to hard difficulty.
Technical Questions
- Given four weights of items that you need to fit into a knapsack of capacity C and fill it to capacity, what is the maximum number of items that can fit into the knapsack? (Dynamic Programming, Greedy)
Tips & Insights
Focus on understanding the greedy approach and dynamic programming methods, as they are frequently tested in technical interviews.