{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":801650084,"defaultBranch":"main","name":"DataStructure_and_AlgorithmInRust","ownerLogin":"da0p","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-05-16T16:36:03.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/36796990?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1715877377.0","currentOid":""},"activityList":{"items":[{"before":"17608964d1191322db04e385cd1bc56b7371444e","after":"25c0f3bafbbbe279be2cf25b8e5acc704359304b","ref":"refs/heads/main","pushedAt":"2024-07-27T21:39:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"count_subarrays: count number of subarrays that sum to a provided value","shortMessageHtmlLink":"count_subarrays: count number of subarrays that sum to a provided value"}},{"before":"2d128157222e84bb6feba6f1c1b9586fbaeb5d44","after":"17608964d1191322db04e385cd1bc56b7371444e","ref":"refs/heads/main","pushedAt":"2024-07-27T20:42:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"sliding_max_window: finds the maximum number of consecutive subwindow","shortMessageHtmlLink":"sliding_max_window: finds the maximum number of consecutive subwindow"}},{"before":"2702f895d86a4c52ff8016f790be8ffc8a60d8fe","after":"2d128157222e84bb6feba6f1c1b9586fbaeb5d44","ref":"refs/heads/main","pushedAt":"2024-07-27T13:42:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"smallest_distinct_window: find a window that contains distinct characters of a string","shortMessageHtmlLink":"smallest_distinct_window: find a window that contains distinct charac…"}},{"before":"3bdd0ef90dc2557bab90ddb0efcbde79f3ff0918","after":"2702f895d86a4c52ff8016f790be8ffc8a60d8fe","ref":"refs/heads/main","pushedAt":"2024-07-27T09:36:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"string_window: find the smallest window containing all characters of a pattern","shortMessageHtmlLink":"string_window: find the smallest window containing all characters of …"}},{"before":"36b13543feb6c439b2fa3488932b30639befe67d","after":"3bdd0ef90dc2557bab90ddb0efcbde79f3ff0918","ref":"refs/heads/main","pushedAt":"2024-07-25T07:34:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"sub_str: find the longest unique substring without duplicated character","shortMessageHtmlLink":"sub_str: find the longest unique substring without duplicated character"}},{"before":"33b95ceffba73e7b0d50bce925408ca6e645f530","after":"36b13543feb6c439b2fa3488932b30639befe67d","ref":"refs/heads/main","pushedAt":"2024-07-25T06:46:53.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"housing: find all ranges that sum is equal to a value","shortMessageHtmlLink":"housing: find all ranges that sum is equal to a value"}},{"before":"7245d26284b48a726a05c64e92411159b50e674c","after":"33b95ceffba73e7b0d50bce925408ca6e645f530","ref":"refs/heads/main","pushedAt":"2024-07-24T21:51:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"housing: find all ranges that sum is equal to a value","shortMessageHtmlLink":"housing: find all ranges that sum is equal to a value"}},{"before":"9671244e40690e112f1e58a8216b2939eeba9ff5","after":"7245d26284b48a726a05c64e92411159b50e674c","ref":"refs/heads/main","pushedAt":"2024-07-21T08:29:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"earth_level: calculate steps in power of two to reach a final goal","shortMessageHtmlLink":"earth_level: calculate steps in power of two to reach a final goal"}},{"before":"f238dbc5ce6e830dca224b21a085ce99813e7b06","after":"9671244e40690e112f1e58a8216b2939eeba9ff5","ref":"refs/heads/main","pushedAt":"2024-07-17T22:05:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"fast_exp: fast exponential calculation","shortMessageHtmlLink":"fast_exp: fast exponential calculation"}},{"before":"feb2f2cddf9496fa84a30f43bd73cc9fbc13efd6","after":"f238dbc5ce6e830dca224b21a085ce99813e7b06","ref":"refs/heads/main","pushedAt":"2024-07-17T21:46:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"count_set_bits: count number of set bits of a number","shortMessageHtmlLink":"count_set_bits: count number of set bits of a number"}},{"before":"15db1b603d4948ebe121210553eb1246f5c63c82","after":"feb2f2cddf9496fa84a30f43bd73cc9fbc13efd6","ref":"refs/heads/main","pushedAt":"2024-07-15T07:31:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"replace_bits: replace a bit range from one number to another number","shortMessageHtmlLink":"replace_bits: replace a bit range from one number to another number"}},{"before":"716deb3d17ea6efa4cf313da6377c78b633fe1bf","after":"15db1b603d4948ebe121210553eb1246f5c63c82","ref":"refs/heads/main","pushedAt":"2024-07-14T12:51:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"string_normalization: normalize string\n\n- First character of every word is capitalized, the rest should be\n  lower-case","shortMessageHtmlLink":"string_normalization: normalize string"}},{"before":"8e00f3f073c79b95f4561c9eb10fc0199650b4bf","after":"716deb3d17ea6efa4cf313da6377c78b633fe1bf","ref":"refs/heads/main","pushedAt":"2024-07-14T12:27:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"break_palindrome: break a palindrome\n\n- Replace a character in a palindrome to break it and the result must be\nlexicographically smallest","shortMessageHtmlLink":"break_palindrome: break a palindrome"}},{"before":"ef7b536dd0a71150b2a82e5315b94b1adf00ca86","after":"8e00f3f073c79b95f4561c9eb10fc0199650b4bf","ref":"refs/heads/main","pushedAt":"2024-07-14T10:03:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"encoding_length: encode a string with length","shortMessageHtmlLink":"encoding_length: encode a string with length"}},{"before":"cfbb3096c41fbc6ad46dd9ed9191d5deab98cb61","after":"ef7b536dd0a71150b2a82e5315b94b1adf00ca86","ref":"refs/heads/main","pushedAt":"2024-07-14T08:24:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"biggest_number_string: form the biggest number string","shortMessageHtmlLink":"biggest_number_string: form the biggest number string"}},{"before":"b584adf26b907eab53bcec6c48fd54e6c0161d99","after":"cfbb3096c41fbc6ad46dd9ed9191d5deab98cb61","ref":"refs/heads/main","pushedAt":"2024-06-16T09:54:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"space20: replace space with %20","shortMessageHtmlLink":"space20: replace space with %20"}},{"before":"a092a92a3a26bf1ddfe3f7eb6f36ea1d5c721214","after":"b584adf26b907eab53bcec6c48fd54e6c0161d99","ref":"refs/heads/main","pushedAt":"2024-06-16T09:49:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"search_all: find all indices of a key word inside a string","shortMessageHtmlLink":"search_all: find all indices of a key word inside a string"}},{"before":"928f37ea5972e876a7b194987aa42bfd0522da5a","after":"a092a92a3a26bf1ddfe3f7eb6f36ea1d5c721214","ref":"refs/heads/main","pushedAt":"2024-06-16T09:23:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"busy_life: find maximum number of non-overlapping ranges","shortMessageHtmlLink":"busy_life: find maximum number of non-overlapping ranges"}},{"before":"fd4e6a2173487dc2d9b8caa2c2edcdc487f53b80","after":"928f37ea5972e876a7b194987aa42bfd0522da5a","ref":"refs/heads/main","pushedAt":"2024-06-16T08:18:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"product_array: product of every other number except the current one","shortMessageHtmlLink":"product_array: product of every other number except the current one"}},{"before":"4a9d10b1d84ecf8d3f01e16b256d3304723f5dd4","after":"fd4e6a2173487dc2d9b8caa2c2edcdc487f53b80","ref":"refs/heads/main","pushedAt":"2024-06-15T21:20:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"min_diff: find pair of numbers what absolute value is closest to zero","shortMessageHtmlLink":"min_diff: find pair of numbers what absolute value is closest to zero"}},{"before":"6115e05ed304472926aa424c67321dfbdade286b","after":"4a9d10b1d84ecf8d3f01e16b256d3304723f5dd4","ref":"refs/heads/main","pushedAt":"2024-06-15T20:27:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"Max subarray: Find max subarray","shortMessageHtmlLink":"Max subarray: Find max subarray"}},{"before":"5d8f43a334163a1ddefa9faa4309497f89967014","after":"6115e05ed304472926aa424c67321dfbdade286b","ref":"refs/heads/main","pushedAt":"2024-06-02T20:58:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"Min swaps: Find the min number of swaps to sort an array","shortMessageHtmlLink":"Min swaps: Find the min number of swaps to sort an array"}},{"before":"bf7d80a219dd4a6b6e66609609fa75e02c62a10c","after":"5d8f43a334163a1ddefa9faa4309497f89967014","ref":"refs/heads/main","pushedAt":"2024-05-19T17:07:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"Subarray: Find starting and ending indices of an out-of-order\nsubarray","shortMessageHtmlLink":"Subarray: Find starting and ending indices of an out-of-order"}},{"before":"fb1c35bb80a0ee62d44794039cf1fcf18528f617","after":"bf7d80a219dd4a6b6e66609609fa75e02c62a10c","ref":"refs/heads/main","pushedAt":"2024-05-18T08:45:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"rain: Total of water trapped","shortMessageHtmlLink":"rain: Total of water trapped"}},{"before":"d6cfe7eb190973055f10b03e91727f1c362fa70f","after":"fb1c35bb80a0ee62d44794039cf1fcf18528f617","ref":"refs/heads/main","pushedAt":"2024-05-18T07:33:37.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"mountain: Find longest band of numbers","shortMessageHtmlLink":"mountain: Find longest band of numbers"}},{"before":"87744da2e581cbbeeb495d5ab087c7dfed1649f3","after":"d6cfe7eb190973055f10b03e91727f1c362fa70f","ref":"refs/heads/main","pushedAt":"2024-05-18T07:29:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"mountain: Find longest band of numbers","shortMessageHtmlLink":"mountain: Find longest band of numbers"}},{"before":"6f93ed7bf4614f5072217149f659f608c0dde0be","after":"87744da2e581cbbeeb495d5ab087c7dfed1649f3","ref":"refs/heads/main","pushedAt":"2024-05-16T17:29:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"pairs: Find all pairs that sum to a target sum","shortMessageHtmlLink":"pairs: Find all pairs that sum to a target sum"}},{"before":"5bfa58ef2639b7c724497fd5d242ad41c2647e83","after":"6f93ed7bf4614f5072217149f659f608c0dde0be","ref":"refs/heads/main","pushedAt":"2024-05-16T16:38:15.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"triplets: find combinations of three numbers making to a target sum","shortMessageHtmlLink":"triplets: find combinations of three numbers making to a target sum"}},{"before":null,"after":"5bfa58ef2639b7c724497fd5d242ad41c2647e83","ref":"refs/heads/main","pushedAt":"2024-05-16T16:36:17.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"da0p","name":"Phuong Dao","path":"/da0p","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/36796990?s=80&v=4"},"commit":{"message":"triplets: find combinations of three numbers making to a target sum","shortMessageHtmlLink":"triplets: find combinations of three numbers making to a target sum"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNy0yN1QyMTozOTo0OS4wMDAwMDBazwAAAASK4rKz","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNy0yN1QyMTozOTo0OS4wMDAwMDBazwAAAASK4rKz","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNS0xNlQxNjozNjoxNy4wMDAwMDBazwAAAARL3TXt"}},"title":"Activity · da0p/DataStructure_and_AlgorithmInRust"}