4 dépôts
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
Trouvez les meilleurs dépôts grâce à l'IA.Nous recherchons les dépôts les plus pertinents grâce à l'IA.
- sharingsource/logicstack-leetcode
SharingSource/LogicStack-LeetCode
7,495Voir sur GitHubLogicStack-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 - coells/100days
coells/100days
7,488Voir sur GitHubThis 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 - chanda-abdul/several-coding-patterns-for-solving-data-structures-and-algorithms-problems-during-interviews
Chanda-Abdul/Several-Coding-Patterns-for-Solving-Data-Structures-and-Algorithms-Problems-during-Interviews
4,129Voir sur GitHubThis 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 - hoanhan101/algo
hoanhan101/algo
3,678Voir sur GitHubThis 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
