{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":364931469,"defaultBranch":"main","name":"Algorithm","ownerLogin":"Albert-learner","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2021-05-06T14:06:29.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/39715124?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1624343626.0430698","currentOid":""},"activityList":{"items":[{"before":"51135bdd99a42cd90898ce1a76252a3bc9133c5d","after":"df97fd8601e2d872911c2f56fc60227f9d5a3518","ref":"refs/heads/main","pushedAt":"2024-04-06T06:53:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is BFS and DFS.\nThis is a basic problem of solving both BFS and DFS. But BFS is more efficient than using DFS.\nSee this again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is BFS…"}},{"before":"9dd5e676ba0797c7bda4be7838fd2c3eaa0cc5bc","after":"51135bdd99a42cd90898ce1a76252a3bc9133c5d","ref":"refs/heads/main","pushedAt":"2024-04-06T06:23:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is DFS.\nThis is a basic implementation of DFS Algorithm. And this can be solved without using DFS Algorithm.\nSee two methods again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is DFS."}},{"before":"2dc9cc6d6b1e1e5a404148eb9d261bd60e474148","after":"9dd5e676ba0797c7bda4be7838fd2c3eaa0cc5bc","ref":"refs/heads/main","pushedAt":"2024-04-05T00:42:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is a simple implementation.\nThink problem simple, not complicated.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is a s…"}},{"before":"63be459a3484b42e0880c434743aa298d707a250","after":"2dc9cc6d6b1e1e5a404148eb9d261bd60e474148","ref":"refs/heads/main","pushedAt":"2024-04-05T00:25:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is finding rules for making fraction.\nZigZag sequence and I need to catch finding rules.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is fin…"}},{"before":"3c51c55e868cd8316bf78f04d0bb3f5237e9022e","after":"63be459a3484b42e0880c434743aa298d707a250","ref":"refs/heads/main","pushedAt":"2024-04-04T12:19:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is Stack.\nBut I didn't catch how to solve this with stack Data Structure.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is Stack."}},{"before":"d22bf682b14b52729b9cf704e3eb925de776f9e6","after":"3c51c55e868cd8316bf78f04d0bb3f5237e9022e","ref":"refs/heads/main","pushedAt":"2024-04-04T03:18:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is Dijkstra Algorithm.\nThis problem can solve without Dijkstra, So I need to rewind two methods.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is Dij…"}},{"before":"fd0654aef123a9edcc7f4175de7e63c0175f9fce","after":"d22bf682b14b52729b9cf704e3eb925de776f9e6","ref":"refs/heads/main","pushedAt":"2024-04-03T01:36:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I almost solve this problem by myself. The key of this problem is finding counts of divisors.\nHere's the code of Searching Divisors in Efficient ways.\nSee it again.","shortMessageHtmlLink":"I almost solve this problem by myself. The key of this problem is fin…"}},{"before":"400f93761df6462ad102f36f6ae7d6c7bfb44360","after":"fd0654aef123a9edcc7f4175de7e63c0175f9fce","ref":"refs/heads/main","pushedAt":"2024-04-03T01:30:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is BFS.\nI need to try implementing BFS even if it's hard.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is BFS."}},{"before":"911453ce967cdbf735370aa602cbca20650c1cd3","after":"400f93761df6462ad102f36f6ae7d6c7bfb44360","ref":"refs/heads/main","pushedAt":"2024-04-02T00:43:06.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I solve this problem by myself. But it is not efficient method.\nI follow the table in problem, but it requires efficient arrangement.\nSee other solution and try to solve like that.\nSee it again.","shortMessageHtmlLink":"I solve this problem by myself. But it is not efficient method."}},{"before":"7015d5acf5e693e0dc07c2f79426ff71aabfc9ee","after":"911453ce967cdbf735370aa602cbca20650c1cd3","ref":"refs/heads/main","pushedAt":"2024-04-02T00:39:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I almost solve this problem by myself. But I miss Memory Excess and Time Excess.\nNot using sort function. Try to memorize this problem as a Greedy problem.\nSee it again.","shortMessageHtmlLink":"I almost solve this problem by myself. But I miss Memory Excess and T…"}},{"before":"a786d2e6e4707195851c41f0ed7d4e5ce460d1fd","after":"7015d5acf5e693e0dc07c2f79426ff71aabfc9ee","ref":"refs/heads/main","pushedAt":"2024-04-01T01:23:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is finding math rules.\nFind math rules elaborated(dp[i] = 2 * dp[i - 1] + dp[i - 2]).\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is fin…"}},{"before":"60c146f33674084dc581ec03e15dac3cbb25eaa4","after":"a786d2e6e4707195851c41f0ed7d4e5ce460d1fd","ref":"refs/heads/main","pushedAt":"2024-03-31T05:38:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I need to find the rule of math at problem.\nThis is about DP(Dynamic Programming), but finding math rule is easier to solve it.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I need to find the rule of mat…"}},{"before":"9e31ccc58f32700bf19fad0522484b817ba5c792","after":"60c146f33674084dc581ec03e15dac3cbb25eaa4","ref":"refs/heads/main","pushedAt":"2024-03-30T03:11:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I think this is related with DFS.\nBut it's wrong for memory excess. So this is about BFS.\nI need to see more about BFS implementation.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I think this is related with DFS."}},{"before":"b7e8bd221d705e0390dc48656a2c4006edae7b15","after":"9e31ccc58f32700bf19fad0522484b817ba5c792","ref":"refs/heads/main","pushedAt":"2024-03-29T00:30:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is not using 2 loop.\nAnd divide pairs and possibles of balanced position.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is not…"}},{"before":"9a763e27092b5130dd477e2fea3a09c767d162ba","after":"b7e8bd221d705e0390dc48656a2c4006edae7b15","ref":"refs/heads/main","pushedAt":"2024-03-28T00:17:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I miss the key that this is about Search and BFS is appropriate for this problem.\nBut using Python's set is more efficient than using Python deque.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I miss the key that this is ab…"}},{"before":"e30f75bcb33465d9b4b39187e4d0184a5092a275","after":"9a763e27092b5130dd477e2fea3a09c767d162ba","ref":"refs/heads/main","pushedAt":"2024-03-28T00:09:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is sorting column and ascending sorting.\nAnd get S_i with easy method. Think simple, not complicated.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is sor…"}},{"before":"9a060379405c280836761aec9d7136cf74307743","after":"e30f75bcb33465d9b4b39187e4d0184a5092a275","ref":"refs/heads/main","pushedAt":"2024-03-27T01:40:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. The key of this problem is comparing first element of two marices.\nAnd the last key is that impossible changes of two matrices.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. The key of this problem is com…"}},{"before":"45658c2483f466af93007797894f9b9578111c50","after":"9a060379405c280836761aec9d7136cf74307743","ref":"refs/heads/main","pushedAt":"2024-03-27T00:23:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. This is a fundamental concept of DFS and BFS.\nAnd there are two versions of applying BFS and DFS(Bi-directional vertex and vertex).\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. This is a fundamental concept …"}},{"before":"a9143e5acbec8449ddf18efc12b467001b46ae92","after":"45658c2483f466af93007797894f9b9578111c50","ref":"refs/heads/main","pushedAt":"2024-03-26T01:33:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. This is about Back Tracking Algorithm.\nThe limitation is moving coordinate is '.'.\nAnd DFS is better than BFS for applying Back Tracking.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. This is about Back Tracking Al…"}},{"before":"ecd5d00150e70058116cd11ed8a62ac455d8a92f","after":"a9143e5acbec8449ddf18efc12b467001b46ae92","ref":"refs/heads/main","pushedAt":"2024-03-26T00:19:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I miss two key points.\nFirst is the starting position of king and stone(1, 1).\nLast one is the overlapped of king and stone.\nSee this again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I miss two key points."}},{"before":"87bd5664f573e2e42e77a035913d66929956fe73","after":"ecd5d00150e70058116cd11ed8a62ac455d8a92f","ref":"refs/heads/main","pushedAt":"2024-03-25T00:19:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I almost solve this problem by myself. But I miss after finding the target coordinate.\nThe easiest way is applying infinity loop for finding target coordinate.\nAnd make some exceptions.\nSee it again.","shortMessageHtmlLink":"I almost solve this problem by myself. But I miss after finding the t…"}},{"before":"9bbd5714a28cde7576bd07b5739d1f3c1885e3e6","after":"87bd5664f573e2e42e77a035913d66929956fe73","ref":"refs/heads/main","pushedAt":"2024-03-24T03:28:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. This is about Search and BFS is better than DFS in this problem.\nThis is a basic BFS code, so I have to rewind the flow.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. This is about Search and BFS i…"}},{"before":"2cde16b82b96c65322ced9d299d51bbe14c8467a","after":"9bbd5714a28cde7576bd07b5739d1f3c1885e3e6","ref":"refs/heads/main","pushedAt":"2024-03-23T06:58:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I almost solve this problem by myself. The key of this problem is finding 4 coordinates of square that satisfy same costs.\nI miss the point that the possible length of square.\nSee it again.","shortMessageHtmlLink":"I almost solve this problem by myself. The key of this problem is fin…"}},{"before":"763f25edb5415b50d649c7fb0c153960550a79be","after":"2cde16b82b96c65322ced9d299d51bbe14c8467a","ref":"refs/heads/main","pushedAt":"2024-03-22T01:17:27.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I have to think about Memory Excess and Time Excess.\nAnd the key is that using queue data structure for all data is wrong in here.\nSee this again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I have to think about Memory E…"}},{"before":"b6aca6d4912cc81e61659bb916db0e90c511570a","after":"763f25edb5415b50d649c7fb0c153960550a79be","ref":"refs/heads/main","pushedAt":"2024-03-21T02:43:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I think this is a little hard version of simple implementation.\nThe key of this problem is finding the longest overlapping words between P and S.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I think this is a little hard …"}},{"before":"061ba8e48c772a609689a2e26ba611679345f0c6","after":"b6aca6d4912cc81e61659bb916db0e90c511570a","ref":"refs/heads/main","pushedAt":"2024-03-20T01:09:24.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I solve this problem by myself. See again for using Python collection's deque.\nThe positive value of deque's rotate function means rotate sequence in a right way.\nNegative means rotate sequence in a left way.","shortMessageHtmlLink":"I solve this problem by myself. See again for using Python collection…"}},{"before":"520e6f406c53b75a8b3d077050023ccc3627954f","after":"061ba8e48c772a609689a2e26ba611679345f0c6","ref":"refs/heads/main","pushedAt":"2024-03-19T01:45:59.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I catch that this is related with Sum of Arithmetic Sequences.\nBut the key point is making S with many numbers as possible.\nSee it again.","shortMessageHtmlLink":"I didn't solve this problem by myself. I catch that this is related w…"}},{"before":"16a292322db44240a5d3355024b878c39a6c509e","after":"520e6f406c53b75a8b3d077050023ccc3627954f","ref":"refs/heads/main","pushedAt":"2024-03-18T06:24:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I solve this problem by myself. But I need to see Other's solution for making code efficient.\nSee it again.","shortMessageHtmlLink":"I solve this problem by myself. But I need to see Other's solution fo…"}},{"before":"448cfeddb1205735b3aa006f7099b04b16b9b2e1","after":"16a292322db44240a5d3355024b878c39a6c509e","ref":"refs/heads/main","pushedAt":"2024-03-17T04:54:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I didn't solve this problem by myself. I didn't catch the key point of this problem(Because of English Explanation).\nFirst point is that the end condition of this problem.\nAnd last is that the meaning of remains at Polynomial coefficients.","shortMessageHtmlLink":"I didn't solve this problem by myself. I didn't catch the key point o…"}},{"before":"62e61883dc7d61c530f65d2c48c062e843c44873","after":"448cfeddb1205735b3aa006f7099b04b16b9b2e1","ref":"refs/heads/main","pushedAt":"2024-03-16T01:33:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Albert-learner","name":"JaeBinLee","path":"/Albert-learner","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/39715124?s=80&v=4"},"commit":{"message":"I almost solve this problem by myself.\nI catch Palindrome and Prime number implementation by my reference code, so see it again for perfect implementation.\nBut I miss except conditions that if the number is 1 and number is 1000000.","shortMessageHtmlLink":"I almost solve this problem by myself."}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNC0wNlQwNjo1MzowMS4wMDAwMDBazwAAAAQpe_kt","startCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wNC0wNlQwNjo1MzowMS4wMDAwMDBazwAAAAQpe_kt","endCursor":"Y3Vyc29yOnYyOpK7MjAyNC0wMy0xNlQwMTozMzoxNS4wMDAwMDBazwAAAAQXKrlt"}},"title":"Activity · Albert-learner/Algorithm"}