#Complexity

16 questions

• What is a data structure and what is an abstract data type (ADT)?Data Structures#data-structuresJunior›
• What is an array and what are the complexities of its operations?Data Structures#data-structuresJunior›
• What are the trade-offs between an array and a linked list?Data Structures#data-structuresJunior›
• What is a binary search tree (BST) and what are its operation complexities?Data Structures#treesMiddle›
• How do hash tables handle collisions, load factor, and resizing?Data Structures#hashingMiddle›
• How do you represent a graph: adjacency list vs adjacency matrix?Data Structures#graphsMiddle›
• What are balanced BSTs (AVL and red-black trees) and why do they matter?Data Structures#treesMiddle›
• How do you choose the right data structure for a problem?Data Structures#data-structuresMiddle›
• What is amortized analysis, using dynamic array resizing as an example?Data Structures#complexityMiddle›
• What are B-trees and B+ trees and why do databases use them?Data Structures#treesSenior›
• What are weighted and directed graphs, and what problems do they model?Data Structures#graphsSenior›
• What is a disjoint-set (union-find) structure with path compression and union by rank?Data Structures#graphsSenior›
• What is a skip list and how does it achieve O(log n) search?Data Structures#data-structuresSenior›
• How do segment trees and Fenwick trees (BIT) support fast range queries?Data Structures#treesSenior›
• How do you design a data structure with specific O(1)/O(log n) requirements?Data Structures#data-structuresSenior›
• What is Big-O notation?Algorithms#complexityJunior›