← Barclays questions
Reported in a candidate post, Aug 2021

DFS vs BFS, structure complexities and why binary search beats ternary search

Filed under Barclays

Explain DFS and BFS (differences, implementation, real-life uses); compare linked list, array, queue and stack on insertion, search and deletion complexity; and name the searching algorithms you know…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Barclays questions

Collected from public candidate posts and coding forums. Updated Nov 2026.