💻
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
Data Engineering
170
Cards
~85m
Study time
Advanced
Difficulty
Sample questions
- ▸What is ETL and how does it work?
- ▸What is ELT and how does it differ from ETL?
- ▸What is a data pipeline?
- ▸What is a data warehouse?
- ▸What is a star schema in data warehousing?
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
Data Engineering
170 cards · ~85 min · Advanced
⭐ Quicker to complete