💻
Programming
Algorithms Code
422
Cards
~211m
Study time
Advanced
Difficulty
Sample questions
- ▸What is Binary Search and what is its time complexity?<br><br>Write the implemen...
- ▸What is Bubble Sort and what is its time complexity?<br><br>Write the implementa...
- ▸What is Merge Sort and what is its time complexity?<br><br>Write the implementat...
- ▸What is Quick Sort and what is its time complexity?<br><br>Write the implementat...
- ▸What is BFS (Breadth-First Search) and what is its time complexity?<br><br>Write...
💻
Programming
Frontend Performance
217
Cards
~109m
Study time
Advanced
Difficulty
Sample questions
- ▸What is frontend performance?
- ▸Why does frontend performance matter?
- ▸What is Time to First Byte (TTFB)?
- ▸What is Largest Contentful Paint (LCP)?
- ▸What is Interaction to Next Paint (INP)?
VS
🤔 Which should you study first?
Both topics are in the Programming category, so they complement each other well. We suggest starting with the smaller deck to build momentum:
Algorithms Code
422 cards · ~211 min · Advanced
Frontend Performance
217 cards · ~109 min · Advanced
⭐ Quicker to complete