{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":311154360,"defaultBranch":"master","name":"leetcode","ownerLogin":"YaroslavKlochko","currentUserCanPush":false,"isFork":false,"isEmpty":false,"createdAt":"2020-11-08T21:03:38.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/43871314?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1689738910.0","currentOid":""},"activityList":{"items":[{"before":"09b5732ca979fbe654ecd1468866fea2efa47e1b","after":"1858a911acc9a18c505731364bd3a8eafad71e19","ref":"refs/heads/master","pushedAt":"2023-11-28T00:48:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"189. Rotate Array\n\nGiven an integer array nums, rotate the array to the right by k steps, where k is non-negative.","shortMessageHtmlLink":"189. Rotate Array"}},{"before":"7e66c5c76e85ad907e46e40fcb6c4dcb79bb22dc","after":"09b5732ca979fbe654ecd1468866fea2efa47e1b","ref":"refs/heads/master","pushedAt":"2023-11-27T01:43:05.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"169. Majority Element\n\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.","shortMessageHtmlLink":"169. Majority Element"}},{"before":"356ecc4d9cc1d82c85fe625863592c41a93e8594","after":"7e66c5c76e85ad907e46e40fcb6c4dcb79bb22dc","ref":"refs/heads/master","pushedAt":"2023-11-26T00:16:53.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"80. Remove Duplicates from Sorted Array II\n\nGiven an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same.\n\nSince it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.\n\nReturn k after placing the final result in the first k slots of nums.\n\nDo not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.","shortMessageHtmlLink":"80. Remove Duplicates from Sorted Array II"}},{"before":"ec713fdc61d142413fc898204123b312dd793238","after":"356ecc4d9cc1d82c85fe625863592c41a93e8594","ref":"refs/heads/master","pushedAt":"2023-11-24T00:08:32.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"28. Find the Index of the First Occurrence in a String\n\nGiven two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.","shortMessageHtmlLink":"28. Find the Index of the First Occurrence in a String"}},{"before":"9b87eb26f87a2a4d4ae8de13de8f243fc7a54815","after":"ec713fdc61d142413fc898204123b312dd793238","ref":"refs/heads/master","pushedAt":"2023-11-22T16:11:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"88. Merge Sorted Array\n\nYou are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.\n\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, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.","shortMessageHtmlLink":"88. Merge Sorted Array"}},{"before":"14897aa461796812ed6e82971136adb9e205707e","after":"9b87eb26f87a2a4d4ae8de13de8f243fc7a54815","ref":"refs/heads/master","pushedAt":"2023-11-22T01:25:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"543. Diameter of Binary Tree\n\nGiven the root of a binary tree, return the length of the diameter of the tree.\n\nThe diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root.\n\nThe length of a path between two nodes is represented by the number of edges between them.","shortMessageHtmlLink":"543. Diameter of Binary Tree"}},{"before":"9ce09993d6b4e7edc058461daf68089304a456f6","after":"14897aa461796812ed6e82971136adb9e205707e","ref":"refs/heads/master","pushedAt":"2023-11-20T22:15:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"11. Container With Most Water\n\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.","shortMessageHtmlLink":"11. Container With Most Water"}},{"before":"82e1adad198a70cd1454dd105987667fa1567966","after":"9ce09993d6b4e7edc058461daf68089304a456f6","ref":"refs/heads/master","pushedAt":"2023-10-16T23:31:12.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 65\n\nValid Number\n\nA valid number can be split up into these components (in order):\n\nA decimal number or an integer.\n(Optional) An 'e' or 'E', followed by an integer.\nA decimal number can be split up into these components (in order):\n\n(Optional) A sign character (either '+' or '-').\nOne of the following formats:\nOne or more digits, followed by a dot '.'.\nOne or more digits, followed by a dot '.', followed by one or more digits.\nA dot '.', followed by one or more digits.\nAn integer can be split up into these components (in order):\n\n(Optional) A sign character (either '+' or '-').\nOne or more digits.\nFor example, all the following are valid numbers: [\"2\", \"0089\", \"-0.1\", \"+3.14\", \"4.\", \"-.9\", \"2e10\", \"-90E3\", \"3e+7\", \"+6e-1\", \"53.5e93\", \"-123.456e789\"], while the following are not valid numbers: [\"abc\", \"1a\", \"1e\", \"e3\", \"99e2.5\", \"--6\", \"-+3\", \"95a54e53\"].\n\nGiven a string s, return true if s is a valid number.","shortMessageHtmlLink":"leetcode 65"}},{"before":"90e669ef8c3621efa6cc24add361b6fe2de622c4","after":"82e1adad198a70cd1454dd105987667fa1567966","ref":"refs/heads/master","pushedAt":"2023-08-01T23:40:17.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 2784\n\nCheck if Array is Good\nYou are given an integer array nums. We consider an array good if it is a permutation of an array base[n].\nbase[n] = [1, 2, ..., n - 1, n, n] (in other words, it is an array of length n + 1 which contains 1 to n - 1 exactly once, plus two occurrences of n). For example, base[1] = [1, 1] and base[3] = [1, 2, 3, 3].\nReturn true if the given array is good, otherwise return false.\nNote: A permutation of integers represents an arrangement of these numbers.","shortMessageHtmlLink":"leetcode 2784"}},{"before":"cc667c086cbffabb4740779a4ea186b17e32d264","after":"90e669ef8c3621efa6cc24add361b6fe2de622c4","ref":"refs/heads/master","pushedAt":"2023-08-01T03:32:28.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 1037\n\nValid Boomerang\nGiven an array points where points[i] = [xi, yi] represents a point on the X-Y plane, return true if these points are a boomerang.\nA boomerang is a set of three points that are all distinct and not in a straight line.","shortMessageHtmlLink":"leetcode 1037"}},{"before":"477e5d49e9d5460a31aab159c5228af2d55822fc","after":"cc667c086cbffabb4740779a4ea186b17e32d264","ref":"refs/heads/master","pushedAt":"2023-07-31T02:01:29.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 1189\n\nMaximum Number of Balloons\nGiven a string text, you want to use the characters of text to form as many instances of the word \"balloon\" as possible.\nYou can use each character in text at most once. Return the maximum number of instances that can be formed.","shortMessageHtmlLink":"leetcode 1189"}},{"before":"aa98a8613a5438e2dcb7ef52e37a36157e8977aa","after":"477e5d49e9d5460a31aab159c5228af2d55822fc","ref":"refs/heads/master","pushedAt":"2023-07-30T03:55:09.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 808\n\nSoup Servings\nThere are two types of soup: type A and type B. Initially, we have n ml of each type of soup. There are four kinds of operations:\nServe 100 ml of soup A and 0 ml of soup B,\nServe 75 ml of soup A and 25 ml of soup B,\nServe 50 ml of soup A and 50 ml of soup B, and\nServe 25 ml of soup A and 75 ml of soup B.\nWhen we serve some soup, we give it to someone, and we no longer have it. Each turn, we will choose from the four operations with an equal probability 0.25. If the remaining volume of soup is not enough to complete the operation, we will serve as much as possible. We stop once we no longer have some quantity of both types of soup.\nNote that we do not have an operation where all 100 ml's of soup B are used first.\nReturn the probability that soup A will be empty first, plus half the probability that A and B become empty at the same time. Answers within 10-5 of the actual answer will be accepted.","shortMessageHtmlLink":"leetcode 808"}},{"before":"6adc69d8255d970ffd3fab2c31d7341ffad6886a","after":"aa98a8613a5438e2dcb7ef52e37a36157e8977aa","ref":"refs/heads/master","pushedAt":"2023-07-28T03:23:47.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 896\n\nMonotonic Array\nAn array is monotonic if it is either monotone increasing or monotone decreasing.\nAn array nums is monotone increasing if for all i <= j, nums[i] <= nums[j]. An array nums is monotone decreasing if for all i <= j, nums[i] >= nums[j].\nGiven an integer array nums, return true if the given array is monotonic, or false otherwise.","shortMessageHtmlLink":"leetcode 896"}},{"before":"03497b746962a108e430291e07bd069b06ebf65c","after":"6adc69d8255d970ffd3fab2c31d7341ffad6886a","ref":"refs/heads/master","pushedAt":"2023-07-26T23:56:11.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 872\n\nLeaf-Similar Trees\nConsider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence.\nFor example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).\nTwo binary trees are considered leaf-similar if their leaf value sequence is the same.\nReturn true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.","shortMessageHtmlLink":"leetcode 872"}},{"before":"2c271767548e37b962434b8e74482265b2004c33","after":"03497b746962a108e430291e07bd069b06ebf65c","ref":"refs/heads/master","pushedAt":"2023-07-26T02:25:48.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 1207\n\nUnique Number of Occurrences\nGiven an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise.","shortMessageHtmlLink":"leetcode 1207"}},{"before":"c27508ad7a1f4ac256e6fd0d1a35399f68059370","after":"2c271767548e37b962434b8e74482265b2004c33","ref":"refs/heads/master","pushedAt":"2023-07-24T23:55:19.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 1431\n\nKids With the Greatest Number of Candies\nThere are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandies, denoting the number of extra candies that you have.\nReturn a boolean array result of length n, where result[i] is true if, after giving the ith kid all the extraCandies, they will have the greatest number of candies among all the kids, or false otherwise.\nNote that multiple kids can have the greatest number of candies.","shortMessageHtmlLink":"leetcode 1431"}},{"before":"578264de04766883bd77fa7aa42148253d5959aa","after":"c27508ad7a1f4ac256e6fd0d1a35399f68059370","ref":"refs/heads/master","pushedAt":"2023-07-24T03:23:49.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 1323 Maximum 69 Number\n\nYou are given a positive integer num consisting only of digits 6 and 9.\nReturn the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6).","shortMessageHtmlLink":"leetcode 1323 Maximum 69 Number"}},{"before":"6a9c470668c036a649488c7b207ef35c2190e48d","after":"578264de04766883bd77fa7aa42148253d5959aa","ref":"refs/heads/master","pushedAt":"2023-07-22T17:11:54.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 693 Binary Number with Alternating Bits\n\nGiven a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.","shortMessageHtmlLink":"leetcode 693 Binary Number with Alternating Bits"}},{"before":"d56025fb5fd172a1e922651072601fff9867c7bf","after":"6a9c470668c036a649488c7b207ef35c2190e48d","ref":"refs/heads/master","pushedAt":"2023-07-22T03:57:21.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 2269 Find the K-Beauty of a Number\n\nThe k-beauty of an integer num is defined as the number of substrings of num when it is read as a string that meet the following conditions:\nIt has a length of k.\nIt is a divisor of num.\nGiven integers num and k, return the k-beauty of num.\nNote:\nLeading zeros are allowed.\n0 is not a divisor of any value.\nA substring is a contiguous sequence of characters in a string.","shortMessageHtmlLink":"leetcode 2269 Find the K-Beauty of a Number"}},{"before":"654cece25e0843ec088111af8978275503540d01","after":"d56025fb5fd172a1e922651072601fff9867c7bf","ref":"refs/heads/master","pushedAt":"2023-07-21T02:41:23.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 735 Asteroid Collision\n\nWe are given an array asteroids of integers representing asteroids in a row.\nFor each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed.\nFind out the state of the asteroids after all collisions. If two asteroids meet, the smaller one will explode. If both are the same size, both will explode. Two asteroids moving in the same direction will never meet.","shortMessageHtmlLink":"leetcode 735 Asteroid Collision"}},{"before":"518c2f5f3015829d870fca618bf83fc8904d871e","after":"654cece25e0843ec088111af8978275503540d01","ref":"refs/heads/master","pushedAt":"2023-07-21T02:38:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 735 Asteroid Collision\n\nWe are given an array asteroids of integers representing asteroids in a row.\nFor each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed.\nFind out the state of the asteroids after all collisions. If two asteroids meet, the smaller one will explode. If both are the same size, both will explode. Two asteroids moving in the same direction will never meet.","shortMessageHtmlLink":"leetcode 735 Asteroid Collision"}},{"before":"4098c1414943d28ebafd541639870d8baa3e1ddc","after":"518c2f5f3015829d870fca618bf83fc8904d871e","ref":"refs/heads/master","pushedAt":"2023-07-20T03:42:25.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"Update the list of issues","shortMessageHtmlLink":"Update the list of issues"}},{"before":"010dd3c29a0ed9d62935a73ffc269d16f497d632","after":"4098c1414943d28ebafd541639870d8baa3e1ddc","ref":"refs/heads/master","pushedAt":"2023-07-20T03:35:53.000Z","pushType":"force_push","commitsCount":0,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"Add many leetcode solutions for the previous 6 months\n\nMany leetcode tasks which I have been solving for the last 6 months were added\n\nSigned-off-by: Yaroslav Klochko <yaroklochko@gmail.com>","shortMessageHtmlLink":"Add many leetcode solutions for the previous 6 months"}},{"before":"00daddc11393ee3cb89bfc97834b89e9ba1ec760","after":"010dd3c29a0ed9d62935a73ffc269d16f497d632","ref":"refs/heads/master","pushedAt":"2023-07-20T03:20:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 435 Non-overlapping Intervals\n\nGiven an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.","shortMessageHtmlLink":"leetcode 435 Non-overlapping Intervals"}},{"before":"9d6b42af81e1ebb1d1243aabb3d8758b4a552210","after":"00daddc11393ee3cb89bfc97834b89e9ba1ec760","ref":"refs/heads/master","pushedAt":"2023-07-19T04:00:13.000Z","pushType":"push","commitsCount":3,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"Merge remote-tracking branch 'origin/master'","shortMessageHtmlLink":"Merge remote-tracking branch 'origin/master'"}},{"before":"f63b0cbda3e51c1d971f7919bcffb5076508f161","after":"9d6b42af81e1ebb1d1243aabb3d8758b4a552210","ref":"refs/heads/master","pushedAt":"2023-07-19T03:55:10.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 57","shortMessageHtmlLink":"leetcode 57"}},{"before":"8fc4359c921c2da9266594156136d894ffef008e","after":"f63b0cbda3e51c1d971f7919bcffb5076508f161","ref":"refs/heads/master","pushedAt":"2023-07-18T00:21:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 997\n\nFind the Town Judge\nIn a town, there are n people labeled from 1 to n. There is a rumor that one of these people is secretly the town judge.\nIf the town judge exists, then:\nThe town judge trusts nobody.\nEverybody (except for the town judge) trusts the town judge.\nThere is exactly one person that satisfies properties 1 and 2.\nYou are given an array trust where trust[i] = [ai, bi] representing that the person labeled ai trusts the person labeled bi. If a trust relationship does not exist in trust array, then such a trust relationship does not exist.\nReturn the label of the town judge if the town judge exists and can be identified, or return -1 otherwise.","shortMessageHtmlLink":"leetcode 997"}},{"before":"41b9f70ee561e332f1c1984a31d5e6757e27bdf9","after":"8fc4359c921c2da9266594156136d894ffef008e","ref":"refs/heads/master","pushedAt":"2023-07-17T01:59:42.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 55\n\nJump Game\nYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.\nReturn true if you can reach the last index, or false otherwise.","shortMessageHtmlLink":"leetcode 55"}},{"before":"fd1c0abfeaf15a24867b73333a1026e1d17e30af","after":"41b9f70ee561e332f1c1984a31d5e6757e27bdf9","ref":"refs/heads/master","pushedAt":"2023-07-15T22:41:15.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 933\n\nNumber of Recent Calls\nYou have a RecentCounter class which counts the number of recent requests within a certain time frame.\nImplement the RecentCounter class:\nRecentCounter() Initializes the counter with zero recent requests.\nint ping(int t) Adds a new request at time t, where t represents some time in milliseconds, and returns the number of requests that has happened in the past 3000 milliseconds (including the new request). Specifically, return the number of requests that have happened in the inclusive range [t - 3000, t].\nIt is guaranteed that every call to ping uses a strictly larger value of t than the previous call.","shortMessageHtmlLink":"leetcode 933"}},{"before":"258ca35c855eabb9a5ce2fcff679fa56300570b6","after":"fd1c0abfeaf15a24867b73333a1026e1d17e30af","ref":"refs/heads/master","pushedAt":"2023-07-15T04:01:57.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"YaroslavKlochko","name":"Yaroslav Klochko","path":"/YaroslavKlochko","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/43871314?s=80&v=4"},"commit":{"message":"leetcode 994\n\nRotting Oranges\nYou are given an m x n grid where each cell can have one of three values:\n0 representing an empty cell,\n1 representing a fresh orange, or\n2 representing a rotten orange.\nEvery minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten.\nReturn the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1.","shortMessageHtmlLink":"leetcode 994"}}],"hasNextPage":true,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"Y3Vyc29yOnYyOpK7MjAyMy0xMS0yOFQwMDo0ODo1NC4wMDAwMDBazwAAAAO5S5zJ","startCursor":"Y3Vyc29yOnYyOpK7MjAyMy0xMS0yOFQwMDo0ODo1NC4wMDAwMDBazwAAAAO5S5zJ","endCursor":"Y3Vyc29yOnYyOpK7MjAyMy0wNy0xNVQwNDowMTo1Ny4wMDAwMDBazwAAAANWC1Sz"}},"title":"Activity · YaroslavKlochko/leetcode"}