payload: {"action":"created","issue":{"url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19/issues/15","repository_url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19","labels_url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19/issues/15/labels{/name}","comments_url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19/issues/15/comments","events_url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19/issues/15/events","html_url":"https://github.com/seneca-btp500f19/btp500-f19/issues/15","id":532769342,"node_id":"MDU6SXNzdWU1MzI3NjkzNDI=","number":15,"title":"ExamReview #5","user":{"login":"rayshroom","id":48970247,"node_id":"MDQ6VXNlcjQ4OTcwMjQ3","avatar_url":"https://avatars2.githubusercontent.com/u/48970247?v=4","gravatar_id":"","url":"https://api.github.com/users/rayshroom","html_url":"https://github.com/rayshroom","followers_url":"https://api.github.com/users/rayshroom/followers","following_url":"https://api.github.com/users/rayshroom/following{/other_user}","gists_url":"https://api.github.com/users/rayshroom/gists{/gist_id}","starred_url":"https://api.github.com/users/rayshroom/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rayshroom/subscriptions","organizations_url":"https://api.github.com/users/rayshroom/orgs","repos_url":"https://api.github.com/users/rayshroom/repos","events_url":"https://api.github.com/users/rayshroom/events{/privacy}","received_events_url":"https://api.github.com/users/rayshroom/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":6,"created_at":"2019-12-04T15:45:25Z","updated_at":"2019-12-10T22:07:24Z","closed_at":null,"author_association":"NONE","body":"5. If you were to implement a reverse phone directory (You enter a phone number to find a person), what data structure would you use for the table.\r\n\r\nA: Depends on the purpose of the use case. If we want to know about existence of a number in the directory, a hash table would be good. If we want to know all numbers in the 647 or 905 area, a trie would be better.\r\n\r\n-----------------\r\nActually shouldn't trie be better than hashtable in both retrieval and space efficiency?"},"comment":{"url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19/issues/comments/564281161","html_url":"https://github.com/seneca-btp500f19/btp500-f19/issues/15#issuecomment-564281161","issue_url":"https://api.github.com/repos/seneca-btp500f19/btp500-f19/issues/15","id":564281161,"node_id":"MDEyOklzc3VlQ29tbWVudDU2NDI4MTE2MQ==","user":{"login":"cathyatseneca","id":201646,"node_id":"MDQ6VXNlcjIwMTY0Ng==","avatar_url":"https://avatars0.githubusercontent.com/u/201646?v=4","gravatar_id":"","url":"https://api.github.com/users/cathyatseneca","html_url":"https://github.com/cathyatseneca","followers_url":"https://api.github.com/users/cathyatseneca/followers","following_url":"https://api.github.com/users/cathyatseneca/following{/other_user}","gists_url":"https://api.github.com/users/cathyatseneca/gists{/gist_id}","starred_url":"https://api.github.com/users/cathyatseneca/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cathyatseneca/subscriptions","organizations_url":"https://api.github.com/users/cathyatseneca/orgs","repos_url":"https://api.github.com/users/cathyatseneca/repos","events_url":"https://api.github.com/users/cathyatseneca/events{/privacy}","received_events_url":"https://api.github.com/users/cathyatseneca/received_events","type":"User","site_admin":false},"created_at":"2019-12-10T22:07:24Z","updated_at":"2019-12-10T22:07:24Z","author_association":"CONTRIBUTOR","body":"you can translate the idea of a phone number into a trie... I mean text is arbitrary and its easy enough to find any digit of a number with / and %. extensions are just more digits... \r\n"}}
other: {"actor":{"display_login":"cathyatseneca"}}