Includes eBook: The Complete JavaScript Handbook
Book Content:
- Chapter 1: Javascript Foundations
-
Chapter 2: Javascript Foundations
-
Chapter 3: JavaScript Types
-
Chapter 4: Closures and Prototypes
Course Syllabus
- System Design
- [Easy] Poll Widget : Create a poll widget that is embeddable on websites.
- [Medium] Image Carousel : Create a horizontally-scrolling image carousel component with responsive design navigation controls and auto-scrolling option
- [Medium] E-commerce: Design a e-commerce platform
- [Hard] Chat App : Develop a chat application with features and functionality similar to popular messaging platforms like Skype and Slack.
- Machine Coding
- [Medium] Star Rating: Construct a star rating component that displays a row of star icons allowing users to choose the desired rating by selecting the number of filled stars.
- [Medium] Image Carousel
- [Hard] Progress Bars : Develop a list of progress bars that gradually fill up concurrently with a maximum limit of 3 bars and include the functionality to pause and resume the progress.
- [Hard] Tic-tac-toe : Create a tic-tac-toe game with a grid size of N x N where the goal is to achieve M consecutive marks in order to win.
- JavaScript Coding
- [Easy]: Implement findIndex
- [Medium]: Implement intersectionWith
- [Medium]: Implement classNames
- [Medium] Event Emitter : Create a class that supports event subscription emission and callback triggering. Subscription objects are returned and can self-unsubscribe.
- [Medium] Flatten : Create a function that recursively reduces the nesting of an array to a single level effectively flattening it.
- [Medium] Promise.all : Create an implementation of the Promise.all() function that resolves to an array of results if all the input elements are resolved and rejects otherwise.
- [Medium]: Implement promiseAllSettled
- [Medium]: Implement promiseAny
- [Hard] Deep Clone : Develop a function that performs a deep copy of a value while handling circular references
- [Hard]: Implement HTML Serializer
- DSA In JS
- [Easy] Stack : Create a stack data structure that includes the standard stack methods.
- [Medium] Binary Search : Create a function that performs binary search on a sorted array of numbers.
- [Medium] Breadth first search : Develop a breadth-first search algorithm that explores a directed graph in a breadth-first manner.
- [Medium] Depth first search : Create a depth-first search algorithm that explores a directed graph in a depth-first manner.
- [Medium] Queue : Create a queue data structure that includes the standard queue methods