{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":652445516,"defaultBranch":"master","name":"LeetCodeSolutions","ownerLogin":"shamstabrez16","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-06-12T05:10:10.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/12733189?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1697260595.0","currentOid":""},"activityList":{"items":[{"before":"dcfb385f9b46c226434c0b163a1c395edbc9a21b","after":"3d9301f8c91e3c110fd145a4b7f91fcc13c4cfcd","ref":"refs/heads/master","pushedAt":"2023-10-19T03:54:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Remove Duplicates 1 and Remove Duplicates 2","shortMessageHtmlLink":"Remove Duplicates 1 and Remove Duplicates 2"}},{"before":"4cf8a49144a5f7ba85db37b86ca87bcb333c0731","after":"dcfb385f9b46c226434c0b163a1c395edbc9a21b","ref":"refs/heads/master","pushedAt":"2023-10-19T03:13:16.000Z","pushType":"push","commitsCount":4,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"KidsWithTheGreatestNumberOfCandies","shortMessageHtmlLink":"KidsWithTheGreatestNumberOfCandies"}},{"before":null,"after":"6515e1f1d11d86f121fca139d339b65b8c9fe670","ref":"refs/heads/268_MissingNumber","pushedAt":"2023-10-14T05:16:35.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"missing number","shortMessageHtmlLink":"missing number"}},{"before":"58fb7db36f162738f4657bd9c3966111c21093ae","after":"4cf8a49144a5f7ba85db37b86ca87bcb333c0731","ref":"refs/heads/master","pushedAt":"2023-10-12T04:40:12.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #49 from shamstabrez16/217._Contains_Duplicate\n\ncontains duplicate","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1939161802\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/49\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/49/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/49\">#49</a> from shamstabrez16/217._Contains_Duplicate"}},{"before":null,"after":"4c60fdabe8b23f076cd239103ad0ffc2e9aee561","ref":"refs/heads/217._Contains_Duplicate","pushedAt":"2023-10-12T04:39:26.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"contains duplicate","shortMessageHtmlLink":"contains duplicate"}},{"before":"fa54dfe6e7824bd81cdbf19210cb952ccc6029d7","after":"58fb7db36f162738f4657bd9c3966111c21093ae","ref":"refs/heads/master","pushedAt":"2023-10-11T16:28:54.000Z","pushType":"pr_merge","commitsCount":3,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #48 from shamstabrez16/1071._Greatest_Common_Divisor_of_Strings\n\n1071. greatest common divisor of strings","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1938213329\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/48\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/48/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/48\">#48</a> from shamstabrez16/1071._Greatest_Common_Divis…"}},{"before":null,"after":"4cfe2dec8b6222ddfeb8b8725c882d4e28513bd6","ref":"refs/heads/1071._Greatest_Common_Divisor_of_Strings","pushedAt":"2023-10-11T16:28:20.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"1071. Greatest Common Divisor of Strings\nSolved\nEasy\nTopics\nCompanies\nHint\nFor two strings s and t, we say \"t divides s\" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times).\n\nGiven two strings str1 and str2, return the largest string x such that x divides both str1 and str2.\n\nExample 1:\n\nInput: str1 = \"ABCABC\", str2 = \"ABC\"\nOutput: \"ABC\"\nExample 2:\n\nInput: str1 = \"ABABAB\", str2 = \"ABAB\"\nOutput: \"AB\"\nExample 3:\n\nInput: str1 = \"LEET\", str2 = \"CODE\"\nOutput: \"\"\n\nConstraints:\n\n1 <= str1.length, str2.length <= 1000\nstr1 and str2 consist of English uppercase letters.\nAccepted\n276K\nSubmissions\n528.6K\nAcceptance Rate\n52.2%","shortMessageHtmlLink":"1071. Greatest Common Divisor of Strings"}},{"before":null,"after":"fc25a0b09764918562f6a6dfe8d85ce8f4e2bfd5","ref":"refs/heads/169_majorityElement","pushedAt":"2023-10-10T15:33:46.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"169. Majority Element\n\nEasy\nTopics\nCompanies\nGiven an array nums of size n, return the majority element.\n\nThe majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array.\n\nExample 1:\n\nInput: nums = [3,2,3]\nOutput: 3\nExample 2:\n\nInput: nums = [2,2,1,1,1,2,2]\nOutput: 2\n\nConstraints:\n\nn == nums.length\n1 <= n <= 5 * 104\n-109 <= nums[i] <= 109","shortMessageHtmlLink":"169. Majority Element"}},{"before":"d29676c1809cdbaeccd90ed721e4557bc9812611","after":"fa54dfe6e7824bd81cdbf19210cb952ccc6029d7","ref":"refs/heads/master","pushedAt":"2023-09-14T17:20:06.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #47 from shamstabrez16/1512._Number_of_Good_Pairs_\n\n512. Number of Good Pairs","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1897001602\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/47\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/47/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/47\">#47</a> from shamstabrez16/1512._Number_of_Good_Pairs_"}},{"before":null,"after":"6ec596601fefc23b17651b21cccc2177a9d95cad","ref":"refs/heads/1512._Number_of_Good_Pairs_","pushedAt":"2023-09-14T17:19:22.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"512. Number of Good Pairs\nSolved\nEasy\nTopics\nCompanies\nHint\nGiven an array of integers nums, return the number of good pairs.\n\nA pair (i, j) is called good if nums[i] == nums[j] and i < j.\n\nExample 1:\n\nInput: nums = [1,2,3,1,1,3]\nOutput: 4\nExplanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed.\nExample 2:\n\nInput: nums = [1,1,1,1]\nOutput: 6\nExplanation: Each pair in the array are good.\nExample 3:\n\nInput: nums = [1,2,3]\nOutput: 0\n\nConstraints:\n\n1 <= nums.length <= 100\n1 <= nums[i] <= 100","shortMessageHtmlLink":"512. Number of Good Pairs"}},{"before":"993f716b012e2f8f5cfa692b00824421774a15f8","after":"d29676c1809cdbaeccd90ed721e4557bc9812611","ref":"refs/heads/master","pushedAt":"2023-09-14T16:06:37.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #46 from shamstabrez16/338_Counting_Bits\n\n338. Counting Bits","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1896887006\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/46\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/46/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/46\">#46</a> from shamstabrez16/338_Counting_Bits"}},{"before":null,"after":"018806a5e160947999b6d2b4fdc102a813effa31","ref":"refs/heads/338_Counting_Bits","pushedAt":"2023-09-14T16:06:06.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"338. Counting Bits\nEasy\n10.4K\n472\nCompanies\nGiven an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.\n\nExample 1:\n\nInput: n = 2\nOutput: [0,1,1]\nExplanation:\n0 --> 0\n1 --> 1\n2 --> 10\nExample 2:\n\nInput: n = 5\nOutput: [0,1,1,2,1,2]\nExplanation:\n0 --> 0\n1 --> 1\n2 --> 10\n3 --> 11\n4 --> 100\n5 --> 101\n\nConstraints:\n\n0 <= n <= 105","shortMessageHtmlLink":"338. Counting Bits"}},{"before":"ef543c3d2b766c03a68a9ab5985cb3d1cfeb81af","after":"993f716b012e2f8f5cfa692b00824421774a15f8","ref":"refs/heads/master","pushedAt":"2023-09-02T05:58:00.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #45 from shamstabrez16/12._Integer_to_Roman\n\n12. Integer to Roman","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1878379155\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/45\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/45/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/45\">#45</a> from shamstabrez16/12._Integer_to_Roman"}},{"before":null,"after":"e14d1f42ad44c1e9a376ffdd286b04073904cbab","ref":"refs/heads/12._Integer_to_Roman","pushedAt":"2023-09-02T05:57:04.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"12. Integer to Roman\nMedium\n6.2K\n5.3K\nCompanies\nRoman numerals are represented by seven different symbols: I, V, X, L, C, D and M.\n\nSymbol       Value\nI             1\nV             5\nX             10\nL             50\nC             100\nD             500\nM             1000\nFor example, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.\n\nRoman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:\n\nI can be placed before V (5) and X (10) to make 4 and 9.\nX can be placed before L (50) and C (100) to make 40 and 90.\nC can be placed before D (500) and M (1000) to make 400 and 900.\nGiven an integer, convert it to a roman numeral.\n\nExample 1:\n\nInput: num = 3\nOutput: \"III\"\nExplanation: 3 is represented as 3 ones.\nExample 2:\n\nInput: num = 58\nOutput: \"LVIII\"\nExplanation: L = 50, V = 5, III = 3.\nExample 3:\n\nInput: num = 1994\nOutput: \"MCMXCIV\"\nExplanation: M = 1000, CM = 900, XC = 90 and IV = 4.\n\nConstraints:\n\n1 <= num <= 3999\nAccepted\n1.1M\nSubmissions\n1.7M\nAcceptance Rate\n62.9%","shortMessageHtmlLink":"12. Integer to Roman"}},{"before":"d446dee19d6af37aabb6c802f4d0268f0f5db1b3","after":"ef543c3d2b766c03a68a9ab5985cb3d1cfeb81af","ref":"refs/heads/master","pushedAt":"2023-09-02T04:48:08.000Z","pushType":"pr_merge","commitsCount":3,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #44 from shamstabrez16/11._Container_With_Most_Water\n\n11. container with most water","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1878347221\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/44\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/44/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/44\">#44</a> from shamstabrez16/11._Container_With_Most_Water"}},{"before":null,"after":"8f74f8a07087c071aed4ead6adbb728a577cda7c","ref":"refs/heads/11._Container_With_Most_Water","pushedAt":"2023-09-02T04:47:17.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"11. Container With Most Water\nMedium\n26.3K\n1.4K\nCompanies\nYou are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).\n\nFind two lines that together with the x-axis form a container, such that the container contains the most water.\n\nReturn the maximum amount of water a container can store.\n\nNotice that you may not slant the container.\n\nExample 1:\n\nInput: height = [1,8,6,2,5,4,8,3,7]\nOutput: 49\nExplanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.\nExample 2:\n\nInput: height = [1,1]\nOutput: 1\n\nConstraints:\n\nn == height.length\n2 <= n <= 105\n0 <= height[i] <= 104\nAccepted\n2.3M\nSubmissions\n4.3M\nAcceptance Rate\n54.1%","shortMessageHtmlLink":"11. Container With Most Water"}},{"before":"3eadcc11b55a15a39eeb141c82c61b4730229c25","after":"d446dee19d6af37aabb6c802f4d0268f0f5db1b3","ref":"refs/heads/master","pushedAt":"2023-08-30T17:34:28.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #43 from shamstabrez16/345._Reverse_Vowels_of_a_String_\n\n7. Reverse Integer","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1874102845\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/43\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/43/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/43\">#43</a> from shamstabrez16/345._Reverse_Vowels_of_a_St…"}},{"before":null,"after":"90429dd7638ea573be64da8e30cde93eb1a1fa8c","ref":"refs/heads/345._Reverse_Vowels_of_a_String_","pushedAt":"2023-08-30T17:33:57.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"7. Reverse Integer\nMedium\n11.6K\n12.8K\nCompanies\nGiven a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0.\n\nAssume the environment does not allow you to store 64-bit integers (signed or unsigned).\n\nExample 1:\n\nInput: x = 123\nOutput: 321\nExample 2:\n\nInput: x = -123\nOutput: -321\nExample 3:\n\nInput: x = 120\nOutput: 21\n\nConstraints:\n\n-231 <= x <= 231 - 1","shortMessageHtmlLink":"7. Reverse Integer"}},{"before":"b5424970a2294e24fa9794d4741fd35f0a3122b4","after":"3eadcc11b55a15a39eeb141c82c61b4730229c25","ref":"refs/heads/master","pushedAt":"2023-08-18T20:08:26.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #42 from shamstabrez16/605._Can_Place_Flowers\n\n605. Can Place Flowers","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1857236013\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/42\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/42/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/42\">#42</a> from shamstabrez16/605._Can_Place_Flowers"}},{"before":null,"after":"522d703fb502ba1e499009ee334339dcd3af0db4","ref":"refs/heads/605._Can_Place_Flowers","pushedAt":"2023-08-18T20:08:01.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"605. Can Place Flowers\nEasy\n5.6K\n947\nCompanies\nYou have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.\n\nGiven an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise.\n\nExample 1:\n\nInput: flowerbed = [1,0,0,0,1], n = 1\nOutput: true\nExample 2:\n\nInput: flowerbed = [1,0,0,0,1], n = 2\nOutput: false\n\nConstraints:\n\n1 <= flowerbed.length <= 2 * 104\nflowerbed[i] is 0 or 1.\nThere are no two adjacent flowers in flowerbed.\n0 <= n <= flowerbed.length\nAccepted\n515K\nSubmissions\n1.7M\nAcceptance Rate\n30.8%","shortMessageHtmlLink":"605. Can Place Flowers"}},{"before":"e47e192da2f18cf9add1dac5c41a5f4fea84f6ad","after":"b5424970a2294e24fa9794d4741fd35f0a3122b4","ref":"refs/heads/master","pushedAt":"2023-08-10T16:07:18.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #41 from shamstabrez16/151._Reverse_Words_in_a_String\n\n151. Reverse Words in a String","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1845487360\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/41\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/41/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/41\">#41</a> from shamstabrez16/151._Reverse_Words_in_a_String"}},{"before":"62d1b878755d110c8dafecbc8421968978a85c72","after":"e47e192da2f18cf9add1dac5c41a5f4fea84f6ad","ref":"refs/heads/master","pushedAt":"2023-08-10T16:06:54.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #40 from shamstabrez16/535._Encode_and_Decode_TinyURL\n\n535. Encode and Decode TinyURL","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1845486840\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/40\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/40/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/40\">#40</a> from shamstabrez16/535._Encode_and_Decode_TinyURL"}},{"before":null,"after":"a8d097583bb76954818c426a2697c90d0e52ba96","ref":"refs/heads/151._Reverse_Words_in_a_String","pushedAt":"2023-08-10T16:06:30.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"151. Reverse Words in a String\nMedium\n6.9K\n4.8K\nCompanies\nGiven an input string s, reverse the order of the words.\n\nA word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.\n\nReturn a string of the words in reverse order concatenated by a single space.\n\nNote that s may contain leading or trailing spaces or multiple spaces between two words. The returned string should only have a single space separating the words. Do not include any extra spaces.\n\nExample 1:\n\nInput: s = \"the sky is blue\"\nOutput: \"blue is sky the\"\nExample 2:\n\nInput: s = \"  hello world  \"\nOutput: \"world hello\"\nExplanation: Your reversed string should not contain leading or trailing spaces.\nExample 3:\n\nInput: s = \"a good   example\"\nOutput: \"example good a\"\nExplanation: You need to reduce multiple spaces between two words to a single space in the reversed string.\n\nConstraints:\n\n1 <= s.length <= 104\ns contains English letters (upper-case and lower-case), digits, and spaces ' '.\nThere is at least one word in s.\n\nFollow-up: If the string data type is mutable in your language, can you solve it in-place with O(1) extra space?\n\nAccepted\n1M\nSubmissions\n2.9M\nAcceptance Rate\n35.5%","shortMessageHtmlLink":"151. Reverse Words in a String"}},{"before":null,"after":"c2286887634312aa4a06ed81f5a2204208451e1e","ref":"refs/heads/535._Encode_and_Decode_TinyURL","pushedAt":"2023-08-10T15:43:16.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"535. Encode and Decode TinyURL\nMedium\n1.9K\n3.6K\nCompanies\nNote: This is a companion problem to the System Design problem: Design TinyURL.\nTinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and it returns a short URL such as http://tinyurl.com/4e9iAk. Design a class to encode a URL and decode a tiny URL.\n\nThere is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.\n\nImplement the Solution class:\n\nSolution() Initializes the object of the system.\nString encode(String longUrl) Returns a tiny URL for the given longUrl.\nString decode(String shortUrl) Returns the original long URL for the given shortUrl. It is guaranteed that the given shortUrl was encoded by the same object.\n\nExample 1:\n\nInput: url = \"https://leetcode.com/problems/design-tinyurl\"\nOutput: \"https://leetcode.com/problems/design-tinyurl\"\n\nExplanation:\nSolution obj = new Solution();\nstring tiny = obj.encode(url); // returns the encoded tiny url.\nstring ans = obj.decode(tiny); // returns the original url after decoding it.\n\nConstraints:\n\n1 <= url.length <= 104\nurl is guranteed to be a valid URL.\nAccepted\n236.1K\nSubmissions\n274.3K\nAcceptance Rate\n86.1%","shortMessageHtmlLink":"535. Encode and Decode TinyURL"}},{"before":"dec609b091470550a64c7bd34240d7f02f3703c5","after":"62d1b878755d110c8dafecbc8421968978a85c72","ref":"refs/heads/master","pushedAt":"2023-08-10T15:21:37.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #39 from shamstabrez16/771._Jewels_and_Stones_\n\n771. Jewels and Stones","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1845412114\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/39\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/39/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/39\">#39</a> from shamstabrez16/771._Jewels_and_Stones_"}},{"before":null,"after":"27d807e6a40e78abb2dea9c5fbffffb740a4e4f6","ref":"refs/heads/771._Jewels_and_Stones_","pushedAt":"2023-08-10T15:21:10.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"771. Jewels and Stones\nEasy\n4.7K\n556\nCompanies\nYou're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone you have. You want to know how many of the stones you have are also jewels.\n\nLetters are case sensitive, so \"a\" is considered a different type of stone from \"A\".\n\nExample 1:\n\nInput: jewels = \"aA\", stones = \"aAAbbbb\"\nOutput: 3\nExample 2:\n\nInput: jewels = \"z\", stones = \"ZZ\"\nOutput: 0\n\nConstraints:\n\n1 <= jewels.length, stones.length <= 50\njewels and stones consist of only English letters.\nAll the characters of jewels are unique.","shortMessageHtmlLink":"771. Jewels and Stones"}},{"before":"0b20da68a9e66b8dec05c583f342bc18a4f778ff","after":"dec609b091470550a64c7bd34240d7f02f3703c5","ref":"refs/heads/master","pushedAt":"2023-08-09T21:26:03.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #38 from shamstabrez16/557._Reverse_Words_in_a_String_III_\n\n557. Reverse Words in a String III","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1844039400\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/38\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/38/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/38\">#38</a> from shamstabrez16/557._Reverse_Words_in_a_Str…"}},{"before":null,"after":"03bbf2274552d0eb21e66ed71b5c0f06b01aa21a","ref":"refs/heads/557._Reverse_Words_in_a_String_III_","pushedAt":"2023-08-09T21:25:14.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"557. Reverse Words in a String III\nEasy\n5.1K\n229\nCompanies\nGiven a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order.\n\nExample 1:\n\nInput: s = \"Let's take LeetCode contest\"\nOutput: \"s'teL ekat edoCteeL tsetnoc\"\nExample 2:\n\nInput: s = \"God Ding\"\nOutput: \"doG gniD\"\n\nConstraints:\n\n1 <= s.length <= 5 * 104\ns contains printable ASCII characters.\ns does not contain any leading or trailing spaces.\nThere is at least one word in s.\nAll the words in s are separated by a single space.\nAccepted\n712.4K\nSubmissions\n869.4K\nAcceptance Rate\n81.9%","shortMessageHtmlLink":"557. Reverse Words in a String III"}},{"before":"83429e1edc6bd93934fe5bb32b1c2704138b7b46","after":"0b20da68a9e66b8dec05c583f342bc18a4f778ff","ref":"refs/heads/master","pushedAt":"2023-08-01T19:51:54.000Z","pushType":"pr_merge","commitsCount":2,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"Merge pull request #37 from shamstabrez16/1572._Matrix_Diagonal_Sum_\n\n1572. Matrix Diagonal Sum","shortMessageHtmlLink":"Merge pull request <a class=\"issue-link js-issue-link\" data-error-text=\"Failed to load title\" data-id=\"1831932153\" data-permission-text=\"Title is private\" data-url=\"https://github.com/shamstabrez16/LeetCodeSolutions/issues/37\" data-hovercard-type=\"pull_request\" data-hovercard-url=\"/shamstabrez16/LeetCodeSolutions/pull/37/hovercard\" href=\"https://github.com/shamstabrez16/LeetCodeSolutions/pull/37\">#37</a> from shamstabrez16/1572._Matrix_Diagonal_Sum_"}},{"before":null,"after":"70038de0b08b59ee3c8073c826fa6e26f5130e2f","ref":"refs/heads/1572._Matrix_Diagonal_Sum_","pushedAt":"2023-08-01T19:51:10.000Z","pushType":"branch_creation","commitsCount":0,"pusher":{"login":"shamstabrez16","name":"Mohammad Shams Tabrez","path":"/shamstabrez16","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/12733189?s=80&v=4"},"commit":{"message":"1572. Matrix Diagonal Sum\nEasy\n3.1K\n41\nCompanies\nGiven a square matrix mat, return the sum of the matrix diagonals.\n\nOnly include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal.\n\nExample 1:\n\nInput: mat = [[1,2,3],\n              [4,5,6],\n              [7,8,9]]\nOutput: 25\nExplanation: Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25\nNotice that element mat[1][1] = 5 is counted only once.\nExample 2:\n\nInput: mat = [[1,1,1,1],\n              [1,1,1,1],\n              [1,1,1,1],\n              [1,1,1,1]]\nOutput: 8\nExample 3:\n\nInput: mat = [[5]]\nOutput: 5\n\nConstraints:\n\nn == mat.length == mat[i].length\n1 <= n <= 100\n1 <= mat[i][j] <= 100\nAccepted\n281.5K\nSubmissions\n340.2K\nAcceptance Rate\n82.7%","shortMessageHtmlLink":"1572. Matrix Diagonal Sum"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAADmpG24AA","startCursor":null,"endCursor":null}},"title":"Activity · shamstabrez16/LeetCodeSolutions"}