This project captures color data using an Arduino Nano 33 BLE Sense Lite paired with an APDS9960 sensor. By applying delta encoding, it minimizes the size of the transmitted data by 15%. The data is then read over a serial connection in Python and updated on a web page in real time using FastAPI with WebSocket communication. Take a look here
A collection of algorithms and data structures inspired by the course “The Last Algorithms Course You’ll Need” from FrontendMasters. The repository includes tests using pytest and covers concepts such as sorting, recursion, searching, heaps, and tree traversals. Algorithms and Data Structures Sorting Algorithms Bubble Sort: Simple comparison-based sorting algorithm with O(n²) complexity. Quick Sort: Efficient divide-and-conquer algorithm with average O(n log n) complexity. Recursion Maze Solver: Uses recursive backtracking to find a path through a maze. Searching Algorithms Binary Search: Efficiently searches sorted arrays with O(log n) complexity. Search Problem (Two Crystal Balls): Optimized algorithm to find a breakpoint with minimized jumps, O(√n) complexity. Heap Min Heap: Tree-based structure allowing quick retrieval/removal of the smallest element with O(log n) complexity. Tree Algorithms Breadth-First Search (BFS): Explores nodes level-by-level in a graph/tree with O(n) complexity. Tree Traversals: PreOrder: Root → Left → Right traversal. InOrder: Left → Root → Right traversal. PostOrder: Left → Right → Root traversal. Take a look here. ...
This project provides an implementation of the Ambient Calculus programming language. It covers the essential aspects of running the language, grammatical categories, code descriptions, and concluding remarks. Notably, it leverages ANTLR4 with Go and Dot to facilitate syntax tree generation. Take a look here