kolodny/exercises
Exercises
This project is a comprehensive educational suite of coding challenges and implementation guides focused on JavaScript. It provides a collection of programmatic exercises and interview questions designed to practice core logic and algorithms.
The repository serves as a test-driven development workbook, pairing coding problems with test suites to verify the correctness of implemented solutions. It includes a specific framework for exercise solution verification and the integration of asynchronous logic into automated testing flows.
The content covers a wide range of computer science building blocks, including functional programming patterns, binary and Merkle tree structures, and sorting and searching logic. It also provides implementations for asynchronous flow management, data integrity verification, immutable state update patterns, and request-processing middleware chains.
Features
- JavaScript Coding Exercises - Provides a comprehensive collection of JavaScript coding challenges and interview exercises.
- Test-Driven Development Resources - Provides a structured collection of coding problems and test suites designed to teach software design through test-driven development.
- Asynchronous Logic Exercises - Provides a suite of exercises for managing concurrent operations and asynchronous flows.
- Algorithm Implementation Guides - Offers practical implementation guides for core computer science patterns and algorithms.
- Functional Programming Patterns - Implements essential functional programming patterns like currying and memoization in JavaScript.
- Solution Verification - Ships a dedicated test suite to verify the correctness of implemented logic for various coding challenges.
- Array Transformations - Provides a custom implementation of the array map function for element transformation.
- Memoization - Implements an algorithmic memoization pattern to cache expensive function results.
- Binary Search Implementations - Provides a concrete implementation of the binary search algorithm for sorted arrays.
- Binary Tree Inversions - Implements a process to reverse the structural orientation of a binary tree.
- Array Flattening Utilities - Provides a utility to recursively flatten multi-dimensional arrays into a single list.
- Custom Sorting Logic - Implements custom sorting logic using comparison functions for collection ordering.
- Function Currying - Provides a programmatic implementation of function currying for partial application.
- Concurrent Task Limiters - Provides a mechanism to cap the number of active concurrent asynchronous tasks.
- Execution Frequency Control - Implements debouncing and throttling logic to control function execution frequency.
- Nested Task Flattening - Implements a utility to flatten nested asynchronous thunks to eliminate callback hell.
- Single Execution Wrappers - Provides a wrapper to ensure a target function executes only once.
- Immutable Data Patterns - Implements patterns for updating object state immutably to maintain data integrity.
- Middleware Patterns - Implements a middleware pattern for processing requests through a sequential chain of handler hooks.
- Merkle-Tree Data Integrity - Implements the construction of Merkle trees by recursively hashing pairs of values.
- Membership Verifications - A method to confirm a value belongs to a dataset by hashing sibling nodes until they match a known root hash.
- Function Execution Throttling - Implements a throttle function to enforce minimum time intervals between calls.
- Interview Preparation - Collection of JavaScript coding exercises with automated tests.
- Programming Languages - JavaScript coding exercises for interview practice.
- Interview Preparation - Basic coding challenges and technical interview exercises.
Star history
How this analysis was created: This summary and feature list are AI-generated from collected project material and can contain mistakes. Stars, license and language are imported from GitHub. Inclusion does not mean that we have tested or audited this project. Check the source documentation for any feature you depend on. Learn more on our About page.
