awesome-repositories.com
Blog
awesome-repositories.com

Descoperă cele mai bune repository-uri open source cu căutare AI.

ExploreazăCăutări recomandateAlternative open-sourceSoftware self-hostedBlogHartă site
ProiectDespreCum realizăm clasamentulPresăServer MCP
LegalConfidențialitateTermeni
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

1 repository

Awesome GitHub RepositoriesJosephus Problem Solving

Algorithms for finding the survivor in circular sequential elimination games.

Distinct from Knapsack Problem Solving: Specifically solves the Josephus problem, distinct from knapsack or partition optimization.

Explore 1 awesome GitHub repository matching software engineering & architecture · Josephus Problem Solving. Refine with filters or upvote what's useful.

Awesome Josephus Problem Solving GitHub Repositories

Găsește cele mai bune repo-uri cu AI.Vom căuta cele mai potrivite repository-uri folosind AI.
  • sharingsource/logicstack-leetcodeAvatar SharingSource

    SharingSource/LogicStack-LeetCode

    7,495Vezi pe GitHub↗

    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

    Employs two pointers moving at different speeds to detect cycles in linked lists or find middle elements.

    algorithminterview-practiceinterview-questions
    Vezi pe GitHub↗7,495
  1. Home
  2. Software Engineering & Architecture
  3. Algorithmic Problem Solving
  4. Josephus Problem Solving

Explorează sub-etichetele

  • Bracket Matching SolutionsSolutions for validating and manipulating nested bracket structures using stack-based parsing for interview challenges. **Distinct from Josephus Problem Solving:** Distinct from Josephus Problem Solving: focuses on bracket matching and validation, not circular elimination games.
  • Fast and Slow Pointer SolversAlgorithms using two pointers moving at different speeds to detect cycles in linked lists or find middle elements. **Distinct from Josephus Problem Solving:** Distinct from Josephus Problem Solving: focuses on pointer-based cycle detection and middle element finding, not circular elimination games.
  • Game Theory Problem Solving1 sub-tagApplies minimax and optimal play strategies to determine outcomes in two-player deterministic games. **Distinct from Josephus Problem Solving:** Distinct from Josephus Problem Solving: covers general two-player game theory (minimax, optimal play) rather than the specific Josephus elimination problem.
  • Queue-Based SolutionsCurated LeetCode solutions for queue-related challenges including circular queues and sliding window averages. **Distinct from Josephus Problem Solving:** Distinct from Josephus Problem Solving: focuses on general queue data structure problems rather than circular elimination games.
  • String Manipulation SolutionsSolutions for string challenges including palindrome detection, integer conversion, and IP address validation. **Distinct from Josephus Problem Solving:** Distinct from Josephus Problem Solving: focuses on string processing techniques rather than circular elimination games.