Data Structures
This structure uses LIFO (last in, first out) ordering.
What is a stack?
This acronym stands for a compact, URL-safe token used for authentication, often containing header, payload, and signature.
What is a JWT?
This principle bundles data and methods together, hiding internal state.
What is encapsulation?
This SQL clause filters rows before grouping.
What is WHERE?
This is the time complexity of binary search.
What is O(log n)?
This structure uses FIFO ordering, often used for BFS (Breadth First Search).
What is a queue?
This HTTP status code means "resource not found."
What is 404?
This principle says a subclass should be substitutable for its parent class without breaking the program.
What is the Liskov Substitution Principle?
This type of join returns all rows from the left table and matched rows from the right.
What is a LEFT JOIN?
This sorting algorithm has average O(n log n) time and works by repeatedly dividing the array in half.
What is merge sort?
Average time complexity for lookup in a hash table.
What is O(1)?
This HTTP method is idempotent and used to fully replace a resource.
This design pattern ensures a class has only one instance and a global access point to it.
What is Singleton?
This acronym describes the guarantees of reliable database transactions.
What is ACID?
This technique solves problems by breaking them into overlapping subproblems and caching results.
What is dynamic programming?
This tree structure keeps itself balanced, guaranteeing O(log n) operations (e.g., Red-Black or AVL).
What is a self-balancing binary search tree?
This protocol upgrades an HTTP connection to allow full-duplex, real-time communication.
What is WebSocket?
This principle states classes should be open for extension but closed for modification.
What is Open/Closed Principle?
This type of database index structure speeds up range queries and is commonly a B-tree.
What is a B-tree index?
This graph traversal algorithm finds the shortest path in a weighted graph with non-negative edges.
What is Dijkstra's algorithm?
This structure efficiently finds the min/max element and is commonly used to implement priority queues.
What is a heap?
This security mechanism restricts which origins can make requests to your API.
What is CORS (Cross-Origin Resource Sharing)?
This design pattern defines a family of algorithms, encapsulates each one, and makes them interchangeable at runtime.
What is the Strategy pattern?
This term describes splitting a database across multiple machines to handle scale.
What is sharding?
This term describes the worst-case time complexity of quicksort.
What is O(n²)?