{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":498402968,"defaultBranch":"main","name":"DSA","ownerLogin":"timdavis0221","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-05-31T15:55:53.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/47051965?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1654012638.993962","currentOid":""},"activityList":{"items":[{"before":"ef29a64721ccfc347c1ddcb2b9e7afe44541b9f8","after":"b673c1c619b37d55af97a3c56190ce6a5d32d2b6","ref":"refs/heads/main","pushedAt":"2024-04-04T04:06:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add the 1st solution of Binary Gap. (LeetCode 868)","shortMessageHtmlLink":"Add the 1st solution of Binary Gap. (LeetCode 868)"}},{"before":"9d2e8d2d4b20f4ee10fa37cb5a3abdca3cb6f5d7","after":"ef29a64721ccfc347c1ddcb2b9e7afe44541b9f8","ref":"refs/heads/main","pushedAt":"2023-11-29T14:51:38.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 2nd solution of Implement Queue using Stacks (LeetCode 232)\n\n* Use two stacks for amortized time complexity of pop and peek operation\n* Add customized error to simplify the code","shortMessageHtmlLink":"Add 2nd solution of Implement Queue using Stacks (LeetCode 232)"}},{"before":"6c2fef0c3a83b17ac82da699a962680103d309d7","after":"9d2e8d2d4b20f4ee10fa37cb5a3abdca3cb6f5d7","ref":"refs/heads/main","pushedAt":"2023-11-29T04:58:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Updates of Implement Stack using Queues\n\n* Rename the field of myStack for clarity\n* Modify the descirption of main logic of push function","shortMessageHtmlLink":"Updates of Implement Stack using Queues"}},{"before":"880f21a99eadd11ce103ac960851e72c330e8f25","after":"6c2fef0c3a83b17ac82da699a962680103d309d7","ref":"refs/heads/main","pushedAt":"2023-11-27T15:13:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Implement Stack using Queues (LeetCode 225)","shortMessageHtmlLink":"Add 1st solution of Implement Stack using Queues (LeetCode 225)"}},{"before":"9cb5a8fd910e23e74a2e6797dd3b26a6d3388a3a","after":"880f21a99eadd11ce103ac960851e72c330e8f25","ref":"refs/heads/main","pushedAt":"2023-11-13T10:45:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add two solution of Linked List Cycle (LeetCode 141)","shortMessageHtmlLink":"Add two solution of Linked List Cycle (LeetCode 141)"}},{"before":"2ff4795f8e3ae4c72f71cbac9a5fcd2618ea14d1","after":"9cb5a8fd910e23e74a2e6797dd3b26a6d3388a3a","ref":"refs/heads/main","pushedAt":"2023-11-10T08:08:47.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Reverse Linked List (LeetCode 206)\n\n * Provide two implementation: iterative and recursive","shortMessageHtmlLink":"Add 1st solution of Reverse Linked List (LeetCode 206)"}},{"before":"3b27d763505673f86dbe9bade0c6ed66b4d7a1f8","after":"2ff4795f8e3ae4c72f71cbac9a5fcd2618ea14d1","ref":"refs/heads/main","pushedAt":"2023-11-09T07:30:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Remove Linked List Elements (LeetCode 203)","shortMessageHtmlLink":"Add 1st solution of Remove Linked List Elements (LeetCode 203)"}},{"before":"1064852e8da6a702e111fcb2e07ec876cce4409d","after":"3b27d763505673f86dbe9bade0c6ed66b4d7a1f8","ref":"refs/heads/main","pushedAt":"2023-11-08T09:03:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Search in Rotated Sorted Array. (LeetCode 33)","shortMessageHtmlLink":"Add 1st solution of Search in Rotated Sorted Array. (LeetCode 33)"}},{"before":"57a5e761630435b549173c1b3b76f38d5972eb35","after":"1064852e8da6a702e111fcb2e07ec876cce4409d","ref":"refs/heads/main","pushedAt":"2023-10-27T08:07:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Rename the variable of ProductExceptSelf for readability","shortMessageHtmlLink":"Rename the variable of ProductExceptSelf for readability"}},{"before":"cb0a7fe6d63572d95c71a5f6571707a1dcd07b6a","after":"57a5e761630435b549173c1b3b76f38d5972eb35","ref":"refs/heads/main","pushedAt":"2023-10-26T15:24:44.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Use efficient way to create 2D matrix in Spirial Matrix II","shortMessageHtmlLink":"Use efficient way to create 2D matrix in Spirial Matrix II"}},{"before":"31d4582ae7dc91b2c59f77be91c8ef56c9ea5380","after":"cb0a7fe6d63572d95c71a5f6571707a1dcd07b6a","ref":"refs/heads/main","pushedAt":"2023-10-26T07:48:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update the comments of MinSubArrayLen","shortMessageHtmlLink":"Update the comments of MinSubArrayLen"}},{"before":"46cad1c03e54caf298aae7505100bc107f7de211","after":"31d4582ae7dc91b2c59f77be91c8ef56c9ea5380","ref":"refs/heads/main","pushedAt":"2023-10-23T02:32:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update the comments of Binary Search","shortMessageHtmlLink":"Update the comments of Binary Search"}},{"before":"812cb20b45a1010e31f250eed7f7d3185c2a6cfd","after":"46cad1c03e54caf298aae7505100bc107f7de211","ref":"refs/heads/main","pushedAt":"2023-10-18T11:00:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update the implementation of Valid Palindrome.\n\n* Use unicode.IsDigit and unicode.IsLetter instead of regexp\n* Reduce the execution time of loop","shortMessageHtmlLink":"Update the implementation of Valid Palindrome."}},{"before":"873f31ed17f0f6f985369b2d2bb14ce5413cb1c2","after":"812cb20b45a1010e31f250eed7f7d3185c2a6cfd","ref":"refs/heads/main","pushedAt":"2023-10-17T13:09:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update the comments of the function ReverseString2","shortMessageHtmlLink":"Update the comments of the function ReverseString2"}},{"before":"d007cebe55acf5adefd501a484c334a47f287612","after":"873f31ed17f0f6f985369b2d2bb14ce5413cb1c2","ref":"refs/heads/main","pushedAt":"2023-10-11T10:46:32.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update the directory of DSA\n\n* Classify each DSA topic into relative folders.","shortMessageHtmlLink":"Update the directory of DSA"}},{"before":"f8d642d06311ef815ec0156623709572c4855724","after":"d007cebe55acf5adefd501a484c334a47f287612","ref":"refs/heads/main","pushedAt":"2023-10-04T15:22:01.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 2nd solution of Repeated Substring Pattern (LeetCode 459)\n\n* Use KMP algorithm to solve the string matching problem","shortMessageHtmlLink":"Add 2nd solution of Repeated Substring Pattern (LeetCode 459)"}},{"before":"fc88a244c18f8fd5dbbcd7947b5c235165a4a0c9","after":"f8d642d06311ef815ec0156623709572c4855724","ref":"refs/heads/main","pushedAt":"2023-10-02T14:10:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Repeated Substring Pattern (LeetCode 159)","shortMessageHtmlLink":"Add 1st solution of Repeated Substring Pattern (LeetCode 159)"}},{"before":"c4cc4b97dcd4012ed6178e91695204c989329970","after":"fc88a244c18f8fd5dbbcd7947b5c235165a4a0c9","ref":"refs/heads/main","pushedAt":"2023-10-02T13:28:22.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update description of ReverseWords2 (LeetCode 151)","shortMessageHtmlLink":"Update description of ReverseWords2 (LeetCode 151)"}},{"before":"e4efae3e1f7d0b4c4ef4e6f96477ddc10937310f","after":"c4cc4b97dcd4012ed6178e91695204c989329970","ref":"refs/heads/main","pushedAt":"2023-09-28T09:03:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 2nd solution of Reverse Word (LeetCode 151)\n\n* Use in-place algorithm to make the space complexity to O(1) if string is mutable\n* Use two pointer to count blank and filter the input string without using library\n* Reverse filtered characters in string then reverse each word in string to get result","shortMessageHtmlLink":"Add 2nd solution of Reverse Word (LeetCode 151)"}},{"before":"1f50c0bcb0c1a8c6871e6c49e69c4320c159e8c0","after":"e4efae3e1f7d0b4c4ef4e6f96477ddc10937310f","ref":"refs/heads/main","pushedAt":"2023-09-27T14:12:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Reverse Words (LeetCode 151)","shortMessageHtmlLink":"Add 1st solution of Reverse Words (LeetCode 151)"}},{"before":"a3aadd5d8d1c1d6c90aa6862d79563aba2313301","after":"1f50c0bcb0c1a8c6871e6c49e69c4320c159e8c0","ref":"refs/heads/main","pushedAt":"2023-09-26T07:52:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Valid Palindrome (LeetCode 125)\n\n* Use two pinter to do comparison for characters","shortMessageHtmlLink":"Add 1st solution of Valid Palindrome (LeetCode 125)"}},{"before":"8866218bf01cd47b5e69a8165d28eb7be1c192a1","after":"a3aadd5d8d1c1d6c90aa6862d79563aba2313301","ref":"refs/heads/main","pushedAt":"2023-09-22T06:39:38.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 3rd solution of Valid Anagram (LeetCode 242)\n\n* Use one hash table to handle the input strings contain Unicode characters","shortMessageHtmlLink":"Add 3rd solution of Valid Anagram (LeetCode 242)"}},{"before":"6d05b5cfcc54aab1ed05bdef43b01b2bc493012b","after":"8866218bf01cd47b5e69a8165d28eb7be1c192a1","ref":"refs/heads/main","pushedAt":"2023-09-21T10:28:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update the comments of Remove Element (LeetCode 27)","shortMessageHtmlLink":"Update the comments of Remove Element (LeetCode 27)"}},{"before":"1b42e479d10f090fd81f49834d8938af907e93b6","after":"6d05b5cfcc54aab1ed05bdef43b01b2bc493012b","ref":"refs/heads/main","pushedAt":"2023-09-21T06:33:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 2nd solution of ValidAnagram (LeetCode 242)\n\n* Using only one slice instead of using two hash tables.","shortMessageHtmlLink":"Add 2nd solution of ValidAnagram (LeetCode 242)"}},{"before":"d00ad04ff1e657f4fe0c9adca5140ea47b4c8ba8","after":"1b42e479d10f090fd81f49834d8938af907e93b6","ref":"refs/heads/main","pushedAt":"2023-09-20T14:40:50.000Z","pushType":"push","commitsCount":2,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Valid Anagram (LeetCode 242)","shortMessageHtmlLink":"Add 1st solution of Valid Anagram (LeetCode 242)"}},{"before":"fa783ef0eb230023ee6a8181c5324e692afd060a","after":"d00ad04ff1e657f4fe0c9adca5140ea47b4c8ba8","ref":"refs/heads/main","pushedAt":"2023-09-18T11:06:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st solution of Reverse String (LeetCode 344)","shortMessageHtmlLink":"Add 1st solution of Reverse String (LeetCode 344)"}},{"before":"e7b0610424037e77582c159fd94e7e21bb29c110","after":"fa783ef0eb230023ee6a8181c5324e692afd060a","ref":"refs/heads/main","pushedAt":"2023-09-04T13:57:07.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update description and comments of Two Sum. (LeetCode 1)","shortMessageHtmlLink":"Update description and comments of Two Sum. (LeetCode 1)"}},{"before":"1f505dec3fda614c8a950f0c493fa1c4e3e70b43","after":"e7b0610424037e77582c159fd94e7e21bb29c110","ref":"refs/heads/main","pushedAt":"2023-09-04T13:48:20.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Update description and comments of Two Sum. (LeetCode 1)","shortMessageHtmlLink":"Update description and comments of Two Sum. (LeetCode 1)"}},{"before":"6500d97ce1c8427b741077a7eb09882512bdb7b3","after":"1f505dec3fda614c8a950f0c493fa1c4e3e70b43","ref":"refs/heads/main","pushedAt":"2023-08-31T13:37:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 2nd solution of Maximum Subarray. (LeetCode 53)\n\n* Solve the problem with Divide and Conquer technique.","shortMessageHtmlLink":"Add 2nd solution of Maximum Subarray. (LeetCode 53)"}},{"before":"5baf8434cd2164171caf57754e75263ba173f4eb","after":"6500d97ce1c8427b741077a7eb09882512bdb7b3","ref":"refs/heads/main","pushedAt":"2023-08-30T10:20:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"timdavis0221","name":"Yao Wen C.","path":"/timdavis0221","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/47051965?s=80&v=4"},"commit":{"message":"Add 1st soultion for Maximum Subarray (LeetCode 53)\n\n* Use the concept of Kadane's Alg to solve this problem.","shortMessageHtmlLink":"Add 1st soultion for Maximum Subarray (LeetCode 53)"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEJ1sK4AA","startCursor":null,"endCursor":null}},"title":"Activity · timdavis0221/DSA"}