{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":584233204,"defaultBranch":"main","name":"LeetCode","ownerLogin":"Chukwudebelu","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2023-01-01T23:43:32.000Z","ownerAvatar":"https://github.com/avatars/u/32755252?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1672616613.537449","currentOid":""},"activityList":{"items":[{"before":"ae367adcaf3e48f3f73a108e44aa795308b35e44","after":"6ebed379b21f93664bfa88f35641914e51a0ab84","ref":"refs/heads/main","pushedAt":"2024-06-20T20:46:08.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ThirdMaximumNumber1.py","shortMessageHtmlLink":"Create ThirdMaximumNumber1.py"}},{"before":"b8aa963f45b1a72d91410987aaf9b54834a80b79","after":"ae367adcaf3e48f3f73a108e44aa795308b35e44","ref":"refs/heads/main","pushedAt":"2024-06-20T20:41:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ThirdMaximumNumber0.py\n\nGiven an integer array nums, return the third distinct maximum number in this array. If the third maximum does not exist, return the maximum number.\r\n\r\nExample 1:\r\n  Input: nums = [3,2,1]\r\n  Output: 1\r\n  Explanation:\r\n  The first distinct maximum is 3.\r\n  The second distinct maximum is 2.\r\n  The third distinct maximum is 1.\r\n\r\nExample 2:\r\n  Input: nums = [1,2]\r\n  Output: 2\r\n  Explanation:\r\n  The first distinct maximum is 2.\r\n  The second distinct maximum is 1.\r\n  The third distinct maximum does not exist, so the maximum (2) is returned instead.\r\n\r\nExample 3:\r\n  Input: nums = [2,2,3,1]\r\n  Output: 1\r\n  Explanation:\r\n  The first distinct maximum is 3.\r\n  The second distinct maximum is 2 (both 2's are counted together since they have the same value).\r\n  The third distinct maximum is 1.\r\n \r\nConstraints:\r\n• 1 <= nums.length <= 10⁴\r\n• -2³¹ <= nums[i] <= 2³¹ - 1","shortMessageHtmlLink":"Create ThirdMaximumNumber0.py"}},{"before":"3440ae827fa7861aaa0811fa11459bafa7153453","after":"b8aa963f45b1a72d91410987aaf9b54834a80b79","ref":"refs/heads/main","pushedAt":"2024-06-18T09:18:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SumOfSquaredNumbers0.py\n\nGiven a non-negative integer c, decide whether there're two integers a and b such that a² + b² = c.\r\n\r\nExample 1:\r\n  Input: c = 5\r\n  Output: true\r\n  Explanation: 1 * 1 + 2 * 2 = 5\r\n\r\nExample 2:\r\n  Input: c = 3\r\n  Output: false\r\n  \r\nConstraints:\r\n• 0 <= c <= 2³¹ - 1","shortMessageHtmlLink":"Create SumOfSquaredNumbers0.py"}},{"before":"7008ed08d529dfee667f75273a1796f351fd853c","after":"3440ae827fa7861aaa0811fa11459bafa7153453","ref":"refs/heads/main","pushedAt":"2024-06-13T06:17:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SortColors2.py","shortMessageHtmlLink":"Create SortColors2.py"}},{"before":"e7f7b06f78087d4a4e368e24a8609763b4094670","after":"7008ed08d529dfee667f75273a1796f351fd853c","ref":"refs/heads/main","pushedAt":"2024-06-13T06:16:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SortColors1.py","shortMessageHtmlLink":"Create SortColors1.py"}},{"before":"95590ccbc2be870f30d30121b9ba8b7a68d28780","after":"e7f7b06f78087d4a4e368e24a8609763b4094670","ref":"refs/heads/main","pushedAt":"2024-06-13T06:14:51.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SortColors0.py\n\nGiven an array nums with n objects colored red, white, or blue, sort them in-place[https://en.wikipedia.org/wiki/In-place_algorithm] so that objects of the same color are adjacent, with the colors in the order red, white, and blue.\r\n\r\nWe will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.\r\n\r\nYou must solve this problem without using the library's sort function.\r\n\r\nExample 1:\r\n  Input: nums = [2, 0, 2, 1, 1, 0]\r\n  Output: [0, 0, 1, 1, 2, 2]\r\n \r\nExample 2:\r\n  Input: nums = [2, 0, 1]\r\n  Output: [0, 1, 2]\r\n \r\nConstraints:\r\n• n == nums.length\r\n• 1 <= n <= 300\r\n• nums[i] is either 0, 1, or 2.","shortMessageHtmlLink":"Create SortColors0.py"}},{"before":"dad4e5dc2197b013cd80f41fd45f8bbef3f5a595","after":"95590ccbc2be870f30d30121b9ba8b7a68d28780","ref":"refs/heads/main","pushedAt":"2024-06-12T01:50:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create RelativeSortArray0.py\n\nGiven two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also in arr1.\r\n\r\nSort the elements of arr1 such that the relative ordering of items in arr1 are the same as in arr2. Elements that do not appear in arr2 should be placed at the end of arr1 in ascending order.\r\n\r\nExample 1:\r\n  Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19], arr2 = [2,1,4,3,9,6]\r\n  Output: [2,2,2,1,4,3,3,9,6,7,19]\r\n\r\nExample 2:\r\n  Input: arr1 = [28,6,22,8,44,17], arr2 = [22,28,8,6]\r\n  Output: [22,28,8,6,17,44]\r\n \r\nConstraints:\r\n• 1 <= arr1.length, arr2.length <= 1000\r\n• 0 <= arr1[i], arr2[i] <= 1000\r\n• All the elements of arr2 are distinct.\r\n• Each arr2[i] is in arr1.","shortMessageHtmlLink":"Create RelativeSortArray0.py"}},{"before":"624c6d39d8948431b18bfeb48781360acfaaa86d","after":"dad4e5dc2197b013cd80f41fd45f8bbef3f5a595","ref":"refs/heads/main","pushedAt":"2024-06-10T20:27:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ZigzagConversion0.py\n\nThe string \"PAYPALISHIRING\" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)\r\n\r\n  P      A     H     N\r\n  A  P  L  S  I   I  G\r\n  Y       I      R\r\n\r\nAnd then read line by line: \"PAHNAPLSIIGYIR\"\r\n\r\nWrite the code that will take a string and make this conversion given a number of rows:\r\n\r\n  string convert(string s, int numRows);\r\n \r\nExample 1:\r\n  Input: s = \"PAYPALISHIRING\", numRows = 3\r\n  Output: \"PAHNAPLSIIGYIR\"\r\n\r\nExample 2:\r\n  Input: s = \"PAYPALISHIRING\", numRows = 4\r\n  Output: \"PINALSIGYAHRPI\"\r\n\r\nExplanation:\r\n  P        I         N\r\n  A    L  S     I  G\r\n  Y A     H R\r\n  P         I\r\n\r\nExample 3:\r\n  Input: s = \"A\", numRows = 1\r\n  Output: \"A\"\r\n\r\nConstraints:\r\n• 1 <= s.length <= 1000\r\n• s consists of English letters (lower-case and upper-case), ',' and '.'.\r\n• 1 <= numRows <= 1000","shortMessageHtmlLink":"Create ZigzagConversion0.py"}},{"before":"dbd736422ad807f72522f890142a22bc7ca677cd","after":"624c6d39d8948431b18bfeb48781360acfaaa86d","ref":"refs/heads/main","pushedAt":"2024-02-08T12:32:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SortCharsByFrequency1.py","shortMessageHtmlLink":"Create SortCharsByFrequency1.py"}},{"before":"2243dcc7a0cbfe60659e87572a9ea37764488975","after":"dbd736422ad807f72522f890142a22bc7ca677cd","ref":"refs/heads/main","pushedAt":"2024-02-08T12:13:16.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Update SortCharsByFrequency0.py\n\nGiven a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.\r\n\r\nReturn the sorted string. If there are multiple answers, return any of them.\r\n\r\nExample 1:\r\n Input: s = \"tree\"\r\n Output: \"eert\"\r\n Explanation: 'e' appears twice while 'r' and 't' both appear once.\r\n So 'e' must appear before both 'r' and 't'. Therefore \"eetr\" is also a valid answer.\r\n\r\nExample 2:\r\n Input: s = \"cccaaa\"\r\n Output: \"aaaccc\"\r\n Explanation: Both 'c' and 'a' appear three times, so both \"cccaaa\" and \"aaaccc\" are valid answers.\r\n Note that \"cacaca\" is incorrect, as the same characters must be together.\r\n\r\nExample 3:\r\n Input: s = \"Aabb\"\r\n Output: \"bbAa\"\r\n Explanation: \"bbaA\" is also a valid answer, but \"Aabb\" is incorrect.\r\n Note that 'A' and 'a' are treated as two different characters.\r\n\r\nConstraints:\r\n• 1 <= s.length <= 5 * 10⁵\r\n• s consists of uppercase and lowercase English letters and digits.","shortMessageHtmlLink":"Update SortCharsByFrequency0.py"}},{"before":"71335045fa063d242191a6dea3267af200940865","after":"2243dcc7a0cbfe60659e87572a9ea37764488975","ref":"refs/heads/main","pushedAt":"2024-02-08T12:12:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SortCharsByFrequency0.py\n\nGiven a string s, sort it in decreasing order based on the frequency of the characters. The frequency of a character is the number of times it appears in the string.\r\n\r\nReturn the sorted string. If there are multiple answers, return any of them.\r\n\r\nExample 1:\r\n Input: s = \"tree\"\r\n Output: \"eert\"\r\n Explanation: 'e' appears twice while 'r' and 't' both appear once.\r\n So 'e' must appear before both 'r' and 't'. Therefore \"eetr\" is also a valid answer.\r\n\r\nExample 2:\r\n Input: s = \"cccaaa\"\r\n Output: \"aaaccc\"\r\n Explanation: Both 'c' and 'a' appear three times, so both \"cccaaa\" and \"aaaccc\" are valid answers.\r\n Note that \"cacaca\" is incorrect, as the same characters must be together.\r\n\r\nExample 3:\r\n Input: s = \"Aabb\"\r\n Output: \"bbAa\"\r\n Explanation: \"bbaA\" is also a valid answer, but \"Aabb\" is incorrect.\r\n Note that 'A' and 'a' are treated as two different characters.\r\n\r\nConstraints:\r\n• 1 <= s.length <= 5 * 105\r\n• s consists of uppercase and lowercase English letters and digits.","shortMessageHtmlLink":"Create SortCharsByFrequency0.py"}},{"before":"904f3a2ee4caf6904154529d22d654d45b152b7f","after":"71335045fa063d242191a6dea3267af200940865","ref":"refs/heads/main","pushedAt":"2024-02-02T11:42:41.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create DivideArrayIntoArraysWithMaxDiff0.py\n\nYou are given an integer array nums of size n and a positive integer k.\r\n\r\nDivide the array into one or more arrays of size 3 satisfying the following conditions:\r\n• Each element of nums should be in exactly one array.\r\n• The difference between any two elements in one array is less than or equal to k.\r\n\r\nReturn a 2D array containing all the arrays. If it is impossible to satisfy the conditions, return an empty array. And if there are multiple answers, return any of them.\r\n\r\nExample 1:\r\n Input: nums = [1,3,4,8,7,9,3,5,1], k = 2\r\n Output: [[1,1,3],[3,4,5],[7,8,9]]\r\n Explanation: We can divide the array into the following arrays: \r\n [1,1,3], [3,4,5] and [7,8,9].\r\n The difference between any two elements in each array is less than or equal to 2.\r\n Note that the order of elements is not important.\r\n\r\nExample 2:\r\n Input: nums = [1,3,3,2,7,3], k = 3\r\n Output: []\r\n Explanation: It is not possible to divide the array satisfying all the conditions.\r\n \r\nConstraints:\r\n• n == nums.length\r\n• 1 <= n <= 10⁵\r\n• n is a multiple of 3.\r\n• 1 <= nums[i] <= 10⁵\r\n• 1 <= k <= 10⁵","shortMessageHtmlLink":"Create DivideArrayIntoArraysWithMaxDiff0.py"}},{"before":"72f4bc4737e2f35c0a2cfaf82c81864ac694a506","after":"904f3a2ee4caf6904154529d22d654d45b152b7f","ref":"refs/heads/main","pushedAt":"2024-01-30T14:52:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Update ImplementQueueFromStacks1.py","shortMessageHtmlLink":"Update ImplementQueueFromStacks1.py"}},{"before":"bc379d9a8a169e9d5942acc2a036487a0bec9e97","after":"72f4bc4737e2f35c0a2cfaf82c81864ac694a506","ref":"refs/heads/main","pushedAt":"2024-01-29T22:55:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ImplementQueueFromStacks1.py","shortMessageHtmlLink":"Create ImplementQueueFromStacks1.py"}},{"before":"31ebaf55534db4b7ba0ef1bee015439a21025086","after":"bc379d9a8a169e9d5942acc2a036487a0bec9e97","ref":"refs/heads/main","pushedAt":"2024-01-29T22:52:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ImplementQueueFromStacks0.py\n\nImplement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).\r\n\r\nImplement the MyQueue class:\r\n\r\n• void push(int x): Pushes element x to the back of the queue.\r\n• int pop(): Removes the element from the front of the queue and returns it.\r\n• int peek(): Returns the element at the front of the queue.\r\n• boolean empty(): Returns true if the queue is empty, false otherwise.\r\n\r\nNotes:\r\n• You must use only standard operations of a stack, which means only push to top, peek/pop from top, size, and is empty operations are valid.\r\n• Depending on your language, the stack may not be supported natively. You may simulate a stack using a list or deque (double-ended queue) as long as you use only a stack's standard operations.\r\n\r\nExample 1:\r\nInput\r\n[\"MyQueue\", \"push\", \"push\", \"peek\", \"pop\", \"empty\"]\r\n[[], [1], [2], [], [], []]\r\nOutput\r\n[null, null, null, 1, 1, false]\r\n\r\nExplanation\r\nMyQueue myQueue = new MyQueue();\r\nmyQueue.push(1); // queue is: [1]\r\nmyQueue.push(2); // queue is: [1, 2] (leftmost is front of the queue)\r\nmyQueue.peek(); // return 1\r\nmyQueue.pop(); // return 1, queue is [2]\r\nmyQueue.empty(); // return false\r\n \r\nConstraints:\r\n• 1 <= x <= 9\r\n• At most 100 calls will be made to push, pop, peek, and empty.\r\n• All the calls to pop and peek are valid.\r\n \r\nFollow-up: Can you implement the queue such that each operation is amortized [https://en.wikipedia.org/wiki/Amortized_analysis] O(1) time complexity? In other words, performing n operations will take overall O(n) time even if one of those operations may take longer.","shortMessageHtmlLink":"Create ImplementQueueFromStacks0.py"}},{"before":"92eccce721311810fdee0a9f2a19a34d5296a52b","after":"31ebaf55534db4b7ba0ef1bee015439a21025086","ref":"refs/heads/main","pushedAt":"2024-01-22T22:45:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SetMismatch2.py","shortMessageHtmlLink":"Create SetMismatch2.py"}},{"before":"de6683796f48c5cc5949275368341838e37ee33f","after":"92eccce721311810fdee0a9f2a19a34d5296a52b","ref":"refs/heads/main","pushedAt":"2024-01-22T22:42:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SetMismatch1.py","shortMessageHtmlLink":"Create SetMismatch1.py"}},{"before":"0cdbd1a5ad22d88ee0594eb1d6f2cf056f231a32","after":"de6683796f48c5cc5949275368341838e37ee33f","ref":"refs/heads/main","pushedAt":"2024-01-22T22:40:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create SetMismatch0.py\n\nYou have a set of integers s, which originally contains all the numbers from 1 to n. Unfortunately, due to some error, one of the numbers in s got duplicated to another number in the set, which results in repetition of one number and loss of another number.\r\n\r\nYou are given an integer array nums representing the data status of this set after the error.\r\n\r\nFind the number that occurs twice and the number that is missing and return them in the form of an array.\r\n\r\nExample 1:\r\nInput: nums = [1,2,2,4]\r\nOutput: [2,3]\r\n\r\nExample 2:\r\nInput: nums = [1,1]\r\nOutput: [1,2]\r\n \r\nConstraints:\r\n• 2 <= nums.length <= 10⁴\r\n• 1 <= nums[i] <= 10⁴","shortMessageHtmlLink":"Create SetMismatch0.py"}},{"before":"b5f3eda817ba15b7f9bd812e6cff99822db96838","after":"0cdbd1a5ad22d88ee0594eb1d6f2cf056f231a32","ref":"refs/heads/main","pushedAt":"2024-01-22T07:04:18.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create DetectCapital2.py","shortMessageHtmlLink":"Create DetectCapital2.py"}},{"before":"bc12d90ff7f7563e00b08bbbf1639c09188d5fda","after":"b5f3eda817ba15b7f9bd812e6cff99822db96838","ref":"refs/heads/main","pushedAt":"2024-01-22T06:56:36.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create DetectCapital1.py","shortMessageHtmlLink":"Create DetectCapital1.py"}},{"before":"e197d1ec6f422effcdceec31c41fc5229ed33956","after":"bc12d90ff7f7563e00b08bbbf1639c09188d5fda","ref":"refs/heads/main","pushedAt":"2024-01-22T06:39:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Rename DetectCapital.py to Problems/0501.-0600./0520._Detect_Capital/DetectCapital0.py\n\nWe define the usage of capitals in a word to be right when one of the following cases holds:\r\n\r\n- All letters in this word are capitals, like \"USA\".\r\n- All letters in this word are not capitals, like \"leetcode\".\r\n- Only the first letter in this word is capital, like \"Google\".\r\nGiven a string word, return true if the usage of capitals in it is right.\r\n\r\nConstraints:\r\n• 1 <= word.length <= 100\r\n• word consists of lowercase and uppercase English letters.","shortMessageHtmlLink":"Rename DetectCapital.py to Problems/0501.-0600./0520._Detect_Capital/…"}},{"before":"6b480a603943c343ca7960cb857dff241877a128","after":"e197d1ec6f422effcdceec31c41fc5229ed33956","ref":"refs/heads/main","pushedAt":"2024-01-19T11:05:35.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ClimbingStairs1.py","shortMessageHtmlLink":"Create ClimbingStairs1.py"}},{"before":"2ae3bef98fd0aa29d651b1627e8f69dcc24fdbe7","after":"6b480a603943c343ca7960cb857dff241877a128","ref":"refs/heads/main","pushedAt":"2024-01-19T10:57:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ClimbingStairs0.py\n\nYou are climbing a staircase. It takes n steps to reach the top.\r\n\r\nEach time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?\r\n\r\nExample 1:\r\nInput: n = 2\r\nOutput: 2\r\nExplanation: There are two ways to climb to the top.\r\n1. 1 step + 1 step\r\n2. 2 steps\r\n\r\nExample 2:\r\nInput: n = 3\r\nOutput: 3\r\nExplanation: There are three ways to climb to the top.\r\n1. 1 step + 1 step + 1 step\r\n2. 1 step + 2 steps\r\n3. 2 steps + 1 step\r\n\r\nConstraints:\r\n• 1 <= n <= 45","shortMessageHtmlLink":"Create ClimbingStairs0.py"}},{"before":"a39733bd97b6f5cd6cca85589f2947d890aa38a8","after":"2ae3bef98fd0aa29d651b1627e8f69dcc24fdbe7","ref":"refs/heads/main","pushedAt":"2024-01-19T10:54:56.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Update and rename MaximumIceCreamBars.py to Problems/1801.-1900./1833._Maximum_Ice_Cream_Bars/MaximumIceCreamBars0.py\n\nIt is a sweltering summer day, and a boy wants to buy some ice cream bars.\r\n\r\nAt the store, there are n ice cream bars. You are given an array costs of length n, where costs[i] is the price of the ith ice cream bar in coins. The boy initially has coins coins to spend, and he wants to buy as many ice cream bars as possible. \r\n\r\nNote: The boy can buy the ice cream bars in any order.\r\n\r\nReturn the maximum number of ice cream bars the boy can buy with coins coins.\r\n\r\nYou must solve the problem by counting sort.\r\n\r\nExample 1:\r\nInput: costs = [1,3,2,4,1], coins = 7\r\nOutput: 4\r\nExplanation: The boy can buy ice cream bars at indices 0,1,2,4 for a total price of 1 + 3 + 2 + 1 = 7.\r\n\r\nExample 2:\r\nInput: costs = [10,6,8,7,7,8], coins = 5\r\nOutput: 0\r\nExplanation: The boy cannot afford any of the ice cream bars.\r\n\r\nExample 3:\r\nInput: costs = [1,6,3,1,2,5], coins = 20\r\nOutput: 6\r\nExplanation: The boy can buy all the ice cream bars for a total price of 1 + 6 + 3 + 1 + 2 + 5 = 18.\r\n\r\nConstraints:\r\n• costs.length == n\r\n• 1 <= n <= 10⁵\r\n• 1 <= costs[i] <= 10⁵\r\n• 1 <= coins <= 10⁸","shortMessageHtmlLink":"Update and rename MaximumIceCreamBars.py to Problems/1801.-1900./1833…"}},{"before":"4423ed0df4156eeb143f0fc348a1067d58ac2e92","after":"a39733bd97b6f5cd6cca85589f2947d890aa38a8","ref":"refs/heads/main","pushedAt":"2024-01-18T11:40:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ReverseInteger3.py","shortMessageHtmlLink":"Create ReverseInteger3.py"}},{"before":"50bae2f7a722f28e720515675c7e6beb8fbce28e","after":"4423ed0df4156eeb143f0fc348a1067d58ac2e92","ref":"refs/heads/main","pushedAt":"2024-01-18T11:33:30.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ReverseInteger2.py","shortMessageHtmlLink":"Create ReverseInteger2.py"}},{"before":"236c4c092e54fffe7d4bc8585614c6583eb6ce34","after":"50bae2f7a722f28e720515675c7e6beb8fbce28e","ref":"refs/heads/main","pushedAt":"2024-01-18T11:13:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create ReverseInteger1.py","shortMessageHtmlLink":"Create ReverseInteger1.py"}},{"before":"709d3498feae4390d9e9e6194350f531ea2e3e1a","after":"236c4c092e54fffe7d4bc8585614c6583eb6ce34","ref":"refs/heads/main","pushedAt":"2024-01-18T11:10:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Update and rename ReverseInteger.py to Problems/0001.-0100./0007._Reverse_Integer/ReverseInteger0.py\n\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 [-2³¹, 2³¹ - 1], then return 0.\r\n\r\nAssume the environment does not allow you to store 64-bit integers (signed or unsigned). \r\n\r\nExample 1:\r\nInput: x = 123\r\nOutput: 321\r\n\r\nExample 2:\r\nInput: x = -123\r\nOutput: -321\r\n\r\nExample 3:\r\nInput: x = 120\r\nOutput: 21 \r\n\r\nConstraints:\r\n• -2³¹ <= x <= 2³¹ - 1","shortMessageHtmlLink":"Update and rename ReverseInteger.py to Problems/0001.-0100./0007._Rev…"}},{"before":"9fdb126db1050aef0b70445eead29f756b82bff4","after":"709d3498feae4390d9e9e6194350f531ea2e3e1a","ref":"refs/heads/main","pushedAt":"2024-01-17T22:17:04.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create UniqueNumberOfOccurences1.py","shortMessageHtmlLink":"Create UniqueNumberOfOccurences1.py"}},{"before":"e0a21355107b54d8c964b9e9c3d9dee7d190045a","after":"9fdb126db1050aef0b70445eead29f756b82bff4","ref":"refs/heads/main","pushedAt":"2024-01-17T22:08:02.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"Chukwudebelu","name":"Chisom Anumba","path":"/Chukwudebelu","primaryAvatarUrl":"https://github.com/avatars/u/32755252?s=80&v=4"},"commit":{"message":"Create UniqueNumberOfOccurences0.py\n\nGiven an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise.\r\n\r\nExample 1:\r\nInput: arr = [1,2,2,1,1,3]\r\nOutput: true\r\nExplanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences.\r\n\r\nExample 2:\r\nInput: arr = [1,2]\r\nOutput: false\r\n\r\nExample 3:\r\nInput: arr = [-3,0,1,-3,1,1,1,-3,10,0]\r\nOutput: true \r\n\r\nConstraints:\r\n• 1 <= arr.length <= 1000\r\n• -1000 <= arr[i] <= 1000","shortMessageHtmlLink":"Create UniqueNumberOfOccurences0.py"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEavk1kwA","startCursor":null,"endCursor":null}},"title":"Activity · Chukwudebelu/LeetCode"}