Awesome GitHub RepositoriesBinary Search Utilities

This project is a curated educational resource and solution repository for algorithmic challenges, specifically focused on LeetCode problems. It serves as a technical reference for common data structures and algorithmic patterns, providing verified code implementations across multiple programming languages alongside detailed logic and complexity analysis. The repository functions as a comprehensive study guide for competitive programming and technical interview preparation. It includes specialized learning tools such as an Anki flashcard dataset for spaced repetition and a browser extension t

GeoIP2-CN provides curated datasets and binary database files designed to identify network addresses originating from mainland China. It provides a GeoIP2 China database and a routing list formatted as a MaxMind compatible database for use with network tools. The project enables proxy traffic management by distinguishing between domestic and international IP addresses. This allows for regional network routing and the application of decision logic to separate traffic paths based on geographic location. The system implements IP identification through MMDB-based lookups, binary-search range mat

GeoLite.mmdb is a curated repository of prebuilt MaxMind GeoIP databases in the MMDB binary format, providing ready-to-use files for mapping IP addresses to geographic locations and autonomous system network providers without requiring a MaxMind account or manual compilation. The project serves as a central source for country-level, city-level, and autonomous system number (ASN) databases that enable fast, decompression-free IP lookups. The repository delivers three primary database files: the GeoLite2 Country database for resolving IP addresses to their registered countries, the GeoLite2 Cit

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

This is a Python library providing sorted list, set, and dictionary data structures that maintain their order automatically during insertions and deletions. The library provides a sorted list for fast random access and logarithmic lookups, a sorted set for unique elements and set-theoretic operations, and a sorted dictionary for managing key-value pairs where keys remain sorted. These collections support custom sorting logic through user-defined key functions to determine the order of elements. Core capabilities include positional indexing, range queries, and the use of bisection methods to