{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":802089391,"defaultBranch":"main","name":"my-datastructures-algorithms-journey","ownerLogin":"hoa-uit","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2024-05-17T13:57:48.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/66675230?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1716659197.0","currentOid":""},"activityList":{"items":[{"before":"71cfb0f6c700c180c99dbafb72b4d5d9344bb054","after":"229f151d22829f895974517d8749943dff0f3f14","ref":"refs/heads/main","pushedAt":"2024-06-22T17:00:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[DP][leetcode][300] find longest increasing sun sequence","shortMessageHtmlLink":"[DP][leetcode][300] find longest increasing sun sequence"}},{"before":"262bbb09a9367eee1877efea316cfb9ed8485777","after":"71cfb0f6c700c180c99dbafb72b4d5d9344bb054","ref":"refs/heads/main","pushedAt":"2024-06-18T16:38:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[heap] construct heap","shortMessageHtmlLink":"[heap] construct heap"}},{"before":"e6263dae785c6c5d07db741160206b4e59c235b1","after":"262bbb09a9367eee1877efea316cfb9ed8485777","ref":"refs/heads/main","pushedAt":"2024-06-01T17:15:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[graph] travering graph with bfs","shortMessageHtmlLink":"[graph] travering graph with bfs"}},{"before":"957543b0b2cb4c92387b272fe30d802aa3ba89cc","after":"e6263dae785c6c5d07db741160206b4e59c235b1","ref":"refs/heads/main","pushedAt":"2024-06-01T15:13:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[graph] intro","shortMessageHtmlLink":"[graph] intro"}},{"before":"524211df56b15bd6b24b2f43a7a0a861fb22ed3a","after":null,"ref":"refs/heads/feature/DFS-sum-path-numbers","pushedAt":"2024-05-25T17:46:37.000Z","pushType":"branch_deletion","commitsCount":0,"pusher":{"login":"maithithuycd","name":"Truong Minh Quan","path":"/maithithuycd","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/160269137?s=80&v=4"}},{"before":"170d9316f979148e78a413b71c9eb8546c17a295","after":"957543b0b2cb4c92387b272fe30d802aa3ba89cc","ref":"refs/heads/main","pushedAt":"2024-05-25T17:45:23.000Z","pushType":"pr_merge","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[DFS] sum path number of binary tree (#1)","shortMessageHtmlLink":"[DFS] sum path number of binary tree (<a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"2317144218\" data-permission-text=\"Title is private\" data-url=\"https://github.com/hoa-uit/my-datastructures-algorithms-journey/issues/1\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/hoa-uit/my-datastructures-algorithms-journey/pull/1/hovercard\" href=\"https://github.com/hoa-uit/my-datastructures-algorithms-journey/pull/1\">#1</a>)"}},{"before":null,"after":"524211df56b15bd6b24b2f43a7a0a861fb22ed3a","ref":"refs/heads/feature/DFS-sum-path-numbers","pushedAt":"2024-05-25T17:12:57.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[DFS] sum path number of binary tree","shortMessageHtmlLink":"[DFS] sum path number of binary tree"}},{"before":"160ec035ff5122593760a80757fc0d98bfbae576","after":"170d9316f979148e78a413b71c9eb8546c17a295","ref":"refs/heads/main","pushedAt":"2024-05-25T16:14:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[DFS] find all path sum is S","shortMessageHtmlLink":"[DFS] find all path sum is S"}},{"before":"2470eb7927c34673522bc7e88f9860d86b49f45a","after":"160ec035ff5122593760a80757fc0d98bfbae576","ref":"refs/heads/main","pushedAt":"2024-05-25T15:03:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[DFS] sum all node values of root to leaf path","shortMessageHtmlLink":"[DFS] sum all node values of root to leaf path"}},{"before":"16f8c32c24598db80065f30bd9530d3d8e9d7f6a","after":"2470eb7927c34673522bc7e88f9860d86b49f45a","ref":"refs/heads/main","pushedAt":"2024-05-23T17:37:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[BFS] get all nodes in right view of binary tree","shortMessageHtmlLink":"[BFS] get all nodes in right view of binary tree"}},{"before":"a73251f205802de5d859df3d7ea841fd2a1b6989","after":"16f8c32c24598db80065f30bd9530d3d8e9d7f6a","ref":"refs/heads/main","pushedAt":"2024-05-23T17:01:27.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[BFS] traverse binary tree in zigzag level","shortMessageHtmlLink":"[BFS] traverse binary tree in zigzag level"}},{"before":"5e20e02e02742259129613db164f7dfd2b317aae","after":"a73251f205802de5d859df3d7ea841fd2a1b6989","ref":"refs/heads/main","pushedAt":"2024-05-23T15:29:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[BFS] complete BFS traversal","shortMessageHtmlLink":"[BFS] complete BFS traversal"}},{"before":"820e0f2ac668f6410efcfdd8ab019971f5d5f325","after":"5e20e02e02742259129613db164f7dfd2b317aae","ref":"refs/heads/main","pushedAt":"2024-05-23T14:55:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[misc] add input from terminal","shortMessageHtmlLink":"[misc] add input from terminal"}},{"before":"b38b0484bb349b617d23987f9acd84a7119a9a5e","after":"820e0f2ac668f6410efcfdd8ab019971f5d5f325","ref":"refs/heads/main","pushedAt":"2024-05-23T14:43:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[misc] print christmas tree","shortMessageHtmlLink":"[misc] print christmas tree"}},{"before":"78e9b453f1ccaa1e97112e4dbb421859e465dd7d","after":"b38b0484bb349b617d23987f9acd84a7119a9a5e","ref":"refs/heads/main","pushedAt":"2024-05-21T14:29:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[BFS] binary search tree level order traversal - part1","shortMessageHtmlLink":"[BFS] binary search tree level order traversal - part1"}},{"before":"85cb0e84333de5cbb2e7ffacd892fd285e5757f3","after":"78e9b453f1ccaa1e97112e4dbb421859e465dd7d","ref":"refs/heads/main","pushedAt":"2024-05-20T16:25:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[BFS] add breaf introduction about BFS","shortMessageHtmlLink":"[BFS] add breaf introduction about BFS"}},{"before":"5c96546c4594376e5612289a76163d04399bbd17","after":"85cb0e84333de5cbb2e7ffacd892fd285e5757f3","ref":"refs/heads/main","pushedAt":"2024-05-18T17:22:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[two-pointers][fast/slow-pointers] find cycle in linkedList","shortMessageHtmlLink":"[two-pointers][fast/slow-pointers] find cycle in linkedList"}},{"before":"35f8c93437fc090d8e2e5128be9f4eab15d3ab06","after":"5c96546c4594376e5612289a76163d04399bbd17","ref":"refs/heads/main","pushedAt":"2024-05-18T15:40:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[two-pointers] remove duplicated element in array","shortMessageHtmlLink":"[two-pointers] remove duplicated element in array"}},{"before":"a66acdc09ab0cd6f2d655717546e1fe7f1cdd32a","after":"35f8c93437fc090d8e2e5128be9f4eab15d3ab06","ref":"refs/heads/main","pushedAt":"2024-05-17T16:30:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[chore] update readme description","shortMessageHtmlLink":"[chore] update readme description"}},{"before":"86a2471b44960c7aa54d46ff5bac81a99d918fe0","after":"a66acdc09ab0cd6f2d655717546e1fe7f1cdd32a","ref":"refs/heads/main","pushedAt":"2024-05-17T16:28:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[chore] add visualize 2 pointers image","shortMessageHtmlLink":"[chore] add visualize 2 pointers image"}},{"before":"f79a59528630cbed718bb960a160b59d6380586c","after":"86a2471b44960c7aa54d46ff5bac81a99d918fe0","ref":"refs/heads/main","pushedAt":"2024-05-17T16:24:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[two-pointers] find a pair sum is equal a given target","shortMessageHtmlLink":"[two-pointers] find a pair sum is equal a given target"}},{"before":"a1256bb46297c6e73c783ef5be8215c34f194e7d","after":"f79a59528630cbed718bb960a160b59d6380586c","ref":"refs/heads/main","pushedAt":"2024-05-17T15:11:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"[sliding-window] average continuous sub array of size K","shortMessageHtmlLink":"[sliding-window] average continuous sub array of size K"}},{"before":null,"after":"a1256bb46297c6e73c783ef5be8215c34f194e7d","ref":"refs/heads/main","pushedAt":"2024-05-17T14:04:31.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"hoa-uit","name":"Duy Hòa Nguyễn","path":"/hoa-uit","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/66675230?s=80&v=4"},"commit":{"message":"add readme","shortMessageHtmlLink":"add readme"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEbGB1yQA","startCursor":null,"endCursor":null}},"title":"Activity · hoa-uit/my-datastructures-algorithms-journey"}