ustcliuc/Dynamic-Programming
Use dynamic programming to solve matrix chain multiplication problem and longest common substring problem (LCS problem)
Public GitHub Catalog
Discovered Sep 29, 2026
ustcliuc / Queens-Puzzle
Various solutions to find a solution of N queens puzzle including Backtracking, Random Search, Hill Climbing Search and Min-conflicts Search with optimized initialization
About this discovery
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
#15492389GitHub System ID
ustcliucOrganization / User
PublicVisibility
ActiveCatalog Status
More from ustcliuc
ustcliuc/8-puzzle
Recursive Best First Search and Iterative Depth First Search