Awesome GitHub RepositoriesSequence Algorithms

This repository is a comprehensive collection of data structures and algorithms implemented in JavaScript, designed primarily as an educational resource for computer science study and technical interview preparation. It provides modular implementations of fundamental programming concepts, allowing developers to explore algorithmic logic and data organization through self-contained, verifiable code examples. The library distinguishes itself by pairing every implementation with formal Big O notation, providing predictable insights into time and space scaling requirements. Each algorithm is stru

This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

xi-editor is a high-performance text editor core written in Rust. It employs a client-server architecture that separates the backend editor logic from the user interface, allowing diverse frontends to communicate with the core via a standardized protocol. The project is distinguished by its use of rope-based text buffers for efficient manipulation of large documents and a collaborative engine powered by conflict-free replicated data types to synchronize concurrent edits. It further features an extensible plugin system that integrates external binaries and third-party tools through JSON-based

This project is a library of source code implementations designed to solve algorithmic challenges and mathematical problems. It serves as a collection of solved LeetCode problems, providing a reference for data structure usage and efficient logic. The repository is a polyglot code collection, implementing the same algorithmic logic across various programming environments, including general-purpose languages, SQL for database queries, and Bash for shell scripting. The content covers a broad range of computational tasks, including data querying, text processing, and the implementation of compl

Nim is a statically typed, compiled systems programming language designed for high performance and cross-platform development. It translates high-level source code into C, C++, or JavaScript, allowing developers to produce efficient native binaries or web-compatible scripts from a single codebase. The language emphasizes a clean, indentation-based syntax that simplifies code hierarchy while maintaining the power of a full-featured systems language. What distinguishes Nim is its robust metaprogramming framework, which allows developers to inspect, modify, and generate code structures during th

This project is a comprehensive library of reference implementations for fundamental data structures and algorithms, designed to support technical interview preparation and software engineering assessments. It provides a structured collection of computational techniques for solving complex problems involving arrays, strings, graphs, trees, and mathematical analysis. The library distinguishes itself by offering specialized implementations for advanced topics, including concurrent programming patterns and geometric algorithms. It features thread-safe primitives for managing shared state and tas

This project is a comprehensive productivity guide and configuration reference for the VS Code editor. It provides a curated collection of shortcuts, configuration tips, and tutorials designed to improve efficiency and optimize the daily coding workflow. The resource covers advanced AI-assisted development, including the integration of autonomous agents, custom prompt files, and AI-powered coding assistants for task automation and code generation. It also provides specialized guidance on integrated terminal management, such as configuring shell profiles and automating command execution. Addi

algs4 is a Java data structures library and algorithm reference collection designed as the source code for a standard computer science textbook curriculum. It provides a comprehensive suite of fundamental implementations for sorting, searching, and core data organization. The project serves as a graph theory framework, offering tools for representing directed and undirected graphs and performing complex traversals and pathfinding. It also includes a broad sorting algorithm suite and a specialized library of Java data structures, including stacks, queues, priority queues, and symbol tables. I

LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

Radash, डेटा रूपांतरण, सत्यापन और वर्कफ़्लो प्रबंधन के लिए डिज़ाइन की गई एक TypeScript कार्यात्मक उपयोगिता लाइब्रेरी है। यह एरे, ऑब्जेक्ट्स और स्ट्रिंग्स में हेरफेर करने के लिए टाइप्ड हेल्पर फंक्शन्स का एक संग्रह प्रदान करती है। इस प्रोजेक्ट में प्रॉमिस, रिट्रीज़ और कॉनकरेंसी लिमिट्स को प्रबंधित करने के लिए एक एसिंक्रोनस वर्कफ़्लो टूलकिट है, साथ ही प्रिमिटिव प्रकारों, ऑब्जेक्ट्स और प्रॉमिस को सत्यापित करने के लिए बूलियन वैलिडेटर्स का एक सुइट है। यह फंक्शन कंपोज़िशन, पार्शियल एप्लिकेशन और एरर-फर्स्ट रिस्पॉन्स पैटर्न जैसे कार्यात्मक प्रोग्रामिंग पैटर्न को भी लागू करता है। लाइब्रेरी डीप क्लोनिंग और मर्जिंग के साथ ऑब्जेक्ट स्टेट प्रबंधन, जटिल एरे हेरफेर और स्ट्रिंग फॉर्मेटिंग सहित क्षमताओं की एक विस्तृत सतह को कवर करती है। यह अतिरिक्त रूप से निष्पादन ऑप्टिमाइज़ेशन के लिए टूल्स प्रदान करती है, जैसे कि रेट लिमिटिंग और रिजल्ट कैशिंग।

This is a C++ ranges library and extension to the Standard Template Library that provides a collection of composable algorithms and lazy views for processing data sequences. It functions as a lazy sequence processing framework and a template meta-programming library for manipulating type lists and performing compile-time type computations. The project enables functional programming patterns in C++ through the use of pipe syntax and partial application to create readable, left-to-right data transformation chains. It allows for the construction of lazy data pipelines that filter and transform e

This repository is a curated guide and implementation library of coding patterns used to solve data structures and algorithms problems. It serves as a technical interview study resource, providing a comprehensive set of strategies and computational logic examples for optimizing time and space complexity. The project focuses on standardized algorithmic patterns, including sliding windows, two pointers, and dynamic programming. It features specific implementations for a wide range of challenges, such as LeetCode problem solutions and specialized techniques like cyclic sort and bitwise XOR opera

nvim-autopairs, Neovim के लिए एक Lua-आधारित एक्सटेंशन है जो संतुलित सिंटैक्स बनाए रखने के लिए स्वचालित रूप से क्लोजिंग ब्रैकेट, कोट्स और कीवर्ड सम्मिलित करता है। यह एक प्रासंगिक ब्रैकेट ऑटोमेटर के रूप में कार्य करता है, जो कोड के वास्तविक सिंटैक्स ट्री के आधार पर क्लोजिंग वर्णों को कब सम्मिलित करना या छोड़ना है, यह निर्धारित करने के लिए Tree-Sitter संरचनात्मक नोड्स का उपयोग करता है। यह प्लगइन स्ट्रिंग्स या टिप्पणियों के भीतर जोड़े सम्मिलित करने से रोकने के लिए Tree-Sitter जागरूकता का उपयोग करके खुद को अलग करता है। यह गतिशील क्लोजिंग स्ट्रिंग रिज़ॉल्यूशन और कस्टम पेयरिंग लॉजिक का समर्थन करता है, जिससे उपयोगकर्ता रेगुलर एक्सप्रेशन और फ़ाइल प्रकार फ़िल्टर का उपयोग करके विशिष्ट नियम परिभाषित कर सकते हैं। बुनियादी सम्मिलन से परे, यह उपकरण सिंक्रनाइज़ पेयर विलोपन, चयनित ब्लॉकों के लिए टेक्स्ट रैपिंग, और न्यूलाइन ब्लॉक स्वरूपण का प्रबंधन करता है। यह किसी फ़ंक्शन या विधि का चयन करने के बाद क्लोजिंग वर्णों के सम्मिलन को स्वचालित करने के लिए कंप्लीशन इंजनों के साथ भी एकीकृत होता है।