3 Repos
Algorithms that expand compressed strings where numbers indicate repetition of substrings, supporting nested patterns.
Distinct from Repetitive String Compression Algorithms: Distinct from compression: focuses on decoding, not encoding, using stack-based parsing.
Explore 3 awesome GitHub repositories matching software engineering & architecture · Repetition-Based String Decoders. Refine with filters or upvote what's useful.
A very compact representation of a placeholder for an image.
Converts BlurHash strings back into blurred image representations across multiple platforms.
This project is an algorithm template library and coding interview study guide providing reusable code patterns for common data structures and algorithms. It serves as a reference for optimized strategies and a structured learning path to build proficiency in algorithmic problem solving and competitive programming. The library focuses on standardized implementations of key algorithmic patterns, including sliding windows, backtracking, dynamic programming, and binary search. It provides specific templates for managing binary search trees, searching rotated sorted arrays, and executing divide-a
Implements stack-based parsing to decode compressed strings with nested repetition patterns.
LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in
Implements decoding of strings with repetition numbers, a common interview problem.