Title: Day 18: q1: Maximum Difference Between Node and Ancestor · Issue #396 · SnowScriptWinterOfCode/LeetCode_Q · GitHub
Open Graph Title: Day 18: q1: Maximum Difference Between Node and Ancestor · Issue #396 · SnowScriptWinterOfCode/LeetCode_Q
X Title: Day 18: q1: Maximum Difference Between Node and Ancestor · Issue #396 · SnowScriptWinterOfCode/LeetCode_Q
Description: Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: any child of a is equal to b or any chil...
Open Graph Description: Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: ...
X Description: Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: ...
Opengraph URL: https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/396
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Day 18: q1: Maximum Difference Between Node and Ancestor","articleBody":"Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b.\r\n\r\nA node a is an ancestor of b if either: any child of a is equal to b or any child of a is an ancestor of b.\r\n\r\nExample 1:\r\n\r\nInput: root = [8,3,10,1,6,null,14,null,null,4,7,13]\r\nOutput: 7\r\n\r\n\r\nExplanation: We have various ancestor-node differences, some of which are given below :\r\n|8 - 3| = 5\r\n|3 - 7| = 4\r\n|8 - 1| = 7\r\n|10 - 13| = 3\r\nAmong all possible differences, the maximum value of 7 is obtained by |8 - 1| = 7.\r\n\r\nExample 2:\r\n\r\nInput: root = [1,null,2,null,0,3]\r\nOutput: 3\r\n\r\n\r\nConstraints:\r\n\r\n The number of nodes in the tree is in the range [2, 5000].\r\n 0 \u003c= Node.val \u003c= 105\r\n\r\nProblem link: https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/description/?envType=daily-question&envId=2024-01-11\r\n ","author":{"url":"https://github.com/prerna-rn","@type":"Person","name":"prerna-rn"},"datePublished":"2024-01-14T07:32:21Z","url":"https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/396"}
| 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:c76bf4cd-115a-5557-b0ca-4502420d34ea |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | AC10:18D1D3:4A76F7:6032E1:6AFFCEBB |
| html-safe-nonce | 7e4b835848f3b08594a500f3f497ba49fb60a835a1c9bf2aa65feb5050fdbc5c |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJBQzEwOjE4RDFEMzo0QTc2Rjc6NjAzMkUxOjZBRkZDRUJCIiwidmlzaXRvcl9pZCI6IjEyMDY5NzQzODI3ODY3Mjc2MTEiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 9ff0098c29a64b64bd32ba4f6f38f7f428d6513b1871589f6dd1cc246a8ff88d |
| hovercard-subject-tag | issue:2080617704 |
| 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/396/issue_layout |
| twitter:image | https://opengraph.githubassets.com/4c5e651b8dbe45dfd6dbe7de7a107ba8264a651607e9c3f20ffdfbbabf8812fc/SnowScriptWinterOfCode/LeetCode_Q/issues/396 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/4c5e651b8dbe45dfd6dbe7de7a107ba8264a651607e9c3f20ffdfbbabf8812fc/SnowScriptWinterOfCode/LeetCode_Q/issues/396 |
| og:image:alt | Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b. A node a is an ancestor of b if either: ... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | prerna-rn |
| 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