{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":518217767,"defaultBranch":"main","name":"algorithms","ownerLogin":"Tunzeki","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2022-07-26T21:09:21.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/67439340?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1658869761.782222","currentOid":""},"activityList":{"items":[{"before":"d10d10e0e9d27e6d615c4623d8a63338d2b29013","after":"b47e0f6a4751d5ebe8dddf40b38a117b41b3f83e","ref":"refs/heads/main","pushedAt":"2023-07-06T19:36:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Baseball Game Challenge\n\nYou are keeping the scores for a baseball game with strange rules.\nAt the beginning of the game, you start with an empty record.\n\nYou are given a list of strings operations, where operations[i] is the\nith operation you must apply to the record and is one of the following:\n- An integer x.\n    - Record a new score of x.\n- '+'.\n    - Record a new score that is the sum of the previous two scores.\n- 'D'.\n    - Record a new score that is the double of the previous score.\n- 'C'.\n    - Invalidate the previous score, removing it from the record.\n\nReturn the sum of all the scores on the record after applying all the\noperations.","shortMessageHtmlLink":"LeetCode's Baseball Game Challenge"}},{"before":"bc49d6192b0f3874fd46ca7c5d3aa3c3a0dcfd4b","after":"d10d10e0e9d27e6d615c4623d8a63338d2b29013","ref":"refs/heads/main","pushedAt":"2023-07-05T22:18:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Remove Element Challenge\n\nGiven an integer array nums and an integer val, remove all occurrences\nof val in nums in-place. The order of the elements may be changed.\nThen return the number of elements in nums which are not equal to val.\n\nConsider the number of elements in nums which are not equal to val be k,\nto get accepted, you need to do the following things:\n- Change the array nums such that the first k elements of nums contain\nthe elements which are not equal to val. The remaining elements of nums\nare not important as well as the size of nums.\n- Return k","shortMessageHtmlLink":"LeetCode's Remove Element Challenge"}},{"before":"6df929e99752974354b0ad125f5390b94fe06da2","after":"bc49d6192b0f3874fd46ca7c5d3aa3c3a0dcfd4b","ref":"refs/heads/main","pushedAt":"2023-07-03T22:05:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Number of Beautiful Pairs Challenge\n\nYou are given a 0-indexed integer array nums.\nA pair of indices i, j where 0 <= i < j < nums.length is called\nbeautiful if the first digit of nums[i] and the last digit of nums[j]\nare coprime.\nReturn the total number of beautiful pairs in nums.\nTwo integers x and y are coprime if there is no integer greater than 1\nthat divides both of them. In other words, x and y are coprime if\ngcd(x, y) == 1, where gcd(x, y) is the greatest common divisor of\nx and y.","shortMessageHtmlLink":"LeetCode's Number of Beautiful Pairs Challenge"}},{"before":"eab95f78041f1637a597d32efd175aa79db01fe5","after":"6df929e99752974354b0ad125f5390b94fe06da2","ref":"refs/heads/main","pushedAt":"2023-07-01T09:00:14.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Reverse String Challenge\n\nWrite a function that reverses a string.\nThe input string is given as an array of characters s.\nYou must do this by modifying the input array in-place with O(1) extra\nmemory.","shortMessageHtmlLink":"LeetCode's Reverse String Challenge"}},{"before":"19c8e5a4f87d62ba6f935cb2e109eaca3c8fd613","after":"eab95f78041f1637a597d32efd175aa79db01fe5","ref":"refs/heads/main","pushedAt":"2023-07-01T00:53:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Merge Sorted Array Challenge\n\nYou are given two integer arrays nums1 and nums2, sorted in\nnon-decreasing order, and two integers m and n, representing the number\nof elements in nums1 and nums2 respectively.\nMerge nums1 and nums2 into a single array sorted in non-decreasing order\n\nThe final sorted array should not be returned by the function,\nbut instead be stored inside the array nums1. To accommodate this,\nnums1 has a length of m + n, where the first m elements denote the\nelements that should be merged, and the last n elements are set to 0\nand should be ignored. nums2 has a length of n.","shortMessageHtmlLink":"LeetCode's Merge Sorted Array Challenge"}},{"before":"8a2925b7b6b5c3e9723e7971b5be4bb877e328a6","after":"19c8e5a4f87d62ba6f935cb2e109eaca3c8fd613","ref":"refs/heads/main","pushedAt":"2023-06-29T22:26:37.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Valid Palindrome Challenge\n\nA phrase is a palindrome if, after converting all uppercase letters into\nlowercase letters and removing all non-alphanumeric characters,\nit reads the same forward and backward.\nAlphanumeric characters include letters and numbers.\n\nGiven a string s, return true if it is a palindrome, or false otherwise.","shortMessageHtmlLink":"LeetCode's Valid Palindrome Challenge"}},{"before":"c672f59f074c340adc635eb94b72fed6eb8008a8","after":"8a2925b7b6b5c3e9723e7971b5be4bb877e328a6","ref":"refs/heads/main","pushedAt":"2023-06-28T06:39:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Pascal's Triangle\n\nGiven an integer numRows, return the first numRows of Pascal's triangle.\nIn Pascal's triangle, each number is the sum of the two numbers directly\nabove it.","shortMessageHtmlLink":"LeetCode's Pascal's Triangle"}},{"before":"55d54258e6507721b78dc733fef48ea9dd5e66d8","after":"c672f59f074c340adc635eb94b72fed6eb8008a8","ref":"refs/heads/main","pushedAt":"2023-06-25T12:54:06.428Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Isomorphic Strings Challenge\n\nGiven two strings s and t, determine if they are isomorphic.\nTwo strings s and t are isomorphic if the characters in s can be\nreplaced to get t.\nAll occurrences of a character must be replaced with another character\nwhile preserving the order of characters.\nNo two characters may map to the same character, but a character may map\nto itself.","shortMessageHtmlLink":"LeetCode's Isomorphic Strings Challenge"}},{"before":"7e75b6f9fad12dd728f84e92671a5693944575b8","after":"55d54258e6507721b78dc733fef48ea9dd5e66d8","ref":"refs/heads/main","pushedAt":"2023-06-24T21:56:23.051Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Single Number Challenge\n\nGiven a non-empty array of integers nums,\nevery element appears twice except for one. Find that single one.\n\nYou must implement a solution with a linear runtime complexity\nand use only constant extra space.","shortMessageHtmlLink":"LeetCode's Single Number Challenge"}},{"before":"3e4b90dd274ef7fa09329e1ac7270e0b3f20f5f0","after":"7e75b6f9fad12dd728f84e92671a5693944575b8","ref":"refs/heads/main","pushedAt":"2023-06-24T11:08:31.433Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Is Subsequence Challenge\n\nGiven two strings s and t, return true if s is a subsequence of t,\nor false otherwise.\n\nA subsequence of a string is a new string that is formed from the\noriginal string by deleting some (can be none) of the characters without\ndisturbing the relative positions of the remaining characters\n(i.e., \"ace\" is a subsequence of \"abcde\" while \"aec\" is not).","shortMessageHtmlLink":"LeetCode's Is Subsequence Challenge"}},{"before":"6cbda50a05cf1a4ceed4d3bf22712512ff10a24b","after":"3e4b90dd274ef7fa09329e1ac7270e0b3f20f5f0","ref":"refs/heads/main","pushedAt":"2023-06-22T19:27:20.399Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Check If It Is a Straight Line\n\nYou are given an array coordinates, coordinates[i] = [x, y],\nwhere [x, y] represents the coordinate of a point.\nCheck if these points make a straight line in the XY plane.","shortMessageHtmlLink":"LeetCode's Check If It Is a Straight Line"}},{"before":"ec8960f78e58663e00a125d76e3a43f6529bc447","after":"6cbda50a05cf1a4ceed4d3bf22712512ff10a24b","ref":"refs/heads/main","pushedAt":"2023-06-21T20:11:01.989Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Valid Anagram Challenge\n\nGiven two strings s and t, return true if t is an anagram of s,\nand false otherwise.\n\nAn Anagram is a word or phrase formed by rearranging the letters\nof a different word or phrase, typically using all the original letters\nexactly once.","shortMessageHtmlLink":"LeetCode's Valid Anagram Challenge"}},{"before":"6fac150c08807e4bc2dea77aa26cc2bf106ac883","after":"ec8960f78e58663e00a125d76e3a43f6529bc447","ref":"refs/heads/main","pushedAt":"2023-06-17T06:17:04.810Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Remove Duplicates from Sorted Array\n\nGiven an integer array nums sorted in non-decreasing order,\nremove the duplicates in-place such that each unique element\nappears only once.\nThe relative order of the elements should be kept the same.\nThen return the number of unique elements in nums.\nConsider the number of unique elements of nums to be k, to get accepted,\nyou need to do the following things:\n- `Change the array nums such that the first k elements of nums\n    contain the unique elements in the order\n    they were present in nums initially.\n    The remaining elements of nums are not important as well as the size of nums.\n- Return k.","shortMessageHtmlLink":"LeetCode's Remove Duplicates from Sorted Array"}},{"before":"a42fe33949408a7dfda6538d7ad1060c1f7c08df","after":"6fac150c08807e4bc2dea77aa26cc2bf106ac883","ref":"refs/heads/main","pushedAt":"2023-06-15T23:26:50.032Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Length of Last Word Challenge\n\nGiven a string s consisting of words and spaces,\nreturn the length of the last word in the string.\nA word is a maximal substring consisting of non-space characters only.","shortMessageHtmlLink":"LeetCode's Length of Last Word Challenge"}},{"before":"70d34edf902a27f62ddbace2ad412955aa051509","after":"a42fe33949408a7dfda6538d7ad1060c1f7c08df","ref":"refs/heads/main","pushedAt":"2023-06-14T22:51:30.507Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Best Time to Buy and Sell Stock\n\nYou are given an array prices\nwhere prices[i] is the price of a given stock on the ith day.\nYou want to maximize your profit by choosing a single day to buy one stock\nand choosing a different day in the future to sell that stock.\nReturn the maximum profit you can achieve from this transaction.\nIf you cannot achieve any profit, return 0.","shortMessageHtmlLink":"LeetCode's Best Time to Buy and Sell Stock"}},{"before":"fb93a3b7def620275f2fc2af7f77a3b893dfd8ef","after":"70d34edf902a27f62ddbace2ad412955aa051509","ref":"refs/heads/main","pushedAt":"2023-06-13T22:59:57.772Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Find the Index of the First Occurence in a String\n\nA LeetCode's Algorithm\n\nGiven two strings needle and haystack,\nreturn the index of the first occurrence of needle in haystack,\nor -1 if needle is not part of haystack.","shortMessageHtmlLink":"Find the Index of the First Occurence in a String"}},{"before":"0c9c7a4ecd7a72e455281e3f0bc641f3f6f9d50d","after":"fb93a3b7def620275f2fc2af7f77a3b893dfd8ef","ref":"refs/heads/main","pushedAt":"2023-06-12T05:47:32.843Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Solve LeetCode's Majority Element Challenge\n\nGiven an array nums of size n, return the majority element.\nThe majority element is the element that appears more than ⌊n / 2⌋ times.\nYou may assume that the majority element always exists in the array.","shortMessageHtmlLink":"Solve LeetCode's Majority Element Challenge"}},{"before":"3b4345e89e4204c0465e4d0e29cef2ac701c06d3","after":"0c9c7a4ecd7a72e455281e3f0bc641f3f6f9d50d","ref":"refs/heads/main","pushedAt":"2023-06-09T23:35:14.418Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Reverse Vowels of a String Challenge\n\nGiven a string s, reverse only all the vowels in the string and\nreturn it.\nThe vowels are 'a', 'e', 'i', 'o', and 'u',\nand they can appear in both lower and upper cases, more than once.","shortMessageHtmlLink":"LeetCode's Reverse Vowels of a String Challenge"}},{"before":"e9c2f0214d9f4e039ab4c49dcfe531e057a8c252","after":"3b4345e89e4204c0465e4d0e29cef2ac701c06d3","ref":"refs/heads/main","pushedAt":"2023-06-08T22:20:42.449Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Solve LeetCode's Can Place Flowers Challenge\n\nYou have a long flowerbed in which some of the plots are planted,\nand some are not.\nHowever, flowers cannot be planted in adjacent plots.\nGiven an integer array flowerbed containing 0's and 1's,\nwhere 0 means empty and 1 means not empty, and an integer n,\nreturn true if n new flowers can be planted in the flowerbed\nwithout violating the no-adjacent-flowers rule and false otherwise.","shortMessageHtmlLink":"Solve LeetCode's Can Place Flowers Challenge"}},{"before":"e14858291a7079aa9355926eb61cf4559c00cf4e","after":"e9c2f0214d9f4e039ab4c49dcfe531e057a8c252","ref":"refs/heads/main","pushedAt":"2023-06-06T22:56:36.226Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Kids With the Greatest Number of Candies","shortMessageHtmlLink":"LeetCode's Kids With the Greatest Number of Candies"}},{"before":"9322533ca86871825b7e82bbd5aa5cfec92a8ece","after":"e14858291a7079aa9355926eb61cf4559c00cf4e","ref":"refs/heads/main","pushedAt":"2023-06-05T21:01:04.893Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Merge Strings Alternately Challenge\n\nYou are given two strings word1 and word2.\nMerge the strings by adding letters in alternating order, starting with\nword1. If a string is longer than the other,\nappend the additional letters onto the end of the merged string.\nReturn the merged string.","shortMessageHtmlLink":"LeetCode's Merge Strings Alternately Challenge"}},{"before":"59582b607ef19bf771abdb8e2f816d9454069e11","after":"9322533ca86871825b7e82bbd5aa5cfec92a8ece","ref":"refs/heads/main","pushedAt":"2023-06-04T21:05:13.868Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Solve LeetCode's Contains Duplicate Challenge\n\nGiven an integer array nums,\nreturn true if any value appears at least twice in the array,\nand return false if every element is distinct.","shortMessageHtmlLink":"Solve LeetCode's Contains Duplicate Challenge"}},{"before":"921ecc114c9bbeee85459a91d53bb274a8f2a559","after":"59582b607ef19bf771abdb8e2f816d9454069e11","ref":"refs/heads/main","pushedAt":"2023-06-03T23:17:32.682Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Solve LeetCode's Valid Parentheses Challenge\n\nGiven a string s containing just the characters '(', ')', '{', '}',\n'[' and ']',  determine if the input string is valid.\n\nAn input string is valid if:\n- Open brackets must be closed by the same type of brackets.\n- Open brackets must be closed in the correct order.\n- Every close bracket has a corresponding open bracket of the same type.","shortMessageHtmlLink":"Solve LeetCode's Valid Parentheses Challenge"}},{"before":"44118dfced33ad567566138257262c1692dba9f6","after":"921ecc114c9bbeee85459a91d53bb274a8f2a559","ref":"refs/heads/main","pushedAt":"2023-06-02T22:26:16.343Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Solve LeetCode's Palindrome Number Challenge\n\nGiven an integer x, return true if x is a palindrome,\nand false otherwise.","shortMessageHtmlLink":"Solve LeetCode's Palindrome Number Challenge"}},{"before":"02cad914638dfdf090ba6f42252593717906f336","after":"44118dfced33ad567566138257262c1692dba9f6","ref":"refs/heads/main","pushedAt":"2023-06-01T21:49:22.495Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"Solve LeetCode's Longest Common Prefix Challenge\n\nWrite a function to find the longest common prefix string\namongst an array of strings.\nIf there is no common prefix, return an empty string \"\"","shortMessageHtmlLink":"Solve LeetCode's Longest Common Prefix Challenge"}},{"before":"1878ff9a74614ce8e63abbf54998eb67c1c06f77","after":"02cad914638dfdf090ba6f42252593717906f336","ref":"refs/heads/main","pushedAt":"2023-05-31T20:09:46.414Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Two Sum Challenge\n\nGiven an array of integers nums and an integer target,\nreturn indices of the two numbers such that they add up to target.\nYou may assume that each input would have exactly one solution,\nand you may not use the same element twice.\nYou can return the answer in any order.","shortMessageHtmlLink":"LeetCode's Two Sum Challenge"}},{"before":"92dfdb852de66cb506c6af92899b68c9202b621d","after":"1878ff9a74614ce8e63abbf54998eb67c1c06f77","ref":"refs/heads/main","pushedAt":"2023-05-30T16:25:30.069Z","pushType":"push","commitsCount":1,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Ransom Note Challenge\n\nGiven two strings ransomNote and magazine,\nreturn true if ransomNote can be constructed by using the letters from\nmagazine and false otherwise.\nEach letter in magazine can only be used once in ransomNote.","shortMessageHtmlLink":"LeetCode's Ransom Note Challenge"}},{"before":"0053e4692e1e6c2f66849c8942bb244ec96d92ca","after":"92dfdb852de66cb506c6af92899b68c9202b621d","ref":"refs/heads/main","pushedAt":"2023-05-29T20:22:24.513Z","pushType":"push","commitsCount":2,"pusher":{"login":"Tunzeki","name":null,"path":"/Tunzeki","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/67439340?s=80&v=4"},"commit":{"message":"LeetCode's Roman to Integer Challenge\n\nGiven a roman numeral, convert it to an integer.","shortMessageHtmlLink":"LeetCode's Roman to Integer Challenge"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADUFS99wA","startCursor":null,"endCursor":null}},"title":"Activity · Tunzeki/algorithms"}