Title: Commits · ManuelAAM/Dynamic-Algorithm-Design · GitHub
Open Graph Title: Commits · ManuelAAM/Dynamic-Algorithm-Design
X Title: Commits · ManuelAAM/Dynamic-Algorithm-Design
Description: Efficient C-based algorithm using dynamic programming and recursive functions to solve the "Minimum Cost to Cut a Stick" problem. - Commits · ManuelAAM/Dynamic-Algorithm-Design
Open Graph Description: Efficient C-based algorithm using dynamic programming and recursive functions to solve the "Minimum Cost to Cut a Stick" problem. - Commits · ManuelAAM/Dynamic-Algorithm-Design
X Description: Efficient C-based algorithm using dynamic programming and recursive functions to solve the "Minimum Cost to Cut a Stick" problem. - Commits · ManuelAAM/Dynamic-Algorithm-Design
Opengraph URL: https://github.com/ManuelAAM/Dynamic-Algorithm-Design
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /:user_id/:repository/graphs/commit-activity(.:format) |
| route-controller | repos_insights_commit_activity |
| route-action | index |
| fetch-nonce | v2:ab412ad7-bac4-2551-ed61-f1ac00181d16 |
| current-catalog-service-hash | b4d8436665c5448282b6f4eacc6394e6e8801de97cb226acdca9da20ae59be92 |
| request-id | D954:1B3FAE:DAF104:118847E:69908F81 |
| html-safe-nonce | a7dac60d4928d07d1c68667835581721335290ac961513f8366004bc8195f44b |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJEOTU0OjFCM0ZBRTpEQUYxMDQ6MTE4ODQ3RTo2OTkwOEY4MSIsInZpc2l0b3JfaWQiOiI0ODI5OTc4MTM2NzQ0NTk1MzI5IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0= |
| visitor-hmac | 2102e0959d464ca7cfe1a13f9d9692b91b71ebf11f8f2ffe4cfd11cdf7ddc879 |
| hovercard-subject-tag | repository:845785383 |
| github-keyboard-shortcuts | repository,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/ManuelAAM/Dynamic-Algorithm-Design/graphs/commit-activity |
| twitter:image | https://opengraph.githubassets.com/6a110866c738ac03bb9083d9445cc46b015f1fcef50788484f616096503d66cd/ManuelAAM/Dynamic-Algorithm-Design |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/6a110866c738ac03bb9083d9445cc46b015f1fcef50788484f616096503d66cd/ManuelAAM/Dynamic-Algorithm-Design |
| og:image:alt | Efficient C-based algorithm using dynamic programming and recursive functions to solve the "Minimum Cost to Cut a Stick" problem. - Commits · ManuelAAM/Dynamic-Algorithm-Design |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 42c603b9d642c4a9065a51770f75e5e27132fef0e858607f5c9cb7e422831a7b |
| turbo-cache-control | no-cache |
| go-import | github.com/ManuelAAM/Dynamic-Algorithm-Design git https://github.com/ManuelAAM/Dynamic-Algorithm-Design.git |
| octolytics-dimension-user_id | 149563807 |
| octolytics-dimension-user_login | ManuelAAM |
| octolytics-dimension-repository_id | 845785383 |
| octolytics-dimension-repository_nwo | ManuelAAM/Dynamic-Algorithm-Design |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 845785383 |
| octolytics-dimension-repository_network_root_nwo | ManuelAAM/Dynamic-Algorithm-Design |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 3b33c5aedc9808f45bc5fcf0b1e4404cf749dac7 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width