{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":694984729,"defaultBranch":"main","name":"algorithm","ownerLogin":"ddoddii","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-09-22T05:33:24.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/95014836?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1704883265.0","currentOid":""},"activityList":{"items":[{"before":"992b5c6c048bded9376e5826606899a6aae8da0c","after":"fbfd937886c6d20117a7f52378321bb4ecf92a09","ref":"refs/heads/main","pushedAt":"2024-06-12T03:49:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[75] Sort Colors\n- Counting sort\n-> 등장하는 숫자의 빈도를 저장하고, 인덱스를 업데이트 한다.","shortMessageHtmlLink":"[75] Sort Colors"}},{"before":"2e818997e90a81b9a1c98950c6dd875361089397","after":"992b5c6c048bded9376e5826606899a6aae8da0c","ref":"refs/heads/main","pushedAt":"2024-06-11T05:59:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1122] Relative Sort Array\n- sol1. hashmap 사용\n- sol2. relative order -> arr1 내에서 순서 바꾸기 !!","shortMessageHtmlLink":"[1122] Relative Sort Array"}},{"before":"dacfe7d5fcc91458ed3f195da85a6fe81f234c07","after":"2e818997e90a81b9a1c98950c6dd875361089397","ref":"refs/heads/main","pushedAt":"2024-06-10T11:19:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[974] Subarray Sums Divisible by K\n- prefix sum 을 사용하지만, 개수를 세는 것이므로 dict {key : prefix_sum, value : num of occurence} 를 저장한다.\n- modulo normalization(음수값의 나머지를 [0,k-1]로 정규화\nprefix_sum = (prefix_sum % k + k) % k","shortMessageHtmlLink":"[974] Subarray Sums Divisible by K"}},{"before":"234405abddb0373e8b7aae0159a45b13c7b6c50b","after":"dacfe7d5fcc91458ed3f195da85a6fe81f234c07","ref":"refs/heads/main","pushedAt":"2024-06-08T04:31:01.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[523] Continuous Subarray Sum\n- Prefix Sum 사용하기 !!! ⭐️⭐️","shortMessageHtmlLink":"[523] Continuous Subarray Sum"}},{"before":"f46a323ac916c563217348175f9f178b2e2a4612","after":"234405abddb0373e8b7aae0159a45b13c7b6c50b","ref":"refs/heads/main","pushedAt":"2024-06-07T00:55:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[648] Replace Words\n- python 에서 어떤 단어가 다른 단어로 시작하는지 알고싶을 때는 startswith 함수가 있다","shortMessageHtmlLink":"[648] Replace Words"}},{"before":"48b7c7e2483f0dfea567b4f3d98c6978bebd30c9","after":"f46a323ac916c563217348175f9f178b2e2a4612","ref":"refs/heads/main","pushedAt":"2024-06-06T02:49:50.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[846] Hand of Straights\n- hashmap","shortMessageHtmlLink":"[846] Hand of Straights"}},{"before":"f8e8dd3861504ebe96c968df907310f370ef6937","after":"48b7c7e2483f0dfea567b4f3d98c6978bebd30c9","ref":"refs/heads/main","pushedAt":"2024-06-04T01:55:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[409] Longest Palindrome","shortMessageHtmlLink":"[409] Longest Palindrome"}},{"before":"dbc47f9ba31a61d3a4add9efe43d2b5bcf9503da","after":"f8e8dd3861504ebe96c968df907310f370ef6937","ref":"refs/heads/main","pushedAt":"2024-06-03T12:08:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[2486] Append Characters to String to Make Subsequence\n- use 2 pointers","shortMessageHtmlLink":"[2486] Append Characters to String to Make Subsequence"}},{"before":"82a4dcd46524229255ce2267a7c25eb1395d45c7","after":"dbc47f9ba31a61d3a4add9efe43d2b5bcf9503da","ref":"refs/heads/main","pushedAt":"2024-05-30T04:25:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1442] Count Triplets That Can Form Two Arrays of Equal XOR\n- a^a = 0\n- if xor == 0 exists in arr[i:k],\nthan there exists (k-i) where xor of arr[i:j] equals to arr[j:k]","shortMessageHtmlLink":"[1442] Count Triplets That Can Form Two Arrays of Equal XOR"}},{"before":"cc6c34386f2d8e8c9ae0d01ddee0ddabf56d8a68","after":"82a4dcd46524229255ce2267a7c25eb1395d45c7","ref":"refs/heads/main","pushedAt":"2024-05-28T04:01:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1208] Get Equal Substrings Within Budget\n- sliding window","shortMessageHtmlLink":"[1208] Get Equal Substrings Within Budget"}},{"before":"ffa667d6e5d084975ca00f6f09b95afecbc22f37","after":"cc6c34386f2d8e8c9ae0d01ddee0ddabf56d8a68","ref":"refs/heads/main","pushedAt":"2024-05-26T02:51:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[552] Student Attendance Record II\n- Dynamic Programming (작게 쪼개고 먼저 계산한것을 토대로 뒤에것 계산 !!)","shortMessageHtmlLink":"[552] Student Attendance Record II"}},{"before":"89dd3abab4e0dc287f5b596f4add3b746a7a894f","after":"ffa667d6e5d084975ca00f6f09b95afecbc22f37","ref":"refs/heads/main","pushedAt":"2024-05-25T11:30:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[140] Word Break II\n- recursion","shortMessageHtmlLink":"[140] Word Break II"}},{"before":"5bb1746bd18e8aa27f7f751080e204ae84cc3806","after":"89dd3abab4e0dc287f5b596f4add3b746a7a894f","ref":"refs/heads/main","pushedAt":"2024-05-25T05:18:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1255] Maximum Score Words Formed by Letters\n- 재귀 + backtrack\n1. 단어 추가 가능하면,\n2. 쓴 단어만큼 빼고,\n3. 이 상태에서 재귀 호출\n4. 다시 복구하고(backtrack)\n5. 현재 단어 추가없이 재귀 호출","shortMessageHtmlLink":"[1255] Maximum Score Words Formed by Letters"}},{"before":"172d4a25b8e4d7394c70a5e926a0b08b03e58155","after":"5bb1746bd18e8aa27f7f751080e204ae84cc3806","ref":"refs/heads/main","pushedAt":"2024-05-23T03:16:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1712] Ways to Split Array Into Three Subarrays\n- binary search","shortMessageHtmlLink":"[1712] Ways to Split Array Into Three Subarrays"}},{"before":"a9b611e569753908c262a888e860f7a82d859845","after":"172d4a25b8e4d7394c70a5e926a0b08b03e58155","ref":"refs/heads/main","pushedAt":"2024-05-20T03:21:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1863] Sum of All Subset XOR Totals\n- backtracking !!","shortMessageHtmlLink":"[1863] Sum of All Subset XOR Totals"}},{"before":"0c56725c4464a6d846659ac557d51952df8f6f3c","after":"a9b611e569753908c262a888e860f7a82d859845","ref":"refs/heads/main","pushedAt":"2024-05-18T12:59:20.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[169] Majority Element","shortMessageHtmlLink":"[169] Majority Element"}},{"before":"6ce34a742d8de86b6e2c9de9eeba01c625c92379","after":"0c56725c4464a6d846659ac557d51952df8f6f3c","ref":"refs/heads/main","pushedAt":"2024-05-17T05:00:38.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1325] Delete Leaves With a Given Value\n- use recursion to traverse tree","shortMessageHtmlLink":"[1325] Delete Leaves With a Given Value"}},{"before":"271f93e24ebf1a3e1ed97db807a0bec8d669cd92","after":"6ce34a742d8de86b6e2c9de9eeba01c625c92379","ref":"refs/heads/main","pushedAt":"2024-05-16T02:03:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[2331] Evaluate Boolean Binary Tree\n- use dfs for full binary tree traversal","shortMessageHtmlLink":"[2331] Evaluate Boolean Binary Tree"}},{"before":"4c9a15f16218c4f83b2d35ae7732d2ec851a5e0f","after":"271f93e24ebf1a3e1ed97db807a0bec8d669cd92","ref":"refs/heads/main","pushedAt":"2024-05-15T03:33:34.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[2812] Find the Safest Path in a Grid\n1. BFS for calculating manhatten distance\n2.  DFS for checking if travel is possible with safety factor (v)\n3. Binary Search to find maximum safety factor","shortMessageHtmlLink":"[2812] Find the Safest Path in a Grid"}},{"before":"d45c6683066f400b36d52e9b46732e8bbe88948d","after":"4c9a15f16218c4f83b2d35ae7732d2ec851a5e0f","ref":"refs/heads/main","pushedAt":"2024-05-14T01:31:46.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1219] Path with Maximum Gold","shortMessageHtmlLink":"[1219] Path with Maximum Gold"}},{"before":"3e8644c9153574dcdd26feefb8545c43738236b2","after":"d45c6683066f400b36d52e9b46732e8bbe88948d","ref":"refs/heads/main","pushedAt":"2024-05-14T01:15:45.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[1219] Path with Maximum Gold\n- backtracking + dfs\n- 방문한 곳은 거기서 탐색 후 visited 에서 remove 하기 !!","shortMessageHtmlLink":"[1219] Path with Maximum Gold"}},{"before":"4391fa6e59971c2f1919382ecea3e8d418a32fcd","after":"3e8644c9153574dcdd26feefb8545c43738236b2","ref":"refs/heads/main","pushedAt":"2024-05-13T12:16:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[861] Score After Flipping Matrix\n- bitwise op.","shortMessageHtmlLink":"[861] Score After Flipping Matrix"}},{"before":"95b76816f68153728432044fe63ea836a903ca7e","after":"4391fa6e59971c2f1919382ecea3e8d418a32fcd","ref":"refs/heads/main","pushedAt":"2024-05-11T05:22:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[857] Minimum Cost to Hire K Workers\n- max heap 사용해서 관리","shortMessageHtmlLink":"[857] Minimum Cost to Hire K Workers"}},{"before":"0b01ec405616fa538911b3f0fe8bd499d62b9fc8","after":"95b76816f68153728432044fe63ea836a903ca7e","ref":"refs/heads/main","pushedAt":"2024-05-10T04:57:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[786] K-th Smallest Prime Fraction\n- heap 사용해서 k-th smallest 찾기","shortMessageHtmlLink":"[786] K-th Smallest Prime Fraction"}},{"before":"7a87eca329b3b6ac9903e2b928c8e2cee84c7d56","after":"0b01ec405616fa538911b3f0fe8bd499d62b9fc8","ref":"refs/heads/main","pushedAt":"2024-05-09T13:10:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[402] Remove K Digits","shortMessageHtmlLink":"[402] Remove K Digits"}},{"before":"13a1484f3126072bfb9a8a92fe6a76d966ac1849","after":"7a87eca329b3b6ac9903e2b928c8e2cee84c7d56","ref":"refs/heads/main","pushedAt":"2024-05-08T08:49:55.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[506] Relative Ranks\n- dict(zip(list1,list2)) 를 사용하면 dict 형태로 묶어준다 ! list1 의 값이 key 가 되고 list2의 값이 value가 된다 !","shortMessageHtmlLink":"[506] Relative Ranks"}},{"before":"9a2b6a6bbb29c2ebaec19c1d4f269d4bc063297c","after":"13a1484f3126072bfb9a8a92fe6a76d966ac1849","ref":"refs/heads/main","pushedAt":"2024-05-07T03:42:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[2816] Double a Number Represented as a Linked List","shortMessageHtmlLink":"[2816] Double a Number Represented as a Linked List"}},{"before":"3bdcd8a1f0379d4a5fa635f282d13041ab2981f0","after":"9a2b6a6bbb29c2ebaec19c1d4f269d4bc063297c","ref":"refs/heads/main","pushedAt":"2024-05-04T04:29:26.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[881] Boats to Save People\n- sort -> two pointers","shortMessageHtmlLink":"[881] Boats to Save People"}},{"before":"3efb6072e350518b9983abc2b78fc5f19ee39c2b","after":"3bdcd8a1f0379d4a5fa635f282d13041ab2981f0","ref":"refs/heads/main","pushedAt":"2024-05-03T05:54:40.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"[165] Compare Version Numbers\n- itertools 의 zip_longest() 함수는 zip과 동일하지만 fillvalue=0 을 지정하면 더 작은 리스트를 0으로 채워준다.","shortMessageHtmlLink":"[165] Compare Version Numbers"}},{"before":"d888a132bcd7dc71cd7ef3218ae54af420636b29","after":"3efb6072e350518b9983abc2b78fc5f19ee39c2b","ref":"refs/heads/main","pushedAt":"2024-04-30T02:01:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ddoddii","name":"Soeun Uhm","path":"/ddoddii","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/95014836?s=80&v=4"},"commit":{"message":"docs : update readme","shortMessageHtmlLink":"docs : update readme"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEYt1RIAA","startCursor":null,"endCursor":null}},"title":"Activity · ddoddii/algorithm"}