Skip to content

Navigation Menu

Appearance settings

Explore
By company size
By use case
By industry
View all solutions
Topics
- AI
- DevOps
- Security
- Software Development
- View all
Explore
- GitHub Sponsors
  Fund open source developers
- The ReadME Project
  GitHub community articles
Repositories
- Enterprise platform
  AI-powered developer platform
Available add-ons
Pricing

Search code, repositories, users, issues, pull requests...

Search

Clear

Search syntax tips

Provide feedback

We read every piece of feedback, and take your input very seriously.

Include my email address so I can be contacted

Saved searches

Use saved searches to filter your results more quickly

Name

Query

To see all available qualifiers, see our documentation.

Appearance settings

You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session.

Dismiss alert

rafiulgits / Algorithm-Lab Public

Notifications You must be signed in to change notification settings
Fork 2
Star 3

Code
Issues
Pull requests
Actions
Projects
Uncyclo
Security
Insights

Additional navigation options

Code
Issues
Pull requests
Actions
Projects
Uncyclo
Security
Insights

Euclidean and Extended Euclidean for GCD

Jump to bottom

Rafiul Islam edited this page Nov 24, 2018 · 5 revisions

Uncyclo

©Rafiul

Toggle table of contents Pages 8

Home
Coin Changing (Unlimited Coin Supply)
Euclidean and Extended Euclidean for GCD
Longest Common Subsequence (LCS)
Longest Increasing Subsequence (LIS)
Matrix Chain Multiplication
String pattern matching with KMP
String pattern matching with transition table (finite automata)

Clone this wiki locally

Footer

© 2025 GitHub, Inc.

Footer navigation

Terms
Privacy
Security
Status
Docs
Contact

You can’t perform that action at this time.