{"action":"created","issue":{"url":"https://api.github.com/repos/congr/world/issues/163","repository_url":"https://api.github.com/repos/congr/world","labels_url":"https://api.github.com/repos/congr/world/issues/163/labels{/name}","comments_url":"https://api.github.com/repos/congr/world/issues/163/comments","events_url":"https://api.github.com/repos/congr/world/issues/163/events","html_url":"https://github.com/congr/world/issues/163","id":320119101,"node_id":"MDU6SXNzdWUzMjAxMTkxMDE=","number":163,"title":"InterviewBit : PathSum","user":{"login":"congr","id":9853714,"node_id":"MDQ6VXNlcjk4NTM3MTQ=","avatar_url":"https://avatars1.githubusercontent.com/u/9853714?v=4","gravatar_id":"","url":"https://api.github.com/users/congr","html_url":"https://github.com/congr","followers_url":"https://api.github.com/users/congr/followers","following_url":"https://api.github.com/users/congr/following{/other_user}","gists_url":"https://api.github.com/users/congr/gists{/gist_id}","starred_url":"https://api.github.com/users/congr/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/congr/subscriptions","organizations_url":"https://api.github.com/users/congr/orgs","repos_url":"https://api.github.com/users/congr/repos","events_url":"https://api.github.com/users/congr/events{/privacy}","received_events_url":"https://api.github.com/users/congr/received_events","type":"User","site_admin":false},"labels":[{"id":784394767,"node_id":"MDU6TGFiZWw3ODQzOTQ3Njc=","url":"https://api.github.com/repos/congr/world/labels/-InterviewBIt","name":"-InterviewBIt","color":"cceeff","default":false},{"id":807126100,"node_id":"MDU6TGFiZWw4MDcxMjYxMDA=","url":"https://api.github.com/repos/congr/world/labels/-LeetCode","name":"-LeetCode","color":"ffcc47","default":false},{"id":532871313,"node_id":"MDU6TGFiZWw1MzI4NzEzMTM=","url":"https://api.github.com/repos/congr/world/labels/DFS","name":"DFS","color":"f9d0c4","default":false},{"id":523006170,"node_id":"MDU6TGFiZWw1MjMwMDYxNzA=","url":"https://api.github.com/repos/congr/world/labels/Tree","name":"Tree","color":"1d76db","default":false}],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":4,"created_at":"2018-05-04T00:03:21Z","updated_at":"2018-06-18T02:46:20Z","closed_at":"2018-05-04T00:08:27Z","author_association":"OWNER","body":"https://www.interviewbit.com/problems/path-sum/\r\n\r\n![image](https://user-images.githubusercontent.com/9853714/39608077-f8eaff32-4f79-11e8-85f4-288709fe09e0.png)\r\n"},"comment":{"url":"https://api.github.com/repos/congr/world/issues/comments/397929005","html_url":"https://github.com/congr/world/issues/163#issuecomment-397929005","issue_url":"https://api.github.com/repos/congr/world/issues/163","id":397929005,"node_id":"MDEyOklzc3VlQ29tbWVudDM5NzkyOTAwNQ==","user":{"login":"congr","id":9853714,"node_id":"MDQ6VXNlcjk4NTM3MTQ=","avatar_url":"https://avatars1.githubusercontent.com/u/9853714?v=4","gravatar_id":"","url":"https://api.github.com/users/congr","html_url":"https://github.com/congr","followers_url":"https://api.github.com/users/congr/followers","following_url":"https://api.github.com/users/congr/following{/other_user}","gists_url":"https://api.github.com/users/congr/gists{/gist_id}","starred_url":"https://api.github.com/users/congr/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/congr/subscriptions","organizations_url":"https://api.github.com/users/congr/orgs","repos_url":"https://api.github.com/users/congr/repos","events_url":"https://api.github.com/users/congr/events{/privacy}","received_events_url":"https://api.github.com/users/congr/received_events","type":"User","site_admin":false},"created_at":"2018-06-18T02:46:20Z","updated_at":"2018-06-18T02:46:20Z","author_association":"OWNER","body":"112. Path Sum\r\nhttps://leetcode.com/problems/path-sum/description/\r\n\r\n```\r\nclass Solution {\r\n    public boolean hasPathSum(TreeNode node, int sum) {\r\n        if (node == null) return false;\r\n        \r\n        if (node.left == null && node.right == null) { // on leaf node\r\n            if (sum - node.val == 0) return true; \r\n        }\r\n        \r\n        return hasPathSum(node.left, sum - node.val) || hasPathSum(node.right, sum - node.val);\r\n    }\r\n}\r\n```"}}
{"actor":{"display_login":"congr"}}