{"action":"created","issue":{"url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/issues/83","repository_url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding","labels_url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/issues/83/labels{/name}","comments_url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/issues/83/comments","events_url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/issues/83/events","html_url":"https://github.com/sahilbansal17/Competitive_Coding/issues/83","id":335416631,"node_id":"MDU6SXNzdWUzMzU0MTY2MzE=","number":83,"title":"Pair sum problem in a Tree","user":{"login":"ramitsawhney27","id":24762556,"node_id":"MDQ6VXNlcjI0NzYyNTU2","avatar_url":"https://avatars3.githubusercontent.com/u/24762556?v=4","gravatar_id":"","url":"https://api.github.com/users/ramitsawhney27","html_url":"https://github.com/ramitsawhney27","followers_url":"https://api.github.com/users/ramitsawhney27/followers","following_url":"https://api.github.com/users/ramitsawhney27/following{/other_user}","gists_url":"https://api.github.com/users/ramitsawhney27/gists{/gist_id}","starred_url":"https://api.github.com/users/ramitsawhney27/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/ramitsawhney27/subscriptions","organizations_url":"https://api.github.com/users/ramitsawhney27/orgs","repos_url":"https://api.github.com/users/ramitsawhney27/repos","events_url":"https://api.github.com/users/ramitsawhney27/events{/privacy}","received_events_url":"https://api.github.com/users/ramitsawhney27/received_events","type":"User","site_admin":false},"labels":[{"id":961513171,"node_id":"MDU6TGFiZWw5NjE1MTMxNzE=","url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/labels/GSSoC","name":"GSSoC","color":"f2eb6a","default":false},{"id":766251497,"node_id":"MDU6TGFiZWw3NjYyNTE0OTc=","url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/labels/algorithms","name":"algorithms","color":"31f70e","default":false},{"id":975747415,"node_id":"MDU6TGFiZWw5NzU3NDc0MTU=","url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/labels/challenge","name":"challenge","color":"3f6ebf","default":false},{"id":972521353,"node_id":"MDU6TGFiZWw5NzI1MjEzNTM=","url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/labels/pro","name":"pro","color":"fc8f7b","default":false}],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":11,"created_at":"2018-06-25T13:51:42Z","updated_at":"2018-07-09T10:29:37Z","closed_at":null,"author_association":"COLLABORATOR","body":"Given a balanced binary search tree (take a sample tree in your code) and a number x, your task is to determine if there exists a pair of nodes, such that their sum is equal to x. Every node contains a value, left ptr and right ptr. \r\n\r\nThe following tasks need to be done for an entire score:\r\n1. Return the larger of the two numbers if there exists a pair, else -1 in time O(n).\r\n2. Space taken should be less than O(n).\r\n3. Explanations for all methods and time/space complexities."},"comment":{"url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/issues/comments/403434103","html_url":"https://github.com/sahilbansal17/Competitive_Coding/issues/83#issuecomment-403434103","issue_url":"https://api.github.com/repos/sahilbansal17/Competitive_Coding/issues/83","id":403434103,"node_id":"MDEyOklzc3VlQ29tbWVudDQwMzQzNDEwMw==","user":{"login":"tanvi15","id":29301442,"node_id":"MDQ6VXNlcjI5MzAxNDQy","avatar_url":"https://avatars2.githubusercontent.com/u/29301442?v=4","gravatar_id":"","url":"https://api.github.com/users/tanvi15","html_url":"https://github.com/tanvi15","followers_url":"https://api.github.com/users/tanvi15/followers","following_url":"https://api.github.com/users/tanvi15/following{/other_user}","gists_url":"https://api.github.com/users/tanvi15/gists{/gist_id}","starred_url":"https://api.github.com/users/tanvi15/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/tanvi15/subscriptions","organizations_url":"https://api.github.com/users/tanvi15/orgs","repos_url":"https://api.github.com/users/tanvi15/repos","events_url":"https://api.github.com/users/tanvi15/events{/privacy}","received_events_url":"https://api.github.com/users/tanvi15/received_events","type":"User","site_admin":false},"created_at":"2018-07-09T10:29:37Z","updated_at":"2018-07-09T10:29:37Z","author_association":"CONTRIBUTOR","body":"Managed time complexity of O(nlogn) and space O(1), but I guess that's not permissible? "}}
{"actor":{"display_login":"tanvi15"}}