Grokking algorithms – Basics of DSA:
- Chapter #1 - binary search implementations
- Chapter #2 - selection sort implementation
- Chapter #3 - factorial implementations
- Chapter #4 - euclid algorithm, quick sort & other "divide and rule" implementations
- Chapter #5 - hash tables usage examples
- Chapter #6 - breadth-first search implementation
- Chapter #7 - dijkstra algorithm implementation
- Chapter #8 - greedy algorithm implementation
- Chapter #9 - algorithm implementations using dynamic programming
- Chapter #10 - k-near neighbours algorithm implementation
- Chapter #11 - binary search tree implementation
CodeRun Summer Challenge – Competition of most efficient solutions:
- Task #1 - Bike Rental - check the task
- Task #2 - Summer Bike Tour - check the task
- Task #3 - Behind the Scenes - check the task
- Task #4 - The Solar Sequence - check the task
- Task #5 - The Map of Hot Spots - check the task
- Task #6 - Koderun Covers The Beach - check the task
LeetCode - 30 Days of JavaScript (TypeScript edition) - Learn JS (TS) Basics with 30 Qs
- Closures
- Task #1 - Create Hello World Function - check the task
- Task #2 - Counter - check the task
- Task #3 - To Be Or Not To Be - check the task
- Task #4 - Counter II - check the task
- Basic Array Transformations
- Task #5 - Apply Transform Over Each Element in Array - check the task
- Task #6 - Filter Elements from Array - check the task
- Task #7 - Array Reduce Transformation - check the task
- Function Transformations
- Task #8 - Function Composition - check the task
- Task #9 - Return Length of Arguments Passed - check the task
- Task #10 - Allow One Function Call - check the task
- Task #11 - Memoize - check the task
- Promises and Time
- Task #12 - Add Two Promises - check the task
- Task #13 - Sleep - check the task
- Task #14 - Timeout Cancellation - check the task
- Task #15 - Promise Time Limit - check the task