{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":77836098,"defaultBranch":"master","name":"PS","ownerLogin":"joshua-qa","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2017-01-02T13:41:33.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/18359200?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1483364634.0","currentOid":""},"activityList":{"items":[{"before":"ccc5f40c256193ecd1cd2b010c9e54676b9f5611","after":"c49c0b377f85c483b6d274806afb0cbc534500b7","ref":"refs/heads/master","pushedAt":"2023-05-21T04:46:30.762Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"934. Shortest Bridge 풀이","shortMessageHtmlLink":"934. Shortest Bridge 풀이"}},{"before":"2cc1efd9d5a919771515d3f31fd9722e91c7e4f2","after":"ccc5f40c256193ecd1cd2b010c9e54676b9f5611","ref":"refs/heads/master","pushedAt":"2023-05-18T15:17:17.547Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1557. Minimum Number of Vertices to Reach All Nodes 풀이","shortMessageHtmlLink":"1557. Minimum Number of Vertices to Reach All Nodes 풀이"}},{"before":"2efdf70001c9598e3208e9fe8feecb113660ada5","after":"2cc1efd9d5a919771515d3f31fd9722e91c7e4f2","ref":"refs/heads/master","pushedAt":"2023-05-05T08:30:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"Leetcode 1456, 2215 풀이","shortMessageHtmlLink":"Leetcode 1456, 2215 풀이"}},{"before":"833e87bb364f351076a2f860a198fe576a2e94d3","after":"2efdf70001c9598e3208e9fe8feecb113660ada5","ref":"refs/heads/master","pushedAt":"2023-05-01T15:07:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1491. Average Salary Excluding the Minimum and Maximum Salary 풀이","shortMessageHtmlLink":"1491. Average Salary Excluding the Minimum and Maximum Salary 풀이"}},{"before":"e565a3fd625135e01f326c249a24c02cdfb75ea1","after":"833e87bb364f351076a2f860a198fe576a2e94d3","ref":"refs/heads/master","pushedAt":"2023-04-27T13:26:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"319. Bulb Switcher 풀이","shortMessageHtmlLink":"319. Bulb Switcher 풀이"}},{"before":"b24720b6f856c8af0a0732663352936ebf3a07e2","after":"e565a3fd625135e01f326c249a24c02cdfb75ea1","ref":"refs/heads/master","pushedAt":"2023-04-26T14:29:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"258. Add Digits 풀이","shortMessageHtmlLink":"258. Add Digits 풀이"}},{"before":"bdbe23853742fec9761810a7b25cfd02ff6bfc5d","after":"b24720b6f856c8af0a0732663352936ebf3a07e2","ref":"refs/heads/master","pushedAt":"2023-04-25T14:12:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2336. Smallest Number in Infinite Set 풀이","shortMessageHtmlLink":"2336. Smallest Number in Infinite Set 풀이"}},{"before":"1bb3f948c4f25b02778ffd6cb6c7853326ab7bc8","after":"bdbe23853742fec9761810a7b25cfd02ff6bfc5d","ref":"refs/heads/master","pushedAt":"2023-04-24T10:01:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1046. Last Stone Weight 풀이","shortMessageHtmlLink":"1046. Last Stone Weight 풀이"}},{"before":"dc992aaadbb26702749c9068426842f4d402b842","after":"1bb3f948c4f25b02778ffd6cb6c7853326ab7bc8","ref":"refs/heads/master","pushedAt":"2023-04-19T14:34:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1372. Longest ZigZag Path in a Binary Tree 풀이","shortMessageHtmlLink":"1372. Longest ZigZag Path in a Binary Tree 풀이"}},{"before":"75b7fab580940b97623b816a9884ab379c3958fd","after":"dc992aaadbb26702749c9068426842f4d402b842","ref":"refs/heads/master","pushedAt":"2023-04-18T13:11:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1768. Merge Strings Alternately 풀이","shortMessageHtmlLink":"1768. Merge Strings Alternately 풀이"}},{"before":"f5a8a2d91f95a7dcffadb528b8540e55b2d9501f","after":"75b7fab580940b97623b816a9884ab379c3958fd","ref":"refs/heads/master","pushedAt":"2023-04-17T14:58:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1431. Kids With the Greatest Number of Candies 풀이","shortMessageHtmlLink":"1431. Kids With the Greatest Number of Candies 풀이"}},{"before":"2151c10f6e7c0a7ef5190cfed63a694b48ff1b55","after":"f5a8a2d91f95a7dcffadb528b8540e55b2d9501f","ref":"refs/heads/master","pushedAt":"2023-04-13T14:16:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"946. Validate Stack Sequences 풀이","shortMessageHtmlLink":"946. Validate Stack Sequences 풀이"}},{"before":"1f6ed5005c20a01cd01457269b1107320c5eb267","after":"2151c10f6e7c0a7ef5190cfed63a694b48ff1b55","ref":"refs/heads/master","pushedAt":"2023-04-11T11:49:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2390. Removing Stars From a String 풀이","shortMessageHtmlLink":"2390. Removing Stars From a String 풀이"}},{"before":"cb8bc42718d8e700df154f1c4853fc5876839318","after":"1f6ed5005c20a01cd01457269b1107320c5eb267","ref":"refs/heads/master","pushedAt":"2023-04-10T14:07:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"20. Valid Parentheses 풀이","shortMessageHtmlLink":"20. Valid Parentheses 풀이"}},{"before":"76abd8bb929b7494f4f1900dfcebc6c305d79e7b","after":"cb8bc42718d8e700df154f1c4853fc5876839318","ref":"refs/heads/master","pushedAt":"2023-04-09T02:52:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"133. Clone Graph 풀이","shortMessageHtmlLink":"133. Clone Graph 풀이"}},{"before":"aa29b4644930518ecc7fb665ab2c11dc69ae7c7a","after":"76abd8bb929b7494f4f1900dfcebc6c305d79e7b","ref":"refs/heads/master","pushedAt":"2023-04-06T15:32:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1254. Number of Closed Islands 풀이","shortMessageHtmlLink":"1254. Number of Closed Islands 풀이"}},{"before":"6448b3d671aa5782b0c305953c4038c59e1f41c9","after":"aa29b4644930518ecc7fb665ab2c11dc69ae7c7a","ref":"refs/heads/master","pushedAt":"2023-04-04T15:13:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2405. Optimal Partition of String 풀이","shortMessageHtmlLink":"2405. Optimal Partition of String 풀이"}},{"before":"117417dca609359214539290f19fa7871e9dd69f","after":"6448b3d671aa5782b0c305953c4038c59e1f41c9","ref":"refs/heads/master","pushedAt":"2023-04-03T15:31:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"881. Boats to Save People 풀이","shortMessageHtmlLink":"881. Boats to Save People 풀이"}},{"before":"5bc28c3d49504ce4ece8200fbf2653ae1a5da83c","after":"117417dca609359214539290f19fa7871e9dd69f","ref":"refs/heads/master","pushedAt":"2023-04-02T15:36:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2300. Successful Pairs of Spells and Potions 풀이","shortMessageHtmlLink":"2300. Successful Pairs of Spells and Potions 풀이"}},{"before":"0c643294efe126d107a781ee6295518cc1cc8b5c","after":"5bc28c3d49504ce4ece8200fbf2653ae1a5da83c","ref":"refs/heads/master","pushedAt":"2023-04-01T06:09:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"704. Binary Search 풀이","shortMessageHtmlLink":"704. Binary Search 풀이"}},{"before":"ce185e70082c01f1c4163ae4ee2c148665438602","after":"0c643294efe126d107a781ee6295518cc1cc8b5c","ref":"refs/heads/master","pushedAt":"2023-03-29T03:24:07.546Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1402. Reducing Dishes 풀이","shortMessageHtmlLink":"1402. Reducing Dishes 풀이"}},{"before":"919dd9f7483120348771e2304ee82961e8a62dab","after":"ce185e70082c01f1c4163ae4ee2c148665438602","ref":"refs/heads/master","pushedAt":"2023-03-26T07:32:39.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2360. Longest Cycle in a Graph 풀이","shortMessageHtmlLink":"2360. Longest Cycle in a Graph 풀이"}},{"before":"f403fb6df6d41a0b538398b6560deac5b8946d2c","after":"919dd9f7483120348771e2304ee82961e8a62dab","ref":"refs/heads/master","pushedAt":"2023-03-25T03:06:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2316. Count Unreachable Pairs of Nodes in an Undirected Graph 풀이","shortMessageHtmlLink":"2316. Count Unreachable Pairs of Nodes in an Undirected Graph 풀이"}},{"before":"62230fa18d61d27e7bfeb8d910fffad5690dc7ee","after":"f403fb6df6d41a0b538398b6560deac5b8946d2c","ref":"refs/heads/master","pushedAt":"2023-03-23T14:48:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1319. Number of Operations to Make Network Connected 풀이","shortMessageHtmlLink":"1319. Number of Operations to Make Network Connected 풀이"}},{"before":"64b5faf859cf11f1c2304da00fc9d01179b8bcf3","after":"62230fa18d61d27e7bfeb8d910fffad5690dc7ee","ref":"refs/heads/master","pushedAt":"2023-03-22T14:21:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2492. Minimum Score of a Path Between Two Cities 풀이","shortMessageHtmlLink":"2492. Minimum Score of a Path Between Two Cities 풀이"}},{"before":"1d68b8de6d4c30d32bec245c0c91f1695edb29dd","after":"64b5faf859cf11f1c2304da00fc9d01179b8bcf3","ref":"refs/heads/master","pushedAt":"2023-03-21T14:20:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"2348. Number of Zero-Filled Subarrays 풀이","shortMessageHtmlLink":"2348. Number of Zero-Filled Subarrays 풀이"}},{"before":"feaabb1a90e758bc3b1b5ca80a0a79b039d30861","after":"1d68b8de6d4c30d32bec245c0c91f1695edb29dd","ref":"refs/heads/master","pushedAt":"2023-03-20T15:20:52.850Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"605. Can Place Flowers 풀이","shortMessageHtmlLink":"605. Can Place Flowers 풀이"}},{"before":"f435bf9177cf7b8e1c965ba00b1cab0d2a6b45c6","after":"feaabb1a90e758bc3b1b5ca80a0a79b039d30861","ref":"refs/heads/master","pushedAt":"2023-03-19T03:43:17.902Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"211. Design Add and Search Words Data Structure 풀이","shortMessageHtmlLink":"211. Design Add and Search Words Data Structure 풀이"}},{"before":"a41441b27620bcd9fc57588c685275d98453b943","after":"f435bf9177cf7b8e1c965ba00b1cab0d2a6b45c6","ref":"refs/heads/master","pushedAt":"2023-03-18T05:30:50.463Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"1472. Design Browser History 풀이","shortMessageHtmlLink":"1472. Design Browser History 풀이"}},{"before":"f37e54dea721538a3106ba626c339964eb9829fe","after":"a41441b27620bcd9fc57588c685275d98453b943","ref":"refs/heads/master","pushedAt":"2023-03-17T14:33:19.234Z","pushType":"push","commitsCount":1,"pusher":{"login":"joshua-qa","name":"Joshua.","path":"/joshua-qa","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/18359200?s=80&v=4"},"commit":{"message":"208. Implement Trie (Prefix Tree) 풀이","shortMessageHtmlLink":"208. Implement Trie (Prefix Tree) 풀이"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADMOLl2gA","startCursor":null,"endCursor":null}},"title":"Activity · joshua-qa/PS"}