How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a Medium difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Citi.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Citi during technical interviews.

Explain data structure fundamentals

Last updated: Mar 29, 2026

Quick Overview

This question evaluates understanding of data structure fundamentals, specifically hash map internals (hashing, collision resolution strategies, load factor, and resizing), time complexity analysis for search/insert/delete, contrasts between arrays and linked lists for random access and insertion, and typical use cases and complexities for stacks versus queues. It is commonly asked in technical interviews to assess algorithmic thinking and the ability to reason about performance trade-offs and appropriate data structure selection; domain: Coding & Algorithms; level: tests both conceptual understanding and practical application.

Citi

Sep 6, 2025, 12:00 AM

Software Engineer

Onsite

Coding & Algorithms

Explain how a hash map works internally: hashing, collision resolution strategies (separate chaining vs. open addressing), load factor, and resizing. Provide average‑ and worst‑case time complexities for search, insert, and delete. Contrast arrays and linked lists for random access and insertion; give typical use cases for a stack versus a queue and their time complexities.

Submit Your Answer

Loading comments...

Browse More Questions

More Coding & Algorithms•More Citi•More Software Engineer•Citi Software Engineer•Citi Coding & Algorithms•Software Engineer Coding & Algorithms