Title: GitHub · Where software is built
Open Graph Title: joney000/Java-Competitive-Programming
X Title: joney000/Java-Competitive-Programming
Description: I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ... - joney000/Java-Competitive-Programming
Open Graph Description: I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement la...
X Description: I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implemen...
Opengraph URL: https://github.com/joney000/Java-Competitive-Programming
X: @github
Domain: patch-diff.githubusercontent.com
| route-pattern | /:user_id/:repository/issues(.:format) |
| route-controller | issues |
| route-action | index |
| fetch-nonce | v2:a09964b8-33aa-0c59-23d5-891e015261b6 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | C6F8:16CF0C:CBD910:1185386:698F05CA |
| html-safe-nonce | 53fe6ead40285eb6bfb7b0c33aa395602e177c886b1ef0a1d820512ea4506ed8 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDNkY4OjE2Q0YwQzpDQkQ5MTA6MTE4NTM4Njo2OThGMDVDQSIsInZpc2l0b3JfaWQiOiI1MjE5NDI2MDE0Mjk2MjEyOTM5IiwicmVnaW9uX2VkZ2UiOiJpYWQiLCJyZWdpb25fcmVuZGVyIjoiaWFkIn0= |
| visitor-hmac | 58288412555d9abcf52f7eccaecfc69e9c0079400e43dadfcbd4f9c3029f16c2 |
| hovercard-subject-tag | repository:75046321 |
| github-keyboard-shortcuts | repository,issues,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/joney000/Java-Competitive-Programming/issues |
| twitter:image | https://opengraph.githubassets.com/cab46ef0e1220283bf3d4c1ad54aee9bbf9c48b707b992a27d17850f900036dd/joney000/Java-Competitive-Programming |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/cab46ef0e1220283bf3d4c1ad54aee9bbf9c48b707b992a27d17850f900036dd/joney000/Java-Competitive-Programming |
| og:image:alt | I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement la... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 2da1a0d1318592c9965539b12269c4641177dfabfc86c3807992efb13e1d96ff |
| turbo-cache-control | no-cache |
| go-import | github.com/joney000/Java-Competitive-Programming git https://github.com/joney000/Java-Competitive-Programming.git |
| octolytics-dimension-user_id | 7651585 |
| octolytics-dimension-user_login | joney000 |
| octolytics-dimension-repository_id | 75046321 |
| octolytics-dimension-repository_nwo | joney000/Java-Competitive-Programming |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 75046321 |
| octolytics-dimension-repository_network_root_nwo | joney000/Java-Competitive-Programming |
| 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 | 66d26b1a7f81bd3ffe8d0f16abab43f6e64fd21a |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width