Title: Day 21: Q2 - Container With Most Water · Issue #421 · SnowScriptWinterOfCode/LeetCode_Q · GitHub
Open Graph Title: Day 21: Q2 - Container With Most Water · Issue #421 · SnowScriptWinterOfCode/LeetCode_Q
X Title: Day 21: Q2 - Container With Most Water · Issue #421 · SnowScriptWinterOfCode/LeetCode_Q
Description: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the c...
Open Graph Description: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the ...
X Description: You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the ...
Opengraph URL: https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/421
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Day 21: Q2 - Container With Most Water","articleBody":"You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).\r\n\r\nFind two lines that together with the x-axis form a container, such that the container contains the most water.\r\n\r\nReturn the maximum amount of water a container can store.\r\n\r\nNotice that you may not slant the container.\r\n\r\nExample 1:\r\nInput: height = [1,8,6,2,5,4,8,3,7]\r\nOutput: 49\r\n\r\nExample 2: \r\nInput: height = [1,1]\r\nOutput: 1\r\n \r\nConstraints:\r\nn == height.length\r\n2 \u003c= n \u003c= 105\r\n0 \u003c= height[i] \u003c= 104","author":{"url":"https://github.com/Mansi8874","@type":"Person","name":"Mansi8874"},"datePublished":"2024-01-16T18:44:30Z","url":"https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/421"}
| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:373f502b-3e47-09e1-1939-d1c2a6aec3c9 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | 93DC:14A3EB:7A4B47:9E41E0:6AFFCED6 |
| html-safe-nonce | 8eb684653bcc7eee0fb58cc5d724c94b57ce4107314a616f9a7bcf8f3604e262 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiI5M0RDOjE0QTNFQjo3QTRCNDc6OUU0MUUwOjZBRkZDRUQ2IiwidmlzaXRvcl9pZCI6IjU2MjM1NzA3MjQ0OTgxNjU0NjIiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | e60ad15a1ff8fe63890299430d420898fbf991bc96e52a01748633bd2ade0941 |
| hovercard-subject-tag | issue:2084598155 |
| 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/_view_fragments/issues/show/SnowScriptWinterOfCode/LeetCode_Q/421/issue_layout |
| twitter:image | https://opengraph.githubassets.com/66c9dc607bc9abc031e88e991c4ab053c555714977beae800843dd8cce420b2a/SnowScriptWinterOfCode/LeetCode_Q/issues/421 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/66c9dc607bc9abc031e88e991c4ab053c555714977beae800843dd8cce420b2a/SnowScriptWinterOfCode/LeetCode_Q/issues/421 |
| og:image:alt | You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the ... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | Mansi8874 |
| hostname | github.com |
| expected-hostname | github.com |
| None | 0a0d8686a27478df474dd7415776a7a080cde8838b3cd92ea7601187572e5729 |
| turbo-cache-control | no-preview |
| go-import | github.com/SnowScriptWinterOfCode/LeetCode_Q git https://github.com/SnowScriptWinterOfCode/LeetCode_Q.git |
| octolytics-dimension-user_id | 154897622 |
| octolytics-dimension-user_login | SnowScriptWinterOfCode |
| octolytics-dimension-repository_id | 735947375 |
| octolytics-dimension-repository_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 735947375 |
| octolytics-dimension-repository_network_root_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| 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 | 16a11879678aaf97e2a42c33ee70830aa084fa37 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| react-app-name | issues |
Links:
Viewport: width=device-width