Back to All Flashcards
Card 1 of 5 0%
0Hard
0Learning
0Know It
Question
Loading…
Click to reveal answer
Answer
All 5 Cards
#1
Q: What is a hash table?
A: A data structure mapping keys to values using a hash function. Average O(1) lookup.
#2
Q: What is recursion?
A: A function that calls itself with a smaller sub-problem until a base case is reached.
#3
Q: Explain the sliding window technique.
A: Maintains a subset of data within a moving window to solve problems like max-sum subarray in O(n).
#4
Q: What is dynamic programming?
A: Solving complex problems by breaking into overlapping sub-problems, storing solutions (memoisation/tabulation).
#5
Q: What is the time complexity of quicksort (average)?
A: O(n log n)
Explore All 125 Free Decks