awesome-repositories.com
Blog
awesome-repositories.com

Entdecke die besten Open-Source-Repositories mit KI-gestützter Suche.

EntdeckenKuratierte SuchenOpen-Source-AlternativenSelf-hosted SoftwareBlogSitemap
ProjektÜber unsRanking-MethodikPresseMCP-Server
RechtlichesDatenschutzAGB
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

4 Repos

Awesome GitHub RepositoriesLongest Substring Identification

Techniques for identifying the longest contiguous segment of a string meeting specific criteria.

Distinct from Substring Counting: Focuses on identifying the actual longest segment rather than counting unique substrings.

Explore 4 awesome GitHub repositories matching software engineering & architecture · Longest Substring Identification. Refine with filters or upvote what's useful.

Awesome Longest Substring Identification GitHub Repositories

Finde die besten Repos mit KI.Wir suchen mit KI nach den am besten passenden Repositories.
  • sharingsource/logicstack-leetcodeAvatar von SharingSource

    SharingSource/LogicStack-LeetCode

    7,495Auf GitHub ansehen↗

    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

    Implements algorithms for finding the maximum length of a contiguous matched parentheses sequence.

    algorithminterview-practiceinterview-questions
    Auf GitHub ansehen↗7,495
  • coells/100daysAvatar von coells

    coells/100days

    7,488Auf GitHub ansehen↗

    This project is a comprehensive collection of computer science implementations and an algorithm tutorial repository. It serves as a study guide and reference for competitive programming, providing executable code examples that demonstrate fundamental algorithmic problem solving and mathematical computation. The library covers a wide range of specialized domains, including cryptography and security primitives, lossless data compression techniques, and computational geometry for spatial analysis. It also features implementations of machine learning models, linear algebra operations, and formal

    Implements a technique to identify the length of the longest contiguous substring containing no repeating characters.

    Jupyter Notebook
    Auf GitHub ansehen↗7,488
  • chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviewsAvatar von Chanda-Abdul

    Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews

    4,129Auf GitHub ansehen↗

    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

    Implements algorithms to find the longest contiguous string segment satisfying distinct character counts.

    algorithmscoding-interviewsdata-structures
    Auf GitHub ansehen↗4,129
  • hoanhan101/algoAvatar von hoanhan101

    hoanhan101/algo

    3,678Auf GitHub ansehen↗

    This project is a Go algorithm implementation library and a reference for data structures. It serves as a collection of solved coding interview problems and an algorithmic pattern collection, providing a reference of over 100 common challenges implemented in Go. The library focuses on specific problem-solving strategies, including sliding windows, two pointers, and dynamic programming. It provides coded examples of standard sorting, searching, and graph traversal techniques to facilitate the study of algorithmic patterns. The repository covers a broad range of capabilities, including array a

    Implements algorithms for finding the longest contiguous substring with all unique characters using sliding window techniques.

    Go
    Auf GitHub ansehen↗3,678
  1. Home
  2. Software Engineering & Architecture
  3. String Processing Algorithms
  4. Substring Counting
  5. Longest Substring Identification

Unter-Tags erkunden

  • Distinct Character Substring AnalyzersAlgorithms that identify the longest contiguous segment of a string containing exactly k unique characters. **Distinct from Longest Substring Identification:** Targets a specific count of unique characters (k), while the parent covers any general criteria for longest segments.
  • Homogeneous Substring IdentifiersAlgorithms that find the longest substring composed of a single repeating character, potentially with limited replacements. **Distinct from Longest Substring Identification:** Specifically targets substrings of identical characters, whereas the parent identifies any longest segment meeting general criteria.
  • Longest Repeated Substring SearchAlgorithms for identifying the longest substring that appears at least twice in a text. **Distinct from Longest Substring Identification:** Specifically targets the longest repetition of a substring, distinct from general longest substring identification.
  • Longest Substring Without Repeats AlgorithmsAlgorithms for finding the longest contiguous substring with all unique characters using sliding window and hash map techniques. **Distinct from Longest Substring Identification:** Distinct from general Longest Substring Identification: specifically targets substrings with no repeating characters, not other criteria like sum or pattern.
  • Longest Valid Bracket SubstringAlgorithms for finding the longest contiguous balanced bracket sequence. **Distinct from Longest Substring Identification:** Specifically searches for the longest valid segment of brackets, unlike general substring identification.
  • Longest Valid Parentheses IdentificationAlgorithms for finding the maximum length of a contiguous matched parentheses sequence. **Distinct from Longest Substring Identification:** Specifically targets matched parentheses logic within the context of longest substring identification.
  • Suffix Array AnalysisAnalysis of strings using suffix arrays to identify complex repeated patterns and substrings. **Distinct from Longest Substring Identification:** Focuses on the use of suffix array data structures for analysis, rather than just identifying a single longest substring.