{"action":"created","issue":{"url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/issues/8","repository_url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview","labels_url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/issues/8/labels{/name}","comments_url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/issues/8/comments","events_url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/issues/8/events","html_url":"https://github.com/honghaoz/CrackingTheCodingInterview/issues/8","id":186978265,"number":8,"title":"Sort and Search","user":{"login":"honghaoz","id":3926785,"avatar_url":"https://avatars.githubusercontent.com/u/3926785?v=3","gravatar_id":"","url":"https://api.github.com/users/honghaoz","html_url":"https://github.com/honghaoz","followers_url":"https://api.github.com/users/honghaoz/followers","following_url":"https://api.github.com/users/honghaoz/following{/other_user}","gists_url":"https://api.github.com/users/honghaoz/gists{/gist_id}","starred_url":"https://api.github.com/users/honghaoz/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/honghaoz/subscriptions","organizations_url":"https://api.github.com/users/honghaoz/orgs","repos_url":"https://api.github.com/users/honghaoz/repos","events_url":"https://api.github.com/users/honghaoz/events{/privacy}","received_events_url":"https://api.github.com/users/honghaoz/received_events","type":"User","site_admin":false},"labels":[{"id":157294505,"url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/labels/Ongoing","name":"Ongoing","color":"84b6eb","default":false}],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":6,"created_at":"2016-11-03T04:47:17Z","updated_at":"2016-11-28T02:35:18Z","closed_at":"2016-11-03T04:48:42Z","body":"## Sort [0/6]\r\n| ❔ | Title | Difficulty | Time | Space |\r\n| -- | ----- | ---------- | ---- | ----- |\r\n❌ | [Sort Colors](https://leetcode.com/problems/sort-colors/)| Medium| O(n)| O(1)|\r\n❌ | [Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)| Medium| O(n)| O(1)|\r\n❌ | [Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| Medium| O(nlogn)| O(n)|\r\n❌ | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)| Medium| O(nlogn)| O(n)|\r\n❌ | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| Easy| O(nlogn)| O(1)|\r\n❌ | [Merge Intervals](https://leetcode.com/problems/merge-intervals/)| Hard| O(nlogn)| O(n)|\r\n\r\n## Search [2/9]\r\n| ❔ | Title | Difficulty | Time | Space |\r\n| -- | ----- | ---------- | ---- | ----- |\r\n❌ | [Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| Easy| O(logn)| O(1)|\r\n✅ | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| Hard| O(logn)| O(1)|\r\n✅ | [Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| Medium| O(logn)| O(1)|\r\n❌ | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| Medium| O(logn)| O(1)|\r\n❌ | [Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| Hard| O(logn)| O(1)|\r\n❌ | [Search for a Range](https://leetcode.com/problems/search-for-a-range/)| Medium| O(logn)| O(1)|\r\n❌ | [Search Insert Position](https://leetcode.com/problems/search-insert-position/)| Medium| O(logn)| O(1)|\r\n❌ | [Find Peak Element](https://leetcode.com/problems/find-peak-element/)| Medium| O(logn)| O(1)|\r\n❌ | [Sqrt(x)](https://leetcode.com/problems/sqrtx/)| Medium| O(logn)| O(1)|"},"comment":{"url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/issues/comments/263170441","html_url":"https://github.com/honghaoz/CrackingTheCodingInterview/issues/8#issuecomment-263170441","issue_url":"https://api.github.com/repos/honghaoz/CrackingTheCodingInterview/issues/8","id":263170441,"user":{"login":"honghaoz","id":3926785,"avatar_url":"https://avatars.githubusercontent.com/u/3926785?v=3","gravatar_id":"","url":"https://api.github.com/users/honghaoz","html_url":"https://github.com/honghaoz","followers_url":"https://api.github.com/users/honghaoz/followers","following_url":"https://api.github.com/users/honghaoz/following{/other_user}","gists_url":"https://api.github.com/users/honghaoz/gists{/gist_id}","starred_url":"https://api.github.com/users/honghaoz/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/honghaoz/subscriptions","organizations_url":"https://api.github.com/users/honghaoz/orgs","repos_url":"https://api.github.com/users/honghaoz/repos","events_url":"https://api.github.com/users/honghaoz/events{/privacy}","received_events_url":"https://api.github.com/users/honghaoz/received_events","type":"User","site_admin":false},"created_at":"2016-11-28T02:35:18Z","updated_at":"2016-11-28T02:35:18Z","body":"## Closest Binary Search Tree Value"}}
{"actor":{"display_login":"honghaoz"}}