[ { "path": ".gitignore", "content": "**/.ipynb_checkpoints\n**/__pycache__\n" }, { "path": "LICENSE", "content": "MIT License\n\nCopyright (c) 2022 Huan Xu\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "README.md", "content": "![leetcode-company-wise-problems-2022](https://socialify.git.ci/hxu296/leetcode-company-wise-problems-2022/image?font=Inter&forks=1&issues=1&language=1&owner=1&pulls=1&stargazers=1&theme=Light)\n## Leetcode Company-wise Problem Lists\n\nCurated lists of Leetcode questions group by companies, updated as of May, 2022.\n\nShout out to fishercoder1534 for the awesome [Leetcode](https://github.com/fishercoder1534/Leetcode) repo for solutions.\n\n## Company Index\n1. [APT Portfolio](#apt-portfolio)\n2. [Accenture](#accenture)\n3. [Activision](#activision)\n4. [Adobe](#adobe)\n5. [Affirm](#affirm)\n6. [Airbnb](#airbnb)\n7. [Akamai](#akamai)\n8. [Akuna Capital](#akuna-capital)\n9. [Alation](#alation)\n10. [Alibaba](#alibaba)\n11. [AllinCall](#allincall)\n12. [Amazon](#amazon)\n13. [American Express](#american-express)\n14. [Apple](#apple)\n15. [Arcesium](#arcesium)\n16. [Arista Networks](#arista-networks)\n17. [Asana](#asana)\n18. [Athenahealth](#athenahealth)\n19. [Atlassian](#atlassian)\n20. [Baidu](#baidu)\n21. [Barclays](#barclays)\n22. [BlackRock](#blackrock)\n23. [Bloomberg](#bloomberg)\n24. [Bolt](#bolt)\n25. [Booking](#booking)\n26. [Box](#box)\n27. [ByteDance](#bytedance)\n28. [C3 IoT](#c3-iot)\n29. [Canonical](#canonical)\n30. [Capital One](#capital-one)\n31. [Cashfree](#cashfree)\n32. [Cisco](#cisco)\n33. [Citadel](#citadel)\n34. [Citrix](#citrix)\n35. [Cohesity](#cohesity)\n36. [Commvault](#commvault)\n37. [Coursera](#coursera)\n38. [Cruise Automation](#cruise-automation)\n39. [DE Shaw](#de-shaw)\n40. [DJI](#dji)\n41. [DRW](#drw)\n42. [Databricks](#databricks)\n43. [Dataminr](#dataminr)\n44. [Dell](#dell)\n45. [Deutsche Bank](#deutsche-bank)\n46. [Directi](#directi)\n47. [Docusign](#docusign)\n48. [DoorDash](#doordash)\n49. [Drawbridge](#drawbridge)\n50. [Dropbox](#dropbox)\n51. [Druva](#druva)\n52. [Dunzo](#dunzo)\n53. [Duolingo](#duolingo)\n54. [Epic Systems](#epic-systems)\n55. [Expedia](#expedia)\n56. [FPT](#fpt)\n57. [Facebook](#facebook)\n58. [FactSet](#factset)\n59. [Flipkart](#flipkart)\n60. [Gilt Groupe](#gilt-groupe)\n61. [GoDaddy](#godaddy)\n62. [Goldman Sachs](#goldman-sachs)\n63. [Google](#google)\n64. [Grab](#grab)\n65. [HBO](#hbo)\n66. [HRT](#hrt)\n67. [Honeywell](#honeywell)\n68. [Hotstar](#hotstar)\n69. [Huawei](#huawei)\n70. [Hulu](#hulu)\n71. [IBM](#ibm)\n72. [IIT Bombay](#iit-bombay)\n73. [IMC](#imc)\n74. [IXL](#ixl)\n75. [Indeed](#indeed)\n76. [Info Edge](#info-edge)\n77. [Infosys](#infosys)\n78. [Intel](#intel)\n79. [Intuit](#intuit)\n80. [JPMorgan](#jpmorgan)\n81. [Jane Street](#jane-street)\n82. [Jeavio](#jeavio)\n83. [Karat](#karat)\n84. [Leap Motion](#leap-motion)\n85. [LinkedIn](#linkedin)\n86. [LiveRamp](#liveramp)\n87. [Lyft](#lyft)\n88. [MAQ Software](#maq-software)\n89. [MakeMyTrip](#makemytrip)\n90. [Mathworks](#mathworks)\n91. [Mercari](#mercari)\n92. [Microsoft](#microsoft)\n93. [MindTickle](#mindtickle)\n94. [MindTree](#mindtree)\n95. [Moengage](#moengage)\n96. [Morgan Stanley](#morgan-stanley)\n97. [National Instruments](#national-instruments)\n98. [Netflix](#netflix)\n99. [Netsuite](#netsuite)\n100. [Nuro](#nuro)\n101. [Nutanix](#nutanix)\n102. [Nvidia](#nvidia)\n103. [OT](#ot)\n104. [Opendoor](#opendoor)\n105. [Optum](#optum)\n106. [Oracle](#oracle)\n107. [Palantir Technologies](#palantir-technologies)\n108. [PayTM](#paytm)\n109. [Paypal](#paypal)\n110. [PhonePe](#phonepe)\n111. [Pinterest](#pinterest)\n112. [Pocket Gems](#pocket-gems)\n113. [Postmates](#postmates)\n114. [Pure Storage](#pure-storage)\n115. [Qualcomm](#qualcomm)\n116. [Qualtrics](#qualtrics)\n117. [Quora](#quora)\n118. [Rakuten](#rakuten)\n119. [Reddit](#reddit)\n120. [Redfin](#redfin)\n121. [Riot Games](#riot-games)\n122. [Robinhood](#robinhood)\n123. [Roblox](#roblox)\n124. [Rubrik](#rubrik)\n125. [Rupeek](#rupeek)\n126. [SAP](#sap)\n127. [Salesforce](#salesforce)\n128. [Samsung](#samsung)\n129. [Sapient](#sapient)\n130. [ServiceNow](#servicenow)\n131. [Shopee](#shopee)\n132. [Snapchat](#snapchat)\n133. [Softwire](#softwire)\n134. [Sony](#sony)\n135. [Splunk](#splunk)\n136. [Spotify](#spotify)\n137. [Sprinklr](#sprinklr)\n138. [Square](#square)\n139. [Sumologic](#sumologic)\n140. [Swiggy](#swiggy)\n141. [T System](#t-system)\n142. [TIAA](#tiaa)\n143. [Tencent](#tencent)\n144. [Tesla](#tesla)\n145. [Thumbtack](#thumbtack)\n146. [Tiger Analytics](#tiger-analytics)\n147. [Toptal](#toptal)\n148. [TripleByte](#triplebyte)\n149. [TuSimple](#tusimple)\n150. [Twilio](#twilio)\n151. [Twitch](#twitch)\n152. [Twitter](#twitter)\n153. [Two Sigma](#two-sigma)\n154. [Uber](#uber)\n155. [United Health Group](#united-health-group)\n156. [VMware](#vmware)\n157. [Valve](#valve)\n158. [Virtu Financial](#virtu-financial)\n159. [Visa](#visa)\n160. [Walmart Global Tech](#walmart-global-tech)\n161. [Wayfair](#wayfair)\n162. [Wealthfront](#wealthfront)\n163. [Wish](#wish)\n164. [Works Applications](#works-applications)\n165. [Yahoo](#yahoo)\n166. [Yandex](#yandex)\n167. [Yelp](#yelp)\n168. [ZScaler](#zscaler)\n169. [Zenefits](#zenefits)\n170. [Zillow](#zillow)\n171. [Zoho](#zoho)\n172. [Zomato](#zomato)\n173. [Zoom](#zoom)\n174. [Zopsmart](#zopsmart)\n175. [eBay](#ebay)\n176. [edabit](#edabit)\n177. [instacart](#instacart)\n178. [payu](#payu)\n179. [peak6](#peak6)\n180. [persistent systems](#persistent-systems)\n181. [razorpay](#razorpay)\n182. [tcs](#tcs)\n183. [tiktok](#tiktok)\n184. [zeta suite](#zeta-suite)\n\n\n## APT Portfolio\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Stone Game VI](https://leetcode.com/problems/stone-game-vi/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1686.java) |\n\n## Accenture\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1523.java) |\n| 2 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 2 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_9.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_9.cpp) |\n| 1 | [Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2099.java) |\n\n## Activision\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_712.java) |\n\n## Adobe\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 52 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 19 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 16 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 13 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) |\n| 12 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 12 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_217.java) |\n| 12 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 11 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 11 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 10 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 9 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_11.java) |\n| 9 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 8 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 8 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 8 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n| 8 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 7 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_35.java) |\n| 7 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 7 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 7 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n\n## Affirm\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 10 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 6 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) |\n| 4 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_381.java) |\n| 3 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_242.java) |\n| 2 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_465.java) |\n\n## Airbnb\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 14 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_336.java) |\n| 14 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_269.java) |\n| 9 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_251.java) |\n| 7 | [Smallest Common Region](https://leetcode.com/problems/smallest-common-region/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1257.java) |\n| 6 | [Pour Water](https://leetcode.com/problems/pour-water/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_755.java) |\n| 6 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_76.java) |\n| 5 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_39.java) |\n| 4 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_341.java) |\n| 3 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_622.java) |\n| 3 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_166.java) |\n| 2 | [Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1283.java) |\n| 2 | [Tag Validator](https://leetcode.com/problems/tag-validator/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_591.java) |\n| 2 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_160.java) |\n| 1 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_756.java) |\n| 1 | [Mini Parser](https://leetcode.com/problems/mini-parser/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_385.java) |\n\n## Akamai\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_961.java) |\n\n## Akuna Capital\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 8 | [Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1370.java) |\n\n## Alation\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [H-Index](https://leetcode.com/problems/h-index/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_274.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n\n## Alibaba\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_666.java) |\n| 1 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_555.java) |\n\n## AllinCall\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1725.java) |\n\n## Amazon\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 117 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 117 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 103 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 87 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 68 | [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1268.java) |\n| 56 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 51 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 50 | [Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1152.java) |\n| 49 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 49 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n| 48 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 47 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 45 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 44 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 43 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 41 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 40 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 36 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 36 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 35 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n\n## American Express\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) |\n| 3 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |\n| 2 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## Apple\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 40 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 20 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 19 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 18 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 17 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 16 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 15 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 11 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 11 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 11 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 10 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_139.java) |\n| 10 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 10 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 9 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 8 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) |\n| 8 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 8 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 8 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Arcesium\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1567.java) |\n| 2 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_991.java) |\n| 2 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_209.java) |\n\n## Arista Networks\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 2 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_165.java) |\n| 2 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_93.java) |\n| 1 | [Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2182.java) |\n\n## Asana\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 13 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 5 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n\n## Athenahealth\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n\n## Atlassian\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 18 | [Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) |\n| 10 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) |\n| 4 | [Lemonade Change](https://leetcode.com/problems/lemonade-change/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_860.java) |\n| 3 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) |\n| 2 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1071.java) |\n| 2 | [Single Number](https://leetcode.com/problems/single-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_136.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## Baidu\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_576.java) |\n| 1 | [Zuma Game](https://leetcode.com/problems/zuma-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_488.java) |\n| 1 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_446.java) |\n\n## Barclays\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## BlackRock\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 6 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n\n## Bloomberg\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 64 | [Design Underground System](https://leetcode.com/problems/design-underground-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1396.java) |\n| 33 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 33 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 28 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_430.java) |\n| 26 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) |\n| 23 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 23 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 20 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 20 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 20 | [Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1656.java) |\n| 19 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 16 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 16 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 15 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 14 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) |\n| 14 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1029.java) |\n| 14 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 14 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 13 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 12 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## Bolt\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1941.java) |\n| 3 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) |\n| 3 | [Word Pattern](https://leetcode.com/problems/word-pattern/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_290.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 2 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_291.java) |\n\n## Booking\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1481.java) |\n| 3 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) |\n| 3 | [Additive Number](https://leetcode.com/problems/additive-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_306.java) |\n| 2 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 2 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 1 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2032.java) |\n\n## Box\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 12 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_191.java) |\n| 4 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_126.java) |\n\n## ByteDance\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 6 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 6 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 6 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 5 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 4 | [The Maze](https://leetcode.com/problems/the-maze/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) |\n| 4 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 4 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 4 | [The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1996.java) |\n| 3 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_122.java) |\n| 3 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) |\n| 3 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_39.java) |\n| 3 | [N-Queens](https://leetcode.com/problems/n-queens/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_51.java) |\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 3 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Sort List](https://leetcode.com/problems/sort-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_148.java) |\n| 3 | [Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1774.java) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 3 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_224.java) |\n\n## C3 IoT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) |\n| 3 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_739.java) |\n| 3 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 2 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1636.java) |\n\n## Canonical\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2138.java) |\n\n## Capital One\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 18 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_482.java) |\n| 14 | [Count Primes](https://leetcode.com/problems/count-primes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_204.java) |\n| 13 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_25.java) |\n| 4 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Candy Crush](https://leetcode.com/problems/candy-crush/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_723.java) |\n| 3 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_12.java) |\n| 2 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) |\n| 2 | [Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1743.java) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 1 | [Four Divisors](https://leetcode.com/problems/four-divisors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1390.java) |\n\n## Cashfree\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1695.java) |\n\n## Cisco\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------|\n| 16 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 16 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) |\n| 11 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 11 | [Expressive Words](https://leetcode.com/problems/expressive-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_809.java) |\n| 9 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_91.java) |\n| 8 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_468.java) |\n| 8 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 6 | [House Robber](https://leetcode.com/problems/house-robber/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_198.java) |\n| 6 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2016.java) |\n| 5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 4 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_191.java) |\n| 3 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) |\n| 3 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_526.java) |\n| 3 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) |\n| 2 | [Coin Change 2](https://leetcode.com/problems/coin-change-2/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_518.java) |\n| 2 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_278.java) |\n| 2 | [Maximum Population Year](https://leetcode.com/problems/maximum-population-year/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1854.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n\n## Citadel\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 8 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) |\n| 5 | [Range Addition](https://leetcode.com/problems/range-addition/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_370.java) |\n| 4 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 2 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_867.java) |\n| 2 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_188.java) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n\n## Citrix\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1992.java) |\n\n## Cohesity\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_333.java) |\n\n## Commvault\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2062.java) |\n\n## Coursera\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) |\n| 2 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_44.java) |\n\n## Cruise Automation\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 9 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) |\n| 5 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 3 | [Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1258.java) |\n| 3 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_218.java) |\n| 2 | [Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1352.java) |\n| 2 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) |\n| 2 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 2 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_267.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n\n## DE Shaw\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Freedom Trail](https://leetcode.com/problems/freedom-trail/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_514.java) |\n| 2 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 1 | [Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1358.java) |\n\n## DJI\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1550.java) |\n\n## DRW\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) |\n| 1 | [Counting Elements](https://leetcode.com/problems/counting-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1426.java) |\n\n## Databricks\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 9 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) |\n| 2 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_311.java) |\n| 2 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n\n## Dataminr\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## Dell\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Deutsche Bank\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2039.java) |\n| 1 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1827.java) |\n\n## Directi\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1535.java) |\n\n## Docusign\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1804.java) |\n| 2 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_836.java) |\n| 2 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## DoorDash\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 18 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 13 | [Buddy Strings](https://leetcode.com/problems/buddy-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_859.java) |\n| 11 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_286.java) |\n| 7 | [Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1347.java) |\n| 7 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 7 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 6 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_224.java) |\n| 5 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_317.java) |\n| 5 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1143.java) |\n| 5 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 4 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 4 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) |\n| 4 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_588.java) |\n| 4 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) |\n| 3 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_437.java) |\n| 3 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) |\n| 3 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) |\n| 3 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1779.java) |\n| 2 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_532.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n\n## Drawbridge\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_757.java) |\n\n## Dropbox\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 6 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_609.java) |\n| 5 | [Game of Life](https://leetcode.com/problems/game-of-life/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_289.java) |\n| 2 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_695.java) |\n| 2 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_379.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 1 | [Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1845.java) |\n\n## Druva\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1005.java) |\n\n## Dunzo\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1561.java) |\n| 2 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_363.java) |\n| 1 | [Stone Game VII](https://leetcode.com/problems/stone-game-vii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1690.java) |\n| 1 | [Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/) | Medium | [Javascript](./javascript/_1664.js) |\n\n## Duolingo\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1733.java) |\n\n## Epic Systems\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 2 | [Additive Number](https://leetcode.com/problems/additive-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_306.java) |\n| 1 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_728.java) |\n\n## Expedia\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 14 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) |\n| 14 | [Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1487.java) |\n| 8 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 7 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 7 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_70.java) |\n| 6 | [The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1492.java) |\n| 6 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 5 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 5 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 4 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_296.java) |\n| 4 | [Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1481.java) |\n| 3 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 3 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2016.java) |\n| 2 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 2 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1805.java) |\n| 2 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_647.java) |\n| 2 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 1 | [Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1451.java) |\n\n## FPT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2177.java) |\n\n## Facebook\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 282 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1249.java) |\n| 252 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_680.java) |\n| 188 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_314.java) |\n| 180 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) |\n| 162 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_50.java) |\n| 156 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) |\n| 149 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_938.java) |\n| 141 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 140 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 140 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_215.java) |\n| 127 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n| 121 | [Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1570.java) |\n| 118 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 114 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_408.java) |\n| 112 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_71.java) |\n| 110 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 108 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_199.java) |\n| 100 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_921.java) |\n| 100 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_339.java) |\n| 97 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) |\n\n## FactSet\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n\n## Flipkart\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 7 | [Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1700.java) |\n| 4 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) |\n| 3 | [Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1561.java) |\n| 3 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) |\n| 2 | [Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1574.java) |\n| 2 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_646.java) |\n\n## Gilt Groupe\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_623.java) |\n\n## GoDaddy\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_419.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n\n## Goldman Sachs\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 38 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 20 | [Height Checker](https://leetcode.com/problems/height-checker/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1051.java) |\n| 18 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 12 | [High Five](https://leetcode.com/problems/high-five/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1086.java) |\n| 11 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 11 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_740.java) |\n| 9 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) |\n| 7 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 7 | [Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1395.java) |\n| 6 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 6 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 5 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_592.java) |\n| 4 | [Elimination Game](https://leetcode.com/problems/elimination-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_390.java) |\n| 4 | [Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1823.java) |\n| 4 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 4 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 4 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 4 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 3 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_64.java) |\n\n## Google\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 75 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_366.java) |\n| 73 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_150.java) |\n| 44 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 36 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | Easy | [Javascript](./javascript/_1146.js) |\n| 30 | [Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2034.java) |\n| 30 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_539.java) |\n| 28 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 27 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 24 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 22 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 22 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_202.java) |\n| 22 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) |\n| 21 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 19 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_278.java) |\n| 19 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 17 | [Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1423.java) |\n| 15 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_62.java) |\n| 15 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_792.java) |\n| 15 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 14 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_552.java) |\n\n## Grab\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1375.java) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 2 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) |\n| 2 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1342.java) |\n| 2 | [Brick Wall](https://leetcode.com/problems/brick-wall/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_554.java) |\n| 2 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n| 1 | [Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2086.java) |\n\n## HBO\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_820.java) |\n| 2 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_480.java) |\n\n## HRT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:--------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 7 | [Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1775.java) |\n| 3 | [24 Game](https://leetcode.com/problems/24-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_679.java) |\n| 3 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Binary Search | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) |\n| 1 | [Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1566.java) |\n| 1 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1323.java) |\n| 1 | [Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1317.java) |\n\n## Honeywell\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1848.java) |\n\n## Hotstar\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 2 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_841.java) |\n| 2 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_373.java) |\n\n## Huawei\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:--------------------------------------------------------------------------------------------------------------------|\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n\n## Hulu\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_440.java) |\n\n## IBM\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) |\n| 8 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 6 | [Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1560.java) |\n| 6 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) |\n| 4 | [Water Bottles](https://leetcode.com/problems/water-bottles/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1518.java) |\n| 3 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 3 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n\n## IIT Bombay\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_861.java) |\n\n## IMC\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2201.java) |\n\n## IXL\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) |\n| 1 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_634.java) |\n\n## Indeed\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 25 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 9 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 8 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) |\n| 6 | [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1160.java) |\n| 4 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 3 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 2 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_88.java) |\n| 1 | [Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_985.java) |\n| 1 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_563.java) |\n\n## Info Edge\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2058.java) |\n\n## Infosys\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_152.java) |\n| 2 | [Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1356.java) |\n| 2 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_856.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [4 Sum](https://leetcode.com/problems/4sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_18.java) |\n| 2 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## Intel\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 3 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_344.java) |\n| 2 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n\n## Intuit\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 6 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_929.java) |\n| 4 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) |\n| 3 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_881.java) |\n| 2 | [Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1110.java) |\n| 2 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 2 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 2 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_234.java) |\n| 2 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_206.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## JPMorgan\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 69 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_423.java) |\n| 8 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 5 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 3 | [Even Odd Tree](https://leetcode.com/problems/even-odd-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1609.java) |\n| 3 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1710.java) |\n| 2 | [Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1413.java) |\n| 2 | [Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1353.java) |\n| 2 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1200.java) |\n| 2 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_349.java) |\n| 2 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_338.java) |\n| 2 | [Paint Fence](https://leetcode.com/problems/paint-fence/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_276.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 1 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1812.java) |\n\n## Jane Street\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2085.java) |\n\n## Jeavio\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2027.java) |\n\n## Karat\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 40 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 17 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 16 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 16 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) |\n| 12 | [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1160.java) |\n| 10 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 4 | [Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2133.java) |\n| 4 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 4 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) |\n| 3 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 2 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1143.java) |\n\n## Leap Motion\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_478.java) |\n\n## LinkedIn\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 71 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_244.java) |\n| 48 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_364.java) |\n| 43 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 34 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_339.java) |\n| 33 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 33 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 29 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_152.java) |\n| 26 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_272.java) |\n| 21 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_605.java) |\n| 18 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 18 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 18 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_235.java) |\n| 17 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 17 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_432.java) |\n| 16 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 15 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 14 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_215.java) |\n| 13 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_366.java) |\n| 11 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_243.java) |\n| 11 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_671.java) |\n\n## LiveRamp\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |\n| 3 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 1 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_594.java) |\n| 1 | [Distribute Candies](https://leetcode.com/problems/distribute-candies/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_575.java) |\n\n## Lyft\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 9 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_76.java) |\n| 8 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_158.java) |\n| 7 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_981.java) |\n| 7 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_91.java) |\n| 4 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 4 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_365.java) |\n| 4 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_304.java) |\n| 4 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 2 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 2 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_157.java) |\n\n## MAQ Software\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_467.java) |\n\n## MakeMyTrip\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1904.java) |\n| 2 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_402.java) |\n\n## Mathworks\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Coin Change](https://leetcode.com/problems/coin-change/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_322.java) |\n| 5 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_166.java) |\n| 3 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 3 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 3 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_115.java) |\n| 2 | [Keyboard Row](https://leetcode.com/problems/keyboard-row/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_500.java) |\n\n## Mercari\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1598.java) |\n| 1 | [Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1432.java) |\n| 1 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1403.java) |\n| 1 | [Count Largest Group](https://leetcode.com/problems/count-largest-group/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1399.java) |\n\n## Microsoft\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 52 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 45 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1822.java) |\n| 42 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 39 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 34 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_151.java) |\n| 29 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 29 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 26 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 24 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 22 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 22 | [Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1304.java) |\n| 20 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 20 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 20 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 18 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 17 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 17 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 17 | [Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1386.java) |\n| 16 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n| 16 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_8.java) |\n\n## MindTickle\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_895.java) |\n\n## MindTree\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2180.java) |\n\n## Moengage\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1897.java) |\n\n## Morgan Stanley\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 1 | [Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1626.java) |\n\n## National Instruments\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n\n## Netflix\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) |\n| 3 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) |\n| 2 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## Netsuite\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1491.java) |\n\n## Nuro\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1476.java) |\n\n## Nutanix\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_165.java) |\n| 2 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) |\n| 1 | [Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1003.java) |\n\n## Nvidia\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1046.java) |\n| 4 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 4 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | Hard | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_10.js) |\n| 3 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_622.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 3 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_160.java) |\n| 3 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_188.java) |\n| 3 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_531.java) |\n| 2 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 2 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_211.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 2 | [Missing Number](https://leetcode.com/problems/missing-number/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_268.java) |\n| 2 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_683.java) |\n| 2 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_74.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 2 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_540.java) |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n\n## OT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------|\n| 1 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |\n\n## Opendoor\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 10 | [Game of Life](https://leetcode.com/problems/game-of-life/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_289.java) |\n| 3 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_631.java) |\n\n## Optum\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2000.java) |\n\n## Oracle\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 13 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 13 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 9 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 7 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 7 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 7 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) |\n| 6 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 6 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 6 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 5 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 5 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 4 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_450.java) |\n| 4 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_102.java) |\n| 4 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 4 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 4 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 4 | [Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_415.java) |\n| 4 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 4 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 4 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n\n## Palantir Technologies\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_393.java) |\n| 1 | [Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1232.java) |\n\n## PayTM\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1103.java) |\n| 2 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n\n## Paypal\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_202.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 3 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1190.java) |\n| 2 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_977.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_6.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n\n## PhonePe\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_979.java) |\n| 1 | [Simple Bank System](https://leetcode.com/problems/simple-bank-system/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2043.java) |\n\n## Pinterest\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/) | Hard | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2050.java) |\n| 3 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_277.java) |\n| 2 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_721.java) |\n| 2 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_323.java) |\n| 2 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_291.java) |\n| 2 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_269.java) |\n| 2 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_133.java) |\n\n## Pocket Gems\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_600.java) |\n\n## Postmates\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Print Words Vertically](https://leetcode.com/problems/print-words-vertically/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1324.java) |\n| 1 | [Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1657.java) |\n\n## Pure Storage\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1668.java) |\n| 2 | [Valid Square](https://leetcode.com/problems/valid-square/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) |\n\n## Qualcomm\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_190.java) |\n| 2 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_876.java) |\n| 2 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_287.java) |\n\n## Qualtrics\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 7 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_139.java) |\n| 6 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 5 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 4 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_695.java) |\n| 4 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_199.java) |\n| 4 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) |\n| 4 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 3 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 2 | [Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1387.java) |\n| 2 | [Fixed Point](https://leetcode.com/problems/fixed-point/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1055.java) |\n| 2 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_228.java) |\n| 2 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) |\n| 2 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) |\n\n## Quora\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1354.java) |\n| 3 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 3 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 2 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 1 | [Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2080.java) |\n| 1 | [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1935.java) |\n| 1 | [Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1876.java) |\n\n## Rakuten\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1862.java) |\n\n## Reddit\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 3 | [Subsets](https://leetcode.com/problems/subsets/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_78.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 3 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_40.java) |\n\n## Redfin\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 3 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_8.java) |\n\n## Riot Games\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_495.java) |\n\n## Robinhood\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 8 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 7 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Insert Intervals](https://leetcode.com/problems/insert-interval/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_57.java) |\n| 1 | [Count Good Meals](https://leetcode.com/problems/count-good-meals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1711.java) |\n\n## Roblox\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:--------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Design Browser History](https://leetcode.com/problems/design-browser-history/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1472.java) |\n| 5 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 4 | [Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1289.java) |\n| 2 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_792.java) |\n| 2 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Binary Search | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) |\n\n## Rubrik\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | Easy | [Javascript](./javascript/_1146.js) |\n| 4 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_668.java) |\n| 4 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_621.java) |\n| 2 | [Majority Element](https://leetcode.com/problems/majority-element/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_169.java) |\n| 2 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_157.java) |\n| 2 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_72.java) |\n| 2 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) |\n\n## Rupeek\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1545.java) |\n\n## SAP\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 9 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_738.java) |\n| 4 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 2 | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_957.java) |\n| 2 | [Count Primes](https://leetcode.com/problems/count-primes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_204.java) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 1 | [Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1349.java) |\n\n## Salesforce\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 19 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 10 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 7 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_628.java) |\n| 6 | [Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_179.java) |\n| 6 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 6 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 6 | [Zuma Game](https://leetcode.com/problems/zuma-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_488.java) |\n| 5 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_881.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 3 | [Min Stack](https://leetcode.com/problems/min-stack/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_155.java) |\n| 3 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n| 3 | [Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1718.java) |\n| 3 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 3 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_588.java) |\n| 3 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_706.java) |\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1200.java) |\n\n## Samsung\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_304.java) |\n| 2 | [Reorder List](https://leetcode.com/problems/reorder-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_143.java) |\n| 2 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 1 | [Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1464.java) |\n\n## Sapient\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n\n## ServiceNow\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_102.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 2 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) |\n| 2 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_836.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 2 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_234.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## Shopee\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 4 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_88.java) |\n| 4 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 3 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_336.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_106.java) |\n| 3 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Snapchat\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:--------------|:------------------------------------------------------------------------------------------------------------------------------|\n| 7 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 5 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 5 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_311.java) |\n| 5 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 5 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 4 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Binary Search | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) |\n| 4 | [Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_208.java) |\n| 4 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 3 | [Add Binary](https://leetcode.com/problems/add-binary/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_67.java) |\n| 3 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 3 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 3 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Word Break II](https://leetcode.com/problems/word-break-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_140.java) |\n| 3 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_126.java) |\n| 3 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1091.java) |\n| 3 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_351.java) |\n| 3 | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_974.java) |\n| 3 | [LFU Cache](https://leetcode.com/problems/lfu-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_460.java) |\n| 3 | [The Maze](https://leetcode.com/problems/the-maze/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) |\n\n## Softwire\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1796.java) |\n\n## Sony\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------|\n| 2 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |\n\n## Splunk\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n\n## Spotify\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 16 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_346.java) |\n| 13 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 10 | [Ransom Note](https://leetcode.com/problems/ransom-note/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_383.java) |\n| 10 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 8 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_242.java) |\n| 8 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 6 | [Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1152.java) |\n| 4 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_480.java) |\n| 4 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_141.java) |\n| 4 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_110.java) |\n| 4 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_104.java) |\n| 3 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) |\n| 2 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) |\n\n## Sprinklr\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_149.java) |\n| 2 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 1 | [Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2048.java) |\n| 1 | [Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1746.java) |\n\n## Square\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 2 | [Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) |\n| 2 | [Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_999.java) |\n| 2 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_804.java) |\n| 2 | [The Maze](https://leetcode.com/problems/the-maze/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 2 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_64.java) |\n| 1 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_573.java) |\n\n## Sumologic\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) |\n| 2 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) |\n| 2 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n| 2 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n\n## Swiggy\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_11.java) |\n| 3 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 2 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_781.java) |\n\n## T System\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Grid Game](https://leetcode.com/problems/grid-game/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2017.java) |\n\n## TIAA\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1979.java) |\n\n## Tencent\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_625.java) |\n\n## Tesla\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_976.java) |\n| 3 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1758.java) |\n| 2 | [Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1275.java) |\n| 2 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_885.java) |\n| 2 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 2 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) |\n| 2 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 2 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## Thumbtack\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_966.java) |\n\n## Tiger Analytics\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2239.java) |\n\n## Toptal\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1694.java) |\n\n## TripleByte\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_712.java) |\n\n## TuSimple\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_145.java) |\n| 2 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Twilio\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 7 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 5 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_974.java) |\n| 3 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1636.java) |\n| 2 | [Knight Dialer](https://leetcode.com/problems/knight-dialer/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_935.java) |\n| 2 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n\n## Twitch\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 7 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_419.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n\n## Twitter\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------|\n| 23 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 10 | [Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1817.java) |\n| 7 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) |\n| 6 | [Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1348.java) |\n| 6 | [Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_208.java) |\n| 5 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 5 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_635.java) |\n| 4 | [Paint House](https://leetcode.com/problems/paint-house/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_256.java) |\n| 4 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) |\n| 3 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 3 | [Subsets](https://leetcode.com/problems/subsets/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_78.java) |\n| 3 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_341.java) |\n| 3 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_358.java) |\n| 3 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 3 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_721.java) |\n| 2 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 2 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_642.java) |\n| 2 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_647.java) |\n| 2 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_895.java) |\n\n## Two Sigma\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1339.java) |\n| 4 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_43.java) |\n| 2 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) |\n\n## Uber\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 36 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 17 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 17 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) |\n| 14 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n| 14 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 14 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1438.java) |\n| 13 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 12 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_174.java) |\n| 11 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 11 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_230.java) |\n| 10 | [Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1428.java) |\n| 10 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) |\n| 9 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 8 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 8 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_465.java) |\n| 7 | [Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1400.java) |\n| 7 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 7 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 7 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 7 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |\n\n## United Health Group\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:---------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1437.java) |\n| 1 | [Day of the Week](https://leetcode.com/problems/day-of-the-week/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1185.java) |\n\n## VMware\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 5 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 5 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 4 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 4 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 4 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 4 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_255.java) |\n| 4 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_994.java) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 3 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 3 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 2 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_26.java) |\n| 2 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) |\n| 2 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_35.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 2 | [Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1451.java) |\n| 2 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) |\n\n## Valve\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_649.java) |\n\n## Virtu Financial\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Hexspeak](https://leetcode.com/problems/hexspeak/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1271.java) |\n| 2 | [Array Transformation](https://leetcode.com/problems/array-transformation/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1243.java) |\n| 2 | [How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1196.java) |\n| 2 | [Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1180.java) |\n| 1 | [Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1758.java) |\n\n## Visa\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 11 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1046.java) |\n| 6 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n| 4 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 4 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 4 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) |\n| 3 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 3 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 3 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_141.java) |\n| 3 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 2 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_151.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) |\n| 2 | [Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_179.java) |\n| 1 | [Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1389.java) |\n\n## Walmart Global Tech\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 9 | [Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2038.java) |\n| 7 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 5 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 5 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 5 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 4 | [Strange Printer](https://leetcode.com/problems/strange-printer/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_664.java) |\n| 4 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_122.java) |\n| 4 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 3 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_19.java) |\n| 3 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 3 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) |\n| 3 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_706.java) |\n| 3 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 2 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Wayfair\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 20 | [Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_415.java) |\n| 9 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 7 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) |\n| 5 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 4 | [The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1904.java) |\n| 4 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 2 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_769.java) |\n| 2 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) |\n| 1 | [Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2139.java) |\n| 1 | [Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1957.java) |\n\n## Wealthfront\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2186.java) |\n\n## Wish\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Find Right Interval](https://leetcode.com/problems/find-right-interval/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_436.java) |\n\n## Works Applications\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_629.java) |\n\n## Yahoo\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 6 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 5 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_93.java) |\n| 5 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 4 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 4 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 4 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) |\n| 4 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 4 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_350.java) |\n| 3 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_438.java) |\n| 3 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_70.java) |\n| 3 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_50.java) |\n| 3 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 3 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_617.java) |\n| 3 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_678.java) |\n| 2 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_29.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_161.java) |\n| 2 | [4 Sum](https://leetcode.com/problems/4sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_18.java) |\n| 2 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_9.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_9.cpp) |\n\n## Yandex\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:---------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_849.java) |\n| 6 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 6 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_281.java) |\n| 6 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_228.java) |\n| 4 | [Permutation in String](https://leetcode.com/problems/permutation-in-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_567.java) |\n| 4 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 3 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 3 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 3 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_206.java) |\n| 3 | [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1493.java) |\n| 3 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_392.java) |\n| 3 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 3 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 3 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_933.java) |\n| 2 | [Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1450.java) |\n| 2 | [Line Reflection](https://leetcode.com/problems/line-reflection/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_356.java) |\n| 2 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_150.java) |\n| 2 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) |\n| 2 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) |\n| 2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n\n## Yelp\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Destination City](https://leetcode.com/problems/destination-city/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1436.java) |\n| 4 | [Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1333.java) |\n| 1 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_599.java) |\n\n## ZScaler\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Day of the Year](https://leetcode.com/problems/day-of-the-year/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1154.java) |\n\n## Zenefits\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_255.java) |\n| 1 | [N-Queens II](https://leetcode.com/problems/n-queens-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_52.java) |\n\n## Zillow\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 2 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Zoho\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_532.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 1 | [Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2164.java) |\n\n## Zomato\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Zoom\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Rotate String](https://leetcode.com/problems/rotate-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_796.java) |\n| 3 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_509.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_25.java) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Zopsmart\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2074.java) |\n\n## eBay\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_767.java) |\n| 2 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) |\n| 2 | [Candy Crush](https://leetcode.com/problems/candy-crush/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_723.java) |\n| 2 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_328.java) |\n| 2 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_232.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 2 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## edabit\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1716.java) |\n\n## instacart\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 2 | [Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2133.java) |\n\n## payu\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) |\n| 1 | [Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2169.java) |\n\n## peak6\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1620.java) |\n\n## persistent systems\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2220.java) |\n\n## razorpay\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2054.java) |\n\n## tcs\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 3 | [Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_344.java) |\n| 2 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_217.java) |\n| 2 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_189.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 1 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1800.java) |\n| 1 | [Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1745.java) |\n\n## tiktok\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 13 | [Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1381.java) |\n| 10 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) |\n| 8 | [Maximum Swap](https://leetcode.com/problems/maximum-swap/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_670.java) |\n| 7 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_207.java) |\n| 6 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 6 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_410.java) |\n| 6 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 6 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_59.java) |\n| 6 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 5 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) |\n| 5 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 5 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 5 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 5 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_286.java) |\n| 5 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 4 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_437.java) |\n| 4 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 4 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_222.java) |\n| 4 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n| 4 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## zeta suite\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2176.java) |" }, { "path": "companies/APT Portfolio.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/stone-game-vi/,Stone Game VI,1\n" }, { "path": "companies/Accenture.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/,Find Subsequence of Length K With the Largest Sum,1\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,2\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/Activision.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Minimum ASCII Delete Sum for Two Strings,2\n" }, { "path": "companies/Adobe.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/concatenation-of-array/,Concatenation of Array,2\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,3\nhttps://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/,Determine Whether Matrix Can Be Obtained By Rotation,2\nhttps://leetcode.com/problems/sum-of-all-subset-xor-totals/,Sum of All Subset XOR Totals,2\nhttps://leetcode.com/problems/sorting-the-sentence/,Sorting the Sentence,2\nhttps://leetcode.com/problems/replace-all-digits-with-characters/,Replace All Digits with Characters,2\nhttps://leetcode.com/problems/count-items-matching-a-rule/,Count Items Matching a Rule,3\nhttps://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/,Maximum Absolute Sum of Any Subarray,2\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,2\nhttps://leetcode.com/problems/count-of-matches-in-tournament/,Count of Matches in Tournament,2\nhttps://leetcode.com/problems/richest-customer-wealth/,Richest Customer Wealth,2\nhttps://leetcode.com/problems/smallest-string-with-a-given-numeric-value/,Smallest String With A Given Numeric Value,2\nhttps://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/,Maximum Number of Achievable Transfer Requests,2\nhttps://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Sum of All Odd Length Subarrays,3\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maximum Length of Subarray With Positive Product,2\nhttps://leetcode.com/problems/make-the-string-great/,Make The String Great,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,2\nhttps://leetcode.com/problems/number-of-good-pairs/,Number of Good Pairs,2\nhttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Maximum Points You Can Obtain from Cards,2\nhttps://leetcode.com/problems/circle-and-rectangle-overlapping/,Circle and Rectangle Overlapping,2\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Number of Substrings Containing All Three Characters,2\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,2\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,2\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,2\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,5\nhttps://leetcode.com/problems/maximum-number-of-balloons/,Maximum Number of Balloons,2\nhttps://leetcode.com/problems/number-of-equivalent-domino-pairs/,Number of Equivalent Domino Pairs,2\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,2\nhttps://leetcode.com/problems/partition-array-for-maximum-sum/,Partition Array for Maximum Sum,3\nhttps://leetcode.com/problems/complement-of-base-10-integer/,Complement of Base 10 Integer,4\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,2\nhttps://leetcode.com/problems/reveal-cards-in-increasing-order/,Reveal Cards In Increasing Order,2\nhttps://leetcode.com/problems/3sum-with-multiplicity/,3Sum With Multiplicity,2\nhttps://leetcode.com/problems/smallest-range-i/,Smallest Range I,1\nhttps://leetcode.com/problems/online-stock-span/,Online Stock Span,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,4\nhttps://leetcode.com/problems/champagne-tower/,Champagne Tower,2\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,2\nhttps://leetcode.com/problems/k-th-symbol-in-grammar/,K-th Symbol in Grammar,2\nhttps://leetcode.com/problems/jewels-and-stones/,Jewels and Stones,2\nhttps://leetcode.com/problems/min-cost-climbing-stairs/,Min Cost Climbing Stairs,4\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,2\nhttps://leetcode.com/problems/binary-search/,Binary Search,3\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,4\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,2\nhttps://leetcode.com/problems/set-mismatch/,Set Mismatch,3\nhttps://leetcode.com/problems/array-nesting/,Array Nesting,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,2\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,2\nhttps://leetcode.com/problems/reverse-string-ii/,Reverse String II,3\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,4\nhttps://leetcode.com/problems/perfect-number/,Perfect Number,2\nhttps://leetcode.com/problems/target-sum/,Target Sum,2\nhttps://leetcode.com/problems/total-hamming-distance/,Total Hamming Distance,2\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,2\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,2\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,2\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,4\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,3\nhttps://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/,Maximum XOR of Two Numbers in an Array,2\nhttps://leetcode.com/problems/sum-of-left-leaves/,Sum of Left Leaves,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,2\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,3\nhttps://leetcode.com/problems/decode-string/,Decode String,3\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,2\nhttps://leetcode.com/problems/elimination-game/,Elimination Game,2\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,2\nhttps://leetcode.com/problems/guess-number-higher-or-lower/,Guess Number Higher or Lower,4\nhttps://leetcode.com/problems/super-pow/,Super Pow,2\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,3\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,5\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,2\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,3\nhttps://leetcode.com/problems/reverse-string/,Reverse String,5\nhttps://leetcode.com/problems/house-robber-iii/,House Robber III,3\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,4\nhttps://leetcode.com/problems/wiggle-sort-ii/,Wiggle Sort II,2\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,2\nhttps://leetcode.com/problems/nim-game/,Nim Game,3\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,2\nhttps://leetcode.com/problems/game-of-life/,Game of Life,4\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,2\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,4\nhttps://leetcode.com/problems/missing-number/,Missing Number,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,4\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,7\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,2\nhttps://leetcode.com/problems/majority-element-ii/,Majority Element II,2\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,2\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,3\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,12\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,5\nhttps://leetcode.com/problems/count-primes/,Count Primes,2\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,2\nhttps://leetcode.com/problems/happy-number/,Happy Number,4\nhttps://leetcode.com/problems/bitwise-and-of-numbers-range/,Bitwise AND of Numbers Range,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/house-robber/,House Robber,4\nhttps://leetcode.com/problems/largest-number/,Largest Number,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,5\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,5\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,3\nhttps://leetcode.com/problems/min-stack/,Min Stack,2\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,3\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,4\nhttps://leetcode.com/problems/binary-tree-preorder-traversal/,Binary Tree Preorder Traversal,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,3\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,4\nhttps://leetcode.com/problems/word-break/,Word Break,3\nhttps://leetcode.com/problems/single-number/,Single Number,4\nhttps://leetcode.com/problems/gas-station/,Gas Station,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,3\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,4\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,3\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,8\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,2\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,2\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,2\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,2\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,2\nhttps://leetcode.com/problems/partition-list/,Partition List,2\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,3\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/,Remove Duplicates from Sorted Array II,3\nhttps://leetcode.com/problems/subsets/,Subsets,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,3\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,3\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,3\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),4\nhttps://leetcode.com/problems/add-binary/,Add Binary,2\nhttps://leetcode.com/problems/plus-one/,Plus One,2\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,4\nhttps://leetcode.com/problems/permutation-sequence/,Permutation Sequence,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,8\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,12\nhttps://leetcode.com/problems/n-queens/,N-Queens,3\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,4\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,5\nhttps://leetcode.com/problems/permutations/,Permutations,3\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,2\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,7\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,8\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,3\nhttps://leetcode.com/problems/count-and-say/,Count and Say,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,3\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,7\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,7\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,2\nhttps://leetcode.com/problems/remove-element/,Remove Element,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,7\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,4\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,4\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,11\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,8\nhttps://leetcode.com/problems/4sum/,4 Sum,3\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,4\nhttps://leetcode.com/problems/3sum/,3Sum,9\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,11\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,16\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,2\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,9\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,5\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),4\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,13\nhttps://leetcode.com/problems/zigzag-conversion/,ZigZag Conversion,4\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,12\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,19\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,6\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,10\nhttps://leetcode.com/problems/two-sum/,Two Sum,52\n" }, { "path": "companies/Affirm.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,2\nhttps://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Insert Delete GetRandom O(1) - Duplicates allowed,3\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),10\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,6\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,4\n" }, { "path": "companies/Airbnb.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/,Find the Smallest Divisor Given a Threshold,2\nhttps://leetcode.com/problems/smallest-common-region/,Smallest Common Region,7\nhttps://leetcode.com/problems/pyramid-transition-matrix/,Pyramid Transition Matrix,1\nhttps://leetcode.com/problems/pour-water/,Pour Water,6\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,3\nhttps://leetcode.com/problems/tag-validator/,Tag Validator,2\nhttps://leetcode.com/problems/mini-parser/,Mini Parser,1\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,4\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,14\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,14\nhttps://leetcode.com/problems/flatten-2d-vector/,Flatten 2D Vector,9\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,3\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,6\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,5\n" }, { "path": "companies/Akamai.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/n-repeated-element-in-size-2n-array/,N-Repeated Element in Size 2N Array,1\n" }, { "path": "companies/Akuna Capital.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/increasing-decreasing-string/,Increasing Decreasing String,8\n" }, { "path": "companies/Alation.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/h-index/,H-Index,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\n" }, { "path": "companies/Alibaba.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/path-sum-iv/,Path Sum IV,1\nhttps://leetcode.com/problems/split-concatenated-strings/,Split Concatenated Strings,1\n" }, { "path": "companies/AllinCall.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/,Number Of Rectangles That Can Form The Largest Square,1\n" }, { "path": "companies/Amazon.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-average-difference/,Minimum Average Difference,1\nhttps://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/,Minimum Rounds to Complete All Tasks,1\nhttps://leetcode.com/problems/partition-array-according-to-given-pivot/,Partition Array According to Given Pivot,1\nhttps://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/,Minimum Sum of Four Digit Number After Splitting Digits,1\nhttps://leetcode.com/problems/rearrange-array-elements-by-sign/,Rearrange Array Elements by Sign,1\nhttps://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/,Minimum Swaps to Group All 1's Together II,2\nhttps://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/,Maximum Twin Sum of a Linked List,23\nhttps://leetcode.com/problems/number-of-laser-beams-in-a-bank/,Number of Laser Beams in a Bank,6\nhttps://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/,Check if a Parentheses String Can Be Valid,2\nhttps://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/,Number of Smooth Descent Periods of a Stock,4\nhttps://leetcode.com/problems/adding-spaces-to-a-string/,Adding Spaces to a String,1\nhttps://leetcode.com/problems/two-furthest-houses-with-different-colors/,Two Furthest Houses With Different Colors,2\nhttps://leetcode.com/problems/decode-the-slanted-ciphertext/,Decode the Slanted Ciphertext,1\nhttps://leetcode.com/problems/plates-between-candles/,Plates Between Candles,3\nhttps://leetcode.com/problems/kth-distinct-string-in-an-array/,Kth Distinct String in an Array,1\nhttps://leetcode.com/problems/number-of-valid-words-in-a-sentence/,Number of Valid Words in a Sentence,2\nhttps://leetcode.com/problems/maximize-the-confusion-of-an-exam/,Maximize the Confusion of an Exam,2\nhttps://leetcode.com/problems/sum-of-beauty-in-the-array/,Sum of Beauty in the Array,1\nhttps://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/,Count Number of Pairs With Absolute Difference K,1\nhttps://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/,Minimize the Difference Between Target and Chosen Elements,1\nhttps://leetcode.com/problems/find-unique-binary-string/,Find Unique Binary String,2\nhttps://leetcode.com/problems/find-if-path-exists-in-graph/,Find if Path Exists in Graph,4\nhttps://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/,Array With Elements Not Equal to Average of Neighbors,2\nhttps://leetcode.com/problems/nearest-exit-from-entrance-in-maze/,Nearest Exit from Entrance in Maze,2\nhttps://leetcode.com/problems/count-square-sum-triples/,Count Square Sum Triples,2\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,2\nhttps://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/,Longer Contiguous Segments of Ones than Zeros,2\nhttps://leetcode.com/problems/maximum-average-pass-ratio/,Maximum Average Pass Ratio,2\nhttps://leetcode.com/problems/sort-features-by-popularity/,Sort Features by Popularity,2\nhttps://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/,Minimum Number of Operations to Move All Balls to Each Box,2\nhttps://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/,Form Array by Concatenating Subarrays of Another Array,1\nhttps://leetcode.com/problems/check-if-array-is-sorted-and-rotated/,Check if Array Is Sorted and Rotated,2\nhttps://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/,Maximum Absolute Sum of Any Subarray,2\nhttps://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Swapping Nodes in a Linked List,3\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,2\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,29\nhttps://leetcode.com/problems/max-number-of-k-sum-pairs/,Max Number of K-Sum Pairs,2\nhttps://leetcode.com/problems/minimize-deviation-in-array/,Minimize Deviation in Array,2\nhttps://leetcode.com/problems/design-front-middle-back-queue/,Design Front Middle Back Queue,3\nhttps://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/,Minimum Operations to Reduce X to Zero,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,3\nhttps://leetcode.com/problems/furthest-building-you-can-reach/,Furthest Building You Can Reach,5\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,5\nhttps://leetcode.com/problems/slowest-key/,Slowest Key,17\nhttps://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/,Design an Expression Tree With Evaluate Function,7\nhttps://leetcode.com/problems/design-parking-system/,Design Parking System,12\nhttps://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/,Maximum Number of Achievable Transfer Requests,1\nhttps://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Sum of All Odd Length Subarrays,2\nhttps://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/,Shortest Subarray to be Removed to Make Array Sorted,4\nhttps://leetcode.com/problems/matrix-diagonal-sum/,Matrix Diagonal Sum,2\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,2\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maximum Length of Subarray With Positive Product,29\nhttps://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/,Minimum Numbers of Function Calls to Make Target Array,1\nhttps://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/,Minimum Number of Vertices to Reach All Nodes,2\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,2\nhttps://leetcode.com/problems/number-of-good-ways-to-split-a-string/,Number of Good Ways to Split a String,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,2\nhttps://leetcode.com/problems/water-bottles/,Water Bottles,2\nhttps://leetcode.com/problems/number-of-good-pairs/,Number of Good Pairs,3\nhttps://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/,Can Make Arithmetic Progression From Sequence,1\nhttps://leetcode.com/problems/the-kth-factor-of-n/,The kth Factor of n,25\nhttps://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/,Average Salary Excluding the Minimum and Maximum Salary,2\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,5\nhttps://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/,Final Prices With a Special Discount in a Shop,2\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,3\nhttps://leetcode.com/problems/shuffle-the-array/,Shuffle the Array,2\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,3\nhttps://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/,Maximum Number of Vowels in a Substring of Given Length,1\nhttps://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/,Check If a Word Occurs As a Prefix of Any Word in a Sentence,2\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Sentence,2\nhttps://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,12\nhttps://leetcode.com/problems/kids-with-the-greatest-number-of-candies/,Kids With the Greatest Number of Candies,3\nhttps://leetcode.com/problems/first-unique-number/,First Unique Number,4\nhttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Maximum Points You Can Obtain from Cards,3\nhttps://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/,Minimum Value to Get Positive Step by Step Sum,2\nhttps://leetcode.com/problems/queries-on-a-permutation-with-key/,Queries on a Permutation With Key,1\nhttps://leetcode.com/problems/string-matching-in-an-array/,String Matching in an Array,3\nhttps://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/,Minimum Subsequence in Non-Increasing Order,2\nhttps://leetcode.com/problems/count-number-of-teams/,Count Number of Teams,3\nhttps://leetcode.com/problems/longest-happy-prefix/,Longest Happy Prefix,2\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target Array in the Given Order,2\nhttps://leetcode.com/problems/cinema-seat-allocation/,Cinema Seat Allocation,2\nhttps://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/,Find a Corresponding Node of a Binary Tree in a Clone of That Tree,2\nhttps://leetcode.com/problems/frog-position-after-t-seconds/,Frog Position After T Seconds,2\nhttps://leetcode.com/problems/time-needed-to-inform-all-employees/,Time Needed to Inform All Employees,6\nhttps://leetcode.com/problems/maximum-sum-bst-in-binary-tree/,Maximum Sum BST in Binary Tree,3\nhttps://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/,Longest ZigZag Path in a Binary Tree,6\nhttps://leetcode.com/problems/increasing-decreasing-string/,Increasing Decreasing String,2\nhttps://leetcode.com/problems/linked-list-in-binary-tree/,Linked List in Binary Tree,2\nhttps://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/,How Many Numbers Are Smaller Than the Current Number,2\nhttps://leetcode.com/problems/closest-divisors/,Closest Divisors,1\nhttps://leetcode.com/problems/number-of-days-between-two-dates/,Number of Days Between Two Dates,5\nhttps://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Maximum Number of Events That Can Be Attended,3\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,3\nhttps://leetcode.com/problems/jump-game-iv/,Jump Game IV,4\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,3\nhttps://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/,The K Weakest Rows in a Matrix,1\nhttps://leetcode.com/problems/maximum-product-of-splitted-binary-tree/,Maximum Product of Splitted Binary Tree,4\nhttps://leetcode.com/problems/reduce-array-size-to-the-half/,Reduce Array Size to The Half,2\nhttps://leetcode.com/problems/delete-leaves-with-a-given-value/,Delete Leaves With a Given Value,2\nhttps://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/,Sum of Nodes with Even-Valued Grandparent,2\nhttps://leetcode.com/problems/matrix-block-sum/,Matrix Block Sum,2\nhttps://leetcode.com/problems/decompress-run-length-encoded-list/,Decompress Run-Length Encoded List,2\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,2\nhttps://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/,Maximum Number of Occurrences of a Substring,2\nhttps://leetcode.com/problems/find-numbers-with-even-number-of-digits/,Find Numbers with Even Number of Digits,2\nhttps://leetcode.com/problems/sequential-digits/,Sequential Digits,3\nhttps://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/,Convert Binary Number in a Linked List to Integer,2\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,14\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,68\nhttps://leetcode.com/problems/synonymous-sentences/,Synonymous Sentences,3\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,6\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,2\nhttps://leetcode.com/problems/two-sum-bsts/,Two Sum BSTs,3\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,8\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,5\nhttps://leetcode.com/problems/diet-plan-performance/,Diet Plan Performance,1\nhttps://leetcode.com/problems/prime-arrangements/,Prime Arrangements,2\nhttps://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/,Remove Zero Sum Consecutive Nodes from Linked List,2\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,2\nhttps://leetcode.com/problems/analyze-user-website-visit-pattern/,Analyze User Website Visit Pattern,50\nhttps://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/,Minimum Swaps to Group All 1's Together,21\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,6\nhttps://leetcode.com/problems/alphabet-board-path/,Alphabet Board Path,2\nhttps://leetcode.com/problems/n-th-tribonacci-number/,N-th Tribonacci Number,3\nhttps://leetcode.com/problems/parallel-courses/,Parallel Courses,2\nhttps://leetcode.com/problems/armstrong-number/,Armstrong Number,1\nhttps://leetcode.com/problems/largest-unique-number/,Largest Unique Number,1\nhttps://leetcode.com/problems/number-of-equivalent-domino-pairs/,Number of Equivalent Domino Pairs,1\nhttps://leetcode.com/problems/remove-vowels-from-a-string/,Remove Vowels from a String,3\nhttps://leetcode.com/problems/number-of-days-in-a-month/,Number of Days in a Month,1\nhttps://leetcode.com/problems/defanging-an-ip-address/,Defanging an IP Address,2\nhttps://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/,Find K-Length Substrings With No Repeated Characters,4\nhttps://leetcode.com/problems/two-sum-less-than-k/,Two Sum Less Than K,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,9\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,9\nhttps://leetcode.com/problems/brace-expansion/,Brace Expansion,2\nhttps://leetcode.com/problems/sum-of-digits-in-the-minimum-number/,Sum of Digits in the Minimum Number,1\nhttps://leetcode.com/problems/campus-bikes-ii/,Campus Bikes II,2\nhttps://leetcode.com/problems/index-pairs-of-a-string/,Index Pairs of a String,1\nhttps://leetcode.com/problems/campus-bikes/,Campus Bikes,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/,Remove All Adjacent Duplicates In String,4\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,4\nhttps://leetcode.com/problems/partition-array-for-maximum-sum/,Partition Array for Maximum Sum,4\nhttps://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/,Binary Search Tree to Greater Sum Tree,2\nhttps://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Maximum Difference Between Node and Ancestor,4\nhttps://leetcode.com/problems/video-stitching/,Video Stitching,2\nhttps://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Sum of Root To Leaf Binary Numbers,2\nhttps://leetcode.com/problems/next-greater-node-in-linked-list/,Next Greater Node In Linked List,5\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,14\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,4\nhttps://leetcode.com/problems/maximize-sum-of-array-after-k-negations/,Maximize Sum Of Array After K Negations,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,2\nhttps://leetcode.com/problems/find-common-characters/,Find Common Characters,4\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,9\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,2\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,35\nhttps://leetcode.com/problems/cousins-in-binary-tree/,Cousins in Binary Tree,3\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,10\nhttps://leetcode.com/problems/unique-paths-iii/,Unique Paths III,3\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,2\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,13\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,3\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,49\nhttps://leetcode.com/problems/powerful-integers/,Powerful Integers,2\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,2\nhttps://leetcode.com/problems/validate-stack-sequences/,Validate Stack Sequences,4\nhttps://leetcode.com/problems/valid-mountain-array/,Valid Mountain Array,2\nhttps://leetcode.com/problems/range-sum-of-bst/,Range Sum of BST,4\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,3\nhttps://leetcode.com/problems/3sum-with-multiplicity/,3Sum With Multiplicity,2\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,3\nhttps://leetcode.com/problems/maximum-sum-circular-subarray/,Maximum Sum Circular Subarray,6\nhttps://leetcode.com/problems/reverse-only-letters/,Reverse Only Letters,2\nhttps://leetcode.com/problems/sort-an-array/,Sort an Array,3\nhttps://leetcode.com/problems/online-stock-span/,Online Stock Span,6\nhttps://leetcode.com/problems/fruit-into-baskets/,Fruit Into Baskets,4\nhttps://leetcode.com/problems/monotonic-array/,Monotonic Array,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,5\nhttps://leetcode.com/problems/surface-area-of-3d-shapes/,Surface Area of 3D Shapes,2\nhttps://leetcode.com/problems/fair-candy-swap/,Fair Candy Swap,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,4\nhttps://leetcode.com/problems/decoded-string-at-index/,Decoded String at Index,2\nhttps://leetcode.com/problems/stone-game/,Stone Game,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,5\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,2\nhttps://leetcode.com/problems/score-after-flipping-matrix/,Score After Flipping Matrix,2\nhttps://leetcode.com/problems/lemonade-change/,Lemonade Change,3\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,4\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,10\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,3\nhttps://leetcode.com/problems/keys-and-rooms/,Keys and Rooms,6\nhttps://leetcode.com/problems/binary-trees-with-factors/,Binary Trees With Factors,2\nhttps://leetcode.com/problems/short-encoding-of-words/,Short Encoding of Words,2\nhttps://leetcode.com/problems/most-common-word/,Most Common Word,2\nhttps://leetcode.com/problems/max-increase-to-keep-city-skyline/,Max Increase to Keep City Skyline,2\nhttps://leetcode.com/problems/champagne-tower/,Champagne Tower,2\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,2\nhttps://leetcode.com/problems/jewels-and-stones/,Jewels and Stones,3\nhttps://leetcode.com/problems/max-chunks-to-make-sorted/,Max Chunks To Make Sorted,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,17\nhttps://leetcode.com/problems/partition-labels/,Partition Labels,4\nhttps://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/,Prime Number of Set Bits in Binary Representation,1\nhttps://leetcode.com/problems/pyramid-transition-matrix/,Pyramid Transition Matrix,2\nhttps://leetcode.com/problems/reach-a-number/,Reach a Number,5\nhttps://leetcode.com/problems/min-cost-climbing-stairs/,Min Cost Climbing Stairs,5\nhttps://leetcode.com/problems/find-smallest-letter-greater-than-target/,Find Smallest Letter Greater Than Target,2\nhttps://leetcode.com/problems/network-delay-time/,Network Delay Time,3\nhttps://leetcode.com/problems/delete-and-earn/,Delete and Earn,5\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,10\nhttps://leetcode.com/problems/monotone-increasing-digits/,Monotone Increasing Digits,1\nhttps://leetcode.com/problems/sentence-similarity-ii/,Sentence Similarity II,2\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,14\nhttps://leetcode.com/problems/my-calendar-i/,My Calendar I,4\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,2\nhttps://leetcode.com/problems/split-linked-list-in-parts/,Split Linked List in Parts,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,3\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,2\nhttps://leetcode.com/problems/max-stack/,Max Stack,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/,Best Time to Buy and Sell Stock with Transaction Fee,3\nhttps://leetcode.com/problems/subarray-product-less-than-k/,Subarray Product Less Than K,3\nhttps://leetcode.com/problems/to-lower-case/,To Lower Case,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,10\nhttps://leetcode.com/problems/design-hashset/,Design HashSet,3\nhttps://leetcode.com/problems/binary-search/,Binary Search,13\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,4\nhttps://leetcode.com/problems/insert-into-a-binary-search-tree/,Insert into a Binary Search Tree,2\nhttps://leetcode.com/problems/search-in-a-binary-search-tree/,Search in a Binary Search Tree,2\nhttps://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Partition to K Equal Sum Subsets,2\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,19\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,8\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,12\nhttps://leetcode.com/problems/knight-probability-in-chessboard/,Knight Probability in Chessboard,3\nhttps://leetcode.com/problems/longest-univalue-path/,Longest Univalue Path,2\nhttps://leetcode.com/problems/redundant-connection-ii/,Redundant Connection II,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,5\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,5\nhttps://leetcode.com/problems/cut-off-trees-for-golf-event/,Cut Off Trees for Golf Event,3\nhttps://leetcode.com/problems/number-of-longest-increasing-subsequence/,Number of Longest Increasing Subsequence,2\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,4\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,3\nhttps://leetcode.com/problems/equal-tree-partition/,Equal Tree Partition,2\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,6\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,3\nhttps://leetcode.com/problems/print-binary-tree/,Print Binary Tree,2\nhttps://leetcode.com/problems/maximum-binary-tree/,Maximum Binary Tree,2\nhttps://leetcode.com/problems/two-sum-iv-input-is-a-bst/,Two Sum IV - Input is a BST,2\nhttps://leetcode.com/problems/find-duplicate-subtrees/,Find Duplicate Subtrees,7\nhttps://leetcode.com/problems/2-keys-keyboard/,2 Keys Keyboard,4\nhttps://leetcode.com/problems/maximum-length-of-pair-chain/,Maximum Length of Pair Chain,2\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,9\nhttps://leetcode.com/problems/solve-the-equation/,Solve the Equation,4\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,2\nhttps://leetcode.com/problems/average-of-levels-in-binary-tree/,Average of Levels in Binary Tree,4\nhttps://leetcode.com/problems/find-the-derangement-of-an-array/,Find the Derangement of An Array,2\nhttps://leetcode.com/problems/sum-of-square-numbers/,Sum of Square Numbers,2\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,4\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,3\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,3\nhttps://leetcode.com/problems/valid-triangle-number/,Valid Triangle Number,2\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,3\nhttps://leetcode.com/problems/range-addition-ii/,Range Addition II,2\nhttps://leetcode.com/problems/tag-validator/,Tag Validator,2\nhttps://leetcode.com/problems/n-ary-tree-postorder-traversal/,N-ary Tree Postorder Traversal,2\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,16\nhttps://leetcode.com/problems/delete-operation-for-two-strings/,Delete Operation for Two Strings,2\nhttps://leetcode.com/problems/kill-process/,Kill Process,8\nhttps://leetcode.com/problems/shortest-unsorted-continuous-subarray/,Shortest Unsorted Continuous Subarray,5\nhttps://leetcode.com/problems/out-of-boundary-paths/,Out of Boundary Paths,3\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,6\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,19\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,3\nhttps://leetcode.com/problems/optimal-division/,Optimal Division,1\nhttps://leetcode.com/problems/friend-circles/,Friend Circles,3\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,12\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,12\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,6\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,9\nhttps://leetcode.com/problems/minimum-time-difference/,Minimum Time Difference,2\nhttps://leetcode.com/problems/convert-bst-to-greater-tree/,Convert BST to Greater Tree,3\nhttps://leetcode.com/problems/complex-number-multiplication/,Complex Number Multiplication,1\nhttps://leetcode.com/problems/encode-and-decode-tinyurl/,Encode and Decode TinyURL,4\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,2\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,11\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,7\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,5\nhttps://leetcode.com/problems/detect-capital/,Detect Capital,2\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,6\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,10\nhttps://leetcode.com/problems/target-sum/,Target Sum,7\nhttps://leetcode.com/problems/reverse-pairs/,Reverse Pairs,3\nhttps://leetcode.com/problems/the-maze/,The Maze,2\nhttps://leetcode.com/problems/total-hamming-distance/,Total Hamming Distance,2\nhttps://leetcode.com/problems/number-complement/,Number Complement,2\nhttps://leetcode.com/problems/heaters/,Heaters,2\nhttps://leetcode.com/problems/concatenated-words/,Concatenated Words,30\nhttps://leetcode.com/problems/validate-ip-address/,Validate IP Address,2\nhttps://leetcode.com/problems/count-the-repetitions/,Count The Repetitions,3\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,2\nhttps://leetcode.com/problems/island-perimeter/,Island Perimeter,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,8\nhttps://leetcode.com/problems/132-pattern/,132 Pattern,4\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,6\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,2\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,8\nhttps://leetcode.com/problems/serialize-and-deserialize-bst/,Serialize and Deserialize BST,3\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,5\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,3\nhttps://leetcode.com/problems/string-compression/,String Compression,8\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,5\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,15\nhttps://leetcode.com/problems/find-right-interval/,Find Right Interval,2\nhttps://leetcode.com/problems/non-overlapping-intervals/,Non-overlapping Intervals,4\nhttps://leetcode.com/problems/all-oone-data-structure/,All O`one Data Structure,3\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,2\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,6\nhttps://leetcode.com/problems/strong-password-checker/,Strong Password Checker,6\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,2\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,2\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,4\nhttps://leetcode.com/problems/add-strings/,Add Strings,3\nhttps://leetcode.com/problems/third-maximum-number/,Third Maximum Number,2\nhttps://leetcode.com/problems/arithmetic-slices/,Arithmetic Slices,2\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,6\nhttps://leetcode.com/problems/longest-palindrome/,Longest Palindrome,2\nhttps://leetcode.com/problems/convert-a-number-to-hexadecimal/,Convert a Number to Hexadecimal,2\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,6\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,10\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,10\nhttps://leetcode.com/problems/random-pick-index/,Random Pick Index,2\nhttps://leetcode.com/problems/rotate-function/,Rotate Function,1\nhttps://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/,Longest Substring with At Least K Repeating Characters,3\nhttps://leetcode.com/problems/decode-string/,Decode String,12\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,4\nhttps://leetcode.com/problems/find-the-difference/,Find the Difference,3\nhttps://leetcode.com/problems/longest-absolute-file-path/,Longest Absolute File Path,2\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,30\nhttps://leetcode.com/problems/linked-list-random-node/,Linked List Random Node,2\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),17\nhttps://leetcode.com/problems/design-phone-directory/,Design Phone Directory,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,6\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,4\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,2\nhttps://leetcode.com/problems/range-addition/,Range Addition,18\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,2\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,9\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,3\nhttps://leetcode.com/problems/design-twitter/,Design Twitter,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,5\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,4\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,9\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,15\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,29\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,4\nhttps://leetcode.com/problems/reverse-string/,Reverse String,6\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,2\nhttps://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/,Longest Substring with At Most K Distinct Characters,2\nhttps://leetcode.com/problems/nested-list-weight-sum/,Nested List Weight Sum,4\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,3\nhttps://leetcode.com/problems/house-robber-iii/,House Robber III,6\nhttps://leetcode.com/problems/self-crossing/,Self Crossing,3\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,4\nhttps://leetcode.com/problems/patching-array/,Patching Array,2\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,4\nhttps://leetcode.com/problems/power-of-three/,Power of Three,2\nhttps://leetcode.com/problems/maximum-size-subarray-sum-equals-k/,Maximum Size Subarray Sum Equals k,2\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,6\nhttps://leetcode.com/problems/coin-change/,Coin Change,18\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,2\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,3\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,4\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,2\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,2\nhttps://leetcode.com/problems/minimum-height-trees/,Minimum Height Trees,2\nhttps://leetcode.com/problems/range-sum-query-mutable/,Range Sum Query - Mutable,3\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,3\nhttps://leetcode.com/problems/remove-invalid-parentheses/,Remove Invalid Parentheses,2\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Binary Tree Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,21\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,4\nhttps://leetcode.com/problems/game-of-life/,Game of Life,6\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,16\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,4\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,3\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,8\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,2\nhttps://leetcode.com/problems/wiggle-sort/,Wiggle Sort,2\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,2\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,12\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,4\nhttps://leetcode.com/problems/h-index/,H-Index,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,19\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,10\nhttps://leetcode.com/problems/missing-number/,Missing Number,8\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,3\nhttps://leetcode.com/problems/paint-house/,Paint House,3\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,48\nhttps://leetcode.com/problems/meeting-rooms/,Meeting Rooms,4\nhttps://leetcode.com/problems/shortest-word-distance-iii/,Shortest Word Distance III,2\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,3\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,8\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,10\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,32\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,32\nhttps://leetcode.com/problems/delete-node-in-a-linked-list/,Delete Node in a Linked List,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,25\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,3\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,16\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,8\nhttps://leetcode.com/problems/power-of-two/,Power of Two,5\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,9\nhttps://leetcode.com/problems/majority-element-ii/,Majority Element II,4\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,13\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,5\nhttps://leetcode.com/problems/implement-stack-using-queues/,Implement Stack using Queues,3\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,7\nhttps://leetcode.com/problems/rectangle-area/,Rectangle Area,2\nhttps://leetcode.com/problems/count-complete-tree-nodes/,Count Complete Tree Nodes,5\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,3\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,19\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,16\nhttps://leetcode.com/problems/house-robber-ii/,House Robber II,4\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,31\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,7\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,34\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,6\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,15\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,28\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,12\nhttps://leetcode.com/problems/isomorphic-strings/,Isomorphic Strings,7\nhttps://leetcode.com/problems/count-primes/,Count Primes,4\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,4\nhttps://leetcode.com/problems/happy-number/,Happy Number,6\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,103\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,10\nhttps://leetcode.com/problems/house-robber/,House Robber,21\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,3\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,9\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,4\nhttps://leetcode.com/problems/repeated-dna-sequences/,Repeated DNA Sequences,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,2\nhttps://leetcode.com/problems/dungeon-game/,Dungeon Game,2\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,4\nhttps://leetcode.com/problems/factorial-trailing-zeroes/,Factorial Trailing Zeroes,4\nhttps://leetcode.com/problems/majority-element/,Majority Element,9\nhttps://leetcode.com/problems/excel-sheet-column-title/,Excel Sheet Column Title,2\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,11\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,7\nhttps://leetcode.com/problems/maximum-gap/,Maximum Gap,2\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,8\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,8\nhttps://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/,Longest Substring with At Most Two Distinct Characters,4\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,2\nhttps://leetcode.com/problems/min-stack/,Min Stack,18\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,8\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,17\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,6\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,4\nhttps://leetcode.com/problems/sort-list/,Sort List,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,117\nhttps://leetcode.com/problems/reorder-list/,Reorder List,10\nhttps://leetcode.com/problems/linked-list-cycle-ii/,Linked List Cycle II,7\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,9\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,11\nhttps://leetcode.com/problems/word-break/,Word Break,34\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,19\nhttps://leetcode.com/problems/single-number-ii/,Single Number II,5\nhttps://leetcode.com/problems/single-number/,Single Number,8\nhttps://leetcode.com/problems/candy/,Candy,8\nhttps://leetcode.com/problems/gas-station/,Gas Station,19\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,8\nhttps://leetcode.com/problems/palindrome-partitioning-ii/,Palindrome Partitioning II,2\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,2\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers/,Sum Root to Leaf Numbers,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,9\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,41\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,9\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,8\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,17\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Best Time to Buy and Sell Stock III,7\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,13\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,56\nhttps://leetcode.com/problems/triangle/,Triangle,4\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,5\nhttps://leetcode.com/problems/distinct-subsequences/,Distinct Subsequences,4\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,6\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,5\nhttps://leetcode.com/problems/path-sum/,Path Sum,2\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,5\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,7\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,3\nhttps://leetcode.com/problems/binary-tree-level-order-traversal-ii/,Binary Tree Level Order Traversal II,2\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,3\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,4\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,28\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,8\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,8\nhttps://leetcode.com/problems/same-tree/,Same Tree,5\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,15\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,25\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,4\nhttps://leetcode.com/problems/unique-binary-search-trees/,Unique Binary Search Trees,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,4\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,3\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,5\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,9\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,2\nhttps://leetcode.com/problems/gray-code/,Gray Code,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,5\nhttps://leetcode.com/problems/maximal-rectangle/,Maximal Rectangle,3\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,12\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,6\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Remove Duplicates from Sorted List II,6\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,5\nhttps://leetcode.com/problems/word-search/,Word Search,36\nhttps://leetcode.com/problems/subsets/,Subsets,13\nhttps://leetcode.com/problems/combinations/,Combinations,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,11\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,8\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,12\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,6\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,8\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,8\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,14\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),9\nhttps://leetcode.com/problems/add-binary/,Add Binary,6\nhttps://leetcode.com/problems/plus-one/,Plus One,5\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,7\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,7\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,8\nhttps://leetcode.com/problems/spiral-matrix-ii/,Spiral Matrix II,2\nhttps://leetcode.com/problems/length-of-last-word/,Length of Last Word,3\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,5\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,87\nhttps://leetcode.com/problems/jump-game/,Jump Game,20\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,13\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,35\nhttps://leetcode.com/problems/n-queens/,N-Queens,7\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",9\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,51\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,8\nhttps://leetcode.com/problems/permutations-ii/,Permutations II,4\nhttps://leetcode.com/problems/permutations/,Permutations,9\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,13\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,5\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,5\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,45\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,20\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,4\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,18\nhttps://leetcode.com/problems/count-and-say/,Count and Say,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,7\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,19\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,9\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,31\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,9\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,3\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,9\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),7\nhttps://leetcode.com/problems/remove-element/,Remove Element,5\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,9\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,14\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,8\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,47\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,15\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,20\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,43\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,10\nhttps://leetcode.com/problems/4sum/,4 Sum,6\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,28\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,15\nhttps://leetcode.com/problems/3sum/,3Sum,44\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,9\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,27\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,27\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,21\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,8\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,7\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),9\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,11\nhttps://leetcode.com/problems/zigzag-conversion/,ZigZag Conversion,5\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,35\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,40\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,49\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,36\nhttps://leetcode.com/problems/two-sum/,Two Sum,117\n" }, { "path": "companies/American Express.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,3\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,2\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,3\nhttps://leetcode.com/problems/3sum/,3Sum,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/AppDynamics.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-number-of-balls-in-a-box/,Maximum Number of Balls in a Box,Lucid\n" }, { "path": "companies/Apple.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/,Check if Numbers Are Ascending in a Sentence,2\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,5\nhttps://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/,Minimum Operations to Make the Array Increasing,2\nhttps://leetcode.com/problems/implement-trie-ii-prefix-tree/,Implement Trie II (Prefix Tree),2\nhttps://leetcode.com/problems/find-the-highest-altitude/,Find the Highest Altitude,3\nhttps://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/,Partitioning Into Minimum Number Of Deci-Binary Numbers,2\nhttps://leetcode.com/problems/goal-parser-interpretation/,Goal Parser Interpretation,2\nhttps://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/,Check If Two String Arrays are Equivalent,2\nhttps://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Sum of All Odd Length Subarrays,2\nhttps://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/,Number of Sub-arrays With Odd Sum,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,2\nhttps://leetcode.com/problems/shuffle-the-array/,Shuffle the Array,3\nhttps://leetcode.com/problems/consecutive-characters/,Consecutive Characters,3\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target Array in the Given Order,2\nhttps://leetcode.com/problems/lucky-numbers-in-a-matrix/,Lucky Numbers in a Matrix,2\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,2\nhttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Number of Steps to Reduce a Number to Zero,2\nhttps://leetcode.com/problems/decompress-run-length-encoded-list/,Decompress Run-Length Encoded List,3\nhttps://leetcode.com/problems/deepest-leaves-sum/,Deepest Leaves Sum,2\nhttps://leetcode.com/problems/sequential-digits/,Sequential Digits,2\nhttps://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/,Group the People Given the Group Size They Belong To,2\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,2\nhttps://leetcode.com/problems/minimum-time-visiting-all-points/,Minimum Time Visiting All Points,3\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,3\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,4\nhttps://leetcode.com/problems/day-of-the-week/,Day of the Week,2\nhttps://leetcode.com/problems/height-checker/,Height Checker,2\nhttps://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Sum of Root To Leaf Binary Numbers,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,2\nhttps://leetcode.com/problems/complement-of-base-10-integer/,Complement of Base 10 Integer,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,2\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,2\nhttps://leetcode.com/problems/smallest-string-starting-from-leaf/,Smallest String Starting From Leaf,2\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,2\nhttps://leetcode.com/problems/range-sum-of-bst/,Range Sum of BST,3\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,4\nhttps://leetcode.com/problems/find-and-replace-pattern/,Find and Replace Pattern,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,2\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,3\nhttps://leetcode.com/problems/lemonade-change/,Lemonade Change,2\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,3\nhttps://leetcode.com/problems/shortest-distance-to-a-character/,Shortest Distance to a Character,2\nhttps://leetcode.com/problems/binary-tree-pruning/,Binary Tree Pruning,2\nhttps://leetcode.com/problems/rotate-string/,Rotate String,2\nhttps://leetcode.com/problems/split-linked-list-in-parts/,Split Linked List in Parts,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,3\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,4\nhttps://leetcode.com/problems/1-bit-and-2-bit-characters/,1-bit and 2-bit Characters,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,3\nhttps://leetcode.com/problems/binary-search/,Binary Search,5\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,3\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,3\nhttps://leetcode.com/problems/employee-importance/,Employee Importance,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,3\nhttps://leetcode.com/problems/cut-off-trees-for-golf-event/,Cut Off Trees for Golf Event,2\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,2\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,3\nhttps://leetcode.com/problems/find-duplicate-file-in-system/,Find Duplicate File in System,2\nhttps://leetcode.com/problems/minimum-index-sum-of-two-lists/,Minimum Index Sum of Two Lists,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,4\nhttps://leetcode.com/problems/array-nesting/,Array Nesting,1\nhttps://leetcode.com/problems/array-partition-i/,Array Partition I,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,3\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,2\nhttps://leetcode.com/problems/friend-circles/,Friend Circles,3\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,2\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,2\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,2\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,2\nhttps://leetcode.com/problems/longest-uncommon-subsequence-ii/,Longest Uncommon Subsequence II,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,3\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,2\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,4\nhttps://leetcode.com/problems/most-frequent-subtree-sum/,Most Frequent Subtree Sum,2\nhttps://leetcode.com/problems/increasing-subsequences/,Increasing Subsequences,2\nhttps://leetcode.com/problems/max-consecutive-ones/,Max Consecutive Ones,2\nhttps://leetcode.com/problems/number-complement/,Number Complement,2\nhttps://leetcode.com/problems/ones-and-zeroes/,Ones and Zeroes,2\nhttps://leetcode.com/problems/unique-substrings-in-wraparound-string/,Unique Substrings in Wraparound String,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,2\nhttps://leetcode.com/problems/assign-cookies/,Assign Cookies,2\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,2\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,2\nhttps://leetcode.com/problems/string-compression/,String Compression,6\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,2\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,4\nhttps://leetcode.com/problems/number-of-segments-in-a-string/,Number of Segments in a String,2\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,2\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,2\nhttps://leetcode.com/problems/add-strings/,Add Strings,2\nhttps://leetcode.com/problems/third-maximum-number/,Third Maximum Number,2\nhttps://leetcode.com/problems/fizz-buzz/,Fizz Buzz,2\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,2\nhttps://leetcode.com/problems/nth-digit/,Nth Digit,3\nhttps://leetcode.com/problems/rotate-function/,Rotate Function,2\nhttps://leetcode.com/problems/decode-string/,Decode String,5\nhttps://leetcode.com/problems/perfect-rectangle/,Perfect Rectangle,4\nhttps://leetcode.com/problems/find-the-difference/,Find the Difference,2\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,6\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,3\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,3\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,2\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,6\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,5\nhttps://leetcode.com/problems/reverse-string/,Reverse String,2\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,5\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,3\nhttps://leetcode.com/problems/create-maximum-number/,Create Maximum Number,2\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,4\nhttps://leetcode.com/problems/super-ugly-number/,Super Ugly Number,2\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,4\nhttps://leetcode.com/problems/game-of-life/,Game of Life,2\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,3\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,3\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,8\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,2\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,2\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,5\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,3\nhttps://leetcode.com/problems/h-index/,H-Index,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,2\nhttps://leetcode.com/problems/missing-number/,Missing Number,3\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,2\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,3\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,10\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,3\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,6\nhttps://leetcode.com/problems/power-of-two/,Power of Two,4\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,2\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,3\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,6\nhttps://leetcode.com/problems/shortest-palindrome/,Shortest Palindrome,2\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,4\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,5\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,2\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,3\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,3\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,6\nhttps://leetcode.com/problems/count-primes/,Count Primes,2\nhttps://leetcode.com/problems/happy-number/,Happy Number,7\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,11\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,2\nhttps://leetcode.com/problems/house-robber/,House Robber,8\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,3\nhttps://leetcode.com/problems/largest-number/,Largest Number,2\nhttps://leetcode.com/problems/excel-sheet-column-number/,Excel Sheet Column Number,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,4\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,3\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,3\nhttps://leetcode.com/problems/sort-list/,Sort List,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,20\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,4\nhttps://leetcode.com/problems/word-break/,Word Break,10\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,2\nhttps://leetcode.com/problems/single-number/,Single Number,4\nhttps://leetcode.com/problems/gas-station/,Gas Station,5\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,5\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,5\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Best Time to Buy and Sell Stock III,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,8\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,4\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,2\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,2\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,2\nhttps://leetcode.com/problems/same-tree/,Same Tree,3\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,3\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,3\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,2\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,3\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,8\nhttps://leetcode.com/problems/maximal-rectangle/,Maximal Rectangle,2\nhttps://leetcode.com/problems/subsets/,Subsets,3\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,4\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,4\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,4\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,3\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,3\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),5\nhttps://leetcode.com/problems/text-justification/,Text Justification,3\nhttps://leetcode.com/problems/plus-one/,Plus One,2\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,3\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,7\nhttps://leetcode.com/problems/spiral-matrix-ii/,Spiral Matrix II,4\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,18\nhttps://leetcode.com/problems/jump-game/,Jump Game,3\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,11\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,17\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",5\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,11\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,8\nhttps://leetcode.com/problems/permutations/,Permutations,4\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,4\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,8\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,4\nhttps://leetcode.com/problems/count-and-say/,Count and Say,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,6\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,4\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,7\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,7\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,2\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),2\nhttps://leetcode.com/problems/remove-element/,Remove Element,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,4\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,8\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,9\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,8\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,2\nhttps://leetcode.com/problems/4sum/,4 Sum,5\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,7\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,3\nhttps://leetcode.com/problems/3sum/,3Sum,10\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,14\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,13\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,3\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,5\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,3\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,4\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,7\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,15\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,16\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,19\nhttps://leetcode.com/problems/two-sum/,Two Sum,40\n" }, { "path": "companies/Arcesium.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maximum Length of Subarray With Positive Product,4\nhttps://leetcode.com/problems/broken-calculator/,Broken Calculator,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,2\n" }, { "path": "companies/Arista Networks.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/construct-string-with-repeat-limit/,Construct String With Repeat Limit,1\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,3\n" }, { "path": "companies/Asana.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,5\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,13\n" }, { "path": "companies/Athenahealth.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,4\n" }, { "path": "companies/Atlassian.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,18\nhttps://leetcode.com/problems/greatest-common-divisor-of-strings/,Greatest Common Divisor of Strings,2\nhttps://leetcode.com/problems/lemonade-change/,Lemonade Change,4\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,10\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,3\nhttps://leetcode.com/problems/single-number/,Single Number,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\n" }, { "path": "companies/Baidu.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/out-of-boundary-paths/,Out of Boundary Paths,1\nhttps://leetcode.com/problems/zuma-game/,Zuma Game,1\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,1\n" }, { "path": "companies/Barclays.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n" }, { "path": "companies/BlackRock.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,6\n" }, { "path": "companies/Bloomberg.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-bitset/,Design Bitset,2\nhttps://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/,Check if All the Integers in a Range Are Covered,1\nhttps://leetcode.com/problems/maximum-population-year/,Maximum Population Year,2\nhttps://leetcode.com/problems/find-the-winner-of-the-circular-game/,Find the Winner of the Circular Game,2\nhttps://leetcode.com/problems/truncate-sentence/,Truncate Sentence,1\nhttps://leetcode.com/problems/maximum-score-from-removing-stones/,Maximum Score From Removing Stones,2\nhttps://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Swapping Nodes in a Linked List,2\nhttps://leetcode.com/problems/design-an-ordered-stream/,Design an Ordered Stream,20\nhttps://leetcode.com/problems/arithmetic-subarrays/,Arithmetic Subarrays,2\nhttps://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/,Maximum Nesting Depth of the Parentheses,4\nhttps://leetcode.com/problems/even-odd-tree/,Even Odd Tree,1\nhttps://leetcode.com/problems/count-unhappy-friends/,Count Unhappy Friends,3\nhttps://leetcode.com/problems/matrix-diagonal-sum/,Matrix Diagonal Sum,2\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,2\nhttps://leetcode.com/problems/xor-operation-in-an-array/,XOR Operation in an Array,2\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,9\nhttps://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/,Pseudo-Palindromic Paths in a Binary Tree,2\nhttps://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/,Find the Kth Smallest Sum of a Matrix With Sorted Rows,2\nhttps://leetcode.com/problems/string-matching-in-an-array/,String Matching in an Array,2\nhttps://leetcode.com/problems/design-underground-system/,Design Underground System,64\nhttps://leetcode.com/problems/sort-integers-by-the-power-value/,Sort Integers by The Power Value,2\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,8\nhttps://leetcode.com/problems/remove-palindromic-subsequences/,Remove Palindromic Subsequences,2\nhttps://leetcode.com/problems/remove-palindromic-subsequences/,Remove Palindromic Subsequences,2\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,2\nhttps://leetcode.com/problems/sum-of-mutated-array-closest-to-target/,Sum of Mutated Array Closest to Target,2\nhttps://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/,Group the People Given the Group Size They Belong To,2\nhttps://leetcode.com/problems/count-square-submatrices-with-all-ones/,Count Square Submatrices with All Ones,2\nhttps://leetcode.com/problems/shift-2d-grid/,Shift 2D Grid,2\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,8\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,2\nhttps://leetcode.com/problems/play-with-chips/,Play with Chips,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,26\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,3\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,3\nhttps://leetcode.com/problems/two-city-scheduling/,Two City Scheduling,14\nhttps://leetcode.com/problems/divisor-game/,Divisor Game,2\nhttps://leetcode.com/problems/next-greater-node-in-linked-list/,Next Greater Node In Linked List,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,3\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,2\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,7\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,10\nhttps://leetcode.com/problems/number-of-recent-calls/,Number of Recent Calls,1\nhttps://leetcode.com/problems/sort-an-array/,Sort an Array,2\nhttps://leetcode.com/problems/online-stock-span/,Online Stock Span,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,2\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,3\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,2\nhttps://leetcode.com/problems/push-dominoes/,Push Dominoes,2\nhttps://leetcode.com/problems/shortest-distance-to-a-character/,Shortest Distance to a Character,2\nhttps://leetcode.com/problems/minimum-distance-between-bst-nodes/,Minimum Distance Between BST Nodes,2\nhttps://leetcode.com/problems/toeplitz-matrix/,Toeplitz Matrix,3\nhttps://leetcode.com/problems/couples-holding-hands/,Couples Holding Hands,2\nhttps://leetcode.com/problems/min-cost-climbing-stairs/,Min Cost Climbing Stairs,2\nhttps://leetcode.com/problems/find-smallest-letter-greater-than-target/,Find Smallest Letter Greater Than Target,2\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,2\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,7\nhttps://leetcode.com/problems/binary-search/,Binary Search,3\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,2\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,4\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,2\nhttps://leetcode.com/problems/non-decreasing-array/,Non-decreasing Array,3\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,2\nhttps://leetcode.com/problems/split-array-into-consecutive-subsequences/,Split Array into Consecutive Subsequences,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,2\nhttps://leetcode.com/problems/find-duplicate-subtrees/,Find Duplicate Subtrees,2\nhttps://leetcode.com/problems/sum-of-square-numbers/,Sum of Square Numbers,2\nhttps://leetcode.com/problems/course-schedule-iii/,Course Schedule III,2\nhttps://leetcode.com/problems/valid-triangle-number/,Valid Triangle Number,2\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,3\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,2\nhttps://leetcode.com/problems/reshape-the-matrix/,Reshape the Matrix,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,4\nhttps://leetcode.com/problems/brick-wall/,Brick Wall,2\nhttps://leetcode.com/problems/friend-circles/,Friend Circles,2\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,2\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,4\nhttps://leetcode.com/problems/convert-bst-to-greater-tree/,Convert BST to Greater Tree,2\nhttps://leetcode.com/problems/encode-and-decode-tinyurl/,Encode and Decode TinyURL,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,2\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,2\nhttps://leetcode.com/problems/target-sum/,Target Sum,2\nhttps://leetcode.com/problems/construct-the-rectangle/,Construct the Rectangle,2\nhttps://leetcode.com/problems/zuma-game/,Zuma Game,4\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,2\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,2\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,6\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,3\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,28\nhttps://leetcode.com/problems/valid-word-square/,Valid Word Square,2\nhttps://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/,Maximum XOR of Two Numbers in an Array,2\nhttps://leetcode.com/problems/add-strings/,Add Strings,3\nhttps://leetcode.com/problems/arithmetic-slices/,Arithmetic Slices,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,3\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,2\nhttps://leetcode.com/problems/integer-replacement/,Integer Replacement,2\nhttps://leetcode.com/problems/decode-string/,Decode String,33\nhttps://leetcode.com/problems/elimination-game/,Elimination Game,4\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,13\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),23\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,2\nhttps://leetcode.com/problems/wiggle-subsequence/,Wiggle Subsequence,2\nhttps://leetcode.com/problems/guess-number-higher-or-lower/,Guess Number Higher or Lower,2\nhttps://leetcode.com/problems/count-numbers-with-unique-digits/,Count Numbers with Unique Digits,2\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,2\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,4\nhttps://leetcode.com/problems/reverse-vowels-of-a-string/,Reverse Vowels of a String,2\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,2\nhttps://leetcode.com/problems/coin-change/,Coin Change,4\nhttps://leetcode.com/problems/maximum-product-of-word-lengths/,Maximum Product of Word Lengths,2\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,8\nhttps://leetcode.com/problems/super-ugly-number/,Super Ugly Number,2\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,4\nhttps://leetcode.com/problems/game-of-life/,Game of Life,4\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,4\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,4\nhttps://leetcode.com/problems/add-digits/,Add Digits,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,3\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,20\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,8\nhttps://leetcode.com/problems/different-ways-to-add-parentheses/,Different Ways to Add Parentheses,3\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,2\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,4\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,3\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,2\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,5\nhttps://leetcode.com/problems/shortest-palindrome/,Shortest Palindrome,3\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,2\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,33\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,4\nhttps://leetcode.com/problems/house-robber/,House Robber,2\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,4\nhttps://leetcode.com/problems/majority-element/,Majority Element,3\nhttps://leetcode.com/problems/min-stack/,Min Stack,7\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,19\nhttps://leetcode.com/problems/reorder-list/,Reorder List,2\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,7\nhttps://leetcode.com/problems/word-break/,Word Break,5\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,3\nhttps://leetcode.com/problems/single-number/,Single Number,5\nhttps://leetcode.com/problems/gas-station/,Gas Station,3\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,6\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,4\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,3\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,12\nhttps://leetcode.com/problems/minimum-depth-of-binary-tree/,Minimum Depth of Binary Tree,2\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,3\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,5\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,6\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,3\nhttps://leetcode.com/problems/same-tree/,Same Tree,2\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,14\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,2\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,3\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,4\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,2\nhttps://leetcode.com/problems/word-search/,Word Search,14\nhttps://leetcode.com/problems/subsets/,Subsets,4\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,5\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,3\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,2\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,2\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),2\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,4\nhttps://leetcode.com/problems/rotate-list/,Rotate List,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,20\nhttps://leetcode.com/problems/jump-game/,Jump Game,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,4\nhttps://leetcode.com/problems/n-queens/,N-Queens,3\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",8\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,3\nhttps://leetcode.com/problems/permutations/,Permutations,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,15\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,2\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,3\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,7\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,4\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,2\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,2\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,14\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,3\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,5\nhttps://leetcode.com/problems/3sum/,3Sum,6\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,5\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,10\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,5\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,5\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,3\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,6\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),5\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,2\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,6\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,23\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,16\nhttps://leetcode.com/problems/two-sum/,Two Sum,16\n" }, { "path": "companies/Bolt.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/,Check if All Characters Have Equal Number of Occurrences,5\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,3\nhttps://leetcode.com/problems/word-pattern-ii/,Word Pattern II,2\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,3\n" }, { "path": "companies/Booking.com.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-out-of-three/,Two Out of Three,1\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,3\nhttps://leetcode.com/problems/additive-number/,Additive Number,3\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n" }, { "path": "companies/Box.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,12\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,4\n" }, { "path": "companies/ByteDance.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number of Weak Characters in the Game,4\nhttps://leetcode.com/problems/closest-dessert-cost/,Closest Dessert Cost,3\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,2\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,2\nhttps://leetcode.com/problems/k-inverse-pairs-array/,K Inverse Pairs Array,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,2\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,3\nhttps://leetcode.com/problems/the-maze-ii/,The Maze II,2\nhttps://leetcode.com/problems/the-maze/,The Maze,4\nhttps://leetcode.com/problems/k-th-smallest-in-lexicographical-order/,K-th Smallest in Lexicographical Order,2\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,2\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,2\nhttps://leetcode.com/problems/decode-string/,Decode String,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,4\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,4\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,3\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,2\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,3\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,6\nhttps://leetcode.com/problems/sort-list/,Sort List,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,5\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,6\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,3\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,2\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,2\nhttps://leetcode.com/problems/plus-one/,Plus One,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,3\nhttps://leetcode.com/problems/n-queens-ii/,N-Queens II,2\nhttps://leetcode.com/problems/n-queens/,N-Queens,3\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,6\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,3\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,8\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,2\nhttps://leetcode.com/problems/3sum/,3Sum,3\n" }, { "path": "companies/C3 IoT.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,3\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,3\n" }, { "path": "companies/Canonical.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/divide-a-string-into-groups-of-size-k/,Divide a String Into Groups of Size k,1\n" }, { "path": "companies/Capital One.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,2\nhttps://leetcode.com/problems/restore-the-array-from-adjacent-pairs/,Restore the Array From Adjacent Pairs,2\nhttps://leetcode.com/problems/four-divisors/,Four Divisors,1\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,3\nhttps://leetcode.com/problems/license-key-formatting/,License Key Formatting,18\nhttps://leetcode.com/problems/count-primes/,Count Primes,14\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,4\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,13\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,3\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,2\n" }, { "path": "companies/Cashfree.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-erasure-value/,Maximum Erasure Value,1\n" }, { "path": "companies/Cisco.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-difference-between-increasing-elements/,Maximum Difference Between Increasing Elements,6\nhttps://leetcode.com/problems/maximum-population-year/,Maximum Population Year,2\nhttps://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/,Check if Binary String Has at Most One Segment of Ones,1\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,2\nhttps://leetcode.com/problems/expressive-words/,Expressive Words,11\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,2\nhttps://leetcode.com/problems/beautiful-arrangement/,Beautiful Arrangement,3\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,2\nhttps://leetcode.com/problems/validate-ip-address/,Validate IP Address,8\nhttps://leetcode.com/problems/decode-string/,Decode String,8\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,3\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,2\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,16\nhttps://leetcode.com/problems/house-robber/,House Robber,6\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,9\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,11\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,16\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,5\nhttps://leetcode.com/problems/3sum/,3Sum,2\n" }, { "path": "companies/Citadel.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,8\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,2\nhttps://leetcode.com/problems/range-addition/,Range Addition,5\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\n" }, { "path": "companies/Citrix.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-all-groups-of-farmland/,Find All Groups of Farmland,1\n" }, { "path": "companies/Cognizant.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/smallest-value-of-the-rearranged-number/,Smallest Value of the Rearranged Number,T-mobile\n" }, { "path": "companies/Cohesity.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,2\n" }, { "path": "companies/Commvault.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-vowel-substrings-of-a-string/,Count Vowel Substrings of a String,1\n" }, { "path": "companies/Coursera.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,2\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,2\n" }, { "path": "companies/Cruise Automation.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,2\nhttps://leetcode.com/problems/synonymous-sentences/,Synonymous Sentences,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,2\nhttps://leetcode.com/problems/decode-string/,Decode String,2\nhttps://leetcode.com/problems/palindrome-permutation-ii/,Palindrome Permutation II,2\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,2\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,9\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,5\n" }, { "path": "companies/DE Shaw.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Number of Substrings Containing All Three Characters,1\nhttps://leetcode.com/problems/freedom-trail/,Freedom Trail,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,2\n" }, { "path": "companies/DJI.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/three-consecutive-odds/,Three Consecutive Odds,1\n" }, { "path": "companies/DRW.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,4\nhttps://leetcode.com/problems/counting-elements/,Counting Elements,1\n" }, { "path": "companies/Databricks.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,9\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,2\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,2\n" }, { "path": "companies/Dataminr.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n" }, { "path": "companies/Dell.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/Deutsche Bank.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/the-time-when-the-network-becomes-idle/,The Time When the Network Becomes Idle,1\nhttps://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/,Minimum Operations to Make the Array Increasing,1\n" }, { "path": "companies/Directi.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-winner-of-an-array-game/,Find the Winner of an Array Game,1\n" }, { "path": "companies/Docusign.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/implement-trie-ii-prefix-tree/,Implement Trie II (Prefix Tree),2\nhttps://leetcode.com/problems/rectangle-overlap/,Rectangle Overlap,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,5\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,3\n" }, { "path": "companies/DoorDash.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/,Find Nearest Point That Has the Same X or Y Coordinate,3\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,7\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,5\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,4\nhttps://leetcode.com/problems/buddy-strings/,Buddy Strings,13\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,7\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,2\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,2\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,4\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,3\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,5\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,7\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,11\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,4\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,2\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,6\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,5\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,18\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,2\nhttps://leetcode.com/problems/jump-game/,Jump Game,3\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,4\n" }, { "path": "companies/Drawbridge.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/set-intersection-size-at-least-two/,Set Intersection Size At Least Two,1\n" }, { "path": "companies/Dropbox.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/seat-reservation-manager/,Seat Reservation Manager,1\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,2\nhttps://leetcode.com/problems/find-duplicate-file-in-system/,Find Duplicate File in System,6\nhttps://leetcode.com/problems/design-phone-directory/,Design Phone Directory,2\nhttps://leetcode.com/problems/game-of-life/,Game of Life,5\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,2\n" }, { "path": "companies/Druva.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximize-sum-of-array-after-k-negations/,Maximize Sum Of Array After K Negations,1\n" }, { "path": "companies/Dunzo.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/stone-game-vii/,Stone Game VII,1\nhttps://leetcode.com/problems/ways-to-make-a-fair-array/,Ways to Make a Fair Array,1\nhttps://leetcode.com/problems/maximum-number-of-coins-you-can-get/,Maximum Number of Coins You Can Get,2\nhttps://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/,Max Sum of Rectangle No Larger Than K,2\n" }, { "path": "companies/Duolingo.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-number-of-people-to-teach/,Minimum Number of People to Teach,2\n" }, { "path": "companies/Epic Systems.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,1\nhttps://leetcode.com/problems/additive-number/,Additive Number,2\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,3\n" }, { "path": "companies/Expedia.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-difference-between-increasing-elements/,Maximum Difference Between Increasing Elements,3\nhttps://leetcode.com/problems/number-of-different-integers-in-a-string/,Number of Different Integers in a String,2\nhttps://leetcode.com/problems/reformat-date/,Reformat Date,14\nhttps://leetcode.com/problems/the-kth-factor-of-n/,The kth Factor of n,6\nhttps://leetcode.com/problems/making-file-names-unique/,Making File Names Unique,14\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,4\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Sentence,1\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,2\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,5\nhttps://leetcode.com/problems/palindromic-substrings/,Palindromic Substrings,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,2\nhttps://leetcode.com/problems/string-compression/,String Compression,8\nhttps://leetcode.com/problems/best-meeting-point/,Best Meeting Point,4\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,5\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,7\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,6\nhttps://leetcode.com/problems/two-sum/,Two Sum,7\n" }, { "path": "companies/FPT.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/,Find Three Consecutive Integers That Sum to a Given Number,1\n" }, { "path": "companies/Facebook.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-hills-and-valleys-in-an-array/,Count Hills and Valleys in an Array,1\nhttps://leetcode.com/problems/k-radius-subarray-averages/,K Radius Subarray Averages,3\nhttps://leetcode.com/problems/find-target-indices-after-sorting-array/,Find Target Indices After Sorting Array,2\nhttps://leetcode.com/problems/process-restricted-friend-requests/,Process Restricted Friend Requests,5\nhttps://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/,Minimum Operations to Make a Uni-Value Grid,3\nhttps://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/,Number of Pairs of Strings With Concatenation Equal to Target,2\nhttps://leetcode.com/problems/find-the-middle-index-in-array/,Find the Middle Index in Array,3\nhttps://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/,Find the Kth Largest Integer in the Array,4\nhttps://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/,Remove One Element to Make the Array Strictly Increasing,2\nhttps://leetcode.com/problems/cutting-ribbons/,Cutting Ribbons,31\nhttps://leetcode.com/problems/check-if-the-sentence-is-pangram/,Check if the Sentence Is Pangram,2\nhttps://leetcode.com/problems/faulty-sensor/,Faulty Sensor,1\nhttps://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/,Check if One String Swap Can Make Strings Equal,2\nhttps://leetcode.com/problems/count-items-matching-a-rule/,Count Items Matching a Rule,2\nhttps://leetcode.com/problems/sum-of-unique-elements/,Sum of Unique Elements,2\nhttps://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Swapping Nodes in a Linked List,3\nhttps://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/,Construct the Lexicographically Largest Valid Sequence,1\nhttps://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/,Check If Two String Arrays are Equivalent,1\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,156\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/,Lowest Common Ancestor of a Binary Tree II,8\nhttps://leetcode.com/problems/check-array-formation-through-concatenation/,Check Array Formation Through Concatenation,2\nhttps://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/,Maximum Nesting Depth of the Parentheses,3\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,121\nhttps://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/,Minimum Insertions to Balance a Parentheses String,4\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,28\nhttps://leetcode.com/problems/clone-binary-tree-with-random-pointer/,Clone Binary Tree With Random Pointer,2\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum Product of Two Elements in an Array,2\nhttps://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/,Make Two Arrays Equal by Reversing Sub-arrays,4\nhttps://leetcode.com/problems/first-unique-number/,First Unique Number,2\nhttps://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Leftmost Column with at Least a One,10\nhttps://leetcode.com/problems/count-number-of-teams/,Count Number of Teams,2\nhttps://leetcode.com/problems/balance-a-binary-search-tree/,Balance a Binary Search Tree,11\nhttps://leetcode.com/problems/validate-binary-tree-nodes/,Validate Binary Tree Nodes,2\nhttps://leetcode.com/problems/apply-discount-every-n-orders/,Apply Discount Every n Orders,1\nhttps://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/,Count Negative Numbers in a Sorted Matrix,2\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,11\nhttps://leetcode.com/problems/rank-transform-of-an-array/,Rank Transform of an Array,3\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,5\nhttps://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/,Replace Elements with Greatest Element on Right Side,2\nhttps://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/,Element Appearing More Than 25% In Sorted Array,5\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,4\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,3\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,282\nhttps://leetcode.com/problems/intersection-of-three-sorted-arrays/,Intersection of Three Sorted Arrays,3\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,7\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,4\nhttps://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/,Maximum Level Sum of a Binary Tree,3\nhttps://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/,Check If a Number Is Majority Element in a Sorted Array,2\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,7\nhttps://leetcode.com/problems/two-sum-less-than-k/,Two Sum Less Than K,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,2\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,76\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/,Remove All Adjacent Duplicates In String,40\nhttps://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/,Binary Search Tree to Greater Sum Tree,2\nhttps://leetcode.com/problems/moving-stones-until-consecutive/,Moving Stones Until Consecutive,1\nhttps://leetcode.com/problems/two-city-scheduling/,Two City Scheduling,2\nhttps://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Maximum Difference Between Node and Ancestor,2\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,26\nhttps://leetcode.com/problems/cousins-in-binary-tree/,Cousins in Binary Tree,2\nhttps://leetcode.com/problems/add-to-array-form-of-integer/,Add to Array-Form of Integer,2\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,82\nhttps://leetcode.com/problems/unique-paths-iii/,Unique Paths III,2\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,29\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,3\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,127\nhttps://leetcode.com/problems/check-completeness-of-a-binary-tree/,Check Completeness of a Binary Tree,11\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,21\nhttps://leetcode.com/problems/range-sum-of-bst/,Range Sum of BST,149\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,6\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,100\nhttps://leetcode.com/problems/increasing-order-search-tree/,Increasing Order Search Tree,2\nhttps://leetcode.com/problems/monotonic-array/,Monotonic Array,12\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\nhttps://leetcode.com/problems/groups-of-special-equivalent-strings/,Groups of Special-Equivalent Strings,1\nhttps://leetcode.com/problems/uncommon-words-from-two-sentences/,Uncommon Words from Two Sentences,3\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,3\nhttps://leetcode.com/problems/advantage-shuffle/,Advantage Shuffle,2\nhttps://leetcode.com/problems/buddy-strings/,Buddy Strings,2\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,4\nhttps://leetcode.com/problems/rectangle-overlap/,Rectangle Overlap,2\nhttps://leetcode.com/problems/goat-latin/,Goat Latin,5\nhttps://leetcode.com/problems/binary-tree-pruning/,Binary Tree Pruning,4\nhttps://leetcode.com/problems/expressive-words/,Expressive Words,2\nhttps://leetcode.com/problems/custom-sort-string/,Custom Sort String,67\nhttps://leetcode.com/problems/rotated-digits/,Rotated Digits,4\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,9\nhttps://leetcode.com/problems/toeplitz-matrix/,Toeplitz Matrix,30\nhttps://leetcode.com/problems/number-of-corner-rectangles/,Number Of Corner Rectangles,1\nhttps://leetcode.com/problems/closest-leaf-in-a-binary-tree/,Closest Leaf in a Binary Tree,3\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,17\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,10\nhttps://leetcode.com/problems/sentence-similarity/,Sentence Similarity,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,14\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,2\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,34\nhttps://leetcode.com/problems/find-k-th-smallest-pair-distance/,Find K-th Smallest Pair Distance,3\nhttps://leetcode.com/problems/max-stack/,Max Stack,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/,Best Time to Buy and Sell Stock with Transaction Fee,2\nhttps://leetcode.com/problems/subarray-product-less-than-k/,Subarray Product Less Than K,3\nhttps://leetcode.com/problems/binary-search/,Binary Search,2\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,3\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,18\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,4\nhttps://leetcode.com/problems/stickers-to-spell-word/,Stickers to Spell Word,3\nhttps://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/,Maximum Sum of 3 Non-Overlapping Subarrays,3\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,252\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,4\nhttps://leetcode.com/problems/implement-magic-dictionary/,Implement Magic Dictionary,3\nhttps://leetcode.com/problems/longest-continuous-increasing-subsequence/,Longest Continuous Increasing Subsequence,4\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,36\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,3\nhttps://leetcode.com/problems/path-sum-iv/,Path Sum IV,2\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,3\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,21\nhttps://leetcode.com/problems/replace-words/,Replace Words,2\nhttps://leetcode.com/problems/palindromic-substrings/,Palindromic Substrings,24\nhttps://leetcode.com/problems/maximum-average-subarray-i/,Maximum Average Subarray I,7\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,2\nhttps://leetcode.com/problems/average-of-levels-in-binary-tree/,Average of Levels in Binary Tree,5\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,33\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,4\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,3\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,6\nhttps://leetcode.com/problems/add-bold-tag-in-string/,Add Bold Tag in String,13\nhttps://leetcode.com/problems/construct-string-from-binary-tree/,Construct String from Binary Tree,2\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,13\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,5\nhttps://leetcode.com/problems/reshape-the-matrix/,Reshape the Matrix,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,141\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,2\nhttps://leetcode.com/problems/split-array-with-equal-sum/,Split Array with Equal Sum,3\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,3\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,89\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,2\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,5\nhttps://leetcode.com/problems/convert-bst-to-greater-tree/,Convert BST to Greater Tree,3\nhttps://leetcode.com/problems/construct-binary-tree-from-string/,Construct Binary Tree from String,7\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,6\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,140\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,3\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,56\nhttps://leetcode.com/problems/find-largest-value-in-each-tree-row/,Find Largest Value in Each Tree Row,18\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,3\nhttps://leetcode.com/problems/diagonal-traverse/,Diagonal Traverse,48\nhttps://leetcode.com/problems/target-sum/,Target Sum,10\nhttps://leetcode.com/problems/the-maze/,The Maze,2\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,9\nhttps://leetcode.com/problems/island-perimeter/,Island Perimeter,10\nhttps://leetcode.com/problems/repeated-substring-pattern/,Repeated Substring Pattern,2\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,3\nhttps://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Minimum Number of Arrows to Burst Balloons,2\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,3\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,7\nhttps://leetcode.com/problems/string-compression/,String Compression,5\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,5\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,4\nhttps://leetcode.com/problems/non-overlapping-intervals/,Non-overlapping Intervals,7\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,4\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,11\nhttps://leetcode.com/problems/add-strings/,Add Strings,54\nhttps://leetcode.com/problems/fizz-buzz/,Fizz Buzz,3\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,5\nhttps://leetcode.com/problems/valid-word-abbreviation/,Valid Word Abbreviation,114\nhttps://leetcode.com/problems/queue-reconstruction-by-height/,Queue Reconstruction by Height,3\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,2\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,8\nhttps://leetcode.com/problems/random-pick-index/,Random Pick Index,21\nhttps://leetcode.com/problems/decode-string/,Decode String,11\nhttps://leetcode.com/problems/utf-8-validation/,UTF-8 Validation,2\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,4\nhttps://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Insert Delete GetRandom O(1) - Duplicates allowed,5\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),23\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,18\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,2\nhttps://leetcode.com/problems/sum-of-two-integers/,Sum of Two Integers,2\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,2\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,4\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,6\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,15\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,97\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,43\nhttps://leetcode.com/problems/reverse-string/,Reverse String,3\nhttps://leetcode.com/problems/integer-break/,Integer Break,3\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,4\nhttps://leetcode.com/problems/nested-list-weight-sum/,Nested List Weight Sum,100\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,2\nhttps://leetcode.com/problems/increasing-triplet-subsequence/,Increasing Triplet Subsequence,2\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,7\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,6\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,6\nhttps://leetcode.com/problems/maximum-size-subarray-sum-equals-k/,Maximum Size Subarray Sum Equals k,11\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,3\nhttps://leetcode.com/problems/coin-change/,Coin Change,2\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,22\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,2\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,188\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,10\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,10\nhttps://leetcode.com/problems/range-sum-query-immutable/,Range Sum Query - Immutable,2\nhttps://leetcode.com/problems/remove-invalid-parentheses/,Remove Invalid Parentheses,36\nhttps://leetcode.com/problems/bulls-and-cows/,Bulls and Cows,2\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Binary Tree Longest Consecutive Sequence,3\nhttps://leetcode.com/problems/best-meeting-point/,Best Meeting Point,2\nhttps://leetcode.com/problems/unique-word-abbreviation/,Unique Word Abbreviation,3\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,4\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,15\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,6\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,19\nhttps://leetcode.com/problems/expression-add-operators/,Expression Add Operators,23\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,7\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,2\nhttps://leetcode.com/problems/h-index/,H-Index,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,20\nhttps://leetcode.com/problems/encode-and-decode-strings/,Encode and Decode Strings,3\nhttps://leetcode.com/problems/closest-binary-search-tree-value/,Closest Binary Search Tree Value,21\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,16\nhttps://leetcode.com/problems/missing-number/,Missing Number,6\nhttps://leetcode.com/problems/palindrome-permutation/,Palindrome Permutation,12\nhttps://leetcode.com/problems/paint-house-ii/,Paint House II,1\nhttps://leetcode.com/problems/ugly-number/,Ugly Number,3\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,2\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,33\nhttps://leetcode.com/problems/group-shifted-strings/,Group Shifted Strings,47\nhttps://leetcode.com/problems/strobogrammatic-number-ii/,Strobogrammatic Number II,4\nhttps://leetcode.com/problems/strobogrammatic-number/,Strobogrammatic Number,19\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,2\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,8\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,5\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,18\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,180\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,5\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,16\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,6\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,118\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,5\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,10\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,15\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,140\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,5\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,7\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,5\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,8\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,9\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,4\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,34\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,108\nhttps://leetcode.com/problems/house-robber/,House Robber,2\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,4\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,3\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,3\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,50\nhttps://leetcode.com/problems/majority-element/,Majority Element,2\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,4\nhttps://leetcode.com/problems/maximum-gap/,Maximum Gap,2\nhttps://leetcode.com/problems/missing-ranges/,Missing Ranges,8\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,82\nhttps://leetcode.com/problems/one-edit-distance/,One Edit Distance,7\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,4\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,2\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,3\nhttps://leetcode.com/problems/min-stack/,Min Stack,4\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,8\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,2\nhttps://leetcode.com/problems/sort-list/,Sort List,6\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,60\nhttps://leetcode.com/problems/binary-tree-postorder-traversal/,Binary Tree Postorder Traversal,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,2\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,22\nhttps://leetcode.com/problems/word-break/,Word Break,33\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,64\nhttps://leetcode.com/problems/single-number/,Single Number,4\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,38\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,2\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers/,Sum Root to Leaf Numbers,31\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,13\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,4\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,94\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,16\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,5\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,16\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,10\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,4\nhttps://leetcode.com/problems/path-sum/,Path Sum,8\nhttps://leetcode.com/problems/minimum-depth-of-binary-tree/,Minimum Depth of Binary Tree,4\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,2\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,11\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,2\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,18\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,6\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,12\nhttps://leetcode.com/problems/same-tree/,Same Tree,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,8\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,2\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,7\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,4\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,3\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,89\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Remove Duplicates from Sorted List II,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,2\nhttps://leetcode.com/problems/word-search/,Word Search,12\nhttps://leetcode.com/problems/subsets/,Subsets,38\nhttps://leetcode.com/problems/combinations/,Combinations,5\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,20\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,2\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,14\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,5\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,2\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,112\nhttps://leetcode.com/problems/text-justification/,Text Justification,4\nhttps://leetcode.com/problems/add-binary/,Add Binary,10\nhttps://leetcode.com/problems/plus-one/,Plus One,11\nhttps://leetcode.com/problems/valid-number/,Valid Number,53\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,8\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,11\nhttps://leetcode.com/problems/permutation-sequence/,Permutation Sequence,2\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,5\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,110\nhttps://leetcode.com/problems/jump-game/,Jump Game,8\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,10\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,11\nhttps://leetcode.com/problems/n-queens/,N-Queens,4\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",162\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,17\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,12\nhttps://leetcode.com/problems/permutations/,Permutations,7\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,2\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,14\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,34\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,4\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,4\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,12\nhttps://leetcode.com/problems/count-and-say/,Count and Say,5\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,2\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,4\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,30\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,4\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,11\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),3\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,16\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,5\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,9\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,59\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,16\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,13\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,24\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,23\nhttps://leetcode.com/problems/4sum/,4 Sum,5\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,14\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,25\nhttps://leetcode.com/problems/3sum/,3Sum,28\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,26\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,8\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,8\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,19\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,8\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),32\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,4\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,7\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,7\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,23\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,19\nhttps://leetcode.com/problems/two-sum/,Two Sum,21\n" }, { "path": "companies/FactSet.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,2\n" }, { "path": "companies/Flipkart.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-students-unable-to-eat-lunch/,Number of Students Unable to Eat Lunch,7\nhttps://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/,Shortest Subarray to be Removed to Make Array Sorted,2\nhttps://leetcode.com/problems/maximum-number-of-coins-you-can-get/,Maximum Number of Coins You Can Get,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,4\nhttps://leetcode.com/problems/maximum-length-of-pair-chain/,Maximum Length of Pair Chain,2\nhttps://leetcode.com/problems/jump-game/,Jump Game,3\n" }, { "path": "companies/Gilt Groupe.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/add-one-row-to-tree/,Add One Row to Tree,1\n" }, { "path": "companies/GoDaddy.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\n" }, { "path": "companies/Goldman Sachs.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/keep-multiplying-found-values-by-two/,Keep Multiplying Found Values by Two,1\nhttps://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/,Remove Duplicates From an Unsorted Linked List,2\nhttps://leetcode.com/problems/check-if-the-sentence-is-pangram/,Check if the Sentence Is Pangram,3\nhttps://leetcode.com/problems/find-the-winner-of-the-circular-game/,Find the Winner of the Circular Game,4\nhttps://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/,Minimum Length of String After Deleting Similar Ends,Amazon\nhttps://leetcode.com/problems/perform-string-shifts/,Perform String Shifts,1\nhttps://leetcode.com/problems/count-number-of-teams/,Count Number of Teams,7\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,2\nhttps://leetcode.com/problems/high-five/,High Five,12\nhttps://leetcode.com/problems/greatest-common-divisor-of-strings/,Greatest Common Divisor of Strings,3\nhttps://leetcode.com/problems/height-checker/,Height Checker,20\nhttps://leetcode.com/problems/rotate-string/,Rotate String,3\nhttps://leetcode.com/problems/delete-and-earn/,Delete and Earn,11\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,3\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,9\nhttps://leetcode.com/problems/subarray-product-less-than-k/,Subarray Product Less Than K,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,3\nhttps://leetcode.com/problems/insert-into-a-binary-search-tree/,Insert into a Binary Search Tree,2\nhttps://leetcode.com/problems/fraction-addition-and-subtraction/,Fraction Addition and Subtraction,5\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,3\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,3\nhttps://leetcode.com/problems/find-permutation/,Find Permutation,2\nhttps://leetcode.com/problems/circular-array-loop/,Circular Array Loop,2\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,4\nhttps://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Minimum Number of Arrows to Burst Balloons,2\nhttps://leetcode.com/problems/string-compression/,String Compression,6\nhttps://leetcode.com/problems/elimination-game/,Elimination Game,4\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,4\nhttps://leetcode.com/problems/coin-change/,Coin Change,2\nhttps://leetcode.com/problems/h-index-ii/,H-Index II,2\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,3\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,3\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/largest-number/,Largest Number,2\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,3\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,6\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,11\nhttps://leetcode.com/problems/pascals-triangle-ii/,Pascal's Triangle II,2\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,3\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,3\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,2\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,2\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\nhttps://leetcode.com/problems/permutations/,Permutations,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,38\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,2\nhttps://leetcode.com/problems/3sum/,3Sum,4\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,3\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),3\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,5\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,18\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,7\n" }, { "path": "companies/Google.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/,Minimum Consecutive Cards to Pick Up,1\nhttps://leetcode.com/problems/count-prefixes-of-a-given-string/,Count Prefixes of a Given String,1\nhttps://leetcode.com/problems/find-the-difference-of-two-arrays/,Find the Difference of Two Arrays,1\nhttps://leetcode.com/problems/find-all-k-distant-indices-in-an-array/,Find All K-Distant Indices in an Array,1\nhttps://leetcode.com/problems/most-frequent-number-following-key-in-an-array/,Most Frequent Number Following Key In an Array,1\nhttps://leetcode.com/problems/counting-words-with-a-given-prefix/,Counting Words With a Given Prefix,1\nhttps://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/,All Divisions With the Highest Score of a Binary Array,1\nhttps://leetcode.com/problems/find-all-lonely-numbers-in-the-array/,Find All Lonely Numbers in the Array,1\nhttps://leetcode.com/problems/destroying-asteroids/,Destroying Asteroids,1\nhttps://leetcode.com/problems/maximum-number-of-words-found-in-sentences/,Maximum Number of Words Found in Sentences,1\nhttps://leetcode.com/problems/rings-and-rods/,Rings and Rods,6\nhttps://leetcode.com/problems/find-target-indices-after-sorting-array/,Find Target Indices After Sorting Array,4\nhttps://leetcode.com/problems/watering-plants/,Watering Plants,1\nhttps://leetcode.com/problems/smallest-index-with-equal-value/,Smallest Index With Equal Value,1\nhttps://leetcode.com/problems/stock-price-fluctuation/,Stock Price Fluctuation,30\nhttps://leetcode.com/problems/convert-1d-array-into-2d-array/,Convert 1D Array Into 2D Array,1\nhttps://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/,Check if Word Can Be Placed In Crossword,4\nhttps://leetcode.com/problems/find-original-array-from-doubled-array/,Find Original Array From Doubled Array,14\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number of Weak Characters in the Game,3\nhttps://leetcode.com/problems/find-if-path-exists-in-graph/,Find if Path Exists in Graph,3\nhttps://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/,Binary Searchable Numbers in an Unsorted Array,1\nhttps://leetcode.com/problems/concatenation-of-array/,Concatenation of Array,4\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,2\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,2\nhttps://leetcode.com/problems/minimize-maximum-pair-sum-in-array/,Minimize Maximum Pair Sum in Array,3\nhttps://leetcode.com/problems/minimize-product-sum-of-two-arrays/,Minimize Product Sum of Two Arrays,1\nhttps://leetcode.com/problems/sorting-the-sentence/,Sorting the Sentence,2\nhttps://leetcode.com/problems/maximum-population-year/,Maximum Population Year,2\nhttps://leetcode.com/problems/replace-all-digits-with-characters/,Replace All Digits with Characters,1\nhttps://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/,Queries on Number of Points Inside a Circle,1\nhttps://leetcode.com/problems/sentence-similarity-iii/,Sentence Similarity III,1\nhttps://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/,Evaluate the Bracket Pairs of a String,2\nhttps://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/,Minimum Number of Operations to Reinitialize a Permutation,1\nhttps://leetcode.com/problems/sum-of-beauty-of-all-substrings/,Sum of Beauty of All Substrings,1\nhttps://leetcode.com/problems/map-of-highest-peak/,Map of Highest Peak,2\nhttps://leetcode.com/problems/design-most-recently-used-queue/,Design Most Recently Used Queue,1\nhttps://leetcode.com/problems/latest-time-by-replacing-hidden-digits/,Latest Time by Replacing Hidden Digits,1\nhttps://leetcode.com/problems/largest-submatrix-with-rearrangements/,Largest Submatrix With Rearrangements,Directi\nhttps://leetcode.com/problems/tuple-with-same-product/,Tuple with Same Product,1\nhttps://leetcode.com/problems/maximum-score-from-removing-substrings/,Maximum Score From Removing Substrings,1\nhttps://leetcode.com/problems/largest-subarray-length-k/,Largest Subarray Length K,1\nhttps://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/,Concatenation of Consecutive Binary Numbers,3\nhttps://leetcode.com/problems/find-the-most-competitive-subsequence/,Find the Most Competitive Subsequence,2\nhttps://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/,Minimum Operations to Reduce X to Zero,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,3\nhttps://leetcode.com/problems/furthest-building-you-can-reach/,Furthest Building You Can Reach,3\nhttps://leetcode.com/problems/count-sorted-vowel-strings/,Count Sorted Vowel Strings,3\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,2\nhttps://leetcode.com/problems/largest-substring-between-two-equal-characters/,Largest Substring Between Two Equal Characters,2\nhttps://leetcode.com/problems/mean-of-array-after-removing-some-elements/,Mean of Array After Removing Some Elements,1\nhttps://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/,Special Array With X Elements Greater Than or Equal X,1\nhttps://leetcode.com/problems/rearrange-spaces-between-words/,Rearrange Spaces Between Words,4\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,4\nhttps://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/,Minimum Number of Vertices to Reach All Nodes,2\nhttps://leetcode.com/problems/make-the-string-great/,Make The String Great,1\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,2\nhttps://leetcode.com/problems/count-good-triplets/,Count Good Triplets,2\nhttps://leetcode.com/problems/shuffle-string/,Shuffle String,2\nhttps://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/,Minimum Number of Increments on Subarrays to Form a Target Array,4\nhttps://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/,Number of Sub-arrays With Odd Sum,2\nhttps://leetcode.com/problems/path-with-maximum-probability/,Path with Maximum Probability,5\nhttps://leetcode.com/problems/range-sum-of-sorted-subarray-sums/,Range Sum of Sorted Subarray Sums,1\nhttps://leetcode.com/problems/path-crossing/,Path Crossing,2\nhttps://leetcode.com/problems/clone-n-ary-tree/,Clone N-ary Tree,2\nhttps://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/,Minimum Number of Days to Make m Bouquets,2\nhttps://leetcode.com/problems/the-k-strongest-values-in-an-array/,The k Strongest Values in an Array,1\nhttps://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/,Check If a String Contains All Binary Codes of Size K,1\nhttps://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/,People Whose List of Favorite Companies Is Not a Subset of Another List,1\nhttps://leetcode.com/problems/simplified-fractions/,Simplified Fractions,2\nhttps://leetcode.com/problems/consecutive-characters/,Consecutive Characters,2\nhttps://leetcode.com/problems/build-an-array-with-stack-operations/,Build an Array With Stack Operations,2\nhttps://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,3\nhttps://leetcode.com/problems/destination-city/,Destination City,2\nhttps://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Leftmost Column with at Least a One,2\nhttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Maximum Points You Can Obtain from Cards,17\nhttps://leetcode.com/problems/maximum-score-after-splitting-a-string/,Maximum Score After Splitting a String,1\nhttps://leetcode.com/problems/reformat-the-string/,Reformat The String,4\nhttps://leetcode.com/problems/pizza-with-3n-slices/,Pizza With 3n Slices,2\nhttps://leetcode.com/problems/frog-position-after-t-seconds/,Frog Position After T Seconds,2\nhttps://leetcode.com/problems/time-needed-to-inform-all-employees/,Time Needed to Inform All Employees,11\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,2\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,7\nhttps://leetcode.com/problems/check-if-n-and-its-double-exist/,Check If N and Its Double Exist,2\nhttps://leetcode.com/problems/jump-game-iv/,Jump Game IV,5\nhttps://leetcode.com/problems/rank-transform-of-an-array/,Rank Transform of an Array,2\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,2\nhttps://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/,Divide Array in Sets of K Consecutive Numbers,4\nhttps://leetcode.com/problems/minimum-falling-path-sum-ii/,Minimum Falling Path Sum II,1\nhttps://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/,Element Appearing More Than 25% In Sorted Array,2\nhttps://leetcode.com/problems/count-square-submatrices-with-all-ones/,Count Square Submatrices with All Ones,8\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,11\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,3\nhttps://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/,Find Elements in a Contaminated Binary Tree,1\nhttps://leetcode.com/problems/cells-with-odd-values-in-a-matrix/,Cells with Odd Values in a Matrix,2\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,2\nhttps://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/,Find Positive Integer Solution for a Given Equation,2\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,2\nhttps://leetcode.com/problems/minimum-absolute-difference/,Minimum Absolute Difference,2\nhttps://leetcode.com/problems/distance-between-bus-stops/,Distance Between Bus Stops,1\nhttps://leetcode.com/problems/single-row-keyboard/,Single-Row Keyboard,1\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,2\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,36\nhttps://leetcode.com/problems/relative-sort-array/,Relative Sort Array,2\nhttps://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/,Compare Strings by Frequency of the Smallest Character,2\nhttps://leetcode.com/problems/print-in-order/,Print in Order,2\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,6\nhttps://leetcode.com/problems/defanging-an-ip-address/,Defanging an IP Address,2\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,3\nhttps://leetcode.com/problems/largest-values-from-labels/,Largest Values From Labels,1\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,5\nhttps://leetcode.com/problems/brace-expansion/,Brace Expansion,4\nhttps://leetcode.com/problems/letter-tile-possibilities/,Letter Tile Possibilities,1\nhttps://leetcode.com/problems/occurrences-after-bigram/,Occurrences After Bigram,1\nhttps://leetcode.com/problems/campus-bikes-ii/,Campus Bikes II,2\nhttps://leetcode.com/problems/confusing-number/,Confusing Number,2\nhttps://leetcode.com/problems/valid-boomerang/,Valid Boomerang,1\nhttps://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Maximum Difference Between Node and Ancestor,2\nhttps://leetcode.com/problems/divisor-game/,Divisor Game,2\nhttps://leetcode.com/problems/video-stitching/,Video Stitching,2\nhttps://leetcode.com/problems/number-of-enclaves/,Number of Enclaves,1\nhttps://leetcode.com/problems/best-sightseeing-pair/,Best Sightseeing Pair,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,3\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,4\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,2\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,5\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,3\nhttps://leetcode.com/problems/univalued-binary-tree/,Univalued Binary Tree,3\nhttps://leetcode.com/problems/array-of-doubled-pairs/,Array of Doubled Pairs,3\nhttps://leetcode.com/problems/flip-equivalent-binary-trees/,Flip Equivalent Binary Trees,2\nhttps://leetcode.com/problems/delete-columns-to-make-sorted/,Delete Columns to Make Sorted,1\nhttps://leetcode.com/problems/minimum-falling-path-sum/,Minimum Falling Path Sum,2\nhttps://leetcode.com/problems/long-pressed-name/,Long Pressed Name,2\nhttps://leetcode.com/problems/maximum-sum-circular-subarray/,Maximum Sum Circular Subarray,3\nhttps://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/,X of a Kind in a Deck of Cards,2\nhttps://leetcode.com/problems/rle-iterator/,RLE Iterator,3\nhttps://leetcode.com/problems/uncommon-words-from-two-sentences/,Uncommon Words from Two Sentences,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,3\nhttps://leetcode.com/problems/leaf-similar-trees/,Leaf-Similar Trees,2\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,2\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,3\nhttps://leetcode.com/problems/magic-squares-in-grid/,Magic Squares In Grid,3\nhttps://leetcode.com/problems/flipping-an-image/,Flipping an Image,3\nhttps://leetcode.com/problems/positions-of-large-groups/,Positions of Large Groups,3\nhttps://leetcode.com/problems/ambiguous-coordinates/,Ambiguous Coordinates,1\nhttps://leetcode.com/problems/largest-triangle-area/,Largest Triangle Area,1\nhttps://leetcode.com/problems/expressive-words/,Expressive Words,3\nhttps://leetcode.com/problems/max-increase-to-keep-city-skyline/,Max Increase to Keep City Skyline,3\nhttps://leetcode.com/problems/similar-rgb-color/,Similar RGB Color,1\nhttps://leetcode.com/problems/number-of-matching-subsequences/,Number of Matching Subsequences,15\nhttps://leetcode.com/problems/escape-the-ghosts/,Escape The Ghosts,1\nhttps://leetcode.com/problems/rotated-digits/,Rotated Digits,2\nhttps://leetcode.com/problems/split-bst/,Split BST,3\nhttps://leetcode.com/problems/global-and-local-inversions/,Global and Local Inversions,2\nhttps://leetcode.com/problems/jewels-and-stones/,Jewels and Stones,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,4\nhttps://leetcode.com/problems/partition-labels/,Partition Labels,2\nhttps://leetcode.com/problems/find-anagram-mappings/,Find Anagram Mappings,1\nhttps://leetcode.com/problems/bold-words-in-string/,Bold Words in String,2\nhttps://leetcode.com/problems/pyramid-transition-matrix/,Pyramid Transition Matrix,2\nhttps://leetcode.com/problems/shortest-completing-word/,Shortest Completing Word,2\nhttps://leetcode.com/problems/network-delay-time/,Network Delay Time,8\nhttps://leetcode.com/problems/delete-and-earn/,Delete and Earn,2\nhttps://leetcode.com/problems/sentence-similarity/,Sentence Similarity,1\nhttps://leetcode.com/problems/my-calendar-i/,My Calendar I,3\nhttps://leetcode.com/problems/minimum-window-subsequence/,Minimum Window Subsequence,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,2\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,3\nhttps://leetcode.com/problems/longest-word-in-dictionary/,Longest Word in Dictionary,6\nhttps://leetcode.com/problems/binary-search/,Binary Search,4\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,4\nhttps://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Partition to K Equal Sum Subsets,2\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,9\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,7\nhttps://leetcode.com/problems/employee-importance/,Employee Importance,6\nhttps://leetcode.com/problems/repeated-string-match/,Repeated String Match,2\nhttps://leetcode.com/problems/redundant-connection/,Redundant Connection,2\nhttps://leetcode.com/problems/k-empty-slots/,K Empty Slots,1\nhttps://leetcode.com/problems/24-game/,24 Game,2\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,3\nhttps://leetcode.com/problems/map-sum-pairs/,Map Sum Pairs,2\nhttps://leetcode.com/problems/implement-magic-dictionary/,Implement Magic Dictionary,2\nhttps://leetcode.com/problems/number-of-longest-increasing-subsequence/,Number of Longest Increasing Subsequence,2\nhttps://leetcode.com/problems/beautiful-arrangement-ii/,Beautiful Arrangement II,1\nhttps://leetcode.com/problems/strange-printer/,Strange Printer,3\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,4\nhttps://leetcode.com/problems/remove-9/,Remove 9,2\nhttps://leetcode.com/problems/split-array-into-consecutive-subsequences/,Split Array into Consecutive Subsequences,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,4\nhttps://leetcode.com/problems/coin-path/,Coin Path,1\nhttps://leetcode.com/problems/find-duplicate-subtrees/,Find Duplicate Subtrees,13\nhttps://leetcode.com/problems/maximum-average-subarray-ii/,Maximum Average Subarray II,1\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,9\nhttps://leetcode.com/problems/solve-the-equation/,Solve the Equation,3\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,3\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,3\nhttps://leetcode.com/problems/design-excel-sum-formula/,Design Excel Sum Formula,3\nhttps://leetcode.com/problems/design-compressed-string-iterator/,Design Compressed String Iterator,2\nhttps://leetcode.com/problems/valid-square/,Valid Square,4\nhttps://leetcode.com/problems/n-ary-tree-preorder-traversal/,N-ary Tree Preorder Traversal,3\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,3\nhttps://leetcode.com/problems/erect-the-fence/,Erect the Fence,1\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,2\nhttps://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/,Longest Line of Consecutive One in Matrix,5\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,15\nhttps://leetcode.com/problems/student-attendance-record-ii/,Student Attendance Record II,14\nhttps://leetcode.com/problems/student-attendance-record-i/,Student Attendance Record I,5\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/,Binary Tree Longest Consecutive Sequence II,4\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,3\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,6\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,3\nhttps://leetcode.com/problems/minimum-time-difference/,Minimum Time Difference,30\nhttps://leetcode.com/problems/lonely-pixel-ii/,Lonely Pixel II,1\nhttps://leetcode.com/problems/lonely-pixel-i/,Lonely Pixel I,1\nhttps://leetcode.com/problems/minimum-absolute-difference-in-bst/,Minimum Absolute Difference in BST,3\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,27\nhttps://leetcode.com/problems/word-abbreviation/,Word Abbreviation,3\nhttps://leetcode.com/problems/longest-word-in-dictionary-through-deleting/,Longest Word in Dictionary through Deleting,4\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,2\nhttps://leetcode.com/problems/longest-uncommon-subsequence-i/,Longest Uncommon Subsequence I,1\nhttps://leetcode.com/problems/detect-capital/,Detect Capital,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,2\nhttps://leetcode.com/problems/freedom-trail/,Freedom Trail,1\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,2\nhttps://leetcode.com/problems/relative-ranks/,Relative Ranks,1\nhttps://leetcode.com/problems/the-maze-ii/,The Maze II,2\nhttps://leetcode.com/problems/base-7/,Base 7,3\nhttps://leetcode.com/problems/the-maze-iii/,The Maze III,2\nhttps://leetcode.com/problems/diagonal-traverse/,Diagonal Traverse,2\nhttps://leetcode.com/problems/target-sum/,Target Sum,2\nhttps://leetcode.com/problems/increasing-subsequences/,Increasing Subsequences,2\nhttps://leetcode.com/problems/the-maze/,The Maze,3\nhttps://leetcode.com/problems/predict-the-winner/,Predict the Winner,2\nhttps://leetcode.com/problems/max-consecutive-ones/,Max Consecutive Ones,2\nhttps://leetcode.com/problems/find-permutation/,Find Permutation,1\nhttps://leetcode.com/problems/license-key-formatting/,License Key Formatting,1\nhttps://leetcode.com/problems/magical-string/,Magical String,1\nhttps://leetcode.com/problems/encode-string-with-shortest-length/,Encode String with Shortest Length,2\nhttps://leetcode.com/problems/convex-polygon/,Convex Polygon,1\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,4\nhttps://leetcode.com/problems/island-perimeter/,Island Perimeter,3\nhttps://leetcode.com/problems/hamming-distance/,Hamming Distance,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,4\nhttps://leetcode.com/problems/repeated-substring-pattern/,Repeated Substring Pattern,2\nhttps://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Minimum Number of Arrows to Burst Balloons,2\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,3\nhttps://leetcode.com/problems/number-of-boomerangs/,Number of Boomerangs,5\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,2\nhttps://leetcode.com/problems/sequence-reconstruction/,Sequence Reconstruction,2\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,2\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,2\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,3\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,2\nhttps://leetcode.com/problems/word-squares/,Word Squares,3\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,7\nhttps://leetcode.com/problems/valid-word-square/,Valid Word Square,1\nhttps://leetcode.com/problems/strong-password-checker/,Strong Password Checker,3\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,10\nhttps://leetcode.com/problems/sentence-screen-fitting/,Sentence Screen Fitting,8\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,10\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,2\nhttps://leetcode.com/problems/add-strings/,Add Strings,5\nhttps://leetcode.com/problems/third-maximum-number/,Third Maximum Number,2\nhttps://leetcode.com/problems/minimum-unique-word-abbreviation/,Minimum Unique Word Abbreviation,1\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,8\nhttps://leetcode.com/problems/valid-word-abbreviation/,Valid Word Abbreviation,3\nhttps://leetcode.com/problems/trapping-rain-water-ii/,Trapping Rain Water II,4\nhttps://leetcode.com/problems/convert-a-number-to-hexadecimal/,Convert a Number to Hexadecimal,2\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,2\nhttps://leetcode.com/problems/binary-watch/,Binary Watch,1\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,8\nhttps://leetcode.com/problems/random-pick-index/,Random Pick Index,3\nhttps://leetcode.com/problems/rotate-function/,Rotate Function,3\nhttps://leetcode.com/problems/decode-string/,Decode String,19\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,3\nhttps://leetcode.com/problems/perfect-rectangle/,Perfect Rectangle,2\nhttps://leetcode.com/problems/find-the-difference/,Find the Difference,6\nhttps://leetcode.com/problems/longest-absolute-file-path/,Longest Absolute File Path,7\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,3\nhttps://leetcode.com/problems/linked-list-random-node/,Linked List Random Node,1\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),4\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,4\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,3\nhttps://leetcode.com/problems/guess-number-higher-or-lower-ii/,Guess Number Higher or Lower II,2\nhttps://leetcode.com/problems/plus-one-linked-list/,Plus One Linked List,1\nhttps://leetcode.com/problems/largest-divisible-subset/,Largest Divisible Subset,2\nhttps://leetcode.com/problems/valid-perfect-square/,Valid Perfect Square,3\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,75\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,2\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,22\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,3\nhttps://leetcode.com/problems/design-twitter/,Design Twitter,3\nhttps://leetcode.com/problems/russian-doll-envelopes/,Russian Doll Envelopes,7\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,3\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,4\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,8\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,4\nhttps://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/,Longest Substring with At Most K Distinct Characters,2\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,2\nhttps://leetcode.com/problems/house-robber-iii/,House Robber III,5\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,3\nhttps://leetcode.com/problems/self-crossing/,Self Crossing,2\nhttps://leetcode.com/problems/increasing-triplet-subsequence/,Increasing Triplet Subsequence,3\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,4\nhttps://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/,Verify Preorder Serialization of a Binary Tree,1\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,2\nhttps://leetcode.com/problems/coin-change/,Coin Change,5\nhttps://leetcode.com/problems/create-maximum-number/,Create Maximum Number,1\nhttps://leetcode.com/problems/generalized-abbreviation/,Generalized Abbreviation,1\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,6\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,6\nhttps://leetcode.com/problems/super-ugly-number/,Super Ugly Number,2\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,7\nhttps://leetcode.com/problems/range-sum-query-2d-mutable/,Range Sum Query 2D - Mutable,3\nhttps://leetcode.com/problems/range-sum-query-mutable/,Range Sum Query - Mutable,6\nhttps://leetcode.com/problems/number-of-islands-ii/,Number of Islands II,2\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,2\nhttps://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/,Smallest Rectangle Enclosing Black Pixels,7\nhttps://leetcode.com/problems/bulls-and-cows/,Bulls and Cows,12\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Binary Tree Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,3\nhttps://leetcode.com/problems/best-meeting-point/,Best Meeting Point,2\nhttps://leetcode.com/problems/flip-game-ii/,Flip Game II,1\nhttps://leetcode.com/problems/flip-game/,Flip Game,1\nhttps://leetcode.com/problems/game-of-life/,Game of Life,3\nhttps://leetcode.com/problems/unique-word-abbreviation/,Unique Word Abbreviation,1\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,2\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,5\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,3\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,8\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,1\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,2\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,19\nhttps://leetcode.com/problems/paint-fence/,Paint Fence,2\nhttps://leetcode.com/problems/h-index/,H-Index,9\nhttps://leetcode.com/problems/closest-binary-search-tree-value-ii/,Closest Binary Search Tree Value II,2\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,7\nhttps://leetcode.com/problems/palindrome-permutation-ii/,Palindrome Permutation II,3\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,3\nhttps://leetcode.com/problems/single-number-iii/,Single Number III,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,2\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,22\nhttps://leetcode.com/problems/meeting-rooms/,Meeting Rooms,2\nhttps://leetcode.com/problems/count-univalue-subtrees/,Count Univalue Subtrees,2\nhttps://leetcode.com/problems/group-shifted-strings/,Group Shifted Strings,2\nhttps://leetcode.com/problems/strobogrammatic-number-iii/,Strobogrammatic Number III,4\nhttps://leetcode.com/problems/strobogrammatic-number-ii/,Strobogrammatic Number II,2\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,2\nhttps://leetcode.com/problems/different-ways-to-add-parentheses/,Different Ways to Add Parentheses,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,8\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,8\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,3\nhttps://leetcode.com/problems/number-of-digit-one/,Number of Digit One,4\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,2\nhttps://leetcode.com/problems/power-of-two/,Power of Two,3\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,3\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,12\nhttps://leetcode.com/problems/count-complete-tree-nodes/,Count Complete Tree Nodes,7\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,3\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,4\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,3\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,6\nhttps://leetcode.com/problems/combination-sum-iii/,Combination Sum III,3\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,8\nhttps://leetcode.com/problems/house-robber-ii/,House Robber II,9\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,5\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,11\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,2\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,9\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,5\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,3\nhttps://leetcode.com/problems/isomorphic-strings/,Isomorphic Strings,3\nhttps://leetcode.com/problems/happy-number/,Happy Number,22\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,21\nhttps://leetcode.com/problems/house-robber/,House Robber,7\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,2\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,2\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,2\nhttps://leetcode.com/problems/excel-sheet-column-number/,Excel Sheet Column Number,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,3\nhttps://leetcode.com/problems/excel-sheet-column-title/,Excel Sheet Column Title,2\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,4\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,7\nhttps://leetcode.com/problems/one-edit-distance/,One Edit Distance,5\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,4\nhttps://leetcode.com/problems/min-stack/,Min Stack,3\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/,Find Minimum in Rotated Sorted Array II,2\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,73\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,3\nhttps://leetcode.com/problems/insertion-sort-list/,Insertion Sort List,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,9\nhttps://leetcode.com/problems/binary-tree-preorder-traversal/,Binary Tree Preorder Traversal,2\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,2\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,3\nhttps://leetcode.com/problems/word-break/,Word Break,2\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,3\nhttps://leetcode.com/problems/single-number/,Single Number,4\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,5\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,3\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,5\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,7\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,6\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,12\nhttps://leetcode.com/problems/distinct-subsequences/,Distinct Subsequences,2\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,3\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,2\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,2\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,3\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,4\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,3\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,3\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,5\nhttps://leetcode.com/problems/same-tree/,Same Tree,3\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,2\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,3\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,3\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,8\nhttps://leetcode.com/problems/maximal-rectangle/,Maximal Rectangle,4\nhttps://leetcode.com/problems/subsets/,Subsets,7\nhttps://leetcode.com/problems/combinations/,Combinations,5\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,4\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,5\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,4\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),4\nhttps://leetcode.com/problems/text-justification/,Text Justification,24\nhttps://leetcode.com/problems/add-binary/,Add Binary,2\nhttps://leetcode.com/problems/plus-one/,Plus One,5\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,4\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,3\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,15\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,11\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,28\nhttps://leetcode.com/problems/jump-game/,Jump Game,2\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,8\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,11\nhttps://leetcode.com/problems/n-queens/,N-Queens,3\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",5\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,5\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,4\nhttps://leetcode.com/problems/permutations/,Permutations,5\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,3\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,4\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,5\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,8\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,5\nhttps://leetcode.com/problems/count-and-say/,Count and Say,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,5\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,4\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,3\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,2\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,5\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),4\nhttps://leetcode.com/problems/remove-element/,Remove Element,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,4\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,8\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,4\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,6\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,5\nhttps://leetcode.com/problems/4sum/,4 Sum,2\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,5\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,3\nhttps://leetcode.com/problems/3sum/,3Sum,8\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,12\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,10\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,2\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,5\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,9\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,11\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),6\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,5\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,12\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,14\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,13\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,10\nhttps://leetcode.com/problems/two-sum/,Two Sum,44\n" }, { "path": "companies/Grab.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/,Minimum Number of Buckets Required to Collect Rainwater from Houses,1\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,2\nhttps://leetcode.com/problems/bulb-switcher-iii/,Bulb Switcher III,4\nhttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Number of Steps to Reduce a Number to Zero,2\nhttps://leetcode.com/problems/brick-wall/,Brick Wall,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,3\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,2\n" }, { "path": "companies/HBO.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/short-encoding-of-words/,Short Encoding of Words,2\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,2\n" }, { "path": "companies/HRT.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/,Equal Sum Arrays With Minimum Number of Operations,7\nhttps://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/,Detect Pattern of Length M Repeated K or More Times,1\nhttps://leetcode.com/problems/maximum-69-number/,Maximum 69 Number,1\nhttps://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/,Convert Integer to the Sum of Two No-Zero Integers,1\nhttps://leetcode.com/problems/24-game/,24 Game,3\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,3\n" }, { "path": "companies/Honeywell.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-distance-to-the-target-element/,Minimum Distance to the Target Element,1\n" }, { "path": "companies/Hotstar.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/keys-and-rooms/,Keys and Rooms,2\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,3\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,2\n" }, { "path": "companies/Huawei.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,2\n" }, { "path": "companies/Hulu.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/k-th-smallest-in-lexicographical-order/,K-th Smallest in Lexicographical Order,1\n" }, { "path": "companies/IBM.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/most-visited-sector-in-a-circular-track/,Most Visited Sector in a Circular Track,6\nhttps://leetcode.com/problems/water-bottles/,Water Bottles,4\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,6\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,3\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,2\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,3\nhttps://leetcode.com/problems/gas-station/,Gas Station,8\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,8\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/IIT Bombay.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/score-after-flipping-matrix/,Score After Flipping Matrix,1\n" }, { "path": "companies/IMC.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-artifacts-that-can-be-extracted/,Count Artifacts That Can Be Extracted,1\n" }, { "path": "companies/IXL.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-derangement-of-an-array/,Find the Derangement of An Array,1\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,2\n" }, { "path": "companies/Indeed.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,4\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,6\nhttps://leetcode.com/problems/sum-of-even-numbers-after-queries/,Sum of Even Numbers After Queries,1\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,25\nhttps://leetcode.com/problems/maximum-length-of-repeated-subarray/,Maximum Length of Repeated Subarray,8\nhttps://leetcode.com/problems/binary-tree-tilt/,Binary Tree Tilt,1\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,2\nhttps://leetcode.com/problems/word-search/,Word Search,9\nhttps://leetcode.com/problems/text-justification/,Text Justification,3\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,3\n" }, { "path": "companies/Info Edge.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/,Find the Minimum and Maximum Number of Nodes Between Critical Points,1\n" }, { "path": "companies/Infosys.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/,Sort Integers by The Number of 1 Bits,2\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,2\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,2\nhttps://leetcode.com/problems/4sum/,4 Sum,2\nhttps://leetcode.com/problems/3sum/,3Sum,2\n" }, { "path": "companies/Intel.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-string/,Reverse String,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/Intuit.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,2\nhttps://leetcode.com/problems/unique-email-addresses/,Unique Email Addresses,6\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,3\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,2\nhttps://leetcode.com/problems/decode-string/,Decode String,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,2\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,8\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,4\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,2\n" }, { "path": "companies/JP Morgan.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/,Lexicographically Smallest String After Applying Operations,JPMorgan\nhttps://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/,Display Table of Food Orders in a Restaurant,JPMorgan\n" }, { "path": "companies/JPMorgan.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/determine-color-of-a-chessboard-square/,Determine Color of a Chessboard Square,1\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,2\nhttps://leetcode.com/problems/even-odd-tree/,Even Odd Tree,3\nhttps://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/,Minimum Value to Get Positive Step by Step Sum,2\nhttps://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Maximum Number of Events That Can Be Attended,2\nhttps://leetcode.com/problems/minimum-absolute-difference/,Minimum Absolute Difference,2\nhttps://leetcode.com/problems/reconstruct-original-digits-from-english/,Reconstruct Original Digits from English,69\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,2\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,2\nhttps://leetcode.com/problems/paint-fence/,Paint Fence,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,5\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,8\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,2\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/Jane Street.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-common-words-with-one-occurrence/,Count Common Words With One Occurrence,1\n" }, { "path": "companies/Jeavio.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-moves-to-convert-string/,Minimum Moves to Convert String,1\n" }, { "path": "companies/Karat.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Check if Every Row and Column Contains All Numbers,4\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,16\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,12\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,2\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,40\nhttps://leetcode.com/problems/maximum-length-of-repeated-subarray/,Maximum Length of Repeated Subarray,16\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,3\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,5\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,4\nhttps://leetcode.com/problems/word-search/,Word Search,17\nhttps://leetcode.com/problems/text-justification/,Text Justification,10\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,3\n" }, { "path": "companies/Leap Motion.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/generate-random-point-in-a-circle/,Generate Random Point in a Circle,1\n" }, { "path": "companies/LinkedIn.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,5\nhttps://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/,Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold,1\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,2\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,2\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\nhttps://leetcode.com/problems/rotate-string/,Rotate String,2\nhttps://leetcode.com/problems/find-smallest-letter-greater-than-target/,Find Smallest Letter Greater Than Target,4\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,2\nhttps://leetcode.com/problems/max-stack/,Max Stack,33\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,5\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,2\nhttps://leetcode.com/problems/insert-into-a-binary-search-tree/,Insert into a Binary Search Tree,3\nhttps://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Partition to K Equal Sum Subsets,10\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,3\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,10\nhttps://leetcode.com/problems/second-minimum-node-in-a-binary-tree/,Second Minimum Node In a Binary Tree,11\nhttps://leetcode.com/problems/print-binary-tree/,Print Binary Tree,3\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,2\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,8\nhttps://leetcode.com/problems/valid-triangle-number/,Valid Triangle Number,2\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,21\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,8\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,5\nhttps://leetcode.com/problems/can-i-win/,Can I Win,3\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,2\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,3\nhttps://leetcode.com/problems/serialize-and-deserialize-bst/,Serialize and Deserialize BST,2\nhttps://leetcode.com/problems/all-oone-data-structure/,All O`one Data Structure,17\nhttps://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Insert Delete GetRandom O(1) - Duplicates allowed,4\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),15\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,8\nhttps://leetcode.com/problems/valid-perfect-square/,Valid Perfect Square,3\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,13\nhttps://leetcode.com/problems/nested-list-weight-sum-ii/,Nested List Weight Sum II,48\nhttps://leetcode.com/problems/sort-transformed-array/,Sort Transformed Array,10\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,8\nhttps://leetcode.com/problems/nested-list-weight-sum/,Nested List Weight Sum,34\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,3\nhttps://leetcode.com/problems/bulb-switcher/,Bulb Switcher,4\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,18\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,6\nhttps://leetcode.com/problems/closest-binary-search-tree-value-ii/,Closest Binary Search Tree Value II,26\nhttps://leetcode.com/problems/encode-and-decode-strings/,Encode and Decode Strings,2\nhttps://leetcode.com/problems/paint-house-ii/,Paint House II,3\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,8\nhttps://leetcode.com/problems/paint-house/,Paint House,5\nhttps://leetcode.com/problems/factor-combinations/,Factor Combinations,5\nhttps://leetcode.com/problems/shortest-word-distance-iii/,Shortest Word Distance III,2\nhttps://leetcode.com/problems/shortest-word-distance-ii/,Shortest Word Distance II,71\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,11\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,11\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,18\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,2\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,14\nhttps://leetcode.com/problems/isomorphic-strings/,Isomorphic Strings,6\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,16\nhttps://leetcode.com/problems/repeated-dna-sequences/,Repeated DNA Sequences,5\nhttps://leetcode.com/problems/two-sum-iii-data-structure-design/,Two Sum III - Data structure design,2\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,6\nhttps://leetcode.com/problems/binary-tree-upside-down/,Binary Tree Upside Down,9\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,29\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,8\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,8\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,5\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,7\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,10\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,2\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,9\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,5\nhttps://leetcode.com/problems/same-tree/,Same Tree,6\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,5\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,4\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,10\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,7\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),9\nhttps://leetcode.com/problems/text-justification/,Text Justification,18\nhttps://leetcode.com/problems/valid-number/,Valid Number,10\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,9\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,7\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,43\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",7\nhttps://leetcode.com/problems/permutations/,Permutations,6\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,17\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,5\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,33\nhttps://leetcode.com/problems/4sum/,4 Sum,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,2\n" }, { "path": "companies/LiveRamp.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/longest-harmonious-subsequence/,Longest Harmonious Subsequence,1\nhttps://leetcode.com/problems/distribute-candies/,Distribute Candies,1\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,3\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,3\n" }, { "path": "companies/Lyft.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,7\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,4\nhttps://leetcode.com/problems/max-stack/,Max Stack,2\nhttps://leetcode.com/problems/water-and-jug-problem/,Water and Jug Problem,4\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,4\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,8\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,2\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,4\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,7\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,9\n" }, { "path": "companies/MAQ Software.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/unique-substrings-in-wraparound-string/,Unique Substrings in Wraparound String,1\n" }, { "path": "companies/MakeMyTrip.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,2\n" }, { "path": "companies/Mathworks.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,3\nhttps://leetcode.com/problems/keyboard-row/,Keyboard Row,2\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,3\nhttps://leetcode.com/problems/coin-change/,Coin Change,5\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,5\nhttps://leetcode.com/problems/distinct-subsequences/,Distinct Subsequences,3\n" }, { "path": "companies/Mercari.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/crawler-log-folder/,Crawler Log Folder,1\nhttps://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/,Max Difference You Can Get From Changing an Integer,1\nhttps://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/,Minimum Subsequence in Non-Increasing Order,1\nhttps://leetcode.com/problems/count-largest-group/,Count Largest Group,1\n" }, { "path": "companies/Microsoft.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/remove-digit-from-number-to-maximize-result/,Remove Digit From Number to Maximize Result,2\nhttps://leetcode.com/problems/minimum-operations-to-halve-array-sum/,Minimum Operations to Halve Array Sum,1\nhttps://leetcode.com/problems/divide-array-into-equal-pairs/,Divide Array Into Equal Pairs,1\nhttps://leetcode.com/problems/merge-nodes-in-between-zeros/,Merge Nodes in Between Zeros,1\nhttps://leetcode.com/problems/check-if-all-as-appears-before-all-bs/,Check if All A's Appears Before All B's,1\nhttps://leetcode.com/problems/find-missing-observations/,Find Missing Observations,Amazon\nhttps://leetcode.com/problems/find-original-array-from-doubled-array/,Find Original Array From Doubled Array,2\nhttps://leetcode.com/problems/three-divisors/,Three Divisors,1\nhttps://leetcode.com/problems/sum-of-digits-of-string-after-convert/,Sum of Digits of String After Convert,1\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,3\nhttps://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/,Remove Duplicates From an Unsorted Linked List,2\nhttps://leetcode.com/problems/sign-of-the-product-of-an-array/,Sign of the Product of an Array,45\nhttps://leetcode.com/problems/find-center-of-star-graph/,Find Center of Star Graph,1\nhttps://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/,Check if Number is a Sum of Powers of Three,2\nhttps://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/,Equal Sum Arrays With Minimum Number of Operations,2\nhttps://leetcode.com/problems/closest-dessert-cost/,Closest Dessert Cost,2\nhttps://leetcode.com/problems/map-of-highest-peak/,Map of Highest Peak,2\nhttps://leetcode.com/problems/longest-nice-substring/,Longest Nice Substring,4\nhttps://leetcode.com/problems/maximum-number-of-balls-in-a-box/,Maximum Number of Balls in a Box,2\nhttps://leetcode.com/problems/maximum-number-of-eaten-apples/,Maximum Number of Eaten Apples,2\nhttps://leetcode.com/problems/ways-to-make-a-fair-array/,Ways to Make a Fair Array,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,5\nhttps://leetcode.com/problems/furthest-building-you-can-reach/,Furthest Building You Can Reach,2\nhttps://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/,Widest Vertical Area Between Two Points Containing No Points,1\nhttps://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/,Replace All ?'s to Avoid Consecutive Repeating Characters,2\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,2\nhttps://leetcode.com/problems/minimum-operations-to-make-array-equal/,Minimum Operations to Make Array Equal,2\nhttps://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/,Minimum Insertions to Balance a Parentheses String,4\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,2\nhttps://leetcode.com/problems/water-bottles/,Water Bottles,1\nhttps://leetcode.com/problems/number-of-good-pairs/,Number of Good Pairs,3\nhttps://leetcode.com/problems/making-file-names-unique/,Making File Names Unique,2\nhttps://leetcode.com/problems/running-sum-of-1d-array/,Running Sum of 1d Array,2\nhttps://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/,Delete N Nodes After M Nodes of a Linked List,1\nhttps://leetcode.com/problems/find-all-the-lonely-nodes/,Find All The Lonely Nodes,1\nhttps://leetcode.com/problems/count-good-nodes-in-binary-tree/,Count Good Nodes in Binary Tree,11\nhttps://leetcode.com/problems/reformat-the-string/,Reformat The String,1\nhttps://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/,The k-th Lexicographical String of All Happy Strings of Length n,1\nhttps://leetcode.com/problems/find-lucky-integer-in-an-array/,Find Lucky Integer in an Array,1\nhttps://leetcode.com/problems/cinema-seat-allocation/,Cinema Seat Allocation,17\nhttps://leetcode.com/problems/bulb-switcher-iii/,Bulb Switcher III,2\nhttps://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/,Generate a String With Characters That Have Odd Counts,2\nhttps://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/,Find the Longest Substring Containing Vowels in Even Counts,1\nhttps://leetcode.com/problems/linked-list-in-binary-tree/,Linked List in Binary Tree,2\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Number of Substrings Containing All Three Characters,2\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,5\nhttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Number of Steps to Reduce a Number to Zero,2\nhttps://leetcode.com/problems/sort-the-matrix-diagonally/,Sort the Matrix Diagonally,2\nhttps://leetcode.com/problems/print-words-vertically/,Print Words Vertically,1\nhttps://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/,Find N Unique Integers Sum up to Zero,22\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,10\nhttps://leetcode.com/problems/delete-tree-nodes/,Delete Tree Nodes,1\nhttps://leetcode.com/problems/count-servers-that-communicate/,Count Servers that Communicate,6\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,4\nhttps://leetcode.com/problems/check-if-it-is-a-straight-line/,Check If It Is a Straight Line,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,2\nhttps://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/,Reverse Substrings Between Each Pair of Parentheses,2\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,2\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,2\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,3\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,8\nhttps://leetcode.com/problems/letter-tile-possibilities/,Letter Tile Possibilities,3\nhttps://leetcode.com/problems/remove-outermost-parentheses/,Remove Outermost Parentheses,2\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,3\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,3\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,5\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,12\nhttps://leetcode.com/problems/cousins-in-binary-tree/,Cousins in Binary Tree,2\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,6\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,4\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,5\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,6\nhttps://leetcode.com/problems/validate-stack-sequences/,Validate Stack Sequences,2\nhttps://leetcode.com/problems/di-string-match/,DI String Match,2\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,2\nhttps://leetcode.com/problems/sort-array-by-parity-ii/,Sort Array By Parity II,2\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,3\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,2\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,2\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,5\nhttps://leetcode.com/problems/rotate-string/,Rotate String,2\nhttps://leetcode.com/problems/letter-case-permutation/,Letter Case Permutation,2\nhttps://leetcode.com/problems/minimum-distance-between-bst-nodes/,Minimum Distance Between BST Nodes,2\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,5\nhttps://leetcode.com/problems/monotone-increasing-digits/,Monotone Increasing Digits,2\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,4\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,2\nhttps://leetcode.com/problems/max-stack/,Max Stack,3\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,6\nhttps://leetcode.com/problems/design-hashset/,Design HashSet,2\nhttps://leetcode.com/problems/binary-search/,Binary Search,4\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,10\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,4\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,8\nhttps://leetcode.com/problems/longest-univalue-path/,Longest Univalue Path,2\nhttps://leetcode.com/problems/redundant-connection/,Redundant Connection,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,3\nhttps://leetcode.com/problems/bulb-switcher-ii/,Bulb Switcher II,1\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,2\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,3\nhttps://leetcode.com/problems/image-smoother/,Image Smoother,2\nhttps://leetcode.com/problems/4-keys-keyboard/,4 Keys Keyboard,2\nhttps://leetcode.com/problems/2-keys-keyboard/,2 Keys Keyboard,3\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,4\nhttps://leetcode.com/problems/decode-ways-ii/,Decode Ways II,2\nhttps://leetcode.com/problems/average-of-levels-in-binary-tree/,Average of Levels in Binary Tree,2\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,3\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,4\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,2\nhttps://leetcode.com/problems/valid-square/,Valid Square,2\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,10\nhttps://leetcode.com/problems/kill-process/,Kill Process,2\nhttps://leetcode.com/problems/shortest-unsorted-continuous-subarray/,Shortest Unsorted Continuous Subarray,3\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,3\nhttps://leetcode.com/problems/maximum-vacation-days/,Maximum Vacation Days,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,5\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,10\nhttps://leetcode.com/problems/maximum-depth-of-n-ary-tree/,Maximum Depth of N-ary Tree,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,5\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,9\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,3\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,5\nhttps://leetcode.com/problems/encode-and-decode-tinyurl/,Encode and Decode TinyURL,5\nhttps://leetcode.com/problems/lonely-pixel-i/,Lonely Pixel I,3\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,2\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,2\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,2\nhttps://leetcode.com/problems/super-washing-machines/,Super Washing Machines,2\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,3\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,4\nhttps://leetcode.com/problems/the-maze-ii/,The Maze II,2\nhttps://leetcode.com/problems/diagonal-traverse/,Diagonal Traverse,6\nhttps://leetcode.com/problems/the-maze/,The Maze,2\nhttps://leetcode.com/problems/max-consecutive-ones-ii/,Max Consecutive Ones II,2\nhttps://leetcode.com/problems/smallest-good-base/,Smallest Good Base,2\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,3\nhttps://leetcode.com/problems/heaters/,Heaters,2\nhttps://leetcode.com/problems/matchsticks-to-square/,Matchsticks to Square,2\nhttps://leetcode.com/problems/concatenated-words/,Concatenated Words,3\nhttps://leetcode.com/problems/validate-ip-address/,Validate IP Address,2\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/,Minimum Moves to Equal Array Elements II,5\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,11\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,5\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,6\nhttps://leetcode.com/problems/serialize-and-deserialize-bst/,Serialize and Deserialize BST,2\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,2\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,4\nhttps://leetcode.com/problems/string-compression/,String Compression,6\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,4\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,11\nhttps://leetcode.com/problems/non-overlapping-intervals/,Non-overlapping Intervals,2\nhttps://leetcode.com/problems/n-ary-tree-level-order-traversal/,N-ary Tree Level Order Traversal,3\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,4\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,5\nhttps://leetcode.com/problems/add-strings/,Add Strings,9\nhttps://leetcode.com/problems/fizz-buzz/,Fizz Buzz,3\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,3\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,3\nhttps://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/,Longest Substring with At Least K Repeating Characters,2\nhttps://leetcode.com/problems/decode-string/,Decode String,14\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,6\nhttps://leetcode.com/problems/linked-list-random-node/,Linked List Random Node,2\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),12\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,4\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,2\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,4\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,8\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,5\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,2\nhttps://leetcode.com/problems/data-stream-as-disjoint-intervals/,Data Stream as Disjoint Intervals,2\nhttps://leetcode.com/problems/android-unlock-patterns/,Android Unlock Patterns,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,2\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,7\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,12\nhttps://leetcode.com/problems/reverse-string/,Reverse String,5\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,2\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,2\nhttps://leetcode.com/problems/coin-change/,Coin Change,14\nhttps://leetcode.com/problems/bulb-switcher/,Bulb Switcher,3\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,7\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,5\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,3\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,6\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,20\nhttps://leetcode.com/problems/nim-game/,Nim Game,2\nhttps://leetcode.com/problems/game-of-life/,Game of Life,3\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,11\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,3\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,11\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,10\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,2\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,6\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,5\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,7\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,3\nhttps://leetcode.com/problems/missing-number/,Missing Number,13\nhttps://leetcode.com/problems/ugly-number-ii/,Ugly Number II,2\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,2\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,14\nhttps://leetcode.com/problems/count-univalue-subtrees/,Count Univalue Subtrees,3\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,2\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,6\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,5\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,6\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,15\nhttps://leetcode.com/problems/delete-node-in-a-linked-list/,Delete Node in a Linked List,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,10\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,10\nhttps://leetcode.com/problems/number-of-digit-one/,Number of Digit One,4\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,3\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,2\nhttps://leetcode.com/problems/majority-element-ii/,Majority Element II,3\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,11\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,5\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,7\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,2\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,4\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,3\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,12\nhttps://leetcode.com/problems/shortest-palindrome/,Shortest Palindrome,3\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,7\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,4\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,10\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,4\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,5\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,10\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,10\nhttps://leetcode.com/problems/count-primes/,Count Primes,4\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,42\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,2\nhttps://leetcode.com/problems/house-robber/,House Robber,5\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,7\nhttps://leetcode.com/problems/reverse-words-in-a-string-ii/,Reverse Words in a String II,4\nhttps://leetcode.com/problems/largest-number/,Largest Number,4\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,9\nhttps://leetcode.com/problems/excel-sheet-column-number/,Excel Sheet Column Number,6\nhttps://leetcode.com/problems/majority-element/,Majority Element,6\nhttps://leetcode.com/problems/excel-sheet-column-title/,Excel Sheet Column Title,4\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,2\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,4\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,2\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,8\nhttps://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/,Longest Substring with At Most Two Distinct Characters,2\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,2\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,4\nhttps://leetcode.com/problems/min-stack/,Min Stack,10\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,7\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,3\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,34\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,2\nhttps://leetcode.com/problems/sort-list/,Sort List,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,52\nhttps://leetcode.com/problems/reorder-list/,Reorder List,4\nhttps://leetcode.com/problems/linked-list-cycle-ii/,Linked List Cycle II,2\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,3\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,3\nhttps://leetcode.com/problems/word-break/,Word Break,5\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,12\nhttps://leetcode.com/problems/single-number/,Single Number,5\nhttps://leetcode.com/problems/gas-station/,Gas Station,7\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,4\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers/,Sum Root to Leaf Numbers,4\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,8\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,6\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,2\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,8\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,7\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,14\nhttps://leetcode.com/problems/triangle/,Triangle,3\nhttps://leetcode.com/problems/pascals-triangle-ii/,Pascal's Triangle II,2\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,4\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,6\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,2\nhttps://leetcode.com/problems/path-sum/,Path Sum,7\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,3\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,2\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,4\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,3\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,13\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,7\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,5\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,4\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,6\nhttps://leetcode.com/problems/unique-binary-search-trees-ii/,Unique Binary Search Trees II,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,4\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,3\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,5\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,4\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,10\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,6\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Remove Duplicates from Sorted List II,2\nhttps://leetcode.com/problems/word-search/,Word Search,16\nhttps://leetcode.com/problems/subsets/,Subsets,3\nhttps://leetcode.com/problems/combinations/,Combinations,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,7\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,8\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,7\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,8\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,6\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,7\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),3\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,5\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,2\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,9\nhttps://leetcode.com/problems/rotate-list/,Rotate List,4\nhttps://leetcode.com/problems/length-of-last-word/,Length of Last Word,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,15\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,26\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,15\nhttps://leetcode.com/problems/n-queens/,N-Queens,4\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",5\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,29\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,9\nhttps://leetcode.com/problems/permutations-ii/,Permutations II,3\nhttps://leetcode.com/problems/permutations/,Permutations,5\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,2\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,14\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,12\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,9\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,16\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,6\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,5\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,8\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,24\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,2\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,2\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,3\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),4\nhttps://leetcode.com/problems/remove-element/,Remove Element,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,6\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,13\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,7\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,17\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,13\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,13\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,22\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,6\nhttps://leetcode.com/problems/4sum/,4 Sum,4\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,20\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,3\nhttps://leetcode.com/problems/3sum/,3Sum,20\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,5\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,6\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,5\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,9\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,11\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),16\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,2\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,18\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,15\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,29\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,17\nhttps://leetcode.com/problems/two-sum/,Two Sum,39\n" }, { "path": "companies/MindTickle.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\n" }, { "path": "companies/MindTree.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-integers-with-even-digit-sum/,Count Integers With Even Digit Sum,1\n" }, { "path": "companies/Moengage.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/,Redistribute Characters to Make All Strings Equal,1\n" }, { "path": "companies/Morgan Stanley.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/best-team-with-no-conflicts/,Best Team With No Conflicts,1\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,2\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,4\nhttps://leetcode.com/problems/3sum/,3Sum,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/National Instruments.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\n" }, { "path": "companies/Netflix.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,4\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,3\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n" }, { "path": "companies/Netsuite.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/,Average Salary Excluding the Minimum and Maximum Salary,1\n" }, { "path": "companies/Nuro.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/subrectangle-queries/,Subrectangle Queries,1\n" }, { "path": "companies/Nutanix.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-word-is-valid-after-substitutions/,Check If Word Is Valid After Substitutions,1\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,2\n" }, { "path": "companies/Nvidia.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,8\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,2\nhttps://leetcode.com/problems/k-empty-slots/,K Empty Slots,2\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,2\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,2\nhttps://leetcode.com/problems/lonely-pixel-i/,Lonely Pixel I,3\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,4\nhttps://leetcode.com/problems/missing-number/,Missing Number,2\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,2\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,3\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,3\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,2\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,2\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,4\n" }, { "path": "companies/OT.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,1\n" }, { "path": "companies/Opendoor.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-excel-sum-formula/,Design Excel Sum Formula,3\nhttps://leetcode.com/problems/game-of-life/,Game of Life,10\n" }, { "path": "companies/Optum.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-prefix-of-word/,Reverse Prefix of Word,1\n" }, { "path": "companies/Oracle.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,3\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,2\nhttps://leetcode.com/problems/html-entity-parser/,HTML Entity Parser,1\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,2\nhttps://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/,Convert Binary Number in a Linked List to Integer,2\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,3\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,2\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,3\nhttps://leetcode.com/problems/shifting-letters/,Shifting Letters,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,2\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,3\nhttps://leetcode.com/problems/split-linked-list-in-parts/,Split Linked List in Parts,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,4\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,2\nhttps://leetcode.com/problems/minimum-index-sum-of-two-lists/,Minimum Index Sum of Two Lists,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,4\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,7\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,2\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,3\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,2\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,4\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,2\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,3\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,2\nhttps://leetcode.com/problems/add-strings/,Add Strings,4\nhttps://leetcode.com/problems/decode-string/,Decode String,6\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,5\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,7\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,2\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,3\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify Preorder Sequence in Binary Search Tree,2\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,13\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,2\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,4\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,3\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,3\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,9\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,3\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,2\nhttps://leetcode.com/problems/factorial-trailing-zeroes/,Factorial Trailing Zeroes,2\nhttps://leetcode.com/problems/min-stack/,Min Stack,2\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,2\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,13\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,3\nhttps://leetcode.com/problems/word-break/,Word Break,3\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,4\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,2\nhttps://leetcode.com/problems/path-sum/,Path Sum,2\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,2\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,4\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,2\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,2\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,3\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,4\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,4\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,3\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,5\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,2\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,3\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,4\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,6\nhttps://leetcode.com/problems/3sum/,3Sum,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,2\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,7\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,4\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,6\n" }, { "path": "companies/Palantir Technologies.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-it-is-a-straight-line/,Check If It Is a Straight Line,1\nhttps://leetcode.com/problems/utf-8-validation/,UTF-8 Validation,2\n" }, { "path": "companies/PayTM.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/distribute-candies-to-people/,Distribute Candies to People,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,2\n" }, { "path": "companies/Paypal.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/,Reverse Substrings Between Each Pair of Parentheses,2\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,2\nhttps://leetcode.com/problems/happy-number/,Happy Number,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,3\nhttps://leetcode.com/problems/zigzag-conversion/,ZigZag Conversion,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,3\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/PhonePe.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/simple-bank-system/,Simple Bank System,1\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,2\n" }, { "path": "companies/Pinterest.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/parallel-courses-iii/,Parallel Courses III,4\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,2\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,2\nhttps://leetcode.com/problems/word-pattern-ii/,Word Pattern II,2\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,3\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,2\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,2\n" }, { "path": "companies/Pocket Gems.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/non-negative-integers-without-consecutive-ones/,Non-negative Integers without Consecutive Ones,1\n" }, { "path": "companies/Postmates.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/most-beautiful-item-for-each-query/,Most Beautiful Item for Each Query,razorpay\nhttps://leetcode.com/problems/determine-if-two-strings-are-close/,Determine if Two Strings Are Close,1\nhttps://leetcode.com/problems/print-words-vertically/,Print Words Vertically,2\n" }, { "path": "companies/Pure Storage.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-repeating-substring/,Maximum Repeating Substring,3\nhttps://leetcode.com/problems/valid-square/,Valid Square,2\n" }, { "path": "companies/Qualcomm.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,2\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,2\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,3\n" }, { "path": "companies/Qualtrics.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-integers-by-the-power-value/,Sort Integers by The Power Value,2\nhttps://leetcode.com/problems/fixed-point/,Fixed Point,2\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,4\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,3\nhttps://leetcode.com/problems/summary-ranges/,Summary Ranges,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,4\nhttps://leetcode.com/problems/word-break/,Word Break,7\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,6\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,2\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,4\nhttps://leetcode.com/problems/jump-game/,Jump Game,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,4\nhttps://leetcode.com/problems/3sum/,3Sum,5\n" }, { "path": "companies/Quora.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/range-frequency-queries/,Range Frequency Queries,1\nhttps://leetcode.com/problems/maximum-number-of-words-you-can-type/,Maximum Number of Words You Can Type,1\nhttps://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/,Substrings of Size Three with Distinct Characters,1\nhttps://leetcode.com/problems/construct-target-array-with-multiple-sums/,Construct Target Array With Multiple Sums,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,2\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,3\n" }, { "path": "companies/Rakuten.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sum-of-floored-pairs/,Sum of Floored Pairs,1\n" }, { "path": "companies/Reddit.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/subsets/,Subsets,3\nhttps://leetcode.com/problems/text-justification/,Text Justification,3\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,3\n" }, { "path": "companies/Redfin.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/string-compression/,String Compression,3\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),3\n" }, { "path": "companies/Riot Games.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/teemo-attacking/,Teemo Attacking,1\n" }, { "path": "companies/Robinhood.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,1\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,8\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,7\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,3\n" }, { "path": "companies/Roblox.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,5\nhttps://leetcode.com/problems/minimum-falling-path-sum-ii/,Minimum Falling Path Sum II,4\nhttps://leetcode.com/problems/number-of-matching-subsequences/,Number of Matching Subsequences,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,5\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,2\n" }, { "path": "companies/Rubrik.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,5\nhttps://leetcode.com/problems/kth-smallest-number-in-multiplication-table/,Kth Smallest Number in Multiplication Table,4\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,2\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,2\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,2\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,4\n" }, { "path": "companies/Rupeek.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-kth-bit-in-nth-binary-string/,Find Kth Bit in Nth Binary String,1\n" }, { "path": "companies/SAP.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-students-taking-exam/,Maximum Students Taking Exam,1\nhttps://leetcode.com/problems/prison-cells-after-n-days/,Prison Cells After N Days,2\nhttps://leetcode.com/problems/monotone-increasing-digits/,Monotone Increasing Digits,9\nhttps://leetcode.com/problems/count-primes/,Count Primes,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,4\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,3\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,2\n" }, { "path": "companies/Salesforce.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/,Check Whether Two Strings are Almost Equivalent,1\nhttps://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/,Construct the Lexicographically Largest Valid Sequence,3\nhttps://leetcode.com/problems/count-sorted-vowel-strings/,Count Sorted Vowel Strings,2\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,2\nhttps://leetcode.com/problems/count-good-nodes-in-binary-tree/,Count Good Nodes in Binary Tree,2\nhttps://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Maximum Number of Events That Can Be Attended,2\nhttps://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/,Find the Smallest Divisor Given a Threshold,3\nhttps://leetcode.com/problems/minimum-absolute-difference/,Minimum Absolute Difference,3\nhttps://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/,Check If a Number Is Majority Element in a Sorted Array,1\nhttps://leetcode.com/problems/height-checker/,Height Checker,1\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,5\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,3\nhttps://leetcode.com/problems/maximum-product-of-three-numbers/,Maximum Product of Three Numbers,7\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,3\nhttps://leetcode.com/problems/teemo-attacking/,Teemo Attacking,2\nhttps://leetcode.com/problems/zuma-game/,Zuma Game,6\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,2\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,2\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,3\nhttps://leetcode.com/problems/missing-number/,Missing Number,2\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,6\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,3\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,6\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,6\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,3\nhttps://leetcode.com/problems/min-stack/,Min Stack,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,10\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,3\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,19\nhttps://leetcode.com/problems/jump-game/,Jump Game,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\nhttps://leetcode.com/problems/3sum/,3Sum,3\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/Samsung.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum Product of Two Elements in an Array,1\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,3\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,2\n" }, { "path": "companies/Sapient.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\n" }, { "path": "companies/ServiceNow.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,2\nhttps://leetcode.com/problems/rectangle-overlap/,Rectangle Overlap,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,4\n" }, { "path": "companies/Shopee.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\nhttps://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/,Construct Binary Tree from Inorder and Postorder Traversal,3\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,4\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,4\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,5\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,2\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,3\n" }, { "path": "companies/Snapchat.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/largest-merge-of-two-strings/,Largest Merge Of Two Strings,1\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,2\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,3\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,3\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,2\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,2\nhttps://leetcode.com/problems/word-abbreviation/,Word Abbreviation,1\nhttps://leetcode.com/problems/the-maze/,The Maze,3\nhttps://leetcode.com/problems/predict-the-winner/,Predict the Winner,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,3\nhttps://leetcode.com/problems/ternary-expression-parser/,Ternary Expression Parser,1\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,5\nhttps://leetcode.com/problems/decode-string/,Decode String,5\nhttps://leetcode.com/problems/android-unlock-patterns/,Android Unlock Patterns,3\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,5\nhttps://leetcode.com/problems/minimum-height-trees/,Minimum Height Trees,2\nhttps://leetcode.com/problems/game-of-life/,Game of Life,2\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,2\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,2\nhttps://leetcode.com/problems/different-ways-to-add-parentheses/,Different Ways to Add Parentheses,2\nhttps://leetcode.com/problems/power-of-two/,Power of Two,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,3\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,2\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,5\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,2\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,4\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,3\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,3\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,4\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,3\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,3\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,2\nhttps://leetcode.com/problems/word-search/,Word Search,7\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,2\nhttps://leetcode.com/problems/add-binary/,Add Binary,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,5\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,3\n" }, { "path": "companies/Softwire.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/second-largest-digit-in-a-string/,Second Largest Digit in a String,1\n" }, { "path": "companies/Sony.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,2\n" }, { "path": "companies/Splunk.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,2\n" }, { "path": "companies/Spotify.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,2\nhttps://leetcode.com/problems/analyze-user-website-visit-pattern/,Analyze User Website Visit Pattern,6\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,4\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,10\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,16\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,8\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,4\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,3\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,4\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,4\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,13\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,10\nhttps://leetcode.com/problems/two-sum/,Two Sum,8\n" }, { "path": "companies/Sprinklr.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/next-greater-numerically-balanced-number/,Next Greater Numerically Balanced Number,1\nhttps://leetcode.com/problems/maximum-subarray-sum-after-one-operation/,Maximum Subarray Sum After One Operation,1\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,2\n" }, { "path": "companies/Square.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,2\nhttps://leetcode.com/problems/available-captures-for-rook/,Available Captures for Rook,2\nhttps://leetcode.com/problems/unique-morse-code-words/,Unique Morse Code Words,2\nhttps://leetcode.com/problems/squirrel-simulation/,Squirrel Simulation,1\nhttps://leetcode.com/problems/the-maze/,The Maze,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,2\nhttps://leetcode.com/problems/text-justification/,Text Justification,3\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,2\n" }, { "path": "companies/Sumologic.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,2\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,2\nhttps://leetcode.com/problems/decode-string/,Decode String,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,3\n" }, { "path": "companies/Swiggy.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,2\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,3\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,4\n" }, { "path": "companies/T System.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/grid-game/,Grid Game,1\n" }, { "path": "companies/TIAA.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-greatest-common-divisor-of-array/,Find Greatest Common Divisor of Array,1\n" }, { "path": "companies/Tencent.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-factorization/,Minimum Factorization,1\n" }, { "path": "companies/Tesla.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/,Minimum Changes To Make Alternating Binary String,2\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,2\nhttps://leetcode.com/problems/largest-perimeter-triangle/,Largest Perimeter Triangle,3\nhttps://leetcode.com/problems/spiral-matrix-iii/,Spiral Matrix III,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,2\nhttps://leetcode.com/problems/3sum/,3Sum,2\n" }, { "path": "companies/Thumbtack.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/vowel-spellchecker/,Vowel Spellchecker,1\n" }, { "path": "companies/Tiger Analytics.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-closest-number-to-zero/,Find Closest Number to Zero,1\n" }, { "path": "companies/Toptal.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reformat-phone-number/,Reformat Phone Number,3\n" }, { "path": "companies/TripleByte.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Minimum ASCII Delete Sum for Two Strings,4\n" }, { "path": "companies/TuSimple.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/binary-tree-postorder-traversal/,Binary Tree Postorder Traversal,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,2\n" }, { "path": "companies/Twilio.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,2\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,3\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,3\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,5\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,7\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,2\nhttps://leetcode.com/problems/text-justification/,Text Justification,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,3\n" }, { "path": "companies/Twitch.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,7\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,2\n" }, { "path": "companies/Twitter.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/time-needed-to-buy-tickets/,Time Needed to Buy Tickets,2\nhttps://leetcode.com/problems/finding-the-users-active-minutes/,Finding the Users Active Minutes,10\nhttps://leetcode.com/problems/design-authentication-manager/,Design Authentication Manager,1\nhttps://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/,Minimum Elements to Add to Form a Given Sum,1\nhttps://leetcode.com/problems/tweet-counts-per-frequency/,Tweet Counts Per Frequency,6\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,2\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\nhttps://leetcode.com/problems/binary-gap/,Binary Gap,eBay\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,3\nhttps://leetcode.com/problems/palindromic-substrings/,Palindromic Substrings,2\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,2\nhttps://leetcode.com/problems/design-log-storage-system/,Design Log Storage System,5\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,2\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,3\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),5\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,7\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,3\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,3\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,4\nhttps://leetcode.com/problems/paint-house/,Paint House,4\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,5\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,6\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,2\nhttps://leetcode.com/problems/word-search/,Word Search,23\nhttps://leetcode.com/problems/subsets/,Subsets,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,3\n" }, { "path": "companies/Two Sigma.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-product-of-splitted-binary-tree/,Maximum Product of Splitted Binary Tree,4\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,2\nhttps://leetcode.com/problems/power-of-four/,Power of Four,Wix\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,4\n" }, { "path": "companies/Uber.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/intersection-of-multiple-arrays/,Intersection of Multiple Arrays,1\nhttps://leetcode.com/problems/calculate-digit-sum-of-a-string/,Calculate Digit Sum of a String,1\nhttps://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/,Number of Strings That Appear as Substrings in Word,1\nhttps://leetcode.com/problems/check-if-string-is-a-prefix-of-array/,Check If String Is a Prefix of Array,1\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,2\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,4\nhttps://leetcode.com/problems/maximum-xor-for-each-query/,Maximum XOR for Each Query,1\nhttps://leetcode.com/problems/count-nice-pairs-in-an-array/,Count Nice Pairs in an Array,3\nhttps://leetcode.com/problems/merge-strings-alternately/,Merge Strings Alternately,3\nhttps://leetcode.com/problems/maximum-number-of-eaten-apples/,Maximum Number of Eaten Apples,1\nhttps://leetcode.com/problems/best-team-with-no-conflicts/,Best Team With No Conflicts,2\nhttps://leetcode.com/problems/special-positions-in-a-binary-matrix/,Special Positions in a Binary Matrix,2\nhttps://leetcode.com/problems/thousand-separator/,Thousand Separator,2\nhttps://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,14\nhttps://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Leftmost Column with at Least a One,10\nhttps://leetcode.com/problems/construct-k-palindrome-strings/,Construct K Palindrome Strings,7\nhttps://leetcode.com/problems/find-the-distance-value-between-two-arrays/,Find the Distance Value Between Two Arrays,2\nhttps://leetcode.com/problems/iterator-for-combination/,Iterator for Combination,2\nhttps://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/,Subtract the Product and Sum of Digits of an Integer,5\nhttps://leetcode.com/problems/shortest-distance-to-target-color/,Shortest Distance to Target Color,2\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,2\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,3\nhttps://leetcode.com/problems/fair-candy-swap/,Fair Candy Swap,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,2\nhttps://leetcode.com/problems/champagne-tower/,Champagne Tower,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,2\nhttps://leetcode.com/problems/largest-plus-sign/,Largest Plus Sign,3\nhttps://leetcode.com/problems/set-intersection-size-at-least-two/,Set Intersection Size At Least Two,7\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,2\nhttps://leetcode.com/problems/my-calendar-i/,My Calendar I,4\nhttps://leetcode.com/problems/binary-search/,Binary Search,2\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,17\nhttps://leetcode.com/problems/baseball-game/,Baseball Game,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,2\nhttps://leetcode.com/problems/two-sum-iv-input-is-a-bst/,Two Sum IV - Input is a BST,2\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,2\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,2\nhttps://leetcode.com/problems/remove-boxes/,Remove Boxes,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,7\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,13\nhttps://leetcode.com/problems/ipo/,IPO,5\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,8\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,2\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,3\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,4\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,3\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,14\nhttps://leetcode.com/problems/decode-string/,Decode String,3\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),7\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,2\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,2\nhttps://leetcode.com/problems/bomb-enemy/,Bomb Enemy,4\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,6\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,2\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,10\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,3\nhttps://leetcode.com/problems/number-of-islands-ii/,Number of Islands II,5\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,4\nhttps://leetcode.com/problems/word-pattern-ii/,Word Pattern II,3\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,2\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,3\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,2\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,3\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,2\nhttps://leetcode.com/problems/strobogrammatic-number-ii/,Strobogrammatic Number II,3\nhttps://leetcode.com/problems/strobogrammatic-number/,Strobogrammatic Number,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,5\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,8\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,11\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,2\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,3\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,5\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,2\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,2\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,36\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,2\nhttps://leetcode.com/problems/happy-number/,Happy Number,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,7\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,2\nhttps://leetcode.com/problems/dungeon-game/,Dungeon Game,12\nhttps://leetcode.com/problems/majority-element/,Majority Element,2\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,5\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,2\nhttps://leetcode.com/problems/single-number/,Single Number,2\nhttps://leetcode.com/problems/gas-station/,Gas Station,2\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Best Time to Buy and Sell Stock III,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,7\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,2\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,2\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,2\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,2\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,4\nhttps://leetcode.com/problems/word-search/,Word Search,17\nhttps://leetcode.com/problems/subsets/,Subsets,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,2\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,4\nhttps://leetcode.com/problems/text-justification/,Text Justification,6\nhttps://leetcode.com/problems/add-binary/,Add Binary,2\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,14\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,4\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,3\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,2\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,5\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,3\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,5\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,2\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),2\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,2\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,9\nhttps://leetcode.com/problems/3sum/,3Sum,6\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,4\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,5\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,11\n" }, { "path": "companies/United Health Group.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/,Check If All 1's Are at Least Length K Places Away,1\nhttps://leetcode.com/problems/day-of-the-week/,Day of the Week,1\n" }, { "path": "companies/VMware.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Sentence,2\nhttps://leetcode.com/problems/missing-number-in-arithmetic-progression/,Missing Number In Arithmetic Progression,2\nhttps://leetcode.com/problems/longest-repeating-substring/,Longest Repeating Substring,2\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,4\nhttps://leetcode.com/problems/max-stack/,Max Stack,3\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,2\nhttps://leetcode.com/problems/all-oone-data-structure/,All O`one Data Structure,2\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,2\nhttps://leetcode.com/problems/missing-number/,Missing Number,2\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify Preorder Sequence in Binary Search Tree,4\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,5\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,4\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,3\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,4\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,5\nhttps://leetcode.com/problems/3sum/,3Sum,3\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,5\n" }, { "path": "companies/Valve.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/dota2-senate/,Dota2 Senate,1\n" }, { "path": "companies/Virtu Financial.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-number-of-homogenous-substrings/,Count Number of Homogenous Substrings,1\nhttps://leetcode.com/problems/hexspeak/,Hexspeak,2\nhttps://leetcode.com/problems/array-transformation/,Array Transformation,2\nhttps://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/,How Many Apples Can You Put into the Basket,2\nhttps://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/,Count Substrings with Only One Distinct Letter,2\n" }, { "path": "companies/Visa.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target Array in the Given Order,1\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,2\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,11\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,4\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,3\nhttps://leetcode.com/problems/string-compression/,String Compression,4\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,3\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,6\nhttps://leetcode.com/problems/largest-number/,Largest Number,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,2\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,3\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,2\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,4\n" }, { "path": "companies/Walmart Global Tech.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/,Remove Colored Pieces if Both Neighbors are the Same Color,9\nhttps://leetcode.com/problems/slowest-key/,Slowest Key,2\nhttps://leetcode.com/problems/reformat-date/,Reformat Date,2\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,2\nhttps://leetcode.com/problems/find-smallest-common-element-in-all-rows/,Find Smallest Common Element in All Rows,2\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,3\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,3\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,2\nhttps://leetcode.com/problems/strange-printer/,Strange Printer,4\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,2\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,2\nhttps://leetcode.com/problems/decode-string/,Decode String,2\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,2\nhttps://leetcode.com/problems/design-twitter/,Design Twitter,2\nhttps://leetcode.com/problems/paint-house-ii/,Paint House II,2\nhttps://leetcode.com/problems/house-robber/,House Robber,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,4\nhttps://leetcode.com/problems/gas-station/,Gas Station,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,3\nhttps://leetcode.com/problems/path-sum/,Path Sum,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,5\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,5\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,2\nhttps://leetcode.com/problems/count-and-say/,Count and Say,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,5\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,2\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,3\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,3\nhttps://leetcode.com/problems/3sum/,3Sum,7\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n" }, { "path": "companies/Wayfair.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-moves-to-reach-target-score/,Minimum Moves to Reach Target Score,1\nhttps://leetcode.com/problems/delete-characters-to-make-fancy-string/,Delete Characters to Make Fancy String,1\nhttps://leetcode.com/problems/the-number-of-full-rounds-you-have-played/,The Number of Full Rounds You Have Played,4\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,5\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,9\nhttps://leetcode.com/problems/max-chunks-to-make-sorted/,Max Chunks To Make Sorted,2\nhttps://leetcode.com/problems/maximum-length-of-repeated-subarray/,Maximum Length of Repeated Subarray,7\nhttps://leetcode.com/problems/add-strings/,Add Strings,20\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,4\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,2\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,3\n" }, { "path": "companies/Wealthfront.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/,Minimum Number of Steps to Make Two Strings Anagram II,1\n" }, { "path": "companies/Wish.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-right-interval/,Find Right Interval,2\n" }, { "path": "companies/Works Applications.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/k-inverse-pairs-array/,K Inverse Pairs Array,1\n" }, { "path": "companies/Yahoo.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum Product of Two Elements in an Array,2\nhttps://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/,How Many Numbers Are Smaller Than the Current Number,2\nhttps://leetcode.com/problems/matrix-cells-in-distance-order/,Matrix Cells in Distance Order,1\nhttps://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Sum of Root To Leaf Binary Numbers,2\nhttps://leetcode.com/problems/binary-search/,Binary Search,2\nhttps://leetcode.com/problems/binary-number-with-alternating-bits/,Binary Number with Alternating Bits,1\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,4\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,3\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,2\nhttps://leetcode.com/problems/maximum-distance-in-arrays/,Maximum Distance in Arrays,1\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,3\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,2\nhttps://leetcode.com/problems/find-bottom-left-tree-value/,Find Bottom Left Tree Value,2\nhttps://leetcode.com/problems/increasing-subsequences/,Increasing Subsequences,1\nhttps://leetcode.com/problems/largest-palindrome-product/,Largest Palindrome Product,1\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,3\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,3\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,4\nhttps://leetcode.com/problems/coin-change/,Coin Change,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,2\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,2\nhttps://leetcode.com/problems/one-edit-distance/,One Edit Distance,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,3\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,5\nhttps://leetcode.com/problems/scramble-string/,Scramble String,2\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,3\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,2\nhttps://leetcode.com/problems/4sum/,4 Sum,2\nhttps://leetcode.com/problems/3sum/,3Sum,5\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,4\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,4\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,6\nhttps://leetcode.com/problems/two-sum/,Two Sum,4\n" }, { "path": "companies/Yandex.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/,Longest Subarray of 1's After Deleting One Element,3\nhttps://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/,Number of Students Doing Homework at a Given Time,2\nhttps://leetcode.com/problems/number-of-recent-calls/,Number of Recent Calls,3\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,8\nhttps://leetcode.com/problems/max-stack/,Max Stack,3\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,4\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,2\nhttps://leetcode.com/problems/string-compression/,String Compression,3\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,3\nhttps://leetcode.com/problems/line-reflection/,Line Reflection,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,6\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,6\nhttps://leetcode.com/problems/summary-ranges/,Summary Ranges,6\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,3\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,2\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,4\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,3\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,2\n" }, { "path": "companies/Yelp.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/destination-city/,Destination City,5\nhttps://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/,\"Filter Restaurants by Vegan-Friendly, Price and Distance\",4\nhttps://leetcode.com/problems/minimum-index-sum-of-two-lists/,Minimum Index Sum of Two Lists,1\n" }, { "path": "companies/ZScaler.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/day-of-the-year/,Day of the Year,1\n" }, { "path": "companies/Zenefits.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify Preorder Sequence in Binary Search Tree,1\nhttps://leetcode.com/problems/n-queens-ii/,N-Queens II,1\n" }, { "path": "companies/Zillow.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,2\n" }, { "path": "companies/Zoho.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-even-and-odd-indices-independently/,Sort Even and Odd Indices Independently,1\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,4\n" }, { "path": "companies/Zomato.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-sum/,Two Sum,2\n" }, { "path": "companies/Zoom.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotate-string/,Rotate String,4\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,2\n" }, { "path": "companies/Zopsmart.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-nodes-in-even-length-groups/,Reverse Nodes in Even Length Groups,1\n" }, { "path": "companies/eBay.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,3\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,2\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,2\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,2\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,4\n" }, { "path": "companies/edabit.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/calculate-money-in-leetcode-bank/,Calculate Money in Leetcode Bank,1\n" }, { "path": "companies/instacart.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Check if Every Row and Column Contains All Numbers,2\n" }, { "path": "companies/payu.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-operations-to-obtain-zero/,Count Operations to Obtain Zero,1\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,2\n" }, { "path": "companies/peak6.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/coordinate-with-maximum-network-quality/,Coordinate With Maximum Network Quality,1\n" }, { "path": "companies/persistent systems.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-bit-flips-to-convert-number/,Minimum Bit Flips to Convert Number,1\n" }, { "path": "companies/razorpay.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-best-non-overlapping-events/,Two Best Non-Overlapping Events,1\n" }, { "path": "companies/tcs.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-ascending-subarray-sum/,Maximum Ascending Subarray Sum,1\nhttps://leetcode.com/problems/palindrome-partitioning-iv/,Palindrome Partitioning IV,1\nhttps://leetcode.com/problems/reverse-string/,Reverse String,3\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,4\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n" }, { "path": "companies/tiktok.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/plates-between-candles/,Plates Between Candles,3\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number of Weak Characters in the Game,3\nhttps://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/,Minimum Time to Type Word Using Special Typewriter,3\nhttps://leetcode.com/problems/incremental-memory-leak/,Incremental Memory Leak,1\nhttps://leetcode.com/problems/closest-dessert-cost/,Closest Dessert Cost,2\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,3\nhttps://leetcode.com/problems/reformat-date/,Reformat Date,10\nhttps://leetcode.com/problems/design-a-stack-with-increment-operation/,Design a Stack With Increment Operation,13\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,2\nhttps://leetcode.com/problems/jump-game-iv/,Jump Game IV,2\nhttps://leetcode.com/problems/path-with-maximum-gold/,Path with Maximum Gold,2\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,3\nhttps://leetcode.com/problems/validate-stack-sequences/,Validate Stack Sequences,2\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,2\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,2\nhttps://leetcode.com/problems/custom-sort-string/,Custom Sort String,2\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,5\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,8\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,4\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,5\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,2\nhttps://leetcode.com/problems/max-consecutive-ones-ii/,Max Consecutive Ones II,3\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,4\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,6\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,2\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,4\nhttps://leetcode.com/problems/decode-string/,Decode String,5\nhttps://leetcode.com/problems/russian-doll-envelopes/,Russian Doll Envelopes,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,3\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,2\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,4\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,5\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,3\nhttps://leetcode.com/problems/count-complete-tree-nodes/,Count Complete Tree Nodes,4\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,3\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,7\nhttps://leetcode.com/problems/count-primes/,Count Primes,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,6\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,6\nhttps://leetcode.com/problems/gas-station/,Gas Station,5\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,3\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,6\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,3\nhttps://leetcode.com/problems/spiral-matrix-ii/,Spiral Matrix II,6\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,2\nhttps://leetcode.com/problems/n-queens/,N-Queens,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,3\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,4\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,3\nhttps://leetcode.com/problems/3sum/,3Sum,4\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,5\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,2\n" }, { "path": "companies/zeta suite.csv", "content": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/,Count Equal and Divisible Pairs in an Array,1\n" }, { "path": "data/companies_and_leetcode_problems.csv", "content": "01 Matrix,1-bit and 2-bit Characters,132 Pattern,2 Keys Keyboard,24 Game,3Sum,3Sum Closest,3Sum With Multiplicity,4 Keys Keyboard,4 Sum,4Sum II,Accounts Merge,Add Binary,Add Bold Tag in String,Add Digits,Add One Row to Tree,Add Strings,Add Two Numbers,Add Two Numbers II,Add and Search Word - Data structure design,Add to Array-Form of Integer,Adding Spaces to a String,Additive Number,Advantage Shuffle,Alert Using Same Key-Card Three or More Times in a One Hour Period,Alien Dictionary,All Divisions With the Highest Score of a Binary Array,All Elements in Two Binary Search Trees,All O`one Data Structure,Alphabet Board Path,Ambiguous Coordinates,Analyze User Website Visit Pattern,Android Unlock Patterns,Angle Between Hands of a Clock,Apply Discount Every n Orders,Arithmetic Slices,Arithmetic Slices II - Subsequence,Arithmetic Subarrays,Armstrong Number,Array Nesting,Array Partition I,Array Transformation,Array With Elements Not Equal to Average of Neighbors,Array of Doubled Pairs,Assign Cookies,Asteroid Collision,Available Captures for Rook,Average Salary Excluding the Minimum and Maximum Salary,Average of Levels in Binary Tree,Backspace String Compare,Balance a Binary Search Tree,Balanced Binary Tree,Base 7,Baseball Game,Basic Calculator,Basic Calculator II,Battleships in a Board,Beautiful Arrangement,Beautiful Arrangement II,Best Meeting Point,Best Sightseeing Pair,Best Team With No Conflicts,Best Time to Buy and Sell Stock,Best Time to Buy and Sell Stock II,Best Time to Buy and Sell Stock III,Best Time to Buy and Sell Stock IV,Best Time to Buy and Sell Stock with Transaction Fee,Binary Gap,Binary Number with Alternating Bits,Binary Search,Binary Search Tree Iterator,Binary Search Tree to Greater Sum Tree,Binary Searchable Numbers in an Unsorted Array,Binary Tree Inorder Traversal,Binary Tree Level Order Traversal,Binary Tree Level Order Traversal II,Binary Tree Longest Consecutive Sequence,Binary Tree Longest Consecutive Sequence II,Binary Tree Maximum Path Sum,Binary Tree Paths,Binary Tree Postorder Traversal,Binary Tree Preorder Traversal,Binary Tree Pruning,Binary Tree Right Side View,Binary Tree Tilt,Binary Tree Upside Down,Binary Tree Vertical Order Traversal,Binary Tree Zigzag Level Order Traversal,Binary Trees With Factors,Binary Watch,Bitwise AND of Numbers Range,Boats to Save People,Bold Words in String,Bomb Enemy,Boundary of Binary Tree,Brace Expansion,Brick Wall,Broken Calculator,Buddy Strings,Build Array from Permutation,Build an Array With Stack Operations,Bulb Switcher,Bulb Switcher II,Bulb Switcher III,Bulls and Cows,Burst Balloons,Calculate Digit Sum of a String,Calculate Money in Leetcode Bank,Campus Bikes,Campus Bikes II,Can I Win,Can Make Arithmetic Progression From Sequence,Can Place Flowers,Candy,Candy Crush,Car Pooling,Cells with Odd Values in a Matrix,Champagne Tower,Check Array Formation Through Concatenation,Check Completeness of a Binary Tree,Check If All 1's Are at Least Length K Places Away,Check If It Is a Straight Line,Check If N and Its Double Exist,Check If String Is a Prefix of Array,Check If Two String Arrays are Equivalent,Check If Word Is Valid After Substitutions,Check If a Number Is Majority Element in a Sorted Array,Check If a String Contains All Binary Codes of Size K,Check If a Word Occurs As a Prefix of Any Word in a Sentence,Check Whether Two Strings are Almost Equivalent,Check if All A's Appears Before All B's,Check if All Characters Have Equal Number of Occurrences,Check if All the Integers in a Range Are Covered,Check if Array Is Sorted and Rotated,Check if Binary String Has at Most One Segment of Ones,Check if Every Row and Column Contains All Numbers,Check if Number is a Sum of Powers of Three,Check if Numbers Are Ascending in a Sentence,Check if One String Swap Can Make Strings Equal,Check if Word Can Be Placed In Crossword,Check if a Parentheses String Can Be Valid,Check if the Sentence Is Pangram,Cinema Seat Allocation,Circle and Rectangle Overlapping,Circular Array Loop,Climbing Stairs,Clone Binary Tree With Random Pointer,Clone Graph,Clone N-ary Tree,Closest Binary Search Tree Value,Closest Binary Search Tree Value II,Closest Dessert Cost,Closest Divisors,Closest Leaf in a Binary Tree,Coin Change,Coin Change 2,Coin Path,Combination Sum,Combination Sum II,Combination Sum III,Combination Sum IV,Combinations,Compare Strings by Frequency of the Smallest Character,Compare Version Numbers,Complement of Base 10 Integer,Complex Number Multiplication,Concatenated Words,Concatenation of Array,Concatenation of Consecutive Binary Numbers,Confusing Number,Consecutive Characters,Construct Binary Search Tree from Preorder Traversal,Construct Binary Tree from Inorder and Postorder Traversal,Construct Binary Tree from Preorder and Inorder Traversal,Construct Binary Tree from String,Construct K Palindrome Strings,Construct String With Repeat Limit,Construct String from Binary Tree,Construct Target Array With Multiple Sums,Construct the Lexicographically Largest Valid Sequence,Construct the Rectangle,Container With Most Water,Contains Duplicate,Contains Duplicate II,Contains Duplicate III,Contiguous Array,Continuous Subarray Sum,Convert 1D Array Into 2D Array,Convert BST to Greater Tree,Convert Binary Number in a Linked List to Integer,Convert Integer to the Sum of Two No-Zero Integers,Convert Sorted Array to Binary Search Tree,Convert Sorted List to Binary Search Tree,Convert a Number to Hexadecimal,Convex Polygon,Coordinate With Maximum Network Quality,Copy List with Random Pointer,Count Artifacts That Can Be Extracted,Count Common Words With One Occurrence,Count Complete Tree Nodes,Count Equal and Divisible Pairs in an Array,Count Good Meals,Count Good Nodes in Binary Tree,Count Good Triplets,Count Hills and Valleys in an Array,Count Integers With Even Digit Sum,Count Items Matching a Rule,Count Largest Group,Count Negative Numbers in a Sorted Matrix,Count Nice Pairs in an Array,Count Number of Homogenous Substrings,Count Number of Pairs With Absolute Difference K,Count Number of Teams,Count Numbers with Unique Digits,Count Odd Numbers in an Interval Range,Count Operations to Obtain Zero,Count Prefixes of a Given String,Count Primes,Count Servers that Communicate,Count Sorted Vowel Strings,Count Square Submatrices with All Ones,Count Square Sum Triples,Count Substrings with Only One Distinct Letter,Count The Repetitions,Count Unhappy Friends,Count Univalue Subtrees,Count Vowel Substrings of a String,Count and Say,Count of Matches in Tournament,Count of Smaller Numbers After Self,Counting Bits,Counting Elements,Counting Words With a Given Prefix,Couples Holding Hands,Course Schedule,Course Schedule II,Course Schedule III,Cousins in Binary Tree,Crawler Log Folder,Create Maximum Number,Create Target Array in the Given Order,Custom Sort String,Cut Off Trees for Golf Event,Cutting Ribbons,DI String Match,Daily Temperatures,Data Stream as Disjoint Intervals,Day of the Week,Day of the Year,Decode String,Decode Ways,Decode Ways II,Decode the Slanted Ciphertext,Decoded String at Index,Decompress Run-Length Encoded List,Deepest Leaves Sum,Defanging an IP Address,Degree of an Array,Delete Characters to Make Fancy String,Delete Columns to Make Sorted,Delete Leaves With a Given Value,Delete N Nodes After M Nodes of a Linked List,Delete Node in a BST,Delete Node in a Linked List,Delete Nodes And Return Forest,Delete Operation for Two Strings,Delete Tree Nodes,Delete and Earn,Design Authentication Manager,Design Bitset,Design Browser History,Design Circular Queue,Design Compressed String Iterator,Design Excel Sum Formula,Design Front Middle Back Queue,Design HashMap,Design HashSet,Design Hit Counter,Design In-Memory File System,Design Log Storage System,Design Most Recently Used Queue,Design Parking System,Design Phone Directory,Design Search Autocomplete System,Design Snake Game,Design Tic-Tac-Toe,Design Twitter,Design Underground System,Design a Stack With Increment Operation,Design an Expression Tree With Evaluate Function,Design an Ordered Stream,Destination City,Destroying Asteroids,Detect Capital,Detect Pattern of Length M Repeated K or More Times,Determine Color of a Chessboard Square,Determine Whether Matrix Can Be Obtained By Rotation,Determine if Two Strings Are Close,Diagonal Traverse,Diameter of Binary Tree,Diet Plan Performance,Different Ways to Add Parentheses,Display Table of Food Orders in a Restaurant,Distance Between Bus Stops,Distinct Subsequences,Distribute Candies,Distribute Candies to People,Distribute Coins in Binary Tree,Divide Array Into Equal Pairs,Divide Array in Sets of K Consecutive Numbers,Divide Two Integers,Divide a String Into Groups of Size k,Divisor Game,Dot Product of Two Sparse Vectors,Dota2 Senate,Dungeon Game,Edit Distance,Element Appearing More Than 25% In Sorted Array,Elimination Game,Employee Importance,Encode String with Shortest Length,Encode and Decode Strings,Encode and Decode TinyURL,Equal Sum Arrays With Minimum Number of Operations,Equal Tree Partition,Erect the Fence,Escape The Ghosts,Evaluate Division,Evaluate Reverse Polish Notation,Evaluate the Bracket Pairs of a String,Even Odd Tree,Excel Sheet Column Number,Excel Sheet Column Title,Exclusive Time of Functions,Expression Add Operators,Expressive Words,Factor Combinations,Factorial Trailing Zeroes,Fair Candy Swap,Faulty Sensor,Fibonacci Number,\"Filter Restaurants by Vegan-Friendly, Price and Distance\",Final Prices With a Special Discount in a Shop,Find All Anagrams in a String,Find All Duplicates in an Array,Find All Groups of Farmland,Find All K-Distant Indices in an Array,Find All Lonely Numbers in the Array,Find All Numbers Disappeared in an Array,Find All The Lonely Nodes,Find Anagram Mappings,Find Bottom Left Tree Value,Find Center of Star Graph,Find Closest Number to Zero,Find Common Characters,Find Duplicate File in System,Find Duplicate Subtrees,Find Elements in a Contaminated Binary Tree,Find Greatest Common Divisor of Array,Find K Closest Elements,Find K Pairs with Smallest Sums,Find K-Length Substrings With No Repeated Characters,Find K-th Smallest Pair Distance,Find Kth Bit in Nth Binary String,Find Largest Value in Each Tree Row,Find Leaves of Binary Tree,Find Lucky Integer in an Array,Find Minimum in Rotated Sorted Array,Find Minimum in Rotated Sorted Array II,Find Missing Observations,Find N Unique Integers Sum up to Zero,Find Nearest Point That Has the Same X or Y Coordinate,Find Numbers with Even Number of Digits,Find Original Array From Doubled Array,Find Peak Element,Find Permutation,Find Pivot Index,Find Positive Integer Solution for a Given Equation,Find Right Interval,Find Smallest Common Element in All Rows,Find Smallest Letter Greater Than Target,Find Subsequence of Length K With the Largest Sum,Find Target Indices After Sorting Array,Find Three Consecutive Integers That Sum to a Given Number,Find Unique Binary String,Find Winner on a Tic Tac Toe Game,Find Words That Can Be Formed by Characters,Find a Corresponding Node of a Binary Tree in a Clone of That Tree,Find and Replace Pattern,Find if Path Exists in Graph,Find the Celebrity,Find the Derangement of An Array,Find the Difference,Find the Difference of Two Arrays,Find the Distance Value Between Two Arrays,Find the Duplicate Number,Find the Highest Altitude,Find the Kth Largest Integer in the Array,Find the Kth Smallest Sum of a Matrix With Sorted Rows,Find the Longest Substring Containing Vowels in Even Counts,Find the Middle Index in Array,Find the Minimum and Maximum Number of Nodes Between Critical Points,Find the Most Competitive Subsequence,Find the Smallest Divisor Given a Threshold,Find the Town Judge,Find the Winner of an Array Game,Find the Winner of the Circular Game,Finding the Users Active Minutes,First Bad Version,First Missing Positive,First Unique Character in a String,First Unique Number,Fixed Point,Fizz Buzz,Flatten 2D Vector,Flatten Binary Tree to Linked List,Flatten Nested List Iterator,Flatten a Multilevel Doubly Linked List,Flip Equivalent Binary Trees,Flip Game,Flip Game II,Flipping an Image,Form Array by Concatenating Subarrays of Another Array,Four Divisors,Fraction Addition and Subtraction,Fraction to Recurring Decimal,Freedom Trail,Friend Circles,Frog Jump,Frog Position After T Seconds,Fruit Into Baskets,Furthest Building You Can Reach,Game of Life,Gas Station,Generalized Abbreviation,Generate Parentheses,Generate Random Point in a Circle,Generate a String With Characters That Have Odd Counts,Global and Local Inversions,Goal Parser Interpretation,Goat Latin,Graph Valid Tree,Gray Code,Greatest Common Divisor of Strings,Grid Game,Group Anagrams,Group Shifted Strings,Group the People Given the Group Size They Belong To,Groups of Special-Equivalent Strings,Guess Number Higher or Lower,Guess Number Higher or Lower II,H-Index,H-Index II,HTML Entity Parser,Hamming Distance,Happy Number,Heaters,Height Checker,Hexspeak,High Five,House Robber,House Robber II,House Robber III,How Many Apples Can You Put into the Basket,How Many Numbers Are Smaller Than the Current Number,IPO,Image Smoother,Implement Magic Dictionary,Implement Queue using Stacks,Implement Stack using Queues,Implement Trie,Implement Trie II (Prefix Tree),Implement strStr(),Increasing Decreasing String,Increasing Order Search Tree,Increasing Subsequences,Increasing Triplet Subsequence,Incremental Memory Leak,Index Pairs of a String,Inorder Successor In BST,Insert Delete GetRandom O(1),Insert Delete GetRandom O(1) - Duplicates allowed,Insert Intervals,Insert into a Binary Search Tree,Insertion Sort List,Integer Break,Integer Replacement,Integer to English Words,Integer to Roman,Interleaving String,Intersection of Multiple Arrays,Intersection of Three Sorted Arrays,Intersection of Two Arrays,Intersection of Two Arrays II,Intersection of Two Linked Lists,Invert Binary Tree,Is Subsequence,Island Perimeter,Isomorphic Strings,Iterator for Combination,Jewels and Stones,Jump Game,Jump Game II,Jump Game IV,K Closest Points to Origin,K Empty Slots,K Inverse Pairs Array,K Radius Subarray Averages,K-diff Pairs in an Array,K-th Smallest in Lexicographical Order,K-th Symbol in Grammar,Keep Multiplying Found Values by Two,Keyboard Row,Keys and Rooms,Kids With the Greatest Number of Candies,Kill Process,Knight Dialer,Knight Probability in Chessboard,Kth Distinct String in an Array,Kth Largest Element in a Stream,Kth Largest Element in an Array,Kth Missing Positive Number,Kth Smallest Element in a BST,Kth Smallest Element in a Sorted Matrix,Kth Smallest Number in Multiplication Table,LFU Cache,LRU Cache,Largest BST Subtree,Largest Divisible Subset,Largest Merge Of Two Strings,Largest Number,Largest Palindrome Product,Largest Perimeter Triangle,Largest Plus Sign,Largest Rectangle in Histogram,Largest Subarray Length K,Largest Submatrix With Rearrangements,Largest Substring Between Two Equal Characters,Largest Triangle Area,Largest Unique Number,Largest Values From Labels,Last Stone Weight,Latest Time by Replacing Hidden Digits,Leaf-Similar Trees,Least Number of Unique Integers after K Removals,Leftmost Column with at Least a One,Lemonade Change,Length of Last Word,Letter Case Permutation,Letter Combinations of a Phone Number,Letter Tile Possibilities,Lexicographically Smallest String After Applying Operations,License Key Formatting,Line Reflection,Linked List Cycle,Linked List Cycle II,Linked List Random Node,Linked List in Binary Tree,Logger Rate Limiter,Lonely Pixel I,Lonely Pixel II,Long Pressed Name,Longer Contiguous Segments of Ones than Zeros,Longest Absolute File Path,Longest Common Prefix,Longest Common Subsequence,Longest Consecutive Sequence,Longest Continuous Increasing Subsequence,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,Longest Happy Prefix,Longest Harmonious Subsequence,Longest Line of Consecutive One in Matrix,Longest Nice Substring,Longest Palindrome,Longest Palindromic Subsequence,Longest Palindromic Substring,Longest Repeating Character Replacement,Longest Repeating Substring,Longest Subarray of 1's After Deleting One Element,Longest Substring Without Repeating Characters,Longest Substring with At Least K Repeating Characters,Longest Substring with At Most K Distinct Characters,Longest Substring with At Most Two Distinct Characters,Longest Uncommon Subsequence I,Longest Uncommon Subsequence II,Longest Univalue Path,Longest Valid Parentheses,Longest Word in Dictionary,Longest Word in Dictionary through Deleting,Longest ZigZag Path in a Binary Tree,Lowest Common Ancestor of a Binary Search Tree,Lowest Common Ancestor of a Binary Tree,Lowest Common Ancestor of a Binary Tree II,Lowest Common Ancestor of a Binary Tree III,Lucky Numbers in a Matrix,Magic Squares In Grid,Magical String,Majority Element,Majority Element II,Make The String Great,Make Two Arrays Equal by Reversing Sub-arrays,Making File Names Unique,Map Sum Pairs,Map of Highest Peak,Matchsticks to Square,Matrix Block Sum,Matrix Cells in Distance Order,Matrix Diagonal Sum,Max Area of Island,Max Chunks To Make Sorted,Max Consecutive Ones,Max Consecutive Ones II,Max Consecutive Ones III,Max Difference You Can Get From Changing an Integer,Max Increase to Keep City Skyline,Max Number of K-Sum Pairs,Max Points on a Line,Max Stack,Max Sum of Rectangle No Larger Than K,Maximal Rectangle,Maximal Square,Maximize Distance to Closest Person,Maximize Sum Of Array After K Negations,Maximize the Confusion of an Exam,Maximum 69 Number,Maximum Absolute Sum of Any Subarray,Maximum Ascending Subarray Sum,Maximum Average Pass Ratio,Maximum Average Subarray I,Maximum Average Subarray II,Maximum Binary Tree,Maximum Depth of Binary Tree,Maximum Depth of N-ary Tree,Maximum Difference Between Increasing Elements,Maximum Difference Between Node and Ancestor,Maximum Distance in Arrays,Maximum Erasure Value,Maximum Frequency Stack,Maximum Gap,Maximum Length of Pair Chain,Maximum Length of Repeated Subarray,Maximum Length of Subarray With Positive Product,Maximum Level Sum of a Binary Tree,Maximum Nesting Depth of the Parentheses,Maximum Number of Achievable Transfer Requests,Maximum Number of Balloons,Maximum Number of Balls in a Box,Maximum Number of Coins You Can Get,Maximum Number of Eaten Apples,Maximum Number of Events That Can Be Attended,Maximum Number of Occurrences of a Substring,Maximum Number of Vowels in a Substring of Given Length,Maximum Number of Words Found in Sentences,Maximum Number of Words You Can Type,Maximum Points You Can Obtain from Cards,Maximum Population Year,Maximum Product Subarray,Maximum Product of Splitted Binary Tree,Maximum Product of Three Numbers,Maximum Product of Two Elements in an Array,Maximum Product of Word Lengths,Maximum Repeating Substring,Maximum Score After Splitting a String,Maximum Score From Removing Stones,Maximum Score From Removing Substrings,Maximum Size Subarray Sum Equals k,Maximum Students Taking Exam,Maximum Subarray,Maximum Subarray Sum After One Operation,Maximum Sum BST in Binary Tree,Maximum Sum Circular Subarray,Maximum Sum of 3 Non-Overlapping Subarrays,Maximum Swap,Maximum Twin Sum of a Linked List,Maximum Units on a Truck,Maximum Vacation Days,Maximum Width of Binary Tree,Maximum XOR for Each Query,Maximum XOR of Two Numbers in an Array,Mean of Array After Removing Some Elements,Median of Two Sorted Arrays,Meeting Rooms,Meeting Rooms II,Merge Intervals,Merge Nodes in Between Zeros,Merge Sorted Array,Merge Strings Alternately,Merge Two Binary Trees,Merge Two Sorted Lists,Merge k Sorted Lists,Middle of the Linked List,Min Cost Climbing Stairs,Min Stack,Minesweeper,Mini Parser,Minimize Deviation in Array,Minimize Maximum Pair Sum in Array,Minimize Product Sum of Two Arrays,Minimize the Difference Between Target and Chosen Elements,Minimum ASCII Delete Sum for Two Strings,Minimum Absolute Difference,Minimum Absolute Difference in BST,Minimum Add to Make Parentheses Valid,Minimum Average Difference,Minimum Bit Flips to Convert Number,Minimum Changes To Make Alternating Binary String,Minimum Consecutive Cards to Pick Up,Minimum Depth of Binary Tree,Minimum Distance Between BST Nodes,Minimum Distance to the Target Element,Minimum Elements to Add to Form a Given Sum,Minimum Factorization,Minimum Falling Path Sum,Minimum Falling Path Sum II,Minimum Height Trees,Minimum Index Sum of Two Lists,Minimum Insertions to Balance a Parentheses String,Minimum Length of String After Deleting Similar Ends,Minimum Moves to Convert String,Minimum Moves to Equal Array Elements,Minimum Moves to Equal Array Elements II,Minimum Moves to Reach Target Score,Minimum Number of Arrows to Burst Balloons,Minimum Number of Buckets Required to Collect Rainwater from Houses,Minimum Number of Days to Make m Bouquets,Minimum Number of Increments on Subarrays to Form a Target Array,Minimum Number of Operations to Move All Balls to Each Box,Minimum Number of Operations to Reinitialize a Permutation,Minimum Number of People to Teach,Minimum Number of Steps to Make Two Strings Anagram,Minimum Number of Steps to Make Two Strings Anagram II,Minimum Number of Vertices to Reach All Nodes,Minimum Numbers of Function Calls to Make Target Array,Minimum Operations to Halve Array Sum,Minimum Operations to Make Array Equal,Minimum Operations to Make a Uni-Value Grid,Minimum Operations to Make the Array Increasing,Minimum Operations to Reduce X to Zero,Minimum Path Sum,Minimum Remove to Make Valid Parentheses,Minimum Rounds to Complete All Tasks,Minimum Size Subarray Sum,Minimum Subsequence in Non-Increasing Order,Minimum Sum of Four Digit Number After Splitting Digits,Minimum Swaps to Group All 1's Together,Minimum Swaps to Group All 1's Together II,Minimum Time Difference,Minimum Time Visiting All Points,Minimum Time to Type Word Using Special Typewriter,Minimum Unique Word Abbreviation,Minimum Value to Get Positive Step by Step Sum,Minimum Window Subsequence,Minimum Window Substring,Missing Number,Missing Number In Arithmetic Progression,Missing Ranges,Monotone Increasing Digits,Monotonic Array,Most Beautiful Item for Each Query,Most Common Word,Most Frequent Number Following Key In an Array,Most Frequent Subtree Sum,Most Visited Sector in a Circular Track,Move Zeroes,Moving Average from Data Stream,Moving Stones Until Consecutive,Multiply Strings,My Calendar I,N-Queens,N-Queens II,N-Repeated Element in Size 2N Array,N-ary Tree Level Order Traversal,N-ary Tree Postorder Traversal,N-ary Tree Preorder Traversal,N-th Tribonacci Number,Nearest Exit from Entrance in Maze,Nested List Weight Sum,Nested List Weight Sum II,Network Delay Time,Next Greater Node In Linked List,Next Greater Numerically Balanced Number,Nim Game,Non-decreasing Array,Non-negative Integers without Consecutive Ones,Non-overlapping Intervals,Nth Digit,Number Complement,Number Of Corner Rectangles,Number Of Rectangles That Can Form The Largest Square,Number of 1 Bits,Number of Boomerangs,Number of Connected Components in an Undirected Graph,Number of Days Between Two Dates,Number of Days in a Month,Number of Different Integers in a String,Number of Digit One,Number of Distinct Islands,Number of Enclaves,Number of Equivalent Domino Pairs,Number of Good Pairs,Number of Good Ways to Split a String,Number of Islands,Number of Islands II,Number of Laser Beams in a Bank,Number of Longest Increasing Subsequence,Number of Matching Subsequences,Number of Pairs of Strings With Concatenation Equal to Target,Number of Recent Calls,Number of Segments in a String,Number of Smooth Descent Periods of a Stock,Number of Steps to Reduce a Number to Zero,Number of Strings That Appear as Substrings in Word,Number of Students Doing Homework at a Given Time,Number of Students Unable to Eat Lunch,Number of Sub-arrays With Odd Sum,Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold,Number of Substrings Containing All Three Characters,Number of Valid Words in a Sentence,Occurrences After Bigram,Odd Even Linked List,One Edit Distance,Ones and Zeroes,Online Stock Span,Optimal Account Balancing,Optimal Division,Out of Boundary Paths,Pacific Atlantic Water Flow,Paint Fence,Paint House,Paint House II,Pairs of Songs With Total Durations Divisible by 60,Palindrome Linked List,Palindrome Number,Palindrome Pairs,Palindrome Partitioning,Palindrome Partitioning II,Palindrome Partitioning IV,Palindrome Permutation,Palindrome Permutation II,Palindromic Substrings,Parallel Courses,Parallel Courses III,Partition Array According to Given Pivot,Partition Array for Maximum Sum,Partition Equal Subset Sum,Partition Labels,Partition List,Partition to K Equal Sum Subsets,Partitioning Into Minimum Number Of Deci-Binary Numbers,Pascal's Triangle,Pascal's Triangle II,Patching Array,Path Crossing,Path Sum,Path Sum II,Path Sum III,Path Sum IV,Path with Maximum Gold,Path with Maximum Probability,Peak Index in a Mountain Array,Peeking Iterator,People Whose List of Favorite Companies Is Not a Subset of Another List,Perfect Number,Perfect Rectangle,Perfect Squares,Perform String Shifts,Permutation Sequence,Permutation in String,Permutations,Permutations II,Pizza With 3n Slices,Plates Between Candles,Play with Chips,Plus One,Plus One Linked List,Positions of Large Groups,Pour Water,\"Pow(x, n)\",Power of Four,Power of Three,Power of Two,Powerful Integers,Predict the Winner,Prime Arrangements,Prime Number of Set Bits in Binary Representation,Print Binary Tree,Print Words Vertically,Print in Order,Prison Cells After N Days,Process Restricted Friend Requests,Product of Array Except Self,Product of the Last K Numbers,Pseudo-Palindromic Paths in a Binary Tree,Push Dominoes,Pyramid Transition Matrix,Queries on Number of Points Inside a Circle,Queries on a Permutation With Key,Queue Reconstruction by Height,RLE Iterator,Rabbits in Forest,Random Pick Index,Random Pick with Weight,Range Addition,Range Addition II,Range Frequency Queries,Range Sum Query - Immutable,Range Sum Query - Mutable,Range Sum Query 2D - Immutable,Range Sum Query 2D - Mutable,Range Sum of BST,Range Sum of Sorted Subarray Sums,Rank Teams by Votes,Rank Transform of an Array,Ransom Note,Reach a Number,Read N Characters Given Read4,Read N Characters Given Read4 II - Call multiple times,Rearrange Array Elements by Sign,Rearrange Spaces Between Words,Rearrange String k Distance Apart,Rearrange Words in a Sentence,Reconstruct Itinerary,Reconstruct Original Digits from English,Recover Binary Search Tree,Rectangle Area,Rectangle Overlap,Redistribute Characters to Make All Strings Equal,Reduce Array Size to The Half,Reducing Dishes,Redundant Connection,Redundant Connection II,Reformat Date,Reformat Phone Number,Reformat The String,Regular Expression Matching,Relative Ranks,Relative Sort Array,Remove 9,Remove All Adjacent Duplicates In String,Remove All Adjacent Duplicates in String II,Remove All Occurrences of a Substring,Remove Boxes,Remove Colored Pieces if Both Neighbors are the Same Color,Remove Digit From Number to Maximize Result,Remove Duplicate Letters,Remove Duplicates From an Unsorted Linked List,Remove Duplicates from Sorted Array,Remove Duplicates from Sorted Array II,Remove Duplicates from Sorted List,Remove Duplicates from Sorted List II,Remove Element,Remove Invalid Parentheses,Remove K Digits,Remove Linked List Elements,Remove Nth Node From End of List,Remove One Element to Make the Array Strictly Increasing,Remove Outermost Parentheses,Remove Palindromic Subsequences,Remove Vowels from a String,Remove Zero Sum Consecutive Nodes from Linked List,Reorder List,Reorder Routes to Make All Paths Lead to the City Zero,Reorganize String,Repeated DNA Sequences,Repeated String Match,Repeated Substring Pattern,Replace All ?'s to Avoid Consecutive Repeating Characters,Replace All Digits with Characters,Replace Elements with Greatest Element on Right Side,Replace Words,Reshape the Matrix,Restore IP Addresses,Restore the Array From Adjacent Pairs,Reveal Cards In Increasing Order,Reverse Bits,Reverse Integer,Reverse Linked List,Reverse Linked List II,Reverse Nodes in Even Length Groups,Reverse Nodes in k-Group,Reverse Only Letters,Reverse Pairs,Reverse Prefix of Word,Reverse String,Reverse String II,Reverse Substrings Between Each Pair of Parentheses,Reverse Vowels of a String,Reverse Words in a String,Reverse Words in a String II,Reverse Words in a String III,Richest Customer Wealth,Rings and Rods,Roman to Integer,Rotate Array,Rotate Function,Rotate Image,Rotate List,Rotate String,Rotated Digits,Rotating the Box,Rotting Oranges,Running Sum of 1d Array,Russian Doll Envelopes,Same Tree,Score After Flipping Matrix,Score of Parentheses,Scramble String,Search Insert Position,Search Suggestions System,Search a 2D Matrix,Search a 2D Matrix II,Search in Rotated Sorted Array,Search in Rotated Sorted Array II,Search in a Binary Search Tree,Seat Reservation Manager,Second Largest Digit in a String,Second Minimum Node In a Binary Tree,Self Crossing,Self Dividing Numbers,Sentence Screen Fitting,Sentence Similarity,Sentence Similarity II,Sentence Similarity III,Sequence Reconstruction,Sequential Digits,Serialize and Deserialize BST,Serialize and Deserialize Binary Tree,Set Intersection Size At Least Two,Set Matrix Zeroes,Set Mismatch,Shift 2D Grid,Shifting Letters,Shopping Offers,Short Encoding of Words,Shortest Completing Word,Shortest Distance from All Buildings,Shortest Distance to Target Color,Shortest Distance to a Character,Shortest Palindrome,Shortest Path in Binary Matrix,Shortest Subarray to be Removed to Make Array Sorted,Shortest Unsorted Continuous Subarray,Shortest Word Distance,Shortest Word Distance II,Shortest Word Distance III,Shuffle String,Shuffle the Array,Sign of the Product of an Array,Similar RGB Color,Simple Bank System,Simplified Fractions,Simplify Path,Single Element in a Sorted Array,Single Number,Single Number II,Single Number III,Single-Row Keyboard,Sliding Window Maximum,Sliding Window Median,Slowest Key,Smallest Common Region,Smallest Good Base,Smallest Index With Equal Value,Smallest Range I,Smallest Rectangle Enclosing Black Pixels,Smallest String Starting From Leaf,Smallest String With A Given Numeric Value,Smallest Value of the Rearranged Number,Snapshot Array,Solve the Equation,Sort Array By Parity II,Sort Array by Increasing Frequency,Sort Characters By Frequency,Sort Colors,Sort Even and Odd Indices Independently,Sort Features by Popularity,Sort Integers by The Number of 1 Bits,Sort Integers by The Power Value,Sort List,Sort Transformed Array,Sort an Array,Sort the Matrix Diagonally,Sorting the Sentence,Sparse Matrix Multiplication,Special Array With X Elements Greater Than or Equal X,Special Positions in a Binary Matrix,Spiral Matrix,Spiral Matrix II,Spiral Matrix III,Split Array Largest Sum,Split Array into Consecutive Subsequences,Split Array with Equal Sum,Split BST,Split Concatenated Strings,Split Linked List in Parts,Split a String in Balanced Strings,Sqrt(x),Squares of a Sorted Array,Squirrel Simulation,Stickers to Spell Word,Stock Price Fluctuation,Stone Game,Stone Game VI,Stone Game VII,Strange Printer,String Compression,String Matching in an Array,String to Integer (atoi),Strobogrammatic Number,Strobogrammatic Number II,Strobogrammatic Number III,Strong Password Checker,Student Attendance Record I,Student Attendance Record II,Subarray Product Less Than K,Subarray Sum Equals K,Subarray Sums Divisible by K,Subdomain Visit Count,Subrectangle Queries,Subsets,Subsets II,Substring with Concatenation of All Words,Substrings of Size Three with Distinct Characters,Subtract the Product and Sum of Digits of an Integer,Subtree of Another Tree,Sudoku Solver,Sum Root to Leaf Numbers,Sum of All Odd Length Subarrays,Sum of All Subset XOR Totals,Sum of Beauty in the Array,Sum of Beauty of All Substrings,Sum of Digits in the Minimum Number,Sum of Digits of String After Convert,Sum of Even Numbers After Queries,Sum of Floored Pairs,Sum of Left Leaves,Sum of Mutated Array Closest to Target,Sum of Nodes with Even-Valued Grandparent,Sum of Root To Leaf Binary Numbers,Sum of Square Numbers,Sum of Two Integers,Sum of Unique Elements,Summary Ranges,Super Pow,Super Ugly Number,Super Washing Machines,Surface Area of 3D Shapes,Surrounded Regions,Swap Nodes in Pairs,Swapping Nodes in a Linked List,Symmetric Tree,Synonymous Sentences,Tag Validator,Target Sum,Task Scheduler,Teemo Attacking,Ternary Expression Parser,Text Justification,The K Weakest Rows in a Matrix,The Maze,The Maze II,The Maze III,The Number of Full Rounds You Have Played,The Number of Weak Characters in the Game,The Skyline Problem,The Time When the Network Becomes Idle,The k Strongest Values in an Array,The k-th Lexicographical String of All Happy Strings of Length n,The kth Factor of n,Third Maximum Number,Thousand Separator,Three Consecutive Odds,Three Divisors,Time Based Key-Value Store,Time Needed to Buy Tickets,Time Needed to Inform All Employees,To Lower Case,Toeplitz Matrix,Top K Frequent Elements,Top K Frequent Words,Total Hamming Distance,Transpose Matrix,Trapping Rain Water,Trapping Rain Water II,Triangle,Trim a Binary Search Tree,Truncate Sentence,Tuple with Same Product,Tweet Counts Per Frequency,Two Best Non-Overlapping Events,Two City Scheduling,Two Furthest Houses With Different Colors,Two Out of Three,Two Sum,Two Sum BSTs,Two Sum II - Input array is sorted,Two Sum III - Data structure design,Two Sum IV - Input is a BST,Two Sum Less Than K,UTF-8 Validation,Ugly Number,Ugly Number II,Uncommon Words from Two Sentences,Unique Binary Search Trees,Unique Binary Search Trees II,Unique Email Addresses,Unique Morse Code Words,Unique Number of Occurrences,Unique Paths,Unique Paths II,Unique Paths III,Unique Substrings in Wraparound String,Unique Word Abbreviation,Univalued Binary Tree,Valid Anagram,Valid Boomerang,Valid Mountain Array,Valid Number,Valid Palindrome,Valid Palindrome II,Valid Parentheses,Valid Parenthesis String,Valid Perfect Square,Valid Square,Valid Sudoku,Valid Triangle Number,Valid Word Abbreviation,Valid Word Square,Validate Binary Search Tree,Validate Binary Tree Nodes,Validate IP Address,Validate Stack Sequences,Verify Preorder Sequence in Binary Search Tree,Verify Preorder Serialization of a Binary Tree,Verifying an Alien Dictionary,Vertical Order Traversal of a Binary Tree,Video Stitching,Vowel Spellchecker,Walls and Gates,Water Bottles,Water and Jug Problem,Watering Plants,Ways to Make a Fair Array,Widest Vertical Area Between Two Points Containing No Points,Wiggle Sort,Wiggle Sort II,Wiggle Subsequence,Wildcard Matching,Word Abbreviation,Word Break,Word Break II,Word Ladder,Word Ladder II,Word Pattern,Word Pattern II,Word Search,Word Search II,Word Squares,X of a Kind in a Deck of Cards,XOR Operation in an Array,ZigZag Conversion,Zigzag Iterator,Zuma Game\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n2,0,0,0,0,9,4,2,0,3,2,0,2,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,3,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,8,0,0,0,0,0,0,3,0,0,0,2,0,0,0,0,2,0,0,2,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,4,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,9,12,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,3,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,0,2,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,4,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,4,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,3,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,4,0,0,0,0,4,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,2,0,0,0,5,3,3,0,2,0,0,0,2,0,2,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,4,5,0,0,2,0,0,4,0,0,0,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,3,0,0,0,0,0,0,0,0,12,3,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,2,0,0,2,2,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,2,0,19,0,0,8,0,0,0,0,11,4,4,4,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,3,3,0,0,0,0,0,0,0,0,0,2,0,0,2,0,3,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,4,0,0,2,0,0,0,0,0,0,0,0,2,5,0,0,0,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,2,0,3,0,0,0,0,2,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,7,3,2,0,2,0,2,2,0,0,0,0,0,0,3,0,0,0,0,0,0,2,0,0,0,0,0,2,0,13,0,2,0,0,0,0,0,5,3,0,0,0,0,0,2,0,16,0,0,5,0,0,0,0,0,0,0,0,0,0,0,7,2,3,0,7,3,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,2,0,0,0,3,0,0,0,0,0,0,0,0,2,4,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,2,0,0,0,2,2,0,0,0,0,3,0,3,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,2,0,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,7,0,0,0,0,0,0,0,0,0,0,52,0,5,0,0,0,0,0,0,0,0,0,0,0,5,4,0,0,0,0,0,0,0,0,0,3,0,8,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,3,4,4,0,2,0,0,0,0,0,0,4,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,9,0,4,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n6,0,4,4,0,44,15,2,0,6,6,2,6,0,0,0,3,36,3,7,0,1,0,0,0,10,0,2,3,2,0,50,0,3,0,2,0,0,1,0,0,0,2,0,0,14,0,2,4,0,0,5,0,0,7,13,2,0,0,0,0,0,56,13,7,4,3,0,0,13,4,2,0,4,8,2,2,0,17,3,0,0,0,10,0,0,4,28,2,0,0,4,0,0,12,2,0,0,0,0,0,0,0,0,0,2,0,0,2,2,0,1,3,8,0,9,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,2,0,2,0,0,14,0,8,0,0,0,0,1,0,18,0,0,18,4,0,4,2,0,7,0,1,30,0,0,0,0,4,0,3,0,0,0,0,0,0,0,21,19,2,2,7,5,0,3,2,0,3,7,2,0,0,19,0,0,5,0,2,0,0,0,0,0,0,0,0,0,1,3,0,2,0,0,4,0,0,0,2,0,3,0,0,0,2,0,3,3,0,0,0,28,34,0,3,0,0,2,0,3,0,0,10,0,0,0,12,9,0,1,2,2,0,2,0,0,0,2,0,8,2,0,2,0,5,0,0,3,4,0,0,3,10,3,9,16,0,0,12,2,9,5,15,2,0,0,7,0,0,0,2,0,0,0,0,0,12,1,0,0,0,4,0,0,2,0,0,9,0,0,2,0,2,8,0,0,0,0,0,4,0,2,0,0,10,6,0,0,0,2,0,0,0,0,4,2,0,10,0,2,15,5,0,0,0,5,0,0,0,0,0,4,0,7,0,0,3,2,4,0,0,0,2,0,8,0,0,0,0,2,0,8,0,3,0,2,0,2,0,0,0,2,14,2,2,0,4,4,2,3,0,0,16,0,0,0,0,0,0,0,0,2,0,0,0,12,20,30,4,0,0,0,6,2,2,0,0,0,0,1,0,0,0,0,3,6,2,4,5,6,19,0,15,0,0,0,0,0,2,2,0,0,51,0,0,0,0,0,2,0,0,0,6,2,0,0,0,21,4,6,0,2,0,0,0,8,3,15,0,7,2,0,0,0,0,1,0,17,0,5,2,0,0,0,19,27,4,0,0,9,4,8,5,4,2,7,0,3,20,13,4,49,0,0,0,2,0,0,0,0,6,3,8,3,3,1,4,16,2,9,6,0,8,117,0,0,0,2,0,0,0,12,0,0,0,0,1,0,4,0,0,5,0,3,3,0,28,0,0,0,0,9,7,2,2,3,0,0,0,2,2,9,6,9,0,12,2,0,0,0,2,6,35,6,0,0,49,3,2,4,0,0,2,9,0,0,6,3,25,0,3,0,0,0,9,4,0,0,0,0,0,0,2,0,2,19,2,0,0,2,0,2,2,4,3,0,3,3,3,2,2,0,2,0,2,0,0,2,4,0,0,4,0,0,5,2,2,0,29,0,0,1,0,0,0,0,3,2,1,0,0,3,0,17,4,0,0,0,0,0,0,0,2,0,35,0,3,6,0,4,23,29,0,6,0,0,0,40,4,48,87,0,5,0,3,20,47,5,5,18,2,0,2,0,0,1,0,0,0,3,1,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,1,0,0,0,0,2,7,6,1,6,2,1,21,2,2,0,0,0,2,0,11,8,0,0,1,2,0,2,0,0,0,8,4,0,5,4,7,0,0,0,2,0,3,2,4,0,3,5,0,0,0,0,4,0,2,0,0,3,0,6,5,1,0,0,8,0,1,3,2,103,0,6,2,0,0,0,0,4,0,0,0,0,0,0,0,2,0,4,0,0,6,2,1,3,2,0,3,0,14,16,7,0,2,2,0,0,0,0,2,0,1,4,4,4,0,2,0,5,0,2,0,2,5,0,0,0,0,10,3,0,0,0,2,0,0,3,9,4,0,3,0,5,0,0,0,9,0,2,5,2,0,2,1,2,0,0,0,0,32,3,0,0,2,0,1,0,0,2,2,11,18,2,0,0,3,3,0,4,0,0,0,0,5,2,0,1,0,0,2,4,0,15,2,0,0,2,0,0,2,0,0,0,8,0,0,0,4,8,2,0,0,0,2,0,9,0,6,6,5,2,10,4,10,0,0,0,3,2,10,3,17,2,0,0,0,0,0,0,0,3,0,0,0,11,12,5,0,14,2,3,0,6,0,0,0,2,0,3,0,0,27,9,1,8,0,0,0,0,35,0,0,5,2,4,0,9,68,12,10,31,5,2,0,0,0,3,2,0,0,2,0,0,3,3,21,0,6,0,0,0,2,2,0,0,0,0,0,9,4,5,3,0,2,0,2,0,0,0,0,8,9,8,5,0,0,32,0,17,0,0,0,0,0,0,0,0,0,4,0,5,2,8,0,2,0,0,3,0,3,0,0,2,0,0,13,2,0,6,0,0,0,0,2,2,9,13,0,0,0,2,0,0,0,8,3,9,0,0,0,6,0,0,3,19,3,0,0,13,2,3,0,0,6,7,3,2,0,1,0,1,0,0,0,0,0,2,2,2,0,0,0,0,0,0,2,0,8,3,8,3,2,7,3,0,0,0,1,2,0,0,0,0,0,0,0,0,25,2,0,0,0,9,0,6,2,0,29,12,2,2,45,0,4,3,0,0,0,0,0,2,0,117,3,11,0,2,3,0,0,0,0,4,0,0,0,5,8,7,3,0,0,0,8,0,2,0,8,5,43,5,0,0,19,2,0,0,25,0,2,4,0,0,2,10,2,0,4,2,0,0,0,0,2,0,0,5,0,34,11,41,9,4,0,36,31,0,0,0,5,2,0\n0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,Lucid,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,2,0,0,0,10,3,0,0,5,0,4,0,0,0,0,2,19,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,0,0,0,2,0,0,0,0,3,0,0,0,0,0,2,2,0,0,0,0,0,8,0,2,3,0,0,0,5,0,0,0,3,2,0,0,0,0,0,0,0,2,2,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,5,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,4,0,0,0,0,0,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,5,6,0,2,2,2,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,3,5,0,0,0,2,2,0,2,0,0,0,0,2,0,5,3,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,4,0,0,4,2,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,2,0,0,3,3,0,0,0,0,0,0,0,2,0,0,0,5,0,6,0,0,2,0,0,5,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,2,5,0,9,0,0,0,2,0,0,0,0,0,11,0,2,0,0,0,2,0,0,0,7,0,2,0,0,8,0,0,0,0,0,0,0,0,0,3,2,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,3,4,0,0,6,0,0,3,0,0,0,0,0,3,4,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,20,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,7,0,0,0,0,0,0,0,0,2,0,0,0,0,0,14,0,2,0,0,0,0,0,0,0,2,7,0,0,0,16,0,0,0,0,2,0,0,0,0,0,3,2,0,0,2,0,0,4,0,0,0,0,0,0,0,0,0,0,3,0,2,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,0,0,0,0,0,0,15,0,0,18,0,8,0,0,0,8,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,0,2,0,0,0,0,0,3,0,0,0,0,4,3,0,0,0,0,0,0,0,2,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,2,0,2,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,2,6,3,3,3,0,0,0,0,0,0,0,0,0,2,0,0,0,2,4,0,0,0,0,0,0,0,0,0,3,3,0,0,4,2,0,0,4,4,0,0,0,0,2,0,0,0,5,0,0,4,0,0,0,0,0,0,0,0,0,10,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,3,0,0,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,3,0,0,0,0,4,0,4,0,0,0,4,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,6,2,0,0,0,0,0,2,0,0,0,3,0,2,0,0,13,0,2,8,0,2,0,0,0,0,0,3,0,0,0,7,2,4,2,7,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,4,0,0,0,2,0,0,0,0,2,2,0,0,0,0,0,0,0,3,0,0,0,0,3,2,4,0,0,0,3,0,0,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,11,4,0,2,0,0,0,0,2,0,5,0,0,0,0,0,0,0,0,6,0,2,0,0,0,0,0,0,0,3,0,0,0,3,0,2,0,0,0,6,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,5,3,0,3,8,0,0,0,0,0,0,0,0,0,0,40,0,3,0,0,0,0,0,0,0,0,0,0,0,4,7,0,0,2,0,0,2,0,0,0,5,3,8,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,4,5,0,0,0,0,4,0,0,0,0,2,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,6,0,0,0,0,2,0,0,0,2,0,3,16,6,0,0,0,0,0,0,4,0,2,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,12,3,0,0,0,0,0,3,4,0,0,0,6,0,0,0,2,3,0,0,0,4,0,0,8,5,0,0,0,2,0,0,2,0,2,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,3,0,7,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,6,0,0,0,0,0,0,4,2,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,0,0,0,0,0,2,5,2,2,0,0,0,0,2,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,3,0,0,0,0,0,2,0,0,2,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,33,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,64,0,0,20,0,0,0,0,0,0,0,0,4,0,3,0,0,0,0,0,0,0,0,2,0,2,2,0,0,2,0,4,0,0,0,2,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,13,0,0,0,0,0,0,28,0,0,0,0,0,0,0,0,0,2,0,0,0,0,4,3,0,3,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,23,0,0,0,0,0,2,0,5,2,0,0,2,2,0,2,0,0,0,0,0,2,3,0,0,0,0,0,2,0,0,0,0,0,0,0,10,0,0,0,5,0,0,2,0,0,19,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,3,2,0,0,0,0,0,0,0,2,6,0,0,0,23,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,2,3,0,0,0,2,0,0,2,0,0,0,4,0,0,0,0,0,0,0,0,2,0,2,0,2,0,20,20,0,4,0,0,3,2,0,2,7,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,8,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,33,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,3,3,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,2,2,0,0,0,2,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,4,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,26,0,0,0,0,0,0,4,0,2,0,0,0,3,0,3,0,0,22,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,4,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,10,0,0,3,3,0,0,0,0,0,0,2,0,3,0,3,0,5,3,7,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,3,0,2,0,0,0,0,0,0,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,2,5,0,0,0,0,0,0,0,4,0,0,0,4,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,2,0,0,4,2,2,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,4,0,0,15,0,0,0,1,0,0,0,14,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,0,0,0,0,0,8,0,0,0,3,2,14,0,0,0,0,2,0,2,14,0,0,0,0,0,0,7,0,0,2,0,0,0,0,0,0,0,2,0,0,5,7,0,0,0,0,14,0,0,0,2,0,0,4\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,0,0,0,0,0,0,3,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,5,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,2,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,T-mobile,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,3,3,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n2,0,0,0,0,28,25,0,0,5,3,34,10,13,0,0,54,19,0,7,2,0,0,2,0,16,0,5,0,0,0,0,0,11,1,0,0,0,0,0,0,0,0,0,0,10,0,0,5,0,11,2,0,0,10,118,4,0,0,2,0,0,16,5,0,0,2,0,0,2,50,2,0,0,6,0,3,0,16,2,2,0,4,108,0,0,188,18,0,0,0,0,0,0,3,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,13,0,2,2,0,0,2,11,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,2,38,0,21,0,0,0,3,2,0,0,12,4,0,2,5,0,0,0,0,0,0,0,0,0,2,0,0,7,0,0,2,0,1,0,8,0,15,0,3,56,0,3,0,0,2,11,0,0,0,64,0,0,0,0,0,0,0,1,0,2,0,2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,9,5,0,2,0,0,0,67,0,31,0,17,0,0,0,11,4,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,15,0,0,0,0,0,0,0,0,0,0,0,0,48,89,0,0,0,0,0,0,0,0,0,0,11,0,0,121,0,0,2,5,0,0,0,3,0,0,0,0,0,8,2,0,0,0,0,33,23,2,0,0,0,1,3,0,0,5,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,21,0,0,3,0,18,2,0,8,0,0,0,0,0,0,82,0,14,0,0,0,0,0,2,0,0,4,0,0,0,0,2,0,0,0,0,4,0,4,0,0,3,0,0,0,0,0,0,0,7,4,4,2,0,3,0,10,4,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,16,0,0,0,0,5,0,0,0,0,17,47,0,1,0,0,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,3,0,0,2,0,3,0,2,0,2,0,0,6,23,5,5,0,0,3,0,20,0,0,0,3,6,4,4,5,0,10,0,0,0,8,0,0,127,0,0,3,0,0,0,0,0,0,0,0,6,0,0,3,140,28,6,18,0,0,60,7,0,0,3,0,0,0,4,0,0,0,0,0,0,0,0,0,0,10,0,0,0,14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,26,0,0,4,0,0,0,0,0,0,0,7,0,0,0,23,0,0,0,0,0,0,4,0,0,0,5,180,8,156,0,0,0,2,0,0,4,0,0,0,0,0,0,0,18,0,0,0,26,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,7,0,0,2,0,0,2,0,0,2,2,0,0,0,3,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,11,0,11,0,0,0,3,36,0,0,0,3,0,0,0,7,0,33,110,0,89,0,6,13,59,3,0,4,6,0,0,0,0,0,0,0,0,100,0,0,0,0,4,0,0,0,0,0,0,0,0,4,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,282,0,8,0,0,0,0,0,0,0,0,0,0,20,6,0,8,0,12,0,0,0,0,0,19,43,1,14,0,4,0,0,0,0,0,0,0,100,0,0,0,0,0,0,0,7,0,0,1,0,4,0,3,0,0,0,0,0,0,0,0,0,34,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,6,7,0,0,0,0,0,0,0,0,1,0,16,8,2,2,0,0,12,0,24,0,0,0,0,11,0,0,0,0,0,0,0,0,8,4,4,2,0,0,0,0,0,0,0,0,0,2,0,7,0,0,0,0,11,0,0,0,162,0,0,0,0,0,0,0,0,0,0,0,5,18,0,0,0,0,0,0,3,0,0,21,140,0,0,0,2,0,10,0,149,0,0,3,0,0,3,2,0,0,0,0,6,0,0,0,2,0,0,0,0,0,0,0,0,19,0,0,0,40,7,0,0,0,0,2,0,16,0,4,2,0,36,2,2,23,2,0,0,0,0,2,0,9,0,0,2,0,0,2,2,2,2,0,0,3,4,4,7,0,5,0,0,0,3,0,0,0,0,0,2,0,0,8,2,0,12,0,0,4,0,0,0,0,2,0,4,0,2,3,14,2,30,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,5,0,0,0,2,0,0,22,0,0,0,76,0,0,2,0,0,0,0,0,0,0,0,112,5,4,0,0,0,5,9,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,6,0,0,0,0,10,0,0,10,0,0,5,0,3,0,0,0,0,0,29,0,3,0,0,0,0,0,5,0,32,19,4,0,0,0,0,3,141,3,0,0,38,3,0,0,0,5,2,31,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,9,3,12,0,0,10,3,0,0,4,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,30,97,4,0,0,34,0,0,3,0,0,0,0,2,0,0,21,0,0,0,0,3,2,3,0,3,0,0,0,0,4,11,8,2,0,3,0,8,0,0,53,94,252,24,4,0,0,4,0,114,0,8,2,0,0,0,0,21,82,0,0,15,0,0,0,0,0,0,0,0,2,0,33,22,13,4,0,0,12,5,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,4,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,2,2,0,0,0,0,0,0,0,0,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,5,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,0,0,0,0,0,2,0,0,0,0,20,0,12,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,2,0,0,0,0,0,6,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,Amazon,0,4,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,3,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,38,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n6,0,0,0,2,8,3,0,0,2,0,3,2,0,0,0,5,10,0,2,0,0,0,0,0,7,1,2,0,0,1,0,0,0,0,0,2,0,0,0,0,0,0,3,0,0,0,0,0,3,0,2,3,0,12,0,10,0,1,2,2,0,12,3,0,2,0,0,0,4,2,0,1,0,3,0,2,4,6,2,0,2,0,0,0,0,0,3,0,1,0,0,2,0,0,4,0,0,0,2,2,0,0,0,12,7,0,0,0,2,0,0,0,0,0,3,2,0,0,0,0,0,2,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,4,0,5,2,0,2,0,0,0,5,2,1,0,0,3,3,5,2,0,0,0,0,4,3,2,2,0,0,3,0,0,0,0,0,0,0,5,6,3,4,0,2,1,0,0,0,0,2,2,1,0,3,0,0,7,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,3,8,0,0,0,0,2,0,3,0,6,2,0,1,0,5,11,0,0,0,1,0,0,0,0,0,0,0,0,0,19,8,0,0,0,0,0,2,0,0,1,0,0,3,0,6,0,0,2,0,0,0,0,2,3,0,0,0,2,3,0,1,0,0,9,2,4,3,0,0,0,0,2,1,2,0,0,0,0,2,3,0,3,0,1,2,0,0,0,0,4,5,0,2,4,0,0,4,2,0,6,2,0,0,0,0,1,1,8,73,2,0,2,2,3,0,3,0,0,0,0,2,0,0,2,2,0,1,1,0,0,1,0,0,0,0,0,13,1,0,4,0,0,0,0,0,75,0,0,2,0,0,0,0,14,7,1,2,2,0,0,0,0,4,0,0,11,2,0,0,3,0,0,6,1,0,2,0,0,0,0,0,0,2,0,2,0,0,0,19,5,0,0,0,0,0,0,0,2,2,1,1,3,0,0,0,0,1,0,2,2,0,3,3,0,1,4,0,0,2,0,0,3,0,0,0,5,2,0,0,0,2,9,0,0,2,22,0,0,0,0,7,9,5,0,0,0,0,2,2,0,9,0,4,0,0,2,3,0,0,3,4,0,11,0,2,0,0,0,2,3,0,0,3,0,0,3,3,3,3,0,2,2,3,5,3,1,0,0,0,0,0,0,0,0,0,0,0,0,0,4,8,2,0,4,0,4,9,0,2,0,0,0,0,0,0,1,Directi,2,1,0,1,0,1,2,0,2,0,0,0,5,1,0,1,0,2,0,1,0,22,1,1,2,0,7,12,0,7,0,3,0,0,5,0,0,0,12,7,0,0,13,0,2,0,1,0,0,0,6,4,0,2,8,0,3,0,3,1,3,0,1,0,0,2,2,0,0,0,0,9,0,2,0,3,0,3,0,3,0,0,4,3,3,0,0,0,0,0,0,0,1,0,4,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,17,2,2,0,0,0,0,0,1,0,1,0,0,11,0,0,3,0,0,0,0,0,4,0,0,1,14,2,22,28,0,0,0,0,3,8,3,0,3,0,0,0,3,1,0,0,2,3,0,0,0,0,1,0,0,0,0,0,2,1,0,0,0,0,0,0,0,0,2,0,2,4,0,1,0,0,0,2,0,0,0,0,0,3,4,2,0,2,0,0,0,0,30,0,0,1,0,2,0,0,0,0,0,0,0,0,1,0,0,0,4,0,5,3,3,0,0,0,0,3,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,2,5,2,0,0,0,4,0,1,0,0,0,21,2,0,2,15,0,0,0,0,0,0,0,0,2,0,0,0,1,0,5,0,0,4,0,0,10,2,0,0,0,3,11,3,3,0,0,0,3,0,0,0,0,0,2,2,0,2,0,0,0,0,2,0,3,3,0,0,5,2,8,1,0,2,2,0,0,2,5,0,2,0,0,5,1,3,0,5,0,0,3,0,2,0,0,0,0,2,0,0,0,7,0,0,2,1,0,0,3,0,3,27,0,0,0,0,6,2,3,0,1,2,2,3,0,0,4,0,4,3,0,4,0,2,0,0,0,0,0,2,0,0,0,4,9,1,2,2,0,0,2,0,0,0,0,0,4,0,0,0,2,0,2,0,5,0,0,0,0,0,0,0,4,0,2,2,0,1,0,0,0,0,0,0,2,5,3,3,0,2,0,0,0,0,0,0,0,2,0,0,0,6,10,4,3,4,0,0,2,0,0,0,7,3,0,0,0,4,3,0,0,3,0,0,0,0,0,2,0,8,1,0,1,2,0,0,3,0,0,0,0,0,3,0,2,6,0,0,0,5,0,0,0,0,0,2,0,0,1,0,2,5,3,4,0,2,1,8,0,0,0,0,1,0,7,0,0,0,36,3,0,2,0,0,0,0,0,0,0,0,0,0,2,0,1,0,8,0,0,8,2,0,3,0,0,0,4,5,0,0,30,0,0,0,3,0,0,6,0,2,4,3,5,14,0,15,0,0,0,7,0,2,0,0,2,5,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,5,0,0,5,0,0,2,0,0,0,24,0,3,2,2,0,3,2,0,1,0,0,2,0,0,0,4,0,11,0,0,8,7,0,0,8,4,0,0,0,1,0,0,0,0,0,44,0,4,0,0,0,0,0,0,2,0,0,0,0,2,15,3,0,0,1,3,2,1,0,0,0,0,6,3,3,4,0,0,3,1,0,0,0,0,0,1,0,0,2,0,5,0,0,1,0,0,0,0,0,4,3,2,3,0,0,0,0,0,5,3,2,0,0,1,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,25,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,JPMorgan,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,JPMorgan,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,69,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,40,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,5,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,17,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,9,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,3,0,21,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,26,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,2,0,0,0,0,0,0,8,0,0,0,0,8,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,15,4,9,3,0,0,0,0,0,0,0,0,0,0,6,0,0,0,6,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,14,0,2,0,0,2,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,18,11,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,8,33,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,29,0,0,0,0,0,0,0,0,0,0,43,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,7,0,5,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,34,48,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,5,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,6,0,0,0,0,0,0,0,17,4,0,0,0,11,0,0,0,0,0,0,0,0,2,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,11,71,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,18,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,33,10,3,0,0,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,2,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,3,0,20,3,0,2,4,0,0,0,0,0,0,9,17,4,4,0,0,0,0,0,3,0,0,0,0,0,0,2,5,0,0,0,0,0,0,0,0,0,0,0,4,0,0,2,0,0,0,0,0,5,11,4,0,0,0,0,0,14,3,0,0,0,0,0,4,9,0,0,4,7,0,0,0,7,2,0,0,0,2,0,0,3,13,0,0,0,2,0,0,9,0,0,0,0,0,0,3,1,2,0,6,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,2,0,0,0,0,0,0,0,0,1,0,0,0,0,0,2,0,0,0,0,0,17,0,0,7,0,4,0,0,0,2,0,0,14,0,0,6,0,0,2,2,0,4,0,0,3,0,0,0,0,3,0,4,0,0,0,0,0,0,0,9,3,2,0,2,0,0,0,0,0,2,3,0,0,0,12,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,6,0,0,0,0,0,0,3,0,0,0,5,0,0,0,0,10,10,0,2,0,0,0,0,0,0,2,5,2,0,0,14,4,2,0,0,0,0,0,0,0,0,0,1,6,3,2,0,1,0,0,0,0,4,0,0,0,6,2,8,10,0,0,0,0,4,2,7,0,0,0,0,0,0,0,0,0,0,0,0,6,3,0,0,0,0,0,0,0,4,1,0,3,0,0,2,0,0,6,0,0,0,0,0,5,2,0,0,0,0,2,0,0,6,4,3,0,0,0,0,0,0,4,0,0,11,4,0,0,0,2,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,4,1,7,0,Amazon,22,0,0,2,2,0,2,0,0,0,0,0,0,0,0,10,0,0,0,0,5,0,0,0,0,11,0,0,0,1,0,0,0,0,0,0,0,0,6,16,6,0,0,3,0,6,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,2,3,7,0,13,0,2,0,0,0,2,0,0,0,29,0,0,0,0,0,0,0,0,0,0,2,0,0,0,5,0,0,0,0,0,2,0,3,0,5,0,4,0,0,0,0,0,0,11,12,0,0,0,0,0,0,7,5,0,0,0,2,0,8,0,0,0,0,0,0,0,2,0,6,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,12,2,2,4,0,11,52,0,0,0,4,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,2,2,20,3,0,0,0,3,2,2,2,5,3,0,0,0,0,5,0,8,0,0,0,0,0,4,0,3,18,0,0,0,29,2,0,2,0,0,2,2,0,0,0,2,10,0,5,0,0,0,6,3,0,0,2,0,2,2,0,0,0,10,0,0,2,3,0,0,0,0,3,0,0,7,5,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,2,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,15,0,0,0,0,0,0,0,2,3,0,0,0,15,0,14,15,1,10,0,0,13,17,2,0,10,2,0,0,0,0,0,0,0,0,3,0,0,0,0,0,2,0,0,0,0,0,0,0,4,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,1,2,0,0,0,5,4,0,4,0,0,0,0,0,0,0,0,0,0,7,13,0,0,2,0,0,0,0,0,0,10,0,0,12,0,4,0,0,3,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,2,0,0,0,4,4,0,0,3,0,42,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,2,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,4,2,0,0,7,2,0,0,0,0,0,2,0,0,0,2,0,0,5,5,3,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,1,0,0,0,15,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,4,2,0,0,2,0,0,0,4,0,0,0,0,0,2,0,0,0,1,11,0,0,0,0,2,3,0,0,2,0,2,6,0,2,2,2,0,3,3,6,0,2,0,0,0,4,0,0,0,0,0,2,0,0,0,0,3,0,0,2,2,10,5,0,13,0,0,0,5,0,2,0,34,4,5,0,0,6,7,0,9,4,2,0,0,12,2,0,0,0,0,0,0,0,7,5,24,0,0,0,0,0,0,0,0,0,0,0,0,0,2,20,0,8,0,0,0,0,0,0,7,0,0,3,8,0,3,2,0,0,0,0,45,0,0,0,0,5,5,0,0,0,6,3,0,0,2,0,0,0,0,0,0,2,0,2,0,5,8,0,0,0,0,3,0,0,2,0,0,0,0,26,0,0,0,0,0,0,0,0,0,3,5,0,0,0,0,0,0,0,6,0,16,0,0,0,0,0,0,0,10,0,0,0,3,0,2,0,0,3,5,4,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,7,0,5,0,0,0,2,0,0,0,0,2,2,0,0,0,4,0,0,1,0,0,0,0,1,5,0,0,0,0,12,8,0,2,9,0,3,2,0,0,0,0,0,0,0,39,0,2,0,0,0,0,0,2,0,0,4,0,0,0,9,2,0,0,0,0,6,0,0,0,8,3,22,0,0,2,8,0,0,0,6,0,2,2,0,0,0,6,0,0,3,1,0,0,2,1,0,0,0,14,0,5,3,6,2,0,0,16,7,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,4,4,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,4,2,0,0,0,0,0,0,0,0,0,0,4,0,0,0,3,0,0,0,0,3,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,2,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,2,0,0,3,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,13,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,7,0,0,0,4,0,0,0,0,0,0,2,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,13,4,0,2,0,0,4,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,2,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,7,0,0,0,3,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,6,0,0,0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,razorpay,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,6,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,6,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,19,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,4,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,3,3,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,3,4,3,0,0,7,5,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,eBay,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,7,0,5,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,23,5,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,Wix,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,6,0,0,0,0,0,0,2,0,0,0,0,4,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,5,2,0,0,0,0,0,2,7,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,4,0,0,0,0,0,2,0,0,0,0,0,3,1,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,7,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,2,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,12,0,0,0,0,0,0,0,0,0,0,0,14,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,2,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,2,1,0,0,0,0,3,0,0,0,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,11,2,0,0,2,0,0,0,0,0,0,3,4,0,0,0,0,0,0,0,0,0,0,10,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,14,0,0,0,0,0,0,0,4,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,1,0,0,0,0,2,14,0,2,3,2,3,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,5,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,8,0,0,3,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,4,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,7,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,0,0,0,0,0,0,0,0,0,2,0,0,0,5,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,2,0,0,6,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,6,17,0,0,5,0,0,0,0,0,0,0,0,0,0,11,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,5,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,3,17,36,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,5,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,5,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,2,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,11,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,3,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,5,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,20,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,9,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,5,0,0,0,2,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,4,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,2,0,0,0,0,0,0,0,4,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,8,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,4,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,7,2,0,0,0,0,0,2,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,13,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,3,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,10,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,2,0,0,2,0,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,0,5,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0\n" }, { "path": "data/leetcode_problems.csv", "content": "name,link,difficulty,solution\nLargest 3-Same-Digit Number in String,https://leetcode.com/problems/largest-3-same-digit-number-in-string/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2264.java) \nMinimum Consecutive Cards to Pick Up,https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2260.java) \nRemove Digit From Number to Maximize Result,https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2259.java) \nMinimum Average Difference,https://leetcode.com/problems/minimum-average-difference/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2256.java) \nCount Prefixes of a Given String,https://leetcode.com/problems/count-prefixes-of-a-given-string/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2255.java) \nIntersection of Multiple Arrays,https://leetcode.com/problems/intersection-of-multiple-arrays/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2248.java) \nMinimum Rounds to Complete All Tasks,https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2244.java) \nCalculate Digit Sum of a String,https://leetcode.com/problems/calculate-digit-sum-of-a-string/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2243.java) \nFind Closest Number to Zero,https://leetcode.com/problems/find-closest-number-to-zero/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2239.java) \nRoot Equals Sum of Children,https://leetcode.com/problems/root-equals-sum-of-children/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2236.java) \nRoot Equals Sum of Children,https://leetcode.com/problems/root-equals-sum-of-children/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2236.java) \nMinimum Bit Flips to Convert Number,https://leetcode.com/problems/minimum-bit-flips-to-convert-number/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2220.java) \nFind the Difference of Two Arrays,https://leetcode.com/problems/find-the-difference-of-two-arrays/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2215.java) \nCount Hills and Valleys in an Array,https://leetcode.com/problems/count-hills-and-valleys-in-an-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2210.java) \nMinimum Operations to Halve Array Sum,https://leetcode.com/problems/minimum-operations-to-halve-array-sum/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2208.java) \nDivide Array Into Equal Pairs,https://leetcode.com/problems/divide-array-into-equal-pairs/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2206.java) \nCount Artifacts That Can Be Extracted,https://leetcode.com/problems/count-artifacts-that-can-be-extracted/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2201.java) \nFind All K-Distant Indices in an Array,https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2200.java) \nCells in a Range on an Excel Sheet,https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2194.java) \nMost Frequent Number Following Key In an Array,https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2190.java) \nMinimum Number of Steps to Make Two Strings Anagram II,https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2186.java) \nCounting Words With a Given Prefix,https://leetcode.com/problems/counting-words-with-a-given-prefix/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2185.java) \nConstruct String With Repeat Limit,https://leetcode.com/problems/construct-string-with-repeat-limit/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2182.java) \nMerge Nodes in Between Zeros,https://leetcode.com/problems/merge-nodes-in-between-zeros/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2181.java) \nCount Integers With Even Digit Sum,https://leetcode.com/problems/count-integers-with-even-digit-sum/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2180.java) \nFind Three Consecutive Integers That Sum to a Given Number,https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2177.java) \nCount Equal and Divisible Pairs in an Array,https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2176.java) \nCount Operations to Obtain Zero,https://leetcode.com/problems/count-operations-to-obtain-zero/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2169.java) \nDesign Bitset,https://leetcode.com/problems/design-bitset/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2166.java) \nSmallest Value of the Rearranged Number,https://leetcode.com/problems/smallest-value-of-the-rearranged-number/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2165.java) \nSort Even and Odd Indices Independently,https://leetcode.com/problems/sort-even-and-odd-indices-independently/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2164.java) \nPartition Array According to Given Pivot,https://leetcode.com/problems/partition-array-according-to-given-pivot/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2161.java) \nMinimum Sum of Four Digit Number After Splitting Digits,https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2160.java) \nFind Substring With Given Hash Value,https://leetcode.com/problems/find-substring-with-given-hash-value/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2156.java) \nAll Divisions With the Highest Score of a Binary Array,https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2155.java) \nKeep Multiplying Found Values by Two,https://leetcode.com/problems/keep-multiplying-found-values-by-two/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2154.java) \nFind All Lonely Numbers in the Array,https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2150.java) \nRearrange Array Elements by Sign,https://leetcode.com/problems/rearrange-array-elements-by-sign/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2149.java) \nCount Elements With Strictly Smaller and Greater Elements,https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2148.java) \nMinimum Cost of Buying Candies With Discount,https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2144.java) \nMinimum Moves to Reach Target Score,https://leetcode.com/problems/minimum-moves-to-reach-target-score/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2139.java) \nDivide a String Into Groups of Size k,https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2138.java) \nMinimum Swaps to Group All 1's Together II,https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2134.java) \nCheck if Every Row and Column Contains All Numbers,https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2133.java) \nMaximum Twin Sum of a Linked List,https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2130.java) \nCapitalize the Title,https://leetcode.com/problems/capitalize-the-title/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2129.java) \nDestroying Asteroids,https://leetcode.com/problems/destroying-asteroids/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2126.java) \nNumber of Laser Beams in a Bank,https://leetcode.com/problems/number-of-laser-beams-in-a-bank/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2125.java) \nCheck if All A's Appears Before All B's,https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2124.java) \nExecution of All Suffix Instructions Staying in a Grid,https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2120.java) \nA Number After a Double Reversal,https://leetcode.com/problems/a-number-after-a-double-reversal/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2119.java) \nCheck if a Parentheses String Can Be Valid,https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2116.java) \nMaximum Number of Words Found in Sentences,https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2114.java) \nNumber of Smooth Descent Periods of a Stock,https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2110.java) \nAdding Spaces to a String,https://leetcode.com/problems/adding-spaces-to-a-string/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2109.java) \nFind First Palindromic String in the Array,https://leetcode.com/problems/find-first-palindromic-string-in-the-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2108.java) \nRings and Rods,https://leetcode.com/problems/rings-and-rods/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2103.java) \nFind Subsequence of Length K With the Largest Sum,https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2099.java) \nDelete the Middle Node of a Linked List,https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2095.java) \nFinding 3-Digit Even Numbers,https://leetcode.com/problems/finding-3-digit-even-numbers/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2094.java) \nRemoving Minimum and Maximum From Array,https://leetcode.com/problems/removing-minimum-and-maximum-from-array/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2091.java) \nK Radius Subarray Averages,https://leetcode.com/problems/k-radius-subarray-averages/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2090.java) \nFind Target Indices After Sorting Array,https://leetcode.com/problems/find-target-indices-after-sorting-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2089.java) \nMinimum Number of Buckets Required to Collect Rainwater from Houses,https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2086.java) \nCount Common Words With One Occurrence,https://leetcode.com/problems/count-common-words-with-one-occurrence/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2085.java) \nRange Frequency Queries,https://leetcode.com/problems/range-frequency-queries/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2080.java) \nWatering Plants,https://leetcode.com/problems/watering-plants/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2079.java) \nTwo Furthest Houses With Different Colors,https://leetcode.com/problems/two-furthest-houses-with-different-colors/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2078.java) \nProcess Restricted Friend Requests,https://leetcode.com/problems/process-restricted-friend-requests/,Hard ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2076.java) \nDecode the Slanted Ciphertext,https://leetcode.com/problems/decode-the-slanted-ciphertext/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2075.java) \nReverse Nodes in Even Length Groups,https://leetcode.com/problems/reverse-nodes-in-even-length-groups/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2074.java) \nTime Needed to Buy Tickets,https://leetcode.com/problems/time-needed-to-buy-tickets/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2073.java) \nMost Beautiful Item for Each Query,https://leetcode.com/problems/most-beautiful-item-for-each-query/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2070.java) \nCheck Whether Two Strings are Almost Equivalent,https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2068.java) \nVowels of All Substrings,https://leetcode.com/problems/vowels-of-all-substrings/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2063.java) \nCount Vowel Substrings of a String,https://leetcode.com/problems/count-vowel-substrings-of-a-string/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2062.java) \nFind the Minimum and Maximum Number of Nodes Between Critical Points,https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2058.java) \nSmallest Index With Equal Value,https://leetcode.com/problems/smallest-index-with-equal-value/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2057.java) \nPlates Between Candles,https://leetcode.com/problems/plates-between-candles/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2055.java) \nTwo Best Non-Overlapping Events,https://leetcode.com/problems/two-best-non-overlapping-events/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2054.java) \nKth Distinct String in an Array,https://leetcode.com/problems/kth-distinct-string-in-an-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2053.java) \nParallel Courses III,https://leetcode.com/problems/parallel-courses-iii/,Hard ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2050.java) \nNext Greater Numerically Balanced Number,https://leetcode.com/problems/next-greater-numerically-balanced-number/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2048.java) \nNumber of Valid Words in a Sentence,https://leetcode.com/problems/number-of-valid-words-in-a-sentence/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2047.java) \nCount Number of Maximum Bitwise-OR Subsets,https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2044.java) \nSimple Bank System,https://leetcode.com/problems/simple-bank-system/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2043.java) \nCheck if Numbers Are Ascending in a Sentence,https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2042.java) \nThe Time When the Network Becomes Idle,https://leetcode.com/problems/the-time-when-the-network-becomes-idle/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2039.java) \nRemove Colored Pieces if Both Neighbors are the Same Color,https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2038.java) \nMinimum Number of Moves to Seat Everyone,https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2037.java) \nStock Price Fluctuation,https://leetcode.com/problems/stock-price-fluctuation/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2034.java) \nMinimum Operations to Make a Uni-Value Grid,https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2033.java) \nTwo Out of Three,https://leetcode.com/problems/two-out-of-three/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2032.java) \nFind Missing Observations,https://leetcode.com/problems/find-missing-observations/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2028.java) \nMinimum Moves to Convert String,https://leetcode.com/problems/minimum-moves-to-convert-string/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2027.java) \nMaximize the Confusion of an Exam,https://leetcode.com/problems/maximize-the-confusion-of-an-exam/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2024.java) \nNumber of Pairs of Strings With Concatenation Equal to Target,https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2023.java) \nConvert 1D Array Into 2D Array,https://leetcode.com/problems/convert-1d-array-into-2d-array/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2022.java) \nCheck if Word Can Be Placed In Crossword,https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2018.java) \nGrid Game,https://leetcode.com/problems/grid-game/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2017.java) \nMaximum Difference Between Increasing Elements,https://leetcode.com/problems/maximum-difference-between-increasing-elements/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2016.java) \nSum of Beauty in the Array,https://leetcode.com/problems/sum-of-beauty-in-the-array/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2012.java) \nFinal Value of Variable After Performing Operations,https://leetcode.com/problems/final-value-of-variable-after-performing-operations/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2011.java) \nFind Original Array From Doubled Array,https://leetcode.com/problems/find-original-array-from-doubled-array/,Medium ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2007.java) \nCount Number of Pairs With Absolute Difference K,https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/,Easy ,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2006.java) \nNumber of Pairs of Interchangeable Rectangles,https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/,Medium ,\"[Python3](https://github.com/fishercoder1534/Leetcode/blob/master/python3/2001.py), [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2001.java) \"\nReverse Prefix of Word,https://leetcode.com/problems/reverse-prefix-of-word/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2000.java) \nThe Number of Weak Characters in the Game,https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1996.java) \nCount Special Quadruplets,https://leetcode.com/problems/count-special-quadruplets/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1995.java) \nFind All Groups of Farmland,https://leetcode.com/problems/find-all-groups-of-farmland/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1992.java) \nFind the Middle Index in Array,https://leetcode.com/problems/find-the-middle-index-in-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1991.java) \nFind the Kth Largest Integer in the Array,https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1985.java) \nMinimum Difference Between Highest and Lowest of K Scores,https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1984.java) \nMinimize the Difference Between Target and Chosen Elements,https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1981.java) \nFind Unique Binary String,https://leetcode.com/problems/find-unique-binary-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1980.java) \nFind Greatest Common Divisor of Array,https://leetcode.com/problems/find-greatest-common-divisor-of-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1979.java) \nMinimum Time to Type Word Using Special Typewriter,https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1974.java) \nFind if Path Exists in Graph,https://leetcode.com/problems/find-if-path-exists-in-graph/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1971.java) \nArray With Elements Not Equal to Average of Neighbors,https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1968.java) \nNumber of Strings That Appear as Substrings in Word,https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1967.java) \nBinary Searchable Numbers in an Unsorted Array,https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1966.java) \nCheck If String Is a Prefix of Array,https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1961.java) \nDelete Characters to Make Fancy String,https://leetcode.com/problems/delete-characters-to-make-fancy-string/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1957.java) \nThree Divisors,https://leetcode.com/problems/three-divisors/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1952.java) \nSum of Digits of String After Convert,https://leetcode.com/problems/sum-of-digits-of-string-after-convert/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1945.java) \nCheck if All Characters Have Equal Number of Occurrences,https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1941.java) \nAdd Minimum Number of Rungs,https://leetcode.com/problems/add-minimum-number-of-rungs/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1936.java) \nMaximum Number of Words You Can Type,https://leetcode.com/problems/maximum-number-of-words-you-can-type/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1935.java) \nCheck if String Is Decomposable Into Value-Equal Substrings,https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1933.java) \nConcatenation of Array,https://leetcode.com/problems/concatenation-of-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1929.java) \nNearest Exit from Entrance in Maze,https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1926.java) \nCount Square Sum Triples,https://leetcode.com/problems/count-square-sum-triples/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1925.java) \nBuild Array from Permutation,https://leetcode.com/problems/build-array-from-permutation/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1920.java) \nMaximum Product Difference Between Two Pairs,https://leetcode.com/problems/maximum-product-difference-between-two-pairs/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1913.java) \nRemove All Occurrences of a Substring,https://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1904.java) \nRemove One Element to Make the Array Strictly Increasing,https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1909.java) \nThe Number of Full Rounds You Have Played,https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1904.java) \nLargest Odd Number in String,https://leetcode.com/problems/largest-odd-number-in-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1903.java) \nRedistribute Characters to Make All Strings Equal,https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1897.java) \nCheck if All the Integers in a Range Are Covered,https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1893.java) \nCutting Ribbons,https://leetcode.com/problems/cutting-ribbons/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1891.java) \nDetermine Whether Matrix Can Be Obtained By Rotation,https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1886.java) \nCheck if Word Equals Summation of Two Words,https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1880.java) \nMinimize Maximum Pair Sum in Array,https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1877.java) \nSubstrings of Size Three with Distinct Characters,https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1876.java) \nMinimize Product Sum of Two Arrays,https://leetcode.com/problems/minimize-product-sum-of-two-arrays/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1874.java) \nLonger Contiguous Segments of Ones than Zeros,https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1869.java) \nSum of All Subset XOR Totals,https://leetcode.com/problems/sum-of-all-subset-xor-totals/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1863.java) \nSum of Floored Pairs,https://leetcode.com/problems/sum-of-floored-pairs/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1862.java) \nRotating the Box,https://leetcode.com/problems/rotating-the-box/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) \nIncremental Memory Leak,https://leetcode.com/problems/incremental-memory-leak/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1860.java) \nSorting the Sentence,https://leetcode.com/problems/sorting-the-sentence/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1859.java) \nMaximum Population Year,https://leetcode.com/problems/maximum-population-year/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1854.java) \nMinimum Distance to the Target Element,https://leetcode.com/problems/minimum-distance-to-the-target-element/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1848.java) \nSeat Reservation Manager,https://leetcode.com/problems/seat-reservation-manager/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1845.java) \nReplace All Digits with Characters,https://leetcode.com/problems/replace-all-digits-with-characters/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1844.java) \nSum of Digits in Base K,https://leetcode.com/problems/sum-of-digits-in-base-k/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1837.java) \nRemove Duplicates From an Unsorted Linked List,https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1836.java) \nMaximum Ice Cream Bars,https://leetcode.com/problems/maximum-ice-cream-bars/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1833.java) \nCheck if the Sentence Is Pangram,https://leetcode.com/problems/check-if-the-sentence-is-pangram/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1832.java) \nMaximum XOR for Each Query,https://leetcode.com/problems/maximum-xor-for-each-query/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1829.java) \nQueries on Number of Points Inside a Circle,https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1828.java) \nMinimum Operations to Make the Array Increasing,https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1827.java) \nFaulty Sensor,https://leetcode.com/problems/faulty-sensor/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1826.java) \nFind the Winner of the Circular Game,https://leetcode.com/problems/find-the-winner-of-the-circular-game/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1823.java) \nSign of the Product of an Array,https://leetcode.com/problems/sign-of-the-product-of-an-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1822.java) \nFinding the Users Active Minutes,https://leetcode.com/problems/finding-the-users-active-minutes/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1817.java) \nTruncate Sentence,https://leetcode.com/problems/truncate-sentence/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1816.java) \nCount Nice Pairs in an Array,https://leetcode.com/problems/count-nice-pairs-in-an-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1814.java) \nSentence Similarity III,https://leetcode.com/problems/sentence-similarity-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1813.java) \nDetermine Color of a Chessboard Square,https://leetcode.com/problems/determine-color-of-a-chessboard-square/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1812.java) \nEvaluate the Bracket Pairs of a String,https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1807.java) \nMinimum Number of Operations to Reinitialize a Permutation,https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1806.java) \nNumber of Different Integers in a String,https://leetcode.com/problems/number-of-different-integers-in-a-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1805.java) \nImplement Trie II (Prefix Tree),https://leetcode.com/problems/implement-trie-ii-prefix-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1804.java) \nMaximum Ascending Subarray Sum,https://leetcode.com/problems/maximum-ascending-subarray-sum/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1800.java) \nDesign Authentication Manager,https://leetcode.com/problems/design-authentication-manager/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1797.java) \nSecond Largest Digit in a String,https://leetcode.com/problems/second-largest-digit-in-a-string/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1796.java) \nMaximum Average Pass Ratio,https://leetcode.com/problems/maximum-average-pass-ratio/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1792.java) \nFind Center of Star Graph,https://leetcode.com/problems/find-center-of-star-graph/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1791.java) \nCheck if One String Swap Can Make Strings Equal,https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1790.java) \nMinimum Elements to Add to Form a Given Sum,https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1785.java) \nCheck if Binary String Has at Most One Segment of Ones,https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1784.java) \nSum of Beauty of All Substrings,https://leetcode.com/problems/sum-of-beauty-of-all-substrings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1781.java) \nCheck if Number is a Sum of Powers of Three,https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1780.java) \nFind Nearest Point That Has the Same X or Y Coordinate,https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1779.java) \nEqual Sum Arrays With Minimum Number of Operations,https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1775.java) \nClosest Dessert Cost,https://leetcode.com/problems/closest-dessert-cost/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1774.java) \nCount Items Matching a Rule,https://leetcode.com/problems/count-items-matching-a-rule/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1773.java) \nSort Features by Popularity,https://leetcode.com/problems/sort-features-by-popularity/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1772.java) \nMinimum Number of Operations to Move All Balls to Each Box,https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1769.java) \nMerge Strings Alternately,https://leetcode.com/problems/merge-strings-alternately/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1768.java) \nMap of Highest Peak,https://leetcode.com/problems/map-of-highest-peak/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1765.java) \nForm Array by Concatenating Subarrays of Another Array,https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1764.java) \nLongest Nice Substring,https://leetcode.com/problems/longest-nice-substring/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1763.java) \nCount Number of Homogenous Substrings,https://leetcode.com/problems/count-number-of-homogenous-substrings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1758.java) \nMinimum Changes To Make Alternating Binary String,https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1758.java) \nDesign Most Recently Used Queue,https://leetcode.com/problems/design-most-recently-used-queue/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1756.java) \nLargest Merge Of Two Strings,https://leetcode.com/problems/largest-merge-of-two-strings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1753.java) \nMaximum Score From Removing Stones,https://leetcode.com/problems/maximum-score-from-removing-stones/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1753.java) \nCheck if Array Is Sorted and Rotated,https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1752.java) \nMinimum Length of String After Deleting Similar Ends,https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1750.java) \nMaximum Absolute Sum of Any Subarray,https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1749.java) \nSum of Unique Elements,https://leetcode.com/problems/sum-of-unique-elements/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1748.java) \nMaximum Subarray Sum After One Operation,https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1746.java) \nPalindrome Partitioning IV,https://leetcode.com/problems/palindrome-partitioning-iv/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1745.java) \nRestore the Array From Adjacent Pairs,https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1743.java) \nMaximum Number of Balls in a Box,https://leetcode.com/problems/maximum-number-of-balls-in-a-box/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1742.java) \nLatest Time by Replacing Hidden Digits,https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1736.java) \nMinimum Number of People to Teach,https://leetcode.com/problems/minimum-number-of-people-to-teach/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1733.java) \nFind the Highest Altitude,https://leetcode.com/problems/find-the-highest-altitude/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1732.java) \nLargest Submatrix With Rearrangements,https://leetcode.com/problems/largest-submatrix-with-rearrangements/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1727.java) \nTuple with Same Product,https://leetcode.com/problems/tuple-with-same-product/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1726.java) \nNumber Of Rectangles That Can Form The Largest Square,https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1725.java) \nSwapping Nodes in a Linked List,https://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1721.java) \nDecode XORed Array,https://leetcode.com/problems/decode-xored-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1720.java) \nConstruct the Lexicographically Largest Valid Sequence,https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1718.java) \nMaximum Score From Removing Substrings,https://leetcode.com/problems/maximum-score-from-removing-substrings/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1717.java) \nCalculate Money in Leetcode Bank,https://leetcode.com/problems/calculate-money-in-leetcode-bank/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1716.java) \nCount Good Meals,https://leetcode.com/problems/count-good-meals/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1711.java) \nMaximum Units on a Truck,https://leetcode.com/problems/maximum-units-on-a-truck/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1710.java) \nLargest Subarray Length K,https://leetcode.com/problems/largest-subarray-length-k/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1708.java) \nMaximum Number of Eaten Apples,https://leetcode.com/problems/maximum-number-of-eaten-apples/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1705.java) \nDetermine if String Halves Are Alike,https://leetcode.com/problems/determine-if-string-halves-are-alike/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1704.java) \nNumber of Students Unable to Eat Lunch,https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1700.java) \nMaximum Erasure Value,https://leetcode.com/problems/maximum-erasure-value/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1695.java) \nReformat Phone Number,https://leetcode.com/problems/reformat-phone-number/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1694.java) \nStone Game VII,https://leetcode.com/problems/stone-game-vii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1690.java) \nPartitioning Into Minimum Number Of Deci-Binary Numbers,https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1689.java) \nCount of Matches in Tournament,https://leetcode.com/problems/count-of-matches-in-tournament/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1688.java) \nStone Game VI,https://leetcode.com/problems/stone-game-vi/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1686.java) \nSum of Absolute Differences in a Sorted Array,https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1685.java) \nCount the Number of Consistent Strings,https://leetcode.com/problems/count-the-number-of-consistent-strings/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1684.java) \nConcatenation of Consecutive Binary Numbers,https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1680.java) \nMax Number of K-Sum Pairs,https://leetcode.com/problems/max-number-of-k-sum-pairs/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1679.java) \nGoal Parser Interpretation,https://leetcode.com/problems/goal-parser-interpretation/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1678.java) \nLowest Common Ancestor of a Binary Tree IV,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1676.java) \nMinimize Deviation in Array,https://leetcode.com/problems/minimize-deviation-in-array/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1675.java) \nFind the Most Competitive Subsequence,https://leetcode.com/problems/find-the-most-competitive-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1673.java) \nRichest Customer Wealth,https://leetcode.com/problems/richest-customer-wealth/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1672.java) \nDesign Front Middle Back Queue,https://leetcode.com/problems/design-front-middle-back-queue/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1670.java) \nMerge In Between Linked Lists,https://leetcode.com/problems/merge-in-between-linked-lists/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1669.java) \nMaximum Repeating Substring,https://leetcode.com/problems/maximum-repeating-substring/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1668.java) \nWays to Make a Fair Array,https://leetcode.com/problems/ways-to-make-a-fair-array/,Medium ,[Javascript](./javascript/_1664.js) \nSmallest String With A Given Numeric Value,https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1663.java) \nCheck If Two String Arrays are Equivalent,https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1662.java) \nMinimum Operations to Reduce X to Zero,https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/,Medium ,\"[Javascript](./javascript/_1658.js), [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1658.java) \"\nDetermine if Two Strings Are Close,https://leetcode.com/problems/determine-if-two-strings-are-close/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1657.java) \nDesign an Ordered Stream,https://leetcode.com/problems/design-an-ordered-stream/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1656.java) \nDefuse the Bomb,https://leetcode.com/problems/defuse-the-bomb/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1652.java) \nLowest Common Ancestor of a Binary Tree III,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) \nGet Maximum in Generated Array,https://leetcode.com/problems/get-maximum-in-generated-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1646.java) \nLowest Common Ancestor of a Binary Tree II,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1644.java) \nFurthest Building You Can Reach,https://leetcode.com/problems/furthest-building-you-can-reach/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1642.java) \nCount Sorted Vowel Strings,https://leetcode.com/problems/count-sorted-vowel-strings/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1641.java) \nCheck Array Formation Through Concatenation,https://leetcode.com/problems/check-array-formation-through-concatenation/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1640.java) \nWidest Vertical Area Between Two Points Containing No Points,https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/,Medium ,\"[Javascript](./javascript/_1637.js), [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1637.java) \"\nSort Array by Increasing Frequency,https://leetcode.com/problems/sort-array-by-increasing-frequency/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1636.java) \nArithmetic Subarrays,https://leetcode.com/problems/arithmetic-subarrays/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1630.java) \nSlowest Key,https://leetcode.com/problems/slowest-key/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1629.java) \nDesign an Expression Tree With Evaluate Function,https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1628.java) \nBest Team With No Conflicts,https://leetcode.com/problems/best-team-with-no-conflicts/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1626.java) \nLexicographically Smallest String After Applying Operations,https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1625.java) \nLargest Substring Between Two Equal Characters,https://leetcode.com/problems/largest-substring-between-two-equal-characters/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1624.java) \nCoordinate With Maximum Network Quality,https://leetcode.com/problems/coordinate-with-maximum-network-quality/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1620.java) \nMean of Array After Removing Some Elements,https://leetcode.com/problems/mean-of-array-after-removing-some-elements/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1619.java) \nMaximum Nesting Depth of the Parentheses,https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1614.java) \nEven Odd Tree,https://leetcode.com/problems/even-odd-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1609.java) \nSpecial Array With X Elements Greater Than or Equal X,https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1608.java) \nAlert Using Same Key-Card Three or More Times in a One Hour Period,https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) \nDesign Parking System,https://leetcode.com/problems/design-parking-system/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1603.java) \nMaximum Number of Achievable Transfer Requests,https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1601.java) \nCrawler Log Folder,https://leetcode.com/problems/crawler-log-folder/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1598.java) \nRearrange Spaces Between Words,https://leetcode.com/problems/rearrange-spaces-between-words/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1592.java) \nSum of All Odd Length Subarrays,https://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1588.java) \nCount Unhappy Friends,https://leetcode.com/problems/count-unhappy-friends/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1583.java) \nSpecial Positions in a Binary Matrix,https://leetcode.com/problems/special-positions-in-a-binary-matrix/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1582.java) \nNumber of Ways Where Square of Number Is Equal to Product of Two Numbers,https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1577.java) \nReplace All ?'s to Avoid Consecutive Repeating Characters,https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1576.java) \nShortest Subarray to be Removed to Make Array Sorted,https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1574.java) \nMatrix Diagonal Sum,https://leetcode.com/problems/matrix-diagonal-sum/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1572.java) \nDot Product of Two Sparse Vectors,https://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1570.java) \nMaximum Length of Subarray With Positive Product,https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1567.java) \nDetect Pattern of Length M Repeated K or More Times,https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1566.java) \nMaximum Number of Coins You Can Get,https://leetcode.com/problems/maximum-number-of-coins-you-can-get/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1561.java) \nMost Visited Sector in a Circular Track,https://leetcode.com/problems/most-visited-sector-in-a-circular-track/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1560.java) \nMinimum Numbers of Function Calls to Make Target Array,https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1558.java) \nMinimum Number of Vertices to Reach All Nodes,https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1557.java) \nThousand Separator,https://leetcode.com/problems/thousand-separator/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1556.java) \nMinimum Operations to Make Array Equal,https://leetcode.com/problems/minimum-operations-to-make-array-equal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1551.java) \nThree Consecutive Odds,https://leetcode.com/problems/three-consecutive-odds/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1550.java) \nFind Kth Bit in Nth Binary String,https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1545.java) \nMake The String Great,https://leetcode.com/problems/make-the-string-great/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1544.java) \nMinimum Insertions to Balance a Parentheses String,https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1541.java) \nKth Missing Positive Number,https://leetcode.com/problems/kth-missing-positive-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1539.java) \nFind the Winner of an Array Game,https://leetcode.com/problems/find-the-winner-of-an-array-game/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1535.java) \nCount Good Triplets,https://leetcode.com/problems/count-good-triplets/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1534.java) \nShuffle String,https://leetcode.com/problems/shuffle-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1528.java) \nMinimum Number of Increments on Subarrays to Form a Target Array,https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1526.java) \nNumber of Good Ways to Split a String,https://leetcode.com/problems/number-of-good-ways-to-split-a-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1525.java) \nNumber of Sub-arrays With Odd Sum,https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1524.java) \nCount Odd Numbers in an Interval Range,https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1523.java) \nWater Bottles,https://leetcode.com/problems/water-bottles/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1518.java) \nPath with Maximum Probability,https://leetcode.com/problems/path-with-maximum-probability/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1514.java) \nNumber of Good Pairs,https://leetcode.com/problems/number-of-good-pairs/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1512.java) \nRange Sum of Sorted Subarray Sums,https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1508.java) \nReformat Date,https://leetcode.com/problems/reformat-date/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) \nCan Make Arithmetic Progression From Sequence,https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1502.java) \nPath Crossing,https://leetcode.com/problems/path-crossing/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1496.java) \nLongest Subarray of 1's After Deleting One Element,https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1493.java) \nThe kth Factor of n,https://leetcode.com/problems/the-kth-factor-of-n/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1492.java) \nAverage Salary Excluding the Minimum and Maximum Salary,https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1491.java) \nClone N-ary Tree,https://leetcode.com/problems/clone-n-ary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1490.java) \nMaking File Names Unique,https://leetcode.com/problems/making-file-names-unique/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1487.java) \nXOR Operation in an Array,https://leetcode.com/problems/xor-operation-in-an-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1486.java) \nClone Binary Tree With Random Pointer,https://leetcode.com/problems/clone-binary-tree-with-random-pointer/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1485.java) \nMinimum Number of Days to Make m Bouquets,https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1482.java) \nLeast Number of Unique Integers after K Removals,https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1481.java) \nRunning Sum of 1d Array,https://leetcode.com/problems/running-sum-of-1d-array/,Easy,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1480.cpp) \"\nSubrectangle Queries,https://leetcode.com/problems/subrectangle-queries/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1476.java) \nFinal Prices With a Special Discount in a Shop,https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1475.java) \nDelete N Nodes After M Nodes of a Linked List,https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1474.java) \nDesign Browser History,https://leetcode.com/problems/design-browser-history/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1472.java) \nThe k Strongest Values in an Array,https://leetcode.com/problems/the-k-strongest-values-in-an-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1471.java) \nShuffle the Array,https://leetcode.com/problems/shuffle-the-array/,Easy,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1470.cpp) \"\nFind All The Lonely Nodes,https://leetcode.com/problems/find-all-the-lonely-nodes/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1469.java) \nReorder Routes to Make All Paths Lead to the City Zero,https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) \nMaximum Product of Two Elements in an Array,https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1464.java) \nCheck If a String Contains All Binary Codes of Size K,https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1461.java) \nMake Two Arrays Equal by Reversing Sub-arrays,https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1460.java) \nPseudo-Palindromic Paths in a Binary Tree,https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1457.java) \nMaximum Number of Vowels in a Substring of Given Length,https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1456.java) \nCheck If a Word Occurs As a Prefix of Any Word in a Sentence,https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1455.java) \nPeople Whose List of Favorite Companies Is Not a Subset of Another List,https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1452.java) \nRearrange Words in a Sentence,https://leetcode.com/problems/rearrange-words-in-a-sentence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1451.java) \nNumber of Students Doing Homework at a Given Time,https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1450.java) \nCount Good Nodes in Binary Tree,https://leetcode.com/problems/count-good-nodes-in-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1448.java) \nSimplified Fractions,https://leetcode.com/problems/simplified-fractions/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1447.java) \nConsecutive Characters,https://leetcode.com/problems/consecutive-characters/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1446.java) \nBuild an Array With Stack Operations,https://leetcode.com/problems/build-an-array-with-stack-operations/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1441.java) \nFind the Kth Smallest Sum of a Matrix With Sorted Rows,https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1439.java) \nLongest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1438.java) \nCheck If All 1's Are at Least Length K Places Away,https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1437.java) \nDestination City,https://leetcode.com/problems/destination-city/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1436.java) \nMax Difference You Can Get From Changing an Integer,https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1432.java) \nKids With the Greatest Number of Candies,https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/,Easy,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1431.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1431.cpp) \"\nFirst Unique Number,https://leetcode.com/problems/first-unique-number/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1429.java) \nLeftmost Column with at Least a One,https://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1428.java) \nPerform String Shifts,https://leetcode.com/problems/perform-string-shifts/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1427.java) \nCounting Elements,https://leetcode.com/problems/counting-elements/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1426.java) \nMaximum Points You Can Obtain from Cards,https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1423.java) \nMaximum Score After Splitting a String,https://leetcode.com/problems/maximum-score-after-splitting-a-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1422.java) \nDisplay Table of Food Orders in a Restaurant,https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1418.java) \nReformat The String,https://leetcode.com/problems/reformat-the-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1417.java) \nThe k-th Lexicographical String of All Happy Strings of Length n,https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1415.java) \nMinimum Value to Get Positive Step by Step Sum,https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1413.java) \nHTML Entity Parser,https://leetcode.com/problems/html-entity-parser/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1410.java) \nQueries on a Permutation With Key,https://leetcode.com/problems/queries-on-a-permutation-with-key/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1409.java) \nString Matching in an Array,https://leetcode.com/problems/string-matching-in-an-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1408.java) \nMinimum Subsequence in Non-Increasing Order,https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1403.java) \nReducing Dishes,https://leetcode.com/problems/reducing-dishes/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) \nCircle and Rectangle Overlapping,https://leetcode.com/problems/circle-and-rectangle-overlapping/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1401.java) \nConstruct K Palindrome Strings,https://leetcode.com/problems/construct-k-palindrome-strings/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1400.java) \nCount Largest Group,https://leetcode.com/problems/count-largest-group/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1399.java) \nDesign Underground System,https://leetcode.com/problems/design-underground-system/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1396.java) \nCount Number of Teams,https://leetcode.com/problems/count-number-of-teams/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1395.java) \nFind Lucky Integer in an Array,https://leetcode.com/problems/find-lucky-integer-in-an-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1394.java) \nLongest Happy Prefix,https://leetcode.com/problems/longest-happy-prefix/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1392.java) \nFour Divisors,https://leetcode.com/problems/four-divisors/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1390.java) \nCreate Target Array in the Given Order,https://leetcode.com/problems/create-target-array-in-the-given-order/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1389.java) \nPizza With 3n Slices,https://leetcode.com/problems/pizza-with-3n-slices/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1388.java) \nSort Integers by The Power Value,https://leetcode.com/problems/sort-integers-by-the-power-value/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1387.java) \nCinema Seat Allocation,https://leetcode.com/problems/cinema-seat-allocation/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1386.java) \nFind the Distance Value Between Two Arrays,https://leetcode.com/problems/find-the-distance-value-between-two-arrays/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1385.java) \nBalance a Binary Search Tree,https://leetcode.com/problems/balance-a-binary-search-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1382.java) \nDesign a Stack With Increment Operation,https://leetcode.com/problems/design-a-stack-with-increment-operation/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1381.java) \nLucky Numbers in a Matrix,https://leetcode.com/problems/lucky-numbers-in-a-matrix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1380.java) \nFind a Corresponding Node of a Binary Tree in a Clone of That Tree,https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1379.java) \nFrog Position After T Seconds,https://leetcode.com/problems/frog-position-after-t-seconds/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1377.java) \nTime Needed to Inform All Employees,https://leetcode.com/problems/time-needed-to-inform-all-employees/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1376.java) \nBulb Switcher III,https://leetcode.com/problems/bulb-switcher-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1375.java) \nGenerate a String With Characters That Have Odd Counts,https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1374.java) \nMaximum Sum BST in Binary Tree,https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1373.java) \nLongest ZigZag Path in a Binary Tree,https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1372.java) \nFind the Longest Substring Containing Vowels in Even Counts,https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1371.java) \nIncreasing Decreasing String,https://leetcode.com/problems/increasing-decreasing-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1370.java) \nLinked List in Binary Tree,https://leetcode.com/problems/linked-list-in-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1367.java) \nRank Teams by Votes,https://leetcode.com/problems/rank-teams-by-votes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) \nHow Many Numbers Are Smaller Than the Current Number,https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1365.java) \nClosest Divisors,https://leetcode.com/problems/closest-divisors/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1362.java) \nValidate Binary Tree Nodes,https://leetcode.com/problems/validate-binary-tree-nodes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1361.java) \nNumber of Days Between Two Dates,https://leetcode.com/problems/number-of-days-between-two-dates/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1360.java) \nNumber of Substrings Containing All Three Characters,https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1358.java) \nApply Discount Every n Orders,https://leetcode.com/problems/apply-discount-every-n-orders/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1357.java) \nSort Integers by The Number of 1 Bits,https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1356.java) \nConstruct Target Array With Multiple Sums,https://leetcode.com/problems/construct-target-array-with-multiple-sums/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1354.java) \nMaximum Number of Events That Can Be Attended,https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1353.java) \nProduct of the Last K Numbers,https://leetcode.com/problems/product-of-the-last-k-numbers/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1352.java) \nCount Negative Numbers in a Sorted Matrix,https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1351.java) \nMaximum Students Taking Exam,https://leetcode.com/problems/maximum-students-taking-exam/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1349.java) \nTweet Counts Per Frequency,https://leetcode.com/problems/tweet-counts-per-frequency/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1348.java) \nMinimum Number of Steps to Make Two Strings Anagram,https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1347.java) \nCheck If N and Its Double Exist,https://leetcode.com/problems/check-if-n-and-its-double-exist/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1346.java) \nJump Game IV,https://leetcode.com/problems/jump-game-iv/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1345.java) \nAngle Between Hands of a Clock,https://leetcode.com/problems/angle-between-hands-of-a-clock/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1344.java) \nNumber of Sub-arrays of Size K and Average Greater than or Equal to Threshold,https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1343.java) \nNumber of Steps to Reduce a Number to Zero,https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1342.java) \nThe K Weakest Rows in a Matrix,https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1341.java) \nMaximum Product of Splitted Binary Tree,https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1339.java) \nReduce Array Size to The Half,https://leetcode.com/problems/reduce-array-size-to-the-half/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1338.java) \nRemove Palindromic Subsequences,https://leetcode.com/problems/remove-palindromic-subsequences/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1337.java) \n\"Filter Restaurants by Vegan-Friendly, Price and Distance\",https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1333.java) \nRemove Palindromic Subsequences,https://leetcode.com/problems/remove-palindromic-subsequences/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1332.java) \nRank Transform of an Array,https://leetcode.com/problems/rank-transform-of-an-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1331.java) \nSort the Matrix Diagonally,https://leetcode.com/problems/sort-the-matrix-diagonally/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1329.java) \nDelete Leaves With a Given Value,https://leetcode.com/problems/delete-leaves-with-a-given-value/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1325.java) \nPrint Words Vertically,https://leetcode.com/problems/print-words-vertically/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1324.java) \nMaximum 69 Number,https://leetcode.com/problems/maximum-69-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1323.java) \nConvert Integer to the Sum of Two No-Zero Integers,https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1317.java) \nSum of Nodes with Even-Valued Grandparent,https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1315.java) \nMatrix Block Sum,https://leetcode.com/problems/matrix-block-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1314.java) \nDecompress Run-Length Encoded List,https://leetcode.com/problems/decompress-run-length-encoded-list/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1313.java) \nAll Elements in Two Binary Search Trees,https://leetcode.com/problems/all-elements-in-two-binary-search-trees/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1305.java) \nFind N Unique Integers Sum up to Zero,https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1304.java) \nDeepest Leaves Sum,https://leetcode.com/problems/deepest-leaves-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1302.java) \nSum of Mutated Array Closest to Target,https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1300.java) \nReplace Elements with Greatest Element on Right Side,https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1299.java) \nMaximum Number of Occurrences of a Substring,https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1297.java) \nDivide Array in Sets of K Consecutive Numbers,https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1296.java) \nFind Numbers with Even Number of Digits,https://leetcode.com/problems/find-numbers-with-even-number-of-digits/,Easy,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1295.java) [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1295.js) \nSequential Digits,https://leetcode.com/problems/sequential-digits/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1291.java) \nConvert Binary Number in a Linked List to Integer,https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1290.java) \nMinimum Falling Path Sum II,https://leetcode.com/problems/minimum-falling-path-sum-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1289.java) \nElement Appearing More Than 25% In Sorted Array,https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1287.java) \nIterator for Combination,https://leetcode.com/problems/iterator-for-combination/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1286.java) \nFind the Smallest Divisor Given a Threshold,https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1283.java) \nGroup the People Given the Group Size They Belong To,https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1282.java) \nSubtract the Product and Sum of Digits of an Integer,https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1281.java) \nCount Square Submatrices with All Ones,https://leetcode.com/problems/count-square-submatrices-with-all-ones/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1277.java) \nFind Winner on a Tic Tac Toe Game,https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1275.java) \nDelete Tree Nodes,https://leetcode.com/problems/delete-tree-nodes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1273.java) \nHexspeak,https://leetcode.com/problems/hexspeak/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1271.java) \nSearch Suggestions System,https://leetcode.com/problems/search-suggestions-system/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1268.java) \nCount Servers that Communicate,https://leetcode.com/problems/count-servers-that-communicate/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1267.java) \nMinimum Time Visiting All Points,https://leetcode.com/problems/minimum-time-visiting-all-points/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1266.java) \nPrint Immutable Linked List in Reverse,https://leetcode.com/problems/print-immutable-linked-list-in-reverse//,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1265.java) \nFind Elements in a Contaminated Binary Tree,https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1261.java) \nShift 2D Grid,https://leetcode.com/problems/shift-2d-grid/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1260.java) \nSynonymous Sentences,https://leetcode.com/problems/synonymous-sentences/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1258.java) \nSmallest Common Region,https://leetcode.com/problems/smallest-common-region/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1257.java) \nCells with Odd Values in a Matrix,https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1252.java) \nMinimum Remove to Make Valid Parentheses,https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1249.java) \nArray Transformation,https://leetcode.com/problems/array-transformation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1243.java) \nFind Positive Integer Solution for a Given Equation,https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1237.java) \nCheck If It Is a Straight Line,https://leetcode.com/problems/check-if-it-is-a-straight-line/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1232.java) \nMissing Number In Arithmetic Progression,https://leetcode.com/problems/missing-number-in-arithmetic-progression/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1228.java) \nSplit a String in Balanced Strings,https://leetcode.com/problems/split-a-string-in-balanced-strings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1221.java) \nPath with Maximum Gold,https://leetcode.com/problems/path-with-maximum-gold/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1219.java) \nPlay with Chips,https://leetcode.com/problems/play-with-chips/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1217.java) \nTwo Sum BSTs,https://leetcode.com/problems/two-sum-bsts/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1214.java) \nIntersection of Three Sorted Arrays,https://leetcode.com/problems/intersection-of-three-sorted-arrays/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1213.java) \nRemove All Adjacent Duplicates in String II,https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) \nUnique Number of Occurrences,https://leetcode.com/problems/unique-number-of-occurrences/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) \nMinimum Absolute Difference,https://leetcode.com/problems/minimum-absolute-difference/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1200.java) \nFind Smallest Common Element in All Rows,https://leetcode.com/problems/find-smallest-common-element-in-all-rows/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1198.java) \nHow Many Apples Can You Put into the Basket,https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1196.java) \nReverse Substrings Between Each Pair of Parentheses,https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1190.java) \nMaximum Number of Balloons,https://leetcode.com/problems/maximum-number-of-balloons/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1189.java) \nDay of the Week,https://leetcode.com/problems/day-of-the-week/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1185.java) \nDistance Between Bus Stops,https://leetcode.com/problems/distance-between-bus-stops/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1184.java) \nShortest Distance to Target Color,https://leetcode.com/problems/shortest-distance-to-target-color/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1182.java) \nCount Substrings with Only One Distinct Letter,https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1180.java) \nDiet Plan Performance,https://leetcode.com/problems/diet-plan-performance/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1176.java) \nPrime Arrangements,https://leetcode.com/problems/prime-arrangements/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1175.java) \nRemove Zero Sum Consecutive Nodes from Linked List,https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1171.java) \nSingle-Row Keyboard,https://leetcode.com/problems/single-row-keyboard/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1165.java) \nMaximum Level Sum of a Binary Tree,https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1161.java) \nFind Words That Can Be Formed by Characters,https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1160.java) \nDay of the Year,https://leetcode.com/problems/day-of-the-year/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1154.java) \nAnalyze User Website Visit Pattern,https://leetcode.com/problems/analyze-user-website-visit-pattern/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1152.java) \nMinimum Swaps to Group All 1's Together,https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1151.java) \nCheck If a Number Is Majority Element in a Sorted Array,https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1150.java) \nSnapshot Array,https://leetcode.com/problems/snapshot-array/,Easy ,[Javascript](./javascript/_1146.js) \nLongest Common Subsequence,https://leetcode.com/problems/longest-common-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1143.java) \nAlphabet Board Path,https://leetcode.com/problems/alphabet-board-path/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1138.java) \nN-th Tribonacci Number,https://leetcode.com/problems/n-th-tribonacci-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1137.java) \nParallel Courses,https://leetcode.com/problems/parallel-courses/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1136.java) \nArmstrong Number,https://leetcode.com/problems/armstrong-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1134.java) \nLargest Unique Number,https://leetcode.com/problems/largest-unique-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1133.java) \nNumber of Equivalent Domino Pairs,https://leetcode.com/problems/number-of-equivalent-domino-pairs/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1128.java) \nRelative Sort Array,https://leetcode.com/problems/relative-sort-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1122.java) \nCompare Strings by Frequency of the Smallest Character,https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1170.java) \nRemove Vowels from a String,https://leetcode.com/problems/remove-vowels-from-a-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1119.java) \nNumber of Days in a Month,https://leetcode.com/problems/number-of-days-in-a-month/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1118.java) \nPrint in Order,https://leetcode.com/problems/print-in-order/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1114.java) \nDelete Nodes And Return Forest,https://leetcode.com/problems/delete-nodes-and-return-forest/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1110.java) \nDefanging an IP Address,https://leetcode.com/problems/defanging-an-ip-address/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1108.java) \nPath In Zigzag Labelled Binary Tree,https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1104.java) \nDistribute Candies to People,https://leetcode.com/problems/distribute-candies-to-people/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1103.java) \nFind K-Length Substrings With No Repeated Characters,https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1100.java) \nTwo Sum Less Than K,https://leetcode.com/problems/two-sum-less-than-k/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1099.java) \nCar Pooling,https://leetcode.com/problems/car-pooling/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) \nLargest Values From Labels,https://leetcode.com/problems/largest-values-from-labels/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1090.java) \nShortest Path in Binary Matrix,https://leetcode.com/problems/shortest-path-in-binary-matrix/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1091.java) \nDuplicate Zeros,https://leetcode.com/problems/duplicate-zeros/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1089.java) \nBrace Expansion,https://leetcode.com/problems/brace-expansion/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1087.java) \nHigh Five,https://leetcode.com/problems/high-five/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1086.java) \nSum of Digits in the Minimum Number,https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1085.java) \nLetter Tile Possibilities,https://leetcode.com/problems/letter-tile-possibilities/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1079.java) \nOccurrences After Bigram,https://leetcode.com/problems/occurrences-after-bigram/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1078.java) \nGreatest Common Divisor of Strings,https://leetcode.com/problems/greatest-common-divisor-of-strings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1071.java) \nCampus Bikes II,https://leetcode.com/problems/campus-bikes-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1066.java) \nIndex Pairs of a String,https://leetcode.com/problems/index-pairs-of-a-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1065.java) \nLongest Repeating Substring,https://leetcode.com/problems/longest-repeating-substring/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1062.java) \nCampus Bikes,https://leetcode.com/problems/campus-bikes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1057.java) \nConfusing Number,https://leetcode.com/problems/confusing-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1056.java) \nFixed Point,https://leetcode.com/problems/fixed-point/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1055.java) \nHeight Checker,https://leetcode.com/problems/height-checker/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1051.java) \nRemove All Adjacent Duplicates In String,https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1047.java) \nLast Stone Weight,https://leetcode.com/problems/last-stone-weight/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1046.java) \nPartition Array for Maximum Sum,https://leetcode.com/problems/partition-array-for-maximum-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1043.java) \nBinary Search Tree to Greater Sum Tree,https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1038.java) \nValid Boomerang,https://leetcode.com/problems/valid-boomerang/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1037.java) \nMoving Stones Until Consecutive,https://leetcode.com/problems/moving-stones-until-consecutive/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1033.java) \nMatrix Cells in Distance Order,https://leetcode.com/problems/matrix-cells-in-distance-order/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1030.java) \nTwo City Scheduling,https://leetcode.com/problems/two-city-scheduling/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1029.java) \nMaximum Difference Between Node and Ancestor,https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1026.java) \nDivisor Game,https://leetcode.com/problems/divisor-game/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1025.java) \nVideo Stitching,https://leetcode.com/problems/video-stitching/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1024.java) \nSum of Root To Leaf Binary Numbers,https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1022.java) \nRemove Outermost Parentheses,https://leetcode.com/problems/remove-outermost-parentheses/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1021.java) \nNumber of Enclaves,https://leetcode.com/problems/number-of-enclaves/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1020.java) \nNext Greater Node In Linked List,https://leetcode.com/problems/next-greater-node-in-linked-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1019.java) \nBinary Prefix Divisible By 5,https://leetcode.com/problems/binary-prefix-divisible-by-5/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1018.java) \nBest Sightseeing Pair,https://leetcode.com/problems/best-sightseeing-pair/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1014.java) \nPartition Array Into Three Parts With Equal Sum,https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1013.java) \nCapacity To Ship Packages Within D Days,https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1011.java) \nPairs of Songs With Total Durations Divisible by 60,https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) \nComplement of Base 10 Integer,https://leetcode.com/problems/complement-of-base-10-integer/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1009.java) \nConstruct Binary Search Tree from Preorder Traversal,https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1008.java) \nMaximize Sum Of Array After K Negations,https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1005.java) \nMax Consecutive Ones III,https://leetcode.com/problems/max-consecutive-ones-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1004.java) \nCheck If Word Is Valid After Substitutions,https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1003.java) \nFind Common Characters,https://leetcode.com/problems/find-common-characters/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1002.java) \nAvailable Captures for Rook,https://leetcode.com/problems/available-captures-for-rook/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_999.java) \nBroken Calculator,https://leetcode.com/problems/broken-calculator/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_991.java) \nTime Based Key-Value Store,https://leetcode.com/problems/time-based-key-value-store/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_981.java) \nFind the Town Judge,https://leetcode.com/problems/find-the-town-judge/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_997.java) \nRotting Oranges,https://leetcode.com/problems/rotting-oranges/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_994.java) \nCousins in Binary Tree,https://leetcode.com/problems/cousins-in-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_993.java) \nAdd to Array-Form of Integer,https://leetcode.com/problems/add-to-array-form-of-integer/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_989.java) \nSmallest String Starting From Leaf,https://leetcode.com/problems/smallest-string-starting-from-leaf/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_988.java) \nVertical Order Traversal of a Binary Tree,https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_987.java) \nInterval List Intersections,https://leetcode.com/problems/interval-list-intersections/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_986.java) \nSum of Even Numbers After Queries,https://leetcode.com/problems/sum-of-even-numbers-after-queries/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_985.java) \nUnique Paths III,https://leetcode.com/problems/unique-paths-iii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_980.java) \nDistribute Coins in Binary Tree,https://leetcode.com/problems/distribute-coins-in-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_979.java) \nSquares of a Sorted Array,https://leetcode.com/problems/squares-of-a-sorted-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_977.java) \nLargest Perimeter Triangle,https://leetcode.com/problems/largest-perimeter-triangle/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_976.java) \nSubarray Sums Divisible by K,https://leetcode.com/problems/subarray-sums-divisible-by-k/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_974.java) \nK Closest Points to Origin,https://leetcode.com/problems/k-closest-points-to-origin/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) \nPowerful Integers,https://leetcode.com/problems/powerful-integers/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_970.java) \nVowel Spellchecker,https://leetcode.com/problems/vowel-spellchecker/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_966.java) \nUnivalued Binary Tree,https://leetcode.com/problems/univalued-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_965.java) \nN-Repeated Element in Size 2N Array,https://leetcode.com/problems/n-repeated-element-in-size-2n-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_961.java) \nCheck Completeness of a Binary Tree,https://leetcode.com/problems/check-completeness-of-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_958.java) \nPrison Cells After N Days,https://leetcode.com/problems/prison-cells-after-n-days/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_957.java) \nArray of Doubled Pairs,https://leetcode.com/problems/array-of-doubled-pairs/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_954.java) \nVerifying an Alien Dictionary,https://leetcode.com/problems/verifying-an-alien-dictionary/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_953.java) \nFlip Equivalent Binary Trees,https://leetcode.com/problems/flip-equivalent-binary-trees/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_951.java) \nReveal Cards In Increasing Order,https://leetcode.com/problems/reveal-cards-in-increasing-order/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_950.java) \nValidate Stack Sequences,https://leetcode.com/problems/validate-stack-sequences/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_946.java) \nDelete Columns to Make Sorted,https://leetcode.com/problems/delete-columns-to-make-sorted/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_944.java) \nDI String Match,https://leetcode.com/problems/di-string-match/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_942.java) \nValid Mountain Array,https://leetcode.com/problems/valid-mountain-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_941.java) \nRange Sum of BST,https://leetcode.com/problems/range-sum-of-bst/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_938.java) \nReorder Log Files,https://leetcode.com/problems/reorder-log-files/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_937.java) \nStamping The Sequence,https://leetcode.com/problems/stamping-the-sequence/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_936.java) \nKnight Dialer,https://leetcode.com/problems/knight-dialer/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_935.java) \nNumber of Recent Calls,https://leetcode.com/problems/number-of-recent-calls/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_933.java) \nMinimum Falling Path Sum,https://leetcode.com/problems/minimum-falling-path-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_931.java) \nUnique Email Addresses,https://leetcode.com/problems/unique-email-addresses/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_929.java) \nLong Pressed Name,https://leetcode.com/problems/long-pressed-name/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_925.java) \n3Sum With Multiplicity,https://leetcode.com/problems/3sum-with-multiplicity/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_923.java) \nSort Array By Parity II,https://leetcode.com/problems/sort-array-by-parity-ii/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_922.java) \nMinimum Add to Make Parentheses Valid,https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_921.java) \nMaximum Sum Circular Subarray,https://leetcode.com/problems/maximum-sum-circular-subarray/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_918.java) \nReverse Only Letters,https://leetcode.com/problems/reverse-only-letters/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_917.java) \nX of a Kind in a Deck of Cards,https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_914.java) \nSort an Array,https://leetcode.com/problems/sort-an-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_912.java) \nSmallest Range I,https://leetcode.com/problems/smallest-range-i/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_908.java) \nOnline Stock Span,https://leetcode.com/problems/online-stock-span/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_901.java) \nFruit Into Baskets,https://leetcode.com/problems/fruit-into-baskets/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_904.java) \nRLE Iterator,https://leetcode.com/problems/rle-iterator/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_900.java) \nIncreasing Order Search Tree,https://leetcode.com/problems/increasing-order-search-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_897.java) \nMonotonic Array,https://leetcode.com/problems/monotonic-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_896.java) \nMaximum Frequency Stack,https://leetcode.com/problems/maximum-frequency-stack/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_895.java) \nGroups of Special-Equivalent Strings,https://leetcode.com/problems/groups-of-special-equivalent-strings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_893.java) \nSurface Area of 3D Shapes,https://leetcode.com/problems/surface-area-of-3d-shapes/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_892.java) \nFind and Replace Pattern,https://leetcode.com/problems/find-and-replace-pattern/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_890.java) \nFair Candy Swap,https://leetcode.com/problems/fair-candy-swap/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_888.java) \nSpiral Matrix III,https://leetcode.com/problems/spiral-matrix-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_885.java) \nUncommon Words from Two Sentences,https://leetcode.com/problems/uncommon-words-from-two-sentences/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_884.java) \nProjection Area of 3D Shapes,https://leetcode.com/problems/projection-area-of-3d-shapes/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_883.java) \nBoats to Save People,https://leetcode.com/problems/boats-to-save-people/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_881.java) \nDecoded String at Index,https://leetcode.com/problems/decoded-string-at-index/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_880.java) \nStone Game,https://leetcode.com/problems/stone-game/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_877.java) \nMiddle of the Linked List,https://leetcode.com/problems/middle-of-the-linked-list/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_876.java) \nLeaf-Similar Trees,https://leetcode.com/problems/leaf-similar-trees/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_872.java) \nAdvantage Shuffle,https://leetcode.com/problems/advantage-shuffle/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_870.java) \nBinary Gap,https://leetcode.com/problems/binary-gap/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_868.java) \nTranspose Matrix,https://leetcode.com/problems/transpose-matrix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_867.java) \nScore After Flipping Matrix,https://leetcode.com/problems/score-after-flipping-matrix/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_861.java) \nLemonade Change,https://leetcode.com/problems/lemonade-change/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_860.java) \nBuddy Strings,https://leetcode.com/problems/buddy-strings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_859.java) \nScore of Parentheses,https://leetcode.com/problems/score-of-parentheses/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_856.java) \nPeak Index in a Mountain Array,https://leetcode.com/problems/peak-index-in-a-mountain-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_852.java) \nMaximize Distance to Closest Person,https://leetcode.com/problems/maximize-distance-to-closest-person/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_849.java) \nShifting Letters,https://leetcode.com/problems/shifting-letters/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_848.java) \nBackspace String Compare,https://leetcode.com/problems/backspace-string-compare/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) \nKeys and Rooms,https://leetcode.com/problems/keys-and-rooms/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_841.java) \nMagic Squares In Grid,https://leetcode.com/problems/magic-squares-in-grid/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_840.java) \nPush Dominoes,https://leetcode.com/problems/push-dominoes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_838.java) \nRectangle Overlap,https://leetcode.com/problems/rectangle-overlap/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_836.java) \nFlipping an Image,https://leetcode.com/problems/flipping-an-image/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_832.java) \nPositions of Large Groups,https://leetcode.com/problems/positions-of-large-groups/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_830.java) \nGoat Latin,https://leetcode.com/problems/goat-latin/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_824.java) \nBinary Trees With Factors,https://leetcode.com/problems/binary-trees-with-factors/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_823.java) \nShortest Distance to a Character,https://leetcode.com/problems/shortest-distance-to-a-character/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_821.java) \nShort Encoding of Words,https://leetcode.com/problems/short-encoding-of-words/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_820.java) \nMost Common Word,https://leetcode.com/problems/most-common-word/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_819.java) \nAmbiguous Coordinates,https://leetcode.com/problems/ambiguous-coordinates/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_816.java) \nBinary Tree Pruning,https://leetcode.com/problems/binary-tree-pruning/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_814.java) \nLargest Triangle Area,https://leetcode.com/problems/largest-triangle-area/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_812.java) \nSubdomain Visit Count,https://leetcode.com/problems/subdomain-visit-count/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) \nExpressive Words,https://leetcode.com/problems/expressive-words/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_809.java) \nMax Increase to Keep City Skyline,https://leetcode.com/problems/max-increase-to-keep-city-skyline/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_807.java) \nNumber of Lines To Write String,https://leetcode.com/problems/number-of-lines-to-write-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_806.java) \nUnique Morse Code Words,https://leetcode.com/problems/unique-morse-code-words/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_804.java) \nSimilar RGB Color,https://leetcode.com/problems/similar-rgb-color/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_800.java) \nChampagne Tower,https://leetcode.com/problems/champagne-tower/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_799.java) \nRotate String,https://leetcode.com/problems/rotate-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_796.java) \nNumber of Matching Subsequences,https://leetcode.com/problems/number-of-matching-subsequences/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_792.java) \nCustom Sort String,https://leetcode.com/problems/custom-sort-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_791.java) \nEscape The Ghosts,https://leetcode.com/problems/escape-the-ghosts/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_789.java) \nRotated Digits,https://leetcode.com/problems/rotated-digits/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_788.java) \nLetter Case Permutation,https://leetcode.com/problems/letter-case-permutation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_784.java) \nMinimum Distance Between BST Nodes,https://leetcode.com/problems/minimum-distance-between-bst-nodes/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_783.java) \nRabbits in Forest,https://leetcode.com/problems/rabbits-in-forest/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_781.java) \nK-th Symbol in Grammar,https://leetcode.com/problems/k-th-symbol-in-grammar/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_779.java) \nSplit BST,https://leetcode.com/problems/split-bst/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_776.java) \nGlobal and Local Inversions,https://leetcode.com/problems/global-and-local-inversions/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_775.java) \nJewels and Stones,https://leetcode.com/problems/jewels-and-stones/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_771.java) \nMax Chunks To Make Sorted,https://leetcode.com/problems/max-chunks-to-make-sorted/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_769.java) \nReorganize String,https://leetcode.com/problems/reorganize-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_767.java) \nToeplitz Matrix,https://leetcode.com/problems/toeplitz-matrix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_766.java) \nCouples Holding Hands,https://leetcode.com/problems/couples-holding-hands/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_765.java) \nLargest Plus Sign,https://leetcode.com/problems/largest-plus-sign/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_764.java) \nPartition Labels,https://leetcode.com/problems/partition-labels/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_763.java) \nPrime Number of Set Bits in Binary Representation,https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_762.java) \nFind Anagram Mappings,https://leetcode.com/problems/find-anagram-mappings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_760.java) \nBold Words in String,https://leetcode.com/problems/bold-words-in-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_758.java) \nSet Intersection Size At Least Two,https://leetcode.com/problems/set-intersection-size-at-least-two/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_757.java) \nPyramid Transition Matrix,https://leetcode.com/problems/pyramid-transition-matrix/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_756.java) \nPour Water,https://leetcode.com/problems/pour-water/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_755.java) \nReach a Number,https://leetcode.com/problems/reach-a-number/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_754.java) \nNumber Of Corner Rectangles,https://leetcode.com/problems/number-of-corner-rectangles/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_750.java) \nShortest Completing Word,https://leetcode.com/problems/shortest-completing-word/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_748.java) \nLargest Number Greater Than Twice of Others,https://leetcode.com/problems/largest-number-greater-than-twice-of-others/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_747.java) \nMin Cost Climbing Stairs,https://leetcode.com/problems/min-cost-climbing-stairs/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_746.java) \nFind Smallest Letter Greater Than Target,https://leetcode.com/problems/find-smallest-letter-greater-than-target/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_744.java) \nNetwork Delay Time,https://leetcode.com/problems/network-delay-time/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_743.java) \nClosest Leaf in a Binary Tree,https://leetcode.com/problems/closest-leaf-in-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_742.java) \nDelete and Earn,https://leetcode.com/problems/delete-and-earn/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_740.java) \nDaily Temperatures,https://leetcode.com/problems/daily-temperatures/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_739.java) \nMonotone Increasing Digits,https://leetcode.com/problems/monotone-increasing-digits/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_738.java) \nSentence Similarity II,https://leetcode.com/problems/sentence-similarity-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_737.java) \nAsteroid Collision,https://leetcode.com/problems/asteroid-collision/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) \nSentence Similarity,https://leetcode.com/problems/sentence-similarity/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_734.java) \nFlood Fill,https://leetcode.com/problem**__**s/flood-fill/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_733.java) \nMy Calendar I,https://leetcode.com/problems/my-calendar-i/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_729.java) \nSelf Dividing Numbers,https://leetcode.com/problems/self-dividing-numbers/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_728.java) \nMinimum Window Subsequence,https://leetcode.com/problems/minimum-window-subsequence/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_727.java) \nSplit Linked List in Parts,https://leetcode.com/problems/split-linked-list-in-parts/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_725.java) \nFind Pivot Index,https://leetcode.com/problems/find-pivot-index/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) \nCandy Crush,https://leetcode.com/problems/candy-crush/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_723.java) \nAccounts Merge,https://leetcode.com/problems/accounts-merge/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_721.java) \nLongest Word in Dictionary,https://leetcode.com/problems/longest-word-in-dictionary/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_720.java) \nFind K-th Smallest Pair Distance,https://leetcode.com/problems/find-k-th-smallest-pair-distance/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_719.java) \nMaximum Length of Repeated Subarray,https://leetcode.com/problems/maximum-length-of-repeated-subarray/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) \n1-bit and 2-bit Characters,https://leetcode.com/problems/1-bit-and-2-bit-characters/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_717.java) \nMax Stack,https://leetcode.com/problems/max-stack/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) \nBest Time to Buy and Sell Stock with Transaction Fee,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_714.java) \nSubarray Product Less Than K,https://leetcode.com/problems/subarray-product-less-than-k/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_713.java) \nMinimum ASCII Delete Sum for Two Strings,https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_712.java) \nTo Lower Case,https://leetcode.com/problems/to-lower-case/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_709.java) \nDesign HashMap,https://leetcode.com/problems/design-hashmap/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_706.java) \nDesign HashSet,https://leetcode.com/problems/design-hashset/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_705.java) \nBinary Search,https://leetcode.com/problems/binary-search/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_704.java) \nKth Largest Element in a Stream,https://leetcode.com/problems/kth-largest-element-in-a-stream/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_703.java) \nInsert into a Binary Search Tree,https://leetcode.com/problems/insert-into-a-binary-search-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_701.java) \nSearch in a Binary Search Tree,https://leetcode.com/problems/search-in-a-binary-search-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_700.java) \nFalling Squares,https://leetcode.com/problems/falling-squares/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_699.java) \nPartition to K Equal Sum Subsets,https://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Medium ,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_698.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_698.cpp) \"\nDegree of an Array,https://leetcode.com/problems/degree-of-an-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) \nCount Binary Substrings,https://leetcode.com/problems/count-binary-substrings/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_696.java) \nMax Area of Island,https://leetcode.com/problems/max-area-of-island/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_695.java) \nNumber of Distinct Islands,https://leetcode.com/problems/number-of-distinct-islands/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_694.java) \nBinary Number with Alternating Bits,https://leetcode.com/problems/binary-number-with-alternating-bits/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_693.java) \nTop K Frequent Words,https://leetcode.com/problems/top-k-frequent-words/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) \nStickers to Spell Word,https://leetcode.com/problems/stickers-to-spell-word/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_691.java) \nEmployee Importance,https://leetcode.com/problems/employee-importance/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_690.java) \nMaximum Sum of 3 Non-Overlapping Subarrays,https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_689.java) \nKnight Probability in Chessboard,https://leetcode.com/problems/knight-probability-in-chessboard/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_688.java) \nLongest Univalue Path,https://leetcode.com/problems/longest-univalue-path/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_687.java) \nRepeated String Match,https://leetcode.com/problems/repeated-string-match/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_686.java) \nRedundant Connection II,https://leetcode.com/problems/redundant-connection-ii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_685.java) \nRedundant Connection,https://leetcode.com/problems/redundant-connection/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_684.java) \nK Empty Slots,https://leetcode.com/problems/k-empty-slots/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_683.java) \nBaseball Game,https://leetcode.com/problems/baseball-game/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_682.java) \nNext Closest Time,https://leetcode.com/problems/parents-closest-time/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_681.java) \nValid Palindrome II,https://leetcode.com/problems/valid-palindrome-ii/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_680.java) \n24 Game,https://leetcode.com/problems/24-game/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_679.java) \nValid Parenthesis String,https://leetcode.com/problems/valid-parenthesis-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_678.java) \nMap Sum Pairs,https://leetcode.com/problems/map-sum-pairs/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_677.java) \nImplement Magic Dictionary,https://leetcode.com/problems/implement-magic-dictionary/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_676.java) \nCut Off Trees for Golf Event,https://leetcode.com/problems/cut-off-trees-for-golf-event/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_675.java) \nLongest Continuous Increasing Subsequence,https://leetcode.com/problems/longest-continuous-increasing-subsequence/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_674.java) \nNumber of Longest Increasing Subsequence,https://leetcode.com/problems/number-of-longest-increasing-subsequence/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_673.java) \nBulb Switcher II,https://leetcode.com/problems/bulb-switcher-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_672.java) \nSecond Minimum Node In a Binary Tree,https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_671.java) \nMaximum Swap,https://leetcode.com/problems/maximum-swap/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_670.java) \nTrim a Binary Search Tree,https://leetcode.com/problems/trim-a-binary-search-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_669.java) \nKth Smallest Number in Multiplication Table,https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_668.java) \nBeautiful Arrangement II,https://leetcode.com/problems/beautiful-arrangement-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_667.java) \nPath Sum IV,https://leetcode.com/problems/path-sum-iv/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_666.java) \nNon-decreasing Array,https://leetcode.com/problems/non-decreasing-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_665.java) \nStrange Printer,https://leetcode.com/problems/strange-printer/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_664.java) \nEqual Tree Partition,https://leetcode.com/problems/equal-tree-partition/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_663.java) \nMaximum Width of Binary Tree,https://leetcode.com/problems/maximum-width-of-binary-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_662.java) \nImage Smoother,https://leetcode.com/problems/image-smoother/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_661.java) \nRemove 9,https://leetcode.com/problems/remove-9/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_660.java) \nSplit Array into Consecutive Subsequences,https://leetcode.com/problems/split-array-into-consecutive-subsequences/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_659.java) \nFind K Closest Elements,https://leetcode.com/problems/find-k-closest-elements/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_658.java) \nJudge Route Circle,https://leetcode.com/problems/judge-route-circle/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_657.java) \nCoin Path,https://leetcode.com/problems/coin-path/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_656.java) \nPrint Binary Tree,https://leetcode.com/problems/print-binary-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_655.java) \nMaximum Binary Tree,https://leetcode.com/problems/maximum-binary-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_654.java) \nTwo Sum IV - Input is a BST,https://leetcode.com/problems/two-sum-iv-input-is-a-bst/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_653.java) \nFind Duplicate Subtrees,https://leetcode.com/problems/find-duplicate-subtrees/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_652.java) \n4 Keys Keyboard,https://leetcode.com/problems/4-keys-keyboard/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_651.java) \n2 Keys Keyboard,https://leetcode.com/problems/2-keys-keyboard/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_650.java) \nDota2 Senate,https://leetcode.com/problems/dota2-senate/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_649.java) \nReplace Words,https://leetcode.com/problems/replace-words/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_648.java) \nPalindromic Substrings,https://leetcode.com/problems/palindromic-substrings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_647.java) \nMaximum Length of Pair Chain,https://leetcode.com/problems/maximum-length-of-pair-chain/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_646.java) \nSet Mismatch,https://leetcode.com/problems/set-mismatch/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_645.java) \nMaximum Average Subarray II,https://leetcode.com/problems/maximum-average-subarray-ii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_644.java) \nMaximum Average Subarray I,https://leetcode.com/problems/maximum-average-subarray-i/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_643.java) \nDesign Search Autocomplete System,https://leetcode.com/problems/design-search-autocomplete-system/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_642.java) \nSolve the Equation,https://leetcode.com/problems/solve-the-equation/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_640.java) \nDecode Ways II,https://leetcode.com/problems/decode-ways-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_639.java) \nShopping Offers,https://leetcode.com/problems/shopping-offers/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_638.java) \nAverage of Levels in Binary Tree,https://leetcode.com/problems/average-of-levels-in-binary-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_637.java) \nExclusive Time of Functions,https://leetcode.com/problems/exclusive-time-of-functions/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_636.java) \nDesign Log Storage System,https://leetcode.com/problems/design-log-storage-system/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_635.java) \nFind the Derangement of An Array,https://leetcode.com/problems/find-the-derangement-of-an-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_634.java) \nSum of Square Numbers,https://leetcode.com/problems/sum-of-square-numbers/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_633.java) \nSmallest Range,https://leetcode.com/problems/smallest-range/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_632.java) \nDesign Excel Sum Formula,https://leetcode.com/problems/design-excel-sum-formula/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_631.java) \nCourse Schedule III,https://leetcode.com/problems/course-schedule-iii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_630.java) \nK Inverse Pairs Array,https://leetcode.com/problems/k-inverse-pairs-array/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_629.java) \nMaximum Product of Three Numbers,https://leetcode.com/problems/maximum-product-of-three-numbers/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_628.java) \nMinimum Factorization,https://leetcode.com/problems/minimum-factorization/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_625.java) \nMaximum Distance in Arrays,https://leetcode.com/problems/maximum-distance-in-arrays/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_624.java) \nAdd One Row to Tree,https://leetcode.com/problems/add-one-row-to-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_623.java) \nDesign Circular Queue,https://leetcode.com/problems/design-circular-queue/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_622.java) \nTask Scheduler,https://leetcode.com/problems/task-scheduler/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_621.java) \nMerge Two Binary Trees,https://leetcode.com/problems/merge-two-binary-trees/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_617.java) \nAdd Bold Tag in String,https://leetcode.com/problems/add-bold-tag-in-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_616.java) \nValid Triangle Number,https://leetcode.com/problems/valid-triangle-number/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_611.java) \nFind Duplicate File in System,https://leetcode.com/problems/find-duplicate-file-in-system/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_609.java) \nConstruct String from Binary Tree,https://leetcode.com/problems/construct-string-from-binary-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_606.java) \nCan Place Flowers,https://leetcode.com/problems/can-place-flowers/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_605.java) \nDesign Compressed String Iterator,https://leetcode.com/problems/design-compressed-string-iterator/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_604.java) \nNon-negative Integers without Consecutive Ones,https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_600.java) \nMinimum Index Sum of Two Lists,https://leetcode.com/problems/minimum-index-sum-of-two-lists/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_599.java) \nRange Addition II,https://leetcode.com/problems/range-addition-ii/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_598.java) \nLongest Harmonious Subsequence,https://leetcode.com/problems/longest-harmonious-subsequence/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_594.java) \nValid Square,https://leetcode.com/problems/valid-square/,Medium ,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) \"\nFraction Addition and Subtraction,https://leetcode.com/problems/fraction-addition-and-subtraction/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_592.java) \nTag Validator,https://leetcode.com/problems/tag-validator/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_591.java) \nN-ary Tree Postorder Traversal,https://leetcode.com/problems/n-ary-tree-postorder-traversal/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_590.java) \nN-ary Tree Preorder Traversal,https://leetcode.com/problems/n-ary-tree-preorder-traversal/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_589.java) \nDesign In-Memory File System,https://leetcode.com/problems/design-in-memory-file-system/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_588.java) \nErect the Fence,https://leetcode.com/problems/erect-the-fence/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_587.java) \nDelete Operation for Two Strings,https://leetcode.com/problems/delete-operation-for-two-strings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_583.java) \nKill Process,https://leetcode.com/problems/kill-process/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_582.java) \nShortest Unsorted Continuous Subarray,https://leetcode.com/problems/shortest-unsorted-continuous-subarray/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_581.java) \nOut of Boundary Paths,https://leetcode.com/problems/out-of-boundary-paths/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_576.java) \nDistribute Candies,https://leetcode.com/problems/distribute-candies/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_575.java) \nSquirrel Simulation,https://leetcode.com/problems/squirrel-simulation/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_573.java) \nSubtree of Another Tree,https://leetcode.com/problems/subtree-of-another-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_572.java) \nMaximum Vacation Days,https://leetcode.com/problems/maximum-vacation-days/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_568.java) \nPermutation in String,https://leetcode.com/problems/permutation-in-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_567.java) \nReshape the Matrix,https://leetcode.com/problems/reshape-the-matrix/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_566.java) \nArray Nesting,https://leetcode.com/problems/array-nesting/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_565.java) \nBinary Tree Tilt,https://leetcode.com/problems/binary-tree-tilt/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_563.java) \nLongest Line of Consecutive One in Matrix,https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_562.java) \nArray Partition I,https://leetcode.com/problems/array-partition-i/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_561.java) \nSubarray Sum Equals K,https://leetcode.com/problems/subarray-sum-equals-k/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) \nMaximum Depth of N-ary Tree,https://leetcode.com/problems/maximum-depth-of-n-ary-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_559.java) \nReverse Words in a String III,https://leetcode.com/problems/reverse-words-in-a-string-iii/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) \nNext Greater Element III,https://leetcode.com/problems/parents-greater-element-iii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_556.java) \nSplit Concatenated Strings,https://leetcode.com/problems/split-concatenated-strings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_555.java) \nBrick Wall,https://leetcode.com/problems/brick-wall/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_554.java) \nOptimal Division,https://leetcode.com/problems/optimal-division/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_553.java) \nStudent Attendance Record II,https://leetcode.com/problems/student-attendance-record-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_552.java) \nStudent Attendance Record I,https://leetcode.com/problems/student-attendance-record-i/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_551.java) \nBinary Tree Longest Consecutive Sequence II,https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_549.java) \nSplit Array with Equal Sum,https://leetcode.com/problems/split-array-with-equal-sum/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_548.java) \nFriend Circles,https://leetcode.com/problems/friend-circles/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_547.java) \nRemove Boxes,https://leetcode.com/problems/remove-boxes/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_546.java) \nBoundary of Binary Tree,https://leetcode.com/problems/boundary-of-binary-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_545.java) \nOutput Contest Matches,https://leetcode.com/problems/output-a824-matches/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_544.java) \nDiameter of Binary Tree,https://leetcode.com/problems/diameter-of-binary-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_543.java) \n01 Matrix,https://leetcode.com/problems/01-matrix/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_542.java) \nReverse String II,https://leetcode.com/problems/reverse-string-ii/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_541.java) \nSingle Element in a Sorted Array,https://leetcode.com/problems/single-element-in-a-sorted-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_540.java) \nMinimum Time Difference,https://leetcode.com/problems/minimum-time-difference/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_539.java) \nConvert BST to Greater Tree,https://leetcode.com/problems/convert-bst-to-greater-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_538.java) \nComplex Number Multiplication,https://leetcode.com/problems/complex-number-multiplication/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_537.java) \nConstruct Binary Tree from String,https://leetcode.com/problems/construct-binary-tree-from-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_536.java) \nEncode and Decode TinyURL,https://leetcode.com/problems/encode-and-decode-tinyurl/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_535.java) \nLonely Pixel II,https://leetcode.com/problems/lonely-pixel-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_533.java) \nK-diff Pairs in an Array,https://leetcode.com/problems/k-diff-pairs-in-an-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_532.java) \nLonely Pixel I,https://leetcode.com/problems/lonely-pixel-i/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_531.java) \nMinimum Absolute Difference in BST,https://leetcode.com/problems/minimum-absolute-difference-in-bst/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_530.java) \nMinesweeper,https://leetcode.com/problems/minesweeper/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) \nRandom Pick with Weight,https://leetcode.com/problems/random-pick-with-weight/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) \nWord Abbreviation,https://leetcode.com/problems/word-abbreviation/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_527.java) \nBeautiful Arrangement,https://leetcode.com/problems/beautiful-arrangement/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_526.java) \nContiguous Array,https://leetcode.com/problems/contiguous-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_525.java) \nLongest Word in Dictionary through Deleting,https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_524.java) \nContinuous Subarray Sum,https://leetcode.com/problems/continuous-subarray-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_523.java) \nLongest Uncommon Subsequence II,https://leetcode.com/problems/longest-uncommon-subsequence-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_522.java) \nLongest Uncommon Subsequence I,https://leetcode.com/problems/longest-uncommon-subsequence-i/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_521.java) \nDetect Capital,https://leetcode.com/problems/detect-capital/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_520.java) \nCoin Change 2,https://leetcode.com/problems/coin-change-2/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_518.java) \nSuper Washing Machines,https://leetcode.com/problems/super-washing-machines/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_517.java) \nLongest Palindromic Subsequence,https://leetcode.com/problems/longest-palindromic-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_516.java) \nFind Largest Value in Each Tree Row,https://leetcode.com/problems/find-largest-value-in-each-tree-row/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_515.java) \nFreedom Trail,https://leetcode.com/problems/freedom-trail/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_514.java) \nFind Bottom Left Tree Value,https://leetcode.com/problems/find-bottom-left-tree-value/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_513.java) \nFibonacci Number,https://leetcode.com/problems/fibonacci-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_509.java) \nMost Frequent Subtree Sum,https://leetcode.com/problems/most-frequent-subtree-sum/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_508.java) \nPerfect Number,https://leetcode.com/problems/perfect-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_507.java) \nRelative Ranks,https://leetcode.com/problems/relative-ranks/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_506.java) \nThe Maze II,https://leetcode.com/problems/the-maze-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_505.java) \nBase 7,https://leetcode.com/problems/base-7/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_504.java) \nNext Greater Element II,https://leetcode.com/problems/parents-greater-element-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_503.java) \nIPO,https://leetcode.com/problems/ipo/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_502.java) \nFind Mode in Binary Tree,https://leetcode.com/problems/find-mode-in-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_501.java) \nKeyboard Row,https://leetcode.com/problems/keyboard-row/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_500.java) \nThe Maze III,https://leetcode.com/problems/the-maze-iii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_499.java) \nNext Greater Element I,https://leetcode.com/problems/parents-greater-element-i/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_496.java) \nDiagonal Traverse,https://leetcode.com/problems/diagonal-traverse/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_498.java) \nTeemo Attacking,https://leetcode.com/problems/teemo-attacking/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_495.java) \nTarget Sum,https://leetcode.com/problems/target-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_494.java) \nReverse Pairs,https://leetcode.com/problems/reverse-pairs/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_493.java) \nConstruct the Rectangle,https://leetcode.com/problems/construct-the-rectangle/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_492.java) \nIncreasing Subsequences,https://leetcode.com/problems/increasing-subsequences/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_491.java) \nThe Maze,https://leetcode.com/problems/the-maze/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) \nZuma Game,https://leetcode.com/problems/zuma-game/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_488.java) \nMax Consecutive Ones II,https://leetcode.com/problems/max-consecutive-ones-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_487.java) \nPredict the Winner,https://leetcode.com/problems/predict-the-winner/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_486.java) \nMax Consecutive Ones,https://leetcode.com/problems/max-consecutive-ones/,Easy,[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_485.js) \nFind Permutation,https://leetcode.com/problems/find-permutation/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_484.java) \nSmallest Good Base,https://leetcode.com/problems/smallest-good-base/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_483.java) \nLicense Key Formatting,https://leetcode.com/problems/license-key-formatting/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_482.java) \nMagical String,https://leetcode.com/problems/magical-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_481.java) \nSliding Window Median,https://leetcode.com/problems/sliding-window-median/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_480.java) \nLargest Palindrome Product,https://leetcode.com/problems/largest-palindrome-product/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_479.java) \nTotal Hamming Distance,https://leetcode.com/problems/total-hamming-distance/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_477.java) \nGenerate Random Point in a Circle,https://leetcode.com/problems/generate-random-point-in-a-circle/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_478.java) \nNumber Complement,https://leetcode.com/problems/number-complement/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_476.java) \nHeaters,https://leetcode.com/problems/heaters/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_475.java) \nOnes and Zeroes,https://leetcode.com/problems/ones-and-zeroes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_474.java) \nMatchsticks to Square,https://leetcode.com/problems/matchsticks-to-square/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_473.java) \nConcatenated Words,https://leetcode.com/problems/concatenated-words/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_472.java) \nEncode String with Shortest Length,https://leetcode.com/problems/encode-string-with-shortest-length/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_471.java) \nConvex Polygon,https://leetcode.com/problems/convex-polygon/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_469.java) \nValidate IP Address,https://leetcode.com/problems/validate-ip-address/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_468.java) \nUnique Substrings in Wraparound String,https://leetcode.com/problems/unique-substrings-in-wraparound-string/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_467.java) \nCount The Repetitions,https://leetcode.com/problems/count-the-repetitions/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_466.java) \nOptimal Account Balancing,https://leetcode.com/problems/optimal-account-balancing/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_465.java) \nCan I Win,https://leetcode.com/problems/can-i-win/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_464.java) \nIsland Perimeter,https://leetcode.com/problems/island-perimeter/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_463.java) \nMinimum Moves to Equal Array Elements II,https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_462.java) \nHamming Distance,https://leetcode.com/problems/hamming-distance/,Easy,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_461.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_461.cpp) \"\nLFU Cache,https://leetcode.com/problems/lfu-cache/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_460.java) \nRepeated Substring Pattern,https://leetcode.com/problems/repeated-substring-pattern/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_459.java) \nPoor Pigs,https://leetcode.com/problems/poor-pigs/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_458.java) \nCircular Array Loop,https://leetcode.com/problems/circular-array-loop/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_457.java) \n132 Pattern,https://leetcode.com/problems/132-pattern/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_456.java) \nAssign Cookies,https://leetcode.com/problems/assign-cookies/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_455.java) \n4Sum II,https://leetcode.com/problems/4sum-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_454.java) \nMinimum Moves to Equal Array Elements,https://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) \nMinimum Number of Arrows to Burst Balloons,https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_452.java) \nSort Characters By Frequency,https://leetcode.com/problems/sort-characters-by-frequency/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_451.java) \nDelete Node in a BST,https://leetcode.com/problems/delete-node-in-a-bst/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_450.java) \nSerialize and Deserialize BST,https://leetcode.com/problems/serialize-and-deserialize-bst/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_449.java) \nFind All Numbers Disappeared in an Array,https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_448.java) \nNumber of Boomerangs,https://leetcode.com/problems/number-of-boomerangs/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_447.java) \nArithmetic Slices II - Subsequence,https://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_446.java) \nAdd Two Numbers II,https://leetcode.com/problems/add-two-numbers-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_445.java) \nSequence Reconstruction,https://leetcode.com/problems/sequence-reconstruction/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_444.java) \nString Compression,https://leetcode.com/problems/string-compression/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) \nFind All Duplicates in an Array,https://leetcode.com/problems/find-all-duplicates-in-an-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_442.java) \nArranging Coins,https://leetcode.com/problems/arrange-coins/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_441.java) \nK-th Smallest in Lexicographical Order,https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_440.java) \nTernary Expression Parser,https://leetcode.com/problems/ternary-expression-parser/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_439.java) \nFind All Anagrams in a String,https://leetcode.com/problems/find-all-anagrams-in-a-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_438.java) \nPath Sum III,https://leetcode.com/problems/path-sum-iii/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_437.java) \nFind Right Interval,https://leetcode.com/problems/find-right-interval/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_436.java) \nNon-overlapping Intervals,https://leetcode.com/problems/non-overlapping-intervals/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_435.java) \nNumber of Segments in a String,https://leetcode.com/problems/number-of-segments-in-a-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_434.java) \nAll O`one Data Structure,https://leetcode.com/problems/all-oone-data-structure/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_432.java) \nFlatten a Multilevel Doubly Linked List,https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_430.java) \nN-ary Tree Level Order Traversal,https://leetcode.com/problems/n-ary-tree-level-order-traversal/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_429.java) \nWord Squares,https://leetcode.com/problems/word-squares/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_425.java) \nLongest Repeating Character Replacement,https://leetcode.com/problems/longest-repeating-character-replacement/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_424.java) \nReconstruct Original Digits from English,https://leetcode.com/problems/reconstruct-original-digits-from-english/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_423.java) \nValid Word Square,https://leetcode.com/problems/valid-word-square/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_422.java) \nMaximum XOR of Two Numbers in an Array,https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_421.java) \nStrong Password Checker,https://leetcode.com/problems/strong-password-checker/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_420.java) \nBattleships in a Board,https://leetcode.com/problems/battleships-in-a-board/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_419.java) \nSentence Screen Fitting,https://leetcode.com/problems/sentence-screen-fitting/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_418.java) \nPacific Atlantic Water Flow,https://leetcode.com/problems/pacific-atlantic-water-flow/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_417.java) \nPartition Equal Subset Sum,https://leetcode.com/problems/partition-equal-subset-sum/,Medium ,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_416.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_416.cpp) \"\nAdd Strings,https://leetcode.com/problems/add-strings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_415.java) \nThird Maximum Number,https://leetcode.com/problems/third-maximum-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_414.java) \nArithmetic Slices,https://leetcode.com/problems/arithmetic-slices/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_413.java) \nFizz Buzz,https://leetcode.com/problems/fizz-buzz/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_412.java) \nMinimum Unique Word Abbreviation,https://leetcode.com/problems/minimum-unique-word-abbreviation/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_411.java) \nSplit Array Largest Sum,https://leetcode.com/problems/split-array-largest-sum/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_410.java) \nLongest Palindrome,https://leetcode.com/problems/longest-palindrome/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_409.java) \nValid Word Abbreviation,https://leetcode.com/problems/valid-word-abbreviation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_408.java) \nTrapping Rain Water II,https://leetcode.com/problems/trapping-rain-water-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_407.java) \nQueue Reconstruction by Height,https://leetcode.com/problems/queue-reconstruction-by-height/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_406.java) \nConvert a Number to Hexadecimal,https://leetcode.com/problems/convert-a-number-to-hexadecimal/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_405.java) \nSum of Left Leaves,https://leetcode.com/problems/sum-of-left-leaves/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_404.java) \nFrog Jump,https://leetcode.com/problems/frog-jump/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_403.java) \nRemove K Digits,https://leetcode.com/problems/remove-k-digits/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_402.java) \nBinary Watch,https://leetcode.com/problems/binary-watch/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_401.java) \nNth Digit,https://leetcode.com/problems/nth-digit/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_400.java) \nEvaluate Division,https://leetcode.com/problems/evaluate-division/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) \nRandom Pick Index,https://leetcode.com/problems/random-pick-index/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_398.java) \nInteger Replacement,https://leetcode.com/problems/integer-replacement/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_397.java) \nRotate Function,https://leetcode.com/problems/rotate-function/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_396.java) \nLongest Substring with At Least K Repeating Characters,https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_395.java) \nDecode String,https://leetcode.com/problems/decode-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) \nUTF-8 Validation,https://leetcode.com/problems/utf-8-validation/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_393.java) \nIs Subsequence,https://leetcode.com/problems/is-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_392.java) \nPerfect Rectangle,https://leetcode.com/problems/perfect-rectangle/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_391.java) \nElimination Game,https://leetcode.com/problems/elimination-game/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_390.java) \nFind the Difference,https://leetcode.com/problems/find-the-difference/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_389.java) \nLongest Absolute File Path,https://leetcode.com/problems/longest-absolute-file-path/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_388.java) \nFirst Unique Character in a String,https://leetcode.com/problems/first-unique-character-in-a-string/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) \nLexicographical Numbers,https://leetcode.com/problems/lexicographical-numbers/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_386.java) \nMini Parser,https://leetcode.com/problems/mini-parser/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_385.java) \nShuffle an Array,https://leetcode.com/problems/shuffle-an-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_384.java) \nRansom Note,https://leetcode.com/problems/ransom-note/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_383.java) \nLinked List Random Node,https://leetcode.com/problems/linked-list-random-node/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_382.java) \nInsert Delete GetRandom O(1) - Duplicates allowed,https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_381.java) \nInsert Delete GetRandom O(1),https://leetcode.com/problems/insert-delete-getrandom-o1/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) \nDesign Phone Directory,https://leetcode.com/problems/design-phone-directory/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_379.java) \nKth Smallest Element in a Sorted Matrix,https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_378.java) \nCombination Sum IV,https://leetcode.com/problems/combination-sum-iv/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_377.java) \nWiggle Subsequence,https://leetcode.com/problems/wiggle-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_376.java) \nGuess Number Higher or Lower II,https://leetcode.com/problems/guess-number-higher-or-lower-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_375.java) \nGuess Number Higher or Lower,https://leetcode.com/problems/guess-number-higher-or-lower/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_374.java) \nFind K Pairs with Smallest Sums,https://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_373.java) \nSuper Pow,https://leetcode.com/problems/super-pow/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_372.java) \nSum of Two Integers,https://leetcode.com/problems/sum-of-two-integers/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_371.java) \nRange Addition,https://leetcode.com/problems/range-addition/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_370.java) \nPlus One Linked List,https://leetcode.com/problems/plus-one-linked-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_369.java) \nLargest Divisible Subset,https://leetcode.com/problems/largest-divisible-subset/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_368.java) \nValid Perfect Square,https://leetcode.com/problems/valid-perfect-square/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_367.java) \nFind Leaves of Binary Tree,https://leetcode.com/problems/find-leaves-of-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_366.java) \nWater and Jug Problem,https://leetcode.com/problems/water-and-jug-problem/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_365.java) \nNested List Weight Sum II,https://leetcode.com/problems/nested-list-weight-sum-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_364.java) \nMax Sum of Rectangle No Larger Than K,https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_363.java) \nDesign Hit Counter,https://leetcode.com/problems/design-hit-counter/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) \nBomb Enemy,https://leetcode.com/problems/bomb-enemy/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_361.java) \nSort Transformed Array,https://leetcode.com/problems/sort-transformed-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_360.java) \nLogger Rate Limiter,https://leetcode.com/problems/logger-rate-limiter/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) \nRearrange String k Distance Apart,https://leetcode.com/problems/rearrange-string-k-distance-apart/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_358.java) \nCount Numbers with Unique Digits,https://leetcode.com/problems/count-numbers-with-unique-digits/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_357.java) \nLine Reflection,https://leetcode.com/problems/line-reflection/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_356.java) \nDesign Twitter,https://leetcode.com/problems/design-twitter/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_355.java) \nRussian Doll Envelopes,https://leetcode.com/problems/russian-doll-envelopes/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_354.java) \nDesign Snake Game,https://leetcode.com/problems/design-snake-game/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) \nData Stream as Disjoint Intervals,https://leetcode.com/problems/data-stream-as-disjoint-intervals/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_352.java) \nAndroid Unlock Patterns,https://leetcode.com/problems/android-unlock-patterns/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_351.java) \nIntersection of Two Arrays II,https://leetcode.com/problems/intersection-of-two-arrays-ii/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_350.java) \nIntersection of Two Arrays,https://leetcode.com/problems/intersection-of-two-arrays/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_349.java) \nDesign Tic-Tac-Toe,https://leetcode.com/problems/design-tic-tac-toe/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_348.java) \nTop K Frequent Elements,https://leetcode.com/problems/top-k-frequent-elements/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) \nMoving Average from Data Stream,https://leetcode.com/problems/moving-average-from-data-stream/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_346.java) \nReverse Vowels of a String,https://leetcode.com/problems/reverse-vowels-of-a-string/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_345.java) \nReverse String,https://leetcode.com/problems/reverse-string/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_344.java) \nInteger Break,https://leetcode.com/problems/integer-break/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_343.java) \nPower of Four,https://leetcode.com/problems/power-of-four/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_342.java) \nFlatten Nested List Iterator,https://leetcode.com/problems/flatten-nested-list-iterator/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_341.java) \nLongest Substring with At Most K Distinct Characters,https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_340.java) \nNested List Weight Sum,https://leetcode.com/problems/nested-list-weight-sum/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_339.java) \nCounting Bits,https://leetcode.com/problems/counting-bits/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_338.java) \nHouse Robber III,https://leetcode.com/problems/house-robber-iii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_337.java) \nPalindrome Pairs,https://leetcode.com/problems/palindrome-pairs/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_336.java) \nSelf Crossing,https://leetcode.com/problems/self-crossing/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_335.java) \nIncreasing Triplet Subsequence,https://leetcode.com/problems/increasing-triplet-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_334.java) \nLargest BST Subtree,https://leetcode.com/problems/largest-bst-subtree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_333.java) \nReconstruct Itinerary,https://leetcode.com/problems/reconstruct-itinerary/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) \nVerify Preorder Serialization of a Binary Tree,https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_331.java) \nPatching Array,https://leetcode.com/problems/patching-array/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_330.java) \nLongest Increasing Path in a Matrix,https://leetcode.com/problems/longest-increasing-path-in-a-matrix/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_329.java) \nOdd Even Linked List,https://leetcode.com/problems/odd-even-linked-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_328.java) \nCount of Range Sum,https://leetcode.com/problems/count-of-range-sum/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_327.java) \nPower of Three,https://leetcode.com/problems/power-of-three/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_326.java) \nMaximum Size Subarray Sum Equals k,https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_325.java) \nWiggle Sort II,https://leetcode.com/problems/wiggle-sort-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_324.java) \nNumber of Connected Components in an Undirected Graph,https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_323.java) \nCoin Change,https://leetcode.com/problems/coin-change/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_322.java) \nCreate Maximum Number,https://leetcode.com/problems/create-maximum-number/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_321.java) \nGeneralized Abbreviation,https://leetcode.com/problems/generalized-abbreviation/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_320.java) \nBulb Switcher,https://leetcode.com/problems/bulb-switcher/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_319.java) \nMaximum Product of Word Lengths,https://leetcode.com/problems/maximum-product-of-word-lengths/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_318.java) \nShortest Distance from All Buildings,https://leetcode.com/problems/shortest-distance-from-all-buildings/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_317.java) \nRemove Duplicate Letters,https://leetcode.com/problems/remove-duplicate-letters/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_316.java) \nCount of Smaller Numbers After Self,https://leetcode.com/problems/count-of-smaller-numbers-after-self/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_315.java) \nBinary Tree Vertical Order Traversal,https://leetcode.com/problems/binary-tree-vertical-order-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_314.java) \nSuper Ugly Number,https://leetcode.com/problems/super-ugly-number/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_313.java) \nBurst Balloons,https://leetcode.com/problems/burst-balloons/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_312.java) \nSparse Matrix Multiplication,https://leetcode.com/problems/sparse-matrix-multiplication/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_311.java) \nMinimum Height Trees,https://leetcode.com/problems/minimum-height-trees/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_310.java) \nBest Time to Buy and Sell Stock with Cooldown,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-cooldown/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_309.java) \nRange Sum Query 2D - Mutable,https://leetcode.com/problems/range-sum-query-2d-mutable/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_308.java) \nRange Sum Query - Mutable,https://leetcode.com/problems/range-sum-query-mutable/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_307.java) \nAdditive Number,https://leetcode.com/problems/additive-number/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_306.java) \nNumber of Islands II,https://leetcode.com/problems/number-of-islands-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_305.java) \nRange Sum Query 2D - Immutable,https://leetcode.com/problems/range-sum-query-2d-immutable/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_304.java) \nRange Sum Query - Immutable,https://leetcode.com/problems/range-sum-query-immutable/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_303.java) \nSmallest Rectangle Enclosing Black Pixels,https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_302.java) \nRemove Invalid Parentheses,https://leetcode.com/problems/remove-invalid-parentheses/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_301.java) \nLongest Increasing Subsequence,https://leetcode.com/problems/longest-increasing-subsequence/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_300.java) \nBulls and Cows,https://leetcode.com/problems/bulls-and-cows/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_299.java) \nBinary Tree Longest Consecutive Sequence,https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_298.java) \nSerialize and Deserialize Binary Tree,https://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) \nBest Meeting Point,https://leetcode.com/problems/best-meeting-point/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_296.java) \nFind Median from Data Stream,https://leetcode.com/problems/find-median-from-data-stream/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_295.java) \nFlip Game II,https://leetcode.com/problems/flip-game-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_294.java) \nFlip Game,https://leetcode.com/problems/flip-game/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_293.java) \nNim Game,https://leetcode.com/problems/nim-game/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_292.java) \nWord Pattern II,https://leetcode.com/problems/word-pattern-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_291.java) \nWord Pattern,https://leetcode.com/problems/word-pattern/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_290.java) \nGame of Life,https://leetcode.com/problems/game-of-life/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_289.java) \nUnique Word Abbreviation,https://leetcode.com/problems/unique-word-abbreviation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_288.java) \nFind the Duplicate Number,https://leetcode.com/problems/find-the-duplicate-number/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_287.java) \nWalls and Gates,https://leetcode.com/problems/walls-and-gates/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_286.java) \nInorder Successor In BST,https://leetcode.com/problems/inorder-successor-in-bst/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_285.java) \nPeeking Iterator,https://leetcode.com/problems/peeking-iterator/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_284.java) \nMove Zeroes,https://leetcode.com/problems/move-zeroes/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) \nExpression Add Operators,https://leetcode.com/problems/expression-add-operators/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_282.java) \nZigzag Iterator,https://leetcode.com/problems/zigzag-iterator/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_281.java) \nWiggle Sort,https://leetcode.com/problems/wiggle-sort/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_280.java) \nPerfect Squares,https://leetcode.com/problems/perfect-squares/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_279.java) \nFirst Bad Version,https://leetcode.com/problems/first-bad-version/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_278.java) \nFind the Celebrity,https://leetcode.com/problems/find-the-celebrity/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_277.java) \nPaint Fence,https://leetcode.com/problems/paint-fence/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_276.java) \nH-Index II,https://leetcode.com/problems/h-index-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_275.java) \nH-Index,https://leetcode.com/problems/h-index/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_274.java) \nInteger to English Words,https://leetcode.com/problems/integer-to-english-words/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) \nClosest Binary Search Tree Value II,https://leetcode.com/problems/closest-binary-search-tree-value-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_272.java) \nEncode and Decode Strings,https://leetcode.com/problems/encode-and-decode-strings/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_271.java) \nClosest Binary Search Tree Value,https://leetcode.com/problems/closest-binary-search-tree-value/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_270.java) \nAlien Dictionary,https://leetcode.com/problems/alien-dictionary/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_269.java) \nMissing Number,https://leetcode.com/problems/missing-number/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_268.java) \nPalindrome Permutation II,https://leetcode.com/problems/palindrome-permutation-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_267.java) \nPalindrome Permutation,https://leetcode.com/problems/palindrome-permutation/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_266.java) \nPaint House II,https://leetcode.com/problems/paint-house-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_265.java) \nUgly Number II,https://leetcode.com/problems/ugly-number-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_264.java) \nUgly Number,https://leetcode.com/problems/ugly-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_263.java) \nGraph Valid Tree,https://leetcode.com/problems/graph-valid-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_261.java) \nSingle Number III,https://leetcode.com/problems/single-number-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_260.java) \n3Sum Smaller,https://leetcode.com/problems/3sum-smaller/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_259.java) \nAdd Digits,https://leetcode.com/problems/add-digits/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_258.java) \nBinary Tree Paths,https://leetcode.com/problems/binary-tree-paths/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_257.java) \nPaint House,https://leetcode.com/problems/paint-house/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_256.java) \nVerify Preorder Sequence in Binary Search Tree,https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_255.java) \nFactor Combinations,https://leetcode.com/problems/factor-combinations/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_254.java) \nMeeting Rooms II,https://leetcode.com/problems/meeting-rooms-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) \nMeeting Rooms,https://leetcode.com/problems/meeting-rooms/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_252.java) \nFlatten 2D Vector,https://leetcode.com/problems/flatten-2d-vector/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_251.java) \nCount Univalue Subtrees,https://leetcode.com/problems/count-univalue-subtrees/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_250.java) \nGroup Shifted Strings,https://leetcode.com/problems/group-shifted-strings/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_249.java) \nStrobogrammatic Number III,https://leetcode.com/problems/strobogrammatic-number-iii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_248.java) \nStrobogrammatic Number II,https://leetcode.com/problems/strobogrammatic-number-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_247.java) \nStrobogrammatic Number,https://leetcode.com/problems/strobogrammatic-number/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_246.java) \nShortest Word Distance III,https://leetcode.com/problems/shortest-word-distance-iii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_245.java) \nShortest Word Distance II,https://leetcode.com/problems/shortest-word-distance-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_244.java) \nShortest Word Distance,https://leetcode.com/problems/shortest-word-distance/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_243.java) \nValid Anagram,https://leetcode.com/problems/valid-anagram/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_242.java) \nDifferent Ways to Add Parentheses,https://leetcode.com/problems/different-ways-to-add-parentheses/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_241.java) \nSearch a 2D Matrix II,https://leetcode.com/problems/search-a-2d-matrix-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_240.java) \nSliding Window Maximum,https://leetcode.com/problems/sliding-window-maximum/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) \nProduct of Array Except Self,https://leetcode.com/problems/product-of-array-except-self/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) \nDelete Node in a Linked List,https://leetcode.com/problems/delete-node-in-a-linked-list/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_237.java) \nLowest Common Ancestor of a Binary Tree,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) \nLowest Common Ancestor of a Binary Search Tree,https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_235.java) \nPalindrome Linked List,https://leetcode.com/problems/palindrome-linked-list/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_234.java) \nNumber of Digit One,https://leetcode.com/problems/number-of-digit-one/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_233.java) \nImplement Queue using Stacks,https://leetcode.com/problems/implement-queue-using-stacks/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_232.java) \nPower of Two,https://leetcode.com/problems/power-of-two/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_231.java) \nKth Smallest Element in a BST,https://leetcode.com/problems/kth-smallest-element-in-a-bst/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_230.java) \nMajority Element II,https://leetcode.com/problems/majority-element-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_229.java) \nSummary Ranges,https://leetcode.com/problems/summary-ranges/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_228.java) \nBasic Calculator II,https://leetcode.com/problems/basic-calculator-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) \nInvert Binary Tree,https://leetcode.com/problems/invert-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_226.java) \nImplement Stack using Queues,https://leetcode.com/problems/implement-stack-using-queues/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_225.java) \nBasic Calculator,https://leetcode.com/problems/basic-calculator/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_224.java) \nRectangle Area,https://leetcode.com/problems/rectangle-area/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_223.java) \nCount Complete Tree Nodes,https://leetcode.com/problems/count-complete-tree-nodes/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_222.java) \nMaximal Square,https://leetcode.com/problems/maximal-square/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) \nContains Duplicate III,https://leetcode.com/problems/contains-duplicate-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_220.java) \nContains Duplicate II,https://leetcode.com/problems/contains-duplicate-ii/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_219.java) \nThe Skyline Problem,https://leetcode.com/problems/the-skyline-problem/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_218.java) \nContains Duplicate,https://leetcode.com/problems/contains-duplicate/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_217.java) \nCombination Sum III,https://leetcode.com/problems/combination-sum-iii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_216.java) \nKth Largest Element in an Array,https://leetcode.com/problems/kth-largest-element-in-an-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_215.java) \nShortest Palindrome,https://leetcode.com/problems/shortest-palindrome/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_214.java) \nHouse Robber II,https://leetcode.com/problems/house-robber-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_213.java) \nWord Search II,https://leetcode.com/problems/word-search-ii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) \nAdd and Search Word - Data structure design,https://leetcode.com/problems/add-and-search-word-data-structure-design/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_211.java) \nCourse Schedule II,https://leetcode.com/problems/course-schedule-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) \nMinimum Size Subarray Sum,https://leetcode.com/problems/minimum-size-subarray-sum/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_209.java) \nImplement Trie,https://leetcode.com/problems/implement-trie-prefix-tree/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_208.java) \nCourse Schedule,https://leetcode.com/problems/course-schedule/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_207.java) \nReverse Linked List,https://leetcode.com/problems/reverse-linked-list/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_206.java) \nIsomorphic Strings,https://leetcode.com/problems/isomorphic-strings/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_205.java) \nCount Primes,https://leetcode.com/problems/count-primes/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_204.java) \nRemove Linked List Elements,https://leetcode.com/problems/remove-linked-list-elements/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_203.java) \nHappy Number,https://leetcode.com/problems/happy-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_202.java) \nBitwise AND of Numbers Range,https://leetcode.com/problems/bitwise-and-of-numbers-range/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_201.java) \nNumber of Islands,https://leetcode.com/problems/number-of-islands/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) \nBinary Tree Right Side View,https://leetcode.com/problems/binary-tree-right-side-view/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_199.java) \nHouse Robber,https://leetcode.com/problems/house-robber/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_198.java) \nNumber of 1 Bits,https://leetcode.com/problems/number-of-1-bits/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_191.java) \nReverse Bits,https://leetcode.com/problems/reverse-bits/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_190.java) \nRotate Array,https://leetcode.com/problems/rotate-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_189.java) \nBest Time to Buy and Sell Stock IV,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_188.java) \nRepeated DNA Sequences,https://leetcode.com/problems/repeated-dna-sequences/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_187.java) \nReverse Words in a String II,https://leetcode.com/problems/reverse-words-in-a-string-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_186.java) \nLargest Number,https://leetcode.com/problems/largest-number/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_179.java) \nDungeon Game,https://leetcode.com/problems/dungeon-game/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_174.java) \nBinary Search Tree Iterator,https://leetcode.com/problems/binary-search-tree-iterator/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/https://github.com/fishercoder1534/Leetcode/blob/blmaster/MEDIUM/src/medium/_173.java) \nFactorial Trailing Zeroes,https://leetcode.com/problems/factorial-trailing-zeroes/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_172.java) \nExcel Sheet Column Number,https://leetcode.com/problems/excel-sheet-column-number/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_171.java) \nTwo Sum III - Data structure design,https://leetcode.com/problems/two-sum-iii-data-structure-design/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_170.java) \nMajority Element,https://leetcode.com/problems/majority-element/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_169.java) \nExcel Sheet Column Title,https://leetcode.com/problems/excel-sheet-column-title/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_168.java) \nTwo Sum II - Input array is sorted,https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Easy,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_167.java), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_167.js) \"\nFraction to Recurring Decimal,https://leetcode.com/problems/fraction-to-recurring-decimal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_166.java) \nCompare Version Numbers,https://leetcode.com/problems/compare-version-numbers/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_165.java) \nMaximum Gap,https://leetcode.com/problems/maximum-gap/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_164.java) \nMissing Ranges,https://leetcode.com/problems/missing-ranges/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_163.java) \nFind Peak Element,https://leetcode.com/problems/find-peak-element/,Binary Search,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) \nOne Edit Distance,https://leetcode.com/problems/one-edit-distance/,,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_161.java) \nIntersection of Two Linked Lists,https://leetcode.com/problems/intersection-of-two-linked-lists/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_160.java) \nLongest Substring with At Most Two Distinct Characters,https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_159.java) \nRead N Characters Given Read4 II - Call multiple times,https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_158.java) \nRead N Characters Given Read4,https://leetcode.com/problems/read-n-characters-given-read4/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_157.java) \nBinary Tree Upside Down,https://leetcode.com/problems/binary-tree-upside-down/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_156.java) \nMin Stack,https://leetcode.com/problems/min-stack/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_155.java) \nFind Minimum in Rotated Sorted Array II,https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_154.java) \nFind Minimum in Rotated Sorted Array,https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_153.java) \nMaximum Product Subarray,https://leetcode.com/problems/maximum-product-subarray/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_152.java) \nReverse Words in a String,https://leetcode.com/problems/reverse-words-in-a-string/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_151.java) \nEvaluate Reverse Polish Notation,https://leetcode.com/problems/evaluate-reverse-polish-notation/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_150.java) \nMax Points on a Line,https://leetcode.com/problems/max-points-on-a-line/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_149.java) \nSort List,https://leetcode.com/problems/sort-list/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_148.java) \nInsertion Sort List,https://leetcode.com/problems/insertion-sort-list/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_147.java) \nLRU Cache,https://leetcode.com/problems/lru-cache/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) \nBinary Tree Postorder Traversal,https://leetcode.com/problems/binary-tree-postorder-traversal/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_145.java) \nBinary Tree Preorder Traversal,https://leetcode.com/problems/binary-tree-preorder-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_144.java) \nReorder List,https://leetcode.com/problems/reorder-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_143.java) \nLinked List Cycle II,https://leetcode.com/problems/linked-list-cycle-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_142.java) \nLinked List Cycle,https://leetcode.com/problems/linked-list-cycle/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_141.java) \nWord Break II,https://leetcode.com/problems/word-break-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_140.java) \nWord Break,https://leetcode.com/problems/word-break/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_139.java) \nCopy List with Random Pointer,https://leetcode.com/problems/copy-list-with-random-pointer/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_138.java) \nSingle Number II,https://leetcode.com/problems/single-number-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_137.java) \nSingle Number,https://leetcode.com/problems/single-number/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_136.java) \nCandy,https://leetcode.com/problems/candy/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_135.java) \nGas Station,https://leetcode.com/problems/gas-station/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) \nClone Graph,https://leetcode.com/problems/clone-graph/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_133.java) \nPalindrome Partitioning II,https://leetcode.com/problems/palindrome-partitioning-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_132.java) \nPalindrome Partitioning,https://leetcode.com/problems/palindrome-partitioning/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_131.java) \nSurrounded Regions,https://leetcode.com/problems/surrounded-regions/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_130.java) \nSum Root to Leaf Numbers,https://leetcode.com/problems/sum-root-to-leaf-numbers/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_129.java) \nLongest Consecutive Sequence,https://leetcode.com/problems/longest-consecutive-sequence/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) \nWord Ladder,https://leetcode.com/problems/word-ladder/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) \nWord Ladder II,https://leetcode.com/problems/word-ladder-ii/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_126.java) \nValid Palindrome,https://leetcode.com/problems/valid-palindrome/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) \nBinary Tree Maximum Path Sum,https://leetcode.com/problems/binary-tree-maximum-path-sum/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) \nBest Time to Buy and Sell Stock III,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_123.java) \nBest Time to Buy and Sell Stock II,https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_122.java) \nBest Time to Buy and Sell Stock,https://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) \nTriangle,https://leetcode.com/problems/triangle/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_120.java) \nPascal's Triangle II,https://leetcode.com/problems/pascals-triangle-ii/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_119.java) \nPascal's Triangle,https://leetcode.com/problems/pascals-triangle/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_118.java) \nPopulating Next Right Pointers in Each Node II,https://leetcode.com/problems/populating-parents-right-pointers-in-each-node-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_117.java) \nPopulating Next Right Pointers in Each Node,https://leetcode.com/problems/populating-parents-right-pointers-in-each-node/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_116.java) \nDistinct Subsequences,https://leetcode.com/problems/distinct-subsequences/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_115.java) \nFlatten Binary Tree to Linked List,https://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_114.java) \nPath Sum II,https://leetcode.com/problems/path-sum-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_113.java) \nPath Sum,https://leetcode.com/problems/path-sum/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_112.java) \nMinimum Depth of Binary Tree,https://leetcode.com/problems/minimum-depth-of-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_111.java) \nBalanced Binary Tree,https://leetcode.com/problems/balanced-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_110.java) \nConvert Sorted List to Binary Search Tree,https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_109.java) \nConvert Sorted Array to Binary Search Tree,https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_108.java) \nBinary Tree Level Order Traversal II,https://leetcode.com/problems/binary-tree-level-order-traversal-ii/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_107.java) \nConstruct Binary Tree from Inorder and Postorder Traversal,https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_106.java) \nConstruct Binary Tree from Preorder and Inorder Traversal,https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_105.java) \nMaximum Depth of Binary Tree,https://leetcode.com/problems/maximum-depth-of-binary-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_104.java) \nBinary Tree Zigzag Level Order Traversal,https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_103.java) \nBinary Tree Level Order Traversal,https://leetcode.com/problems/binary-tree-level-order-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_102.java) \nSymmetric Tree,https://leetcode.com/problems/symmetric-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_101.java) \nSame Tree,https://leetcode.com/problems/same-tree/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_100.java) \nRecover Binary Search Tree,https://leetcode.com/problems/recover-binary-search-tree/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_99.java) \nValidate Binary Search Tree,https://leetcode.com/problems/validate-binary-search-tree/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) \nInterleaving String,https://leetcode.com/problems/interleaving-string/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_97.java) \nUnique Binary Search Trees,https://leetcode.com/problems/unique-binary-search-trees/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_96.java) \nUnique Binary Search Trees II,https://leetcode.com/problems/unique-binary-search-trees-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_95.java) \nBinary Tree Inorder Traversal,https://leetcode.com/problems/binary-tree-inorder-traversal/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_94.java) \nRestore IP Addresses,https://leetcode.com/problems/restore-ip-addresses/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_93.java) \nReverse Linked List II,https://leetcode.com/problems/reverse-linked-list-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_92.java) \nDecode Ways,https://leetcode.com/problems/decode-ways/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_91.java) \nSubsets II,https://leetcode.com/problems/subsets-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_90.java) \nGray Code,https://leetcode.com/problems/gray-code/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_89.java) \nMerge Sorted Array,https://leetcode.com/problems/merge-sorted-array/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_88.java) \nScramble String,https://leetcode.com/problems/scramble-string/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_87.java) \nPartition List,https://leetcode.com/problems/partition-list/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_86.java) \nMaximal Rectangle,https://leetcode.com/problems/maximal-rectangle/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_85.java) \nLargest Rectangle in Histogram,https://leetcode.com/problems/largest-rectangle-in-histogram/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_84.java) \nRemove Duplicates from Sorted List,https://leetcode.com/problems/remove-duplicates-from-sorted-list/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_83.java) \nRemove Duplicates from Sorted List II,https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_82.java) \nSearch in Rotated Sorted Array II,https://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_81.java) \nRemove Duplicates from Sorted Array II,https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_80.java) \nWord Search,https://leetcode.com/problems/word-search/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) \nSubsets,https://leetcode.com/problems/subsets/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_78.java) \nCombinations,https://leetcode.com/problems/combinations/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_77.java) \nMinimum Window Substring,https://leetcode.com/problems/minimum-window-substring/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_76.java) \nSort Colors,https://leetcode.com/problems/sort-colors/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) \nSearch a 2D Matrix,https://leetcode.com/problems/search-a-2d-matrix/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_74.java) \nSet Matrix Zeroes,https://leetcode.com/problems/set-matrix-zeroes/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_73.java) \nEdit Distance,https://leetcode.com/problems/edit-distance/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_72.java) \nSimplify Path,https://leetcode.com/problems/simplify-path/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_71.java) \nClimbing Stairs,https://leetcode.com/problems/climbing-stairs/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_70.java) \nSqrt(x),https://leetcode.com/problems/sqrtx/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_69.java) \nText Justification,https://leetcode.com/problems/text-justification/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) \nAdd Binary,https://leetcode.com/problems/add-binary/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_67.java) \nPlus One,https://leetcode.com/problems/plus-one/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_66.java) \nValid Number,https://leetcode.com/problems/valid-number/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_65.java) \nMinimum Path Sum,https://leetcode.com/problems/minimum-path-sum/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_64.java) \nUnique Paths II,https://leetcode.com/problems/unique-paths-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) \nUnique Paths,https://leetcode.com/problems/unique-paths/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_62.java) \nRotate List,https://leetcode.com/problems/rotate-list/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_61.java) \nPermutation Sequence,https://leetcode.com/problems/permutation-sequence/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_60.java) \nSpiral Matrix II,https://leetcode.com/problems/spiral-matrix-ii/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_59.java) \nLength of Last Word,https://leetcode.com/problems/length-of-last-word/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_58.java) \nInsert Intervals,https://leetcode.com/problems/insert-interval/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_57.java) \nMerge Intervals,https://leetcode.com/problems/merge-intervals/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) \nJump Game,https://leetcode.com/problems/jump-game/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) \nSpiral Matrix,https://leetcode.com/problems/spiral-matrix/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) \nMaximum Subarray,https://leetcode.com/problems/maximum-subarray/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) \nN-Queens II,https://leetcode.com/problems/n-queens-ii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_52.java) \nN-Queens,https://leetcode.com/problems/n-queens/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_51.java) \n\"Pow(x, n)\",https://leetcode.com/problems/powx-n/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_50.java) \nGroup Anagrams,https://leetcode.com/problems/group-anagrams/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) \nRotate Image,https://leetcode.com/problems/rotate-image/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) \nPermutations II,https://leetcode.com/problems/permutations-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_47.java) \nPermutations,https://leetcode.com/problems/permutations/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_46.java) \nJump Game II,https://leetcode.com/problems/jump-game-ii/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) \nWildcard Matching,https://leetcode.com/problems/wildcard-matching/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_44.java) \nMultiply Strings,https://leetcode.com/problems/multiply-strings/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_43.java) \nTrapping Rain Water,https://leetcode.com/problems/trapping-rain-water/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) \nFirst Missing Positive,https://leetcode.com/problems/first-missing-positive/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) \nCombination Sum II,https://leetcode.com/problems/combination-sum-ii/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_40.java) \nCombination Sum,https://leetcode.com/problems/combination-sum/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_39.java) \nCount and Say,https://leetcode.com/problems/count-and-say/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_38.java) \nSudoku Solver,https://leetcode.com/problems/sudoku-solver/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) \nValid Sudoku,https://leetcode.com/problems/valid-sudoku/,Medium ,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) \"\nSearch Insert Position,https://leetcode.com/problems/search-insert-position/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_35.java) \nSearch for a Range,https://leetcode.com/problems/search-for-a-range/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_34.java) \nSearch in Rotated Sorted Array,https://leetcode.com/problems/search-in-rotated-sorted-array/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) \nLongest Valid Parentheses,https://leetcode.com/problems/longest-valid-parentheses/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) \nNext Permutation,https://leetcode.com/problems/parents-permutation,Medium ,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_31.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_31.cpp) \"\nSubstring with Concatenation of All Words,https://leetcode.com/problems/substring-with-concatenation-of-all-words/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_30.java) \nDivide Two Integers,https://leetcode.com/problems/divide-two-integers/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_29.java) \nImplement strStr(),https://leetcode.com/problems/implement-strstr/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_28.java) \nRemove Element,https://leetcode.com/problems/remove-element/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_27.java) \nRemove Duplicates from Sorted Array,https://leetcode.com/problems/remove-duplicates-from-sorted-array/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_26.java) \nReverse Nodes in k-Group,https://leetcode.com/problems/reverse-nodes-in-k-group/,Hard ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_25.java) \nSwap Nodes in Pairs,https://leetcode.com/problems/swap-nodes-in-pairs/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_24.java) \nMerge k Sorted Lists,https://leetcode.com/problems/merge-k-sorted-lists/,Hard,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) \nGenerate Parentheses,https://leetcode.com/problems/generate-parentheses/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) \nMerge Two Sorted Lists,https://leetcode.com/problems/merge-two-sorted-lists/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) \nValid Parentheses,https://leetcode.com/problems/valid-parentheses/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) \nRemove Nth Node From End of List,https://leetcode.com/problems/remove-nth-node-from-end-of-list/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_19.java) \n4 Sum,https://leetcode.com/problems/4sum/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_18.java) \nLetter Combinations of a Phone Number,https://leetcode.com/problems/letter-combinations-of-a-phone-number/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) \n3Sum Closest,https://leetcode.com/problems/3sum-closest/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_16.java) \n3Sum,https://leetcode.com/problems/3sum/,Medium,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) \"\nLongest Common Prefix,https://leetcode.com/problems/longest-common-prefix/,Easy,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) \nRoman to Integer,https://leetcode.com/problems/roman-to-integer,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) \nInteger to Roman,https://leetcode.com/problems/integer-to-roman/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_12.java) \nContainer With Most Water,https://leetcode.com/problems/container-with-most-water/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_11.java) \nRegular Expression Matching,https://leetcode.com/problems/regular-expression-matching/,Hard ,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_10.js) \"\nPalindrome Number,https://leetcode.com/problems/palindrome-number/,Easy,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_9.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_9.cpp) \"\nString to Integer (atoi),https://leetcode.com/problems/string-to-integer-atoi/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_8.java) \nReverse Integer,https://leetcode.com/problems/reverse-integer/,Easy ,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) \"\nZigZag Conversion,https://leetcode.com/problems/zigzag-conversion/,Easy ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_6.java) \nLongest Palindromic Substring,https://leetcode.com/problems/longest-palindromic-substring/,Medium,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) \nMedian of Two Sorted Arrays,https://leetcode.com/problems/median-of-two-sorted-arrays/,Hard ,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) \"\nLongest Substring Without Repeating Characters,https://leetcode.com/problems/longest-substring-without-repeating-characters/,Medium ,\"[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) \"\nAdd Two Numbers,https://leetcode.com/problems/add-two-numbers/,Medium ,[Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) \nTwo Sum,https://leetcode.com/problems/two-sum/,Easy,\"[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) \"\n" }, { "path": "data/leetcode_problems_and_companies.csv", "content": "problem_link,problem_name,company_name,num_occur\nhttps://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/,Minimum Consecutive Cards to Pick Up,Google,1\nhttps://leetcode.com/problems/remove-digit-from-number-to-maximize-result/,Remove Digit From Number to Maximize Result,Microsoft,2\nhttps://leetcode.com/problems/minimum-average-difference/,Minimum Average Difference,Amazon,1\nhttps://leetcode.com/problems/count-prefixes-of-a-given-string/,Count Prefixes of a Given String,Google,1\nhttps://leetcode.com/problems/intersection-of-multiple-arrays/,Intersection of Multiple Arrays,Uber,1\nhttps://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/,Minimum Rounds to Complete All Tasks,Amazon,1\nhttps://leetcode.com/problems/calculate-digit-sum-of-a-string/,Calculate Digit Sum of a String,Uber,1\nhttps://leetcode.com/problems/find-closest-number-to-zero/,Find Closest Number to Zero,Tiger Analytics,1\nhttps://leetcode.com/problems/minimum-bit-flips-to-convert-number/,Minimum Bit Flips to Convert Number,persistent systems,1\nhttps://leetcode.com/problems/find-the-difference-of-two-arrays/,Find the Difference of Two Arrays,Google,1\nhttps://leetcode.com/problems/count-hills-and-valleys-in-an-array/,Count Hills and Valleys in an Array,Facebook,1\nhttps://leetcode.com/problems/minimum-operations-to-halve-array-sum/,Minimum Operations to Halve Array Sum,Microsoft,1\nhttps://leetcode.com/problems/divide-array-into-equal-pairs/,Divide Array Into Equal Pairs,Microsoft,1\nhttps://leetcode.com/problems/count-artifacts-that-can-be-extracted/,Count Artifacts That Can Be Extracted,IMC,1\nhttps://leetcode.com/problems/find-all-k-distant-indices-in-an-array/,Find All K-Distant Indices in an Array,Google,1\nhttps://leetcode.com/problems/most-frequent-number-following-key-in-an-array/,Most Frequent Number Following Key In an Array,Google,1\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/,Minimum Number of Steps to Make Two Strings Anagram II,Wealthfront,1\nhttps://leetcode.com/problems/counting-words-with-a-given-prefix/,Counting Words With a Given Prefix,Google,1\nhttps://leetcode.com/problems/construct-string-with-repeat-limit/,Construct String With Repeat Limit,Arista Networks,1\nhttps://leetcode.com/problems/merge-nodes-in-between-zeros/,Merge Nodes in Between Zeros,Microsoft,1\nhttps://leetcode.com/problems/count-integers-with-even-digit-sum/,Count Integers With Even Digit Sum,MindTree,1\nhttps://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/,Find Three Consecutive Integers That Sum to a Given Number,FPT,1\nhttps://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/,Count Equal and Divisible Pairs in an Array,zeta suite,1\nhttps://leetcode.com/problems/count-operations-to-obtain-zero/,Count Operations to Obtain Zero,payu,1\nhttps://leetcode.com/problems/design-bitset/,Design Bitset,Bloomberg,2\nhttps://leetcode.com/problems/smallest-value-of-the-rearranged-number/,Smallest Value of the Rearranged Number,Cognizant,T-mobile\nhttps://leetcode.com/problems/sort-even-and-odd-indices-independently/,Sort Even and Odd Indices Independently,Zoho,1\nhttps://leetcode.com/problems/partition-array-according-to-given-pivot/,Partition Array According to Given Pivot,Amazon,1\nhttps://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/,Minimum Sum of Four Digit Number After Splitting Digits,Amazon,1\nhttps://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/,All Divisions With the Highest Score of a Binary Array,Google,1\nhttps://leetcode.com/problems/keep-multiplying-found-values-by-two/,Keep Multiplying Found Values by Two,Goldman Sachs,1\nhttps://leetcode.com/problems/find-all-lonely-numbers-in-the-array/,Find All Lonely Numbers in the Array,Google,1\nhttps://leetcode.com/problems/rearrange-array-elements-by-sign/,Rearrange Array Elements by Sign,Amazon,1\nhttps://leetcode.com/problems/minimum-moves-to-reach-target-score/,Minimum Moves to Reach Target Score,Wayfair,1\nhttps://leetcode.com/problems/divide-a-string-into-groups-of-size-k/,Divide a String Into Groups of Size k,Canonical,1\nhttps://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/,Minimum Swaps to Group All 1's Together II,Amazon,2\nhttps://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Check if Every Row and Column Contains All Numbers,Karat,4\nhttps://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Check if Every Row and Column Contains All Numbers,instacart,2\nhttps://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/,Maximum Twin Sum of a Linked List,Amazon,23\nhttps://leetcode.com/problems/destroying-asteroids/,Destroying Asteroids,Google,1\nhttps://leetcode.com/problems/number-of-laser-beams-in-a-bank/,Number of Laser Beams in a Bank,Amazon,6\nhttps://leetcode.com/problems/check-if-all-as-appears-before-all-bs/,Check if All A's Appears Before All B's,Microsoft,1\nhttps://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/,Check if a Parentheses String Can Be Valid,Amazon,2\nhttps://leetcode.com/problems/maximum-number-of-words-found-in-sentences/,Maximum Number of Words Found in Sentences,Google,1\nhttps://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/,Number of Smooth Descent Periods of a Stock,Amazon,4\nhttps://leetcode.com/problems/adding-spaces-to-a-string/,Adding Spaces to a String,Amazon,1\nhttps://leetcode.com/problems/rings-and-rods/,Rings and Rods,Google,6\nhttps://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/,Find Subsequence of Length K With the Largest Sum,Accenture,1\nhttps://leetcode.com/problems/k-radius-subarray-averages/,K Radius Subarray Averages,Facebook,3\nhttps://leetcode.com/problems/find-target-indices-after-sorting-array/,Find Target Indices After Sorting Array,Google,4\nhttps://leetcode.com/problems/find-target-indices-after-sorting-array/,Find Target Indices After Sorting Array,Facebook,2\nhttps://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/,Minimum Number of Buckets Required to Collect Rainwater from Houses,Grab,1\nhttps://leetcode.com/problems/count-common-words-with-one-occurrence/,Count Common Words With One Occurrence,Jane Street,1\nhttps://leetcode.com/problems/range-frequency-queries/,Range Frequency Queries,Quora,1\nhttps://leetcode.com/problems/watering-plants/,Watering Plants,Google,1\nhttps://leetcode.com/problems/two-furthest-houses-with-different-colors/,Two Furthest Houses With Different Colors,Amazon,2\nhttps://leetcode.com/problems/process-restricted-friend-requests/,Process Restricted Friend Requests,Facebook,5\nhttps://leetcode.com/problems/decode-the-slanted-ciphertext/,Decode the Slanted Ciphertext,Amazon,1\nhttps://leetcode.com/problems/reverse-nodes-in-even-length-groups/,Reverse Nodes in Even Length Groups,Zopsmart,1\nhttps://leetcode.com/problems/time-needed-to-buy-tickets/,Time Needed to Buy Tickets,Twitter,2\nhttps://leetcode.com/problems/most-beautiful-item-for-each-query/,Most Beautiful Item for Each Query,Postmates,razorpay\nhttps://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/,Check Whether Two Strings are Almost Equivalent,Salesforce,1\nhttps://leetcode.com/problems/count-vowel-substrings-of-a-string/,Count Vowel Substrings of a String,Commvault,1\nhttps://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/,Find the Minimum and Maximum Number of Nodes Between Critical Points,Info Edge,1\nhttps://leetcode.com/problems/smallest-index-with-equal-value/,Smallest Index With Equal Value,Google,1\nhttps://leetcode.com/problems/plates-between-candles/,Plates Between Candles,Amazon,3\nhttps://leetcode.com/problems/plates-between-candles/,Plates Between Candles,tiktok,3\nhttps://leetcode.com/problems/two-best-non-overlapping-events/,Two Best Non-Overlapping Events,razorpay,1\nhttps://leetcode.com/problems/kth-distinct-string-in-an-array/,Kth Distinct String in an Array,Amazon,1\nhttps://leetcode.com/problems/parallel-courses-iii/,Parallel Courses III,Pinterest,4\nhttps://leetcode.com/problems/next-greater-numerically-balanced-number/,Next Greater Numerically Balanced Number,Sprinklr,1\nhttps://leetcode.com/problems/number-of-valid-words-in-a-sentence/,Number of Valid Words in a Sentence,Amazon,2\nhttps://leetcode.com/problems/simple-bank-system/,Simple Bank System,PhonePe,1\nhttps://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/,Check if Numbers Are Ascending in a Sentence,Apple,2\nhttps://leetcode.com/problems/the-time-when-the-network-becomes-idle/,The Time When the Network Becomes Idle,Deutsche Bank,1\nhttps://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/,Remove Colored Pieces if Both Neighbors are the Same Color,Walmart Global Tech,9\nhttps://leetcode.com/problems/stock-price-fluctuation/,Stock Price Fluctuation,Google,30\nhttps://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/,Minimum Operations to Make a Uni-Value Grid,Facebook,3\nhttps://leetcode.com/problems/two-out-of-three/,Two Out of Three,Booking.com,1\nhttps://leetcode.com/problems/find-missing-observations/,Find Missing Observations,Microsoft,Amazon\nhttps://leetcode.com/problems/minimum-moves-to-convert-string/,Minimum Moves to Convert String,Jeavio,1\nhttps://leetcode.com/problems/maximize-the-confusion-of-an-exam/,Maximize the Confusion of an Exam,Amazon,2\nhttps://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/,Number of Pairs of Strings With Concatenation Equal to Target,Facebook,2\nhttps://leetcode.com/problems/convert-1d-array-into-2d-array/,Convert 1D Array Into 2D Array,Google,1\nhttps://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/,Check if Word Can Be Placed In Crossword,Google,4\nhttps://leetcode.com/problems/grid-game/,Grid Game,T System,1\nhttps://leetcode.com/problems/maximum-difference-between-increasing-elements/,Maximum Difference Between Increasing Elements,Cisco,6\nhttps://leetcode.com/problems/maximum-difference-between-increasing-elements/,Maximum Difference Between Increasing Elements,Expedia,3\nhttps://leetcode.com/problems/sum-of-beauty-in-the-array/,Sum of Beauty in the Array,Amazon,1\nhttps://leetcode.com/problems/find-original-array-from-doubled-array/,Find Original Array From Doubled Array,Google,14\nhttps://leetcode.com/problems/find-original-array-from-doubled-array/,Find Original Array From Doubled Array,Microsoft,2\nhttps://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/,Count Number of Pairs With Absolute Difference K,Amazon,1\nhttps://leetcode.com/problems/reverse-prefix-of-word/,Reverse Prefix of Word,Optum,1\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number of Weak Characters in the Game,ByteDance,4\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number of Weak Characters in the Game,Google,3\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number of Weak Characters in the Game,tiktok,3\nhttps://leetcode.com/problems/find-all-groups-of-farmland/,Find All Groups of Farmland,Citrix,1\nhttps://leetcode.com/problems/find-the-middle-index-in-array/,Find the Middle Index in Array,Facebook,3\nhttps://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/,Find the Kth Largest Integer in the Array,Facebook,4\nhttps://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/,Minimize the Difference Between Target and Chosen Elements,Amazon,1\nhttps://leetcode.com/problems/find-unique-binary-string/,Find Unique Binary String,Amazon,2\nhttps://leetcode.com/problems/find-greatest-common-divisor-of-array/,Find Greatest Common Divisor of Array,TIAA,1\nhttps://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/,Minimum Time to Type Word Using Special Typewriter,tiktok,3\nhttps://leetcode.com/problems/find-if-path-exists-in-graph/,Find if Path Exists in Graph,Amazon,4\nhttps://leetcode.com/problems/find-if-path-exists-in-graph/,Find if Path Exists in Graph,Google,3\nhttps://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/,Array With Elements Not Equal to Average of Neighbors,Amazon,2\nhttps://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/,Number of Strings That Appear as Substrings in Word,Uber,1\nhttps://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/,Binary Searchable Numbers in an Unsorted Array,Google,1\nhttps://leetcode.com/problems/check-if-string-is-a-prefix-of-array/,Check If String Is a Prefix of Array,Uber,1\nhttps://leetcode.com/problems/delete-characters-to-make-fancy-string/,Delete Characters to Make Fancy String,Wayfair,1\nhttps://leetcode.com/problems/three-divisors/,Three Divisors,Microsoft,1\nhttps://leetcode.com/problems/sum-of-digits-of-string-after-convert/,Sum of Digits of String After Convert,Microsoft,1\nhttps://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/,Check if All Characters Have Equal Number of Occurrences,Bolt,5\nhttps://leetcode.com/problems/maximum-number-of-words-you-can-type/,Maximum Number of Words You Can Type,Quora,1\nhttps://leetcode.com/problems/concatenation-of-array/,Concatenation of Array,Google,4\nhttps://leetcode.com/problems/concatenation-of-array/,Concatenation of Array,Adobe,2\nhttps://leetcode.com/problems/nearest-exit-from-entrance-in-maze/,Nearest Exit from Entrance in Maze,Amazon,2\nhttps://leetcode.com/problems/count-square-sum-triples/,Count Square Sum Triples,Amazon,2\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,Apple,5\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,Adobe,3\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,Uber,2\nhttps://leetcode.com/problems/build-array-from-permutation/,Build Array from Permutation,Google,2\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,Microsoft,3\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,MakeMyTrip,2\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,Google,2\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occurrences of a Substring,Amazon,2\nhttps://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/,Remove One Element to Make the Array Strictly Increasing,Facebook,2\nhttps://leetcode.com/problems/the-number-of-full-rounds-you-have-played/,The Number of Full Rounds You Have Played,Wayfair,4\nhttps://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/,Redistribute Characters to Make All Strings Equal,Moengage,1\nhttps://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/,Check if All the Integers in a Range Are Covered,Bloomberg,1\nhttps://leetcode.com/problems/cutting-ribbons/,Cutting Ribbons,Facebook,31\nhttps://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/,Determine Whether Matrix Can Be Obtained By Rotation,Adobe,2\nhttps://leetcode.com/problems/minimize-maximum-pair-sum-in-array/,Minimize Maximum Pair Sum in Array,Google,3\nhttps://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/,Substrings of Size Three with Distinct Characters,Quora,1\nhttps://leetcode.com/problems/minimize-product-sum-of-two-arrays/,Minimize Product Sum of Two Arrays,Google,1\nhttps://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/,Longer Contiguous Segments of Ones than Zeros,Amazon,2\nhttps://leetcode.com/problems/sum-of-all-subset-xor-totals/,Sum of All Subset XOR Totals,Adobe,2\nhttps://leetcode.com/problems/sum-of-floored-pairs/,Sum of Floored Pairs,Rakuten,1\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,Uber,4\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,Netflix,4\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,eBay,2\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,Capital One,2\nhttps://leetcode.com/problems/incremental-memory-leak/,Incremental Memory Leak,tiktok,1\nhttps://leetcode.com/problems/sorting-the-sentence/,Sorting the Sentence,Google,2\nhttps://leetcode.com/problems/sorting-the-sentence/,Sorting the Sentence,Adobe,2\nhttps://leetcode.com/problems/maximum-population-year/,Maximum Population Year,Google,2\nhttps://leetcode.com/problems/maximum-population-year/,Maximum Population Year,Cisco,2\nhttps://leetcode.com/problems/maximum-population-year/,Maximum Population Year,Bloomberg,2\nhttps://leetcode.com/problems/minimum-distance-to-the-target-element/,Minimum Distance to the Target Element,Honeywell,1\nhttps://leetcode.com/problems/seat-reservation-manager/,Seat Reservation Manager,Dropbox,1\nhttps://leetcode.com/problems/replace-all-digits-with-characters/,Replace All Digits with Characters,Adobe,2\nhttps://leetcode.com/problems/replace-all-digits-with-characters/,Replace All Digits with Characters,Google,1\nhttps://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/,Remove Duplicates From an Unsorted Linked List,Microsoft,2\nhttps://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/,Remove Duplicates From an Unsorted Linked List,Goldman Sachs,2\nhttps://leetcode.com/problems/check-if-the-sentence-is-pangram/,Check if the Sentence Is Pangram,Goldman Sachs,3\nhttps://leetcode.com/problems/check-if-the-sentence-is-pangram/,Check if the Sentence Is Pangram,Facebook,2\nhttps://leetcode.com/problems/maximum-xor-for-each-query/,Maximum XOR for Each Query,Uber,1\nhttps://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/,Queries on Number of Points Inside a Circle,Google,1\nhttps://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/,Minimum Operations to Make the Array Increasing,Apple,2\nhttps://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/,Minimum Operations to Make the Array Increasing,Deutsche Bank,1\nhttps://leetcode.com/problems/faulty-sensor/,Faulty Sensor,Facebook,1\nhttps://leetcode.com/problems/find-the-winner-of-the-circular-game/,Find the Winner of the Circular Game,Goldman Sachs,4\nhttps://leetcode.com/problems/find-the-winner-of-the-circular-game/,Find the Winner of the Circular Game,Bloomberg,2\nhttps://leetcode.com/problems/sign-of-the-product-of-an-array/,Sign of the Product of an Array,Microsoft,45\nhttps://leetcode.com/problems/finding-the-users-active-minutes/,Finding the Users Active Minutes,Twitter,10\nhttps://leetcode.com/problems/truncate-sentence/,Truncate Sentence,Bloomberg,1\nhttps://leetcode.com/problems/count-nice-pairs-in-an-array/,Count Nice Pairs in an Array,Uber,3\nhttps://leetcode.com/problems/sentence-similarity-iii/,Sentence Similarity III,Google,1\nhttps://leetcode.com/problems/determine-color-of-a-chessboard-square/,Determine Color of a Chessboard Square,JPMorgan,1\nhttps://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/,Evaluate the Bracket Pairs of a String,Google,2\nhttps://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/,Minimum Number of Operations to Reinitialize a Permutation,Google,1\nhttps://leetcode.com/problems/number-of-different-integers-in-a-string/,Number of Different Integers in a String,Expedia,2\nhttps://leetcode.com/problems/implement-trie-ii-prefix-tree/,Implement Trie II (Prefix Tree),Apple,2\nhttps://leetcode.com/problems/implement-trie-ii-prefix-tree/,Implement Trie II (Prefix Tree),Docusign,2\nhttps://leetcode.com/problems/maximum-ascending-subarray-sum/,Maximum Ascending Subarray Sum,tcs,1\nhttps://leetcode.com/problems/design-authentication-manager/,Design Authentication Manager,Twitter,1\nhttps://leetcode.com/problems/second-largest-digit-in-a-string/,Second Largest Digit in a String,Softwire,1\nhttps://leetcode.com/problems/maximum-average-pass-ratio/,Maximum Average Pass Ratio,Amazon,2\nhttps://leetcode.com/problems/find-center-of-star-graph/,Find Center of Star Graph,Microsoft,1\nhttps://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/,Check if One String Swap Can Make Strings Equal,Facebook,2\nhttps://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/,Minimum Elements to Add to Form a Given Sum,Twitter,1\nhttps://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/,Check if Binary String Has at Most One Segment of Ones,Cisco,1\nhttps://leetcode.com/problems/sum-of-beauty-of-all-substrings/,Sum of Beauty of All Substrings,Google,1\nhttps://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/,Check if Number is a Sum of Powers of Three,Microsoft,2\nhttps://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/,Find Nearest Point That Has the Same X or Y Coordinate,DoorDash,3\nhttps://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/,Equal Sum Arrays With Minimum Number of Operations,HRT,7\nhttps://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/,Equal Sum Arrays With Minimum Number of Operations,Microsoft,2\nhttps://leetcode.com/problems/closest-dessert-cost/,Closest Dessert Cost,ByteDance,3\nhttps://leetcode.com/problems/closest-dessert-cost/,Closest Dessert Cost,tiktok,2\nhttps://leetcode.com/problems/closest-dessert-cost/,Closest Dessert Cost,Microsoft,2\nhttps://leetcode.com/problems/count-items-matching-a-rule/,Count Items Matching a Rule,Adobe,3\nhttps://leetcode.com/problems/count-items-matching-a-rule/,Count Items Matching a Rule,Facebook,2\nhttps://leetcode.com/problems/sort-features-by-popularity/,Sort Features by Popularity,Amazon,2\nhttps://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/,Minimum Number of Operations to Move All Balls to Each Box,Amazon,2\nhttps://leetcode.com/problems/merge-strings-alternately/,Merge Strings Alternately,Uber,3\nhttps://leetcode.com/problems/map-of-highest-peak/,Map of Highest Peak,Google,2\nhttps://leetcode.com/problems/map-of-highest-peak/,Map of Highest Peak,Microsoft,2\nhttps://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/,Form Array by Concatenating Subarrays of Another Array,Amazon,1\nhttps://leetcode.com/problems/longest-nice-substring/,Longest Nice Substring,Microsoft,4\nhttps://leetcode.com/problems/count-number-of-homogenous-substrings/,Count Number of Homogenous Substrings,Virtu Financial,1\nhttps://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/,Minimum Changes To Make Alternating Binary String,Tesla,2\nhttps://leetcode.com/problems/design-most-recently-used-queue/,Design Most Recently Used Queue,Google,1\nhttps://leetcode.com/problems/largest-merge-of-two-strings/,Largest Merge Of Two Strings,Snapchat,1\nhttps://leetcode.com/problems/maximum-score-from-removing-stones/,Maximum Score From Removing Stones,Bloomberg,2\nhttps://leetcode.com/problems/check-if-array-is-sorted-and-rotated/,Check if Array Is Sorted and Rotated,Amazon,2\nhttps://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/,Minimum Length of String After Deleting Similar Ends,Goldman Sachs,Amazon\nhttps://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/,Maximum Absolute Sum of Any Subarray,Amazon,2\nhttps://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/,Maximum Absolute Sum of Any Subarray,Adobe,2\nhttps://leetcode.com/problems/sum-of-unique-elements/,Sum of Unique Elements,Facebook,2\nhttps://leetcode.com/problems/maximum-subarray-sum-after-one-operation/,Maximum Subarray Sum After One Operation,Sprinklr,1\nhttps://leetcode.com/problems/palindrome-partitioning-iv/,Palindrome Partitioning IV,tcs,1\nhttps://leetcode.com/problems/restore-the-array-from-adjacent-pairs/,Restore the Array From Adjacent Pairs,Capital One,2\nhttps://leetcode.com/problems/maximum-number-of-balls-in-a-box/,Maximum Number of Balls in a Box,Microsoft,2\nhttps://leetcode.com/problems/maximum-number-of-balls-in-a-box/,Maximum Number of Balls in a Box,AppDynamics,Lucid\nhttps://leetcode.com/problems/latest-time-by-replacing-hidden-digits/,Latest Time by Replacing Hidden Digits,Google,1\nhttps://leetcode.com/problems/minimum-number-of-people-to-teach/,Minimum Number of People to Teach,Duolingo,2\nhttps://leetcode.com/problems/find-the-highest-altitude/,Find the Highest Altitude,Apple,3\nhttps://leetcode.com/problems/largest-submatrix-with-rearrangements/,Largest Submatrix With Rearrangements,Google,Directi\nhttps://leetcode.com/problems/tuple-with-same-product/,Tuple with Same Product,Google,1\nhttps://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/,Number Of Rectangles That Can Form The Largest Square,AllinCall,1\nhttps://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Swapping Nodes in a Linked List,Amazon,3\nhttps://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Swapping Nodes in a Linked List,Facebook,3\nhttps://leetcode.com/problems/swapping-nodes-in-a-linked-list/,Swapping Nodes in a Linked List,Bloomberg,2\nhttps://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/,Construct the Lexicographically Largest Valid Sequence,Salesforce,3\nhttps://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/,Construct the Lexicographically Largest Valid Sequence,Facebook,1\nhttps://leetcode.com/problems/maximum-score-from-removing-substrings/,Maximum Score From Removing Substrings,Google,1\nhttps://leetcode.com/problems/calculate-money-in-leetcode-bank/,Calculate Money in Leetcode Bank,edabit,1\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,Amazon,2\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,Adobe,2\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,Robinhood,1\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,Amazon,29\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,JPMorgan,2\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,LinkedIn,2\nhttps://leetcode.com/problems/largest-subarray-length-k/,Largest Subarray Length K,Google,1\nhttps://leetcode.com/problems/maximum-number-of-eaten-apples/,Maximum Number of Eaten Apples,Microsoft,2\nhttps://leetcode.com/problems/maximum-number-of-eaten-apples/,Maximum Number of Eaten Apples,Uber,1\nhttps://leetcode.com/problems/number-of-students-unable-to-eat-lunch/,Number of Students Unable to Eat Lunch,Flipkart,7\nhttps://leetcode.com/problems/maximum-erasure-value/,Maximum Erasure Value,Cashfree,1\nhttps://leetcode.com/problems/reformat-phone-number/,Reformat Phone Number,Toptal,3\nhttps://leetcode.com/problems/stone-game-vii/,Stone Game VII,Dunzo,1\nhttps://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/,Partitioning Into Minimum Number Of Deci-Binary Numbers,Apple,2\nhttps://leetcode.com/problems/count-of-matches-in-tournament/,Count of Matches in Tournament,Adobe,2\nhttps://leetcode.com/problems/stone-game-vi/,Stone Game VI,APT Portfolio,1\nhttps://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/,Concatenation of Consecutive Binary Numbers,Google,3\nhttps://leetcode.com/problems/max-number-of-k-sum-pairs/,Max Number of K-Sum Pairs,Amazon,2\nhttps://leetcode.com/problems/goal-parser-interpretation/,Goal Parser Interpretation,Apple,2\nhttps://leetcode.com/problems/minimize-deviation-in-array/,Minimize Deviation in Array,Amazon,2\nhttps://leetcode.com/problems/find-the-most-competitive-subsequence/,Find the Most Competitive Subsequence,Google,2\nhttps://leetcode.com/problems/richest-customer-wealth/,Richest Customer Wealth,Adobe,2\nhttps://leetcode.com/problems/design-front-middle-back-queue/,Design Front Middle Back Queue,Amazon,3\nhttps://leetcode.com/problems/maximum-repeating-substring/,Maximum Repeating Substring,Pure Storage,3\nhttps://leetcode.com/problems/ways-to-make-a-fair-array/,Ways to Make a Fair Array,Microsoft,2\nhttps://leetcode.com/problems/ways-to-make-a-fair-array/,Ways to Make a Fair Array,Dunzo,1\nhttps://leetcode.com/problems/smallest-string-with-a-given-numeric-value/,Smallest String With A Given Numeric Value,Adobe,2\nhttps://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/,Check If Two String Arrays are Equivalent,Apple,2\nhttps://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/,Check If Two String Arrays are Equivalent,Facebook,1\nhttps://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/,Minimum Operations to Reduce X to Zero,Google,3\nhttps://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/,Minimum Operations to Reduce X to Zero,Amazon,2\nhttps://leetcode.com/problems/determine-if-two-strings-are-close/,Determine if Two Strings Are Close,Postmates,1\nhttps://leetcode.com/problems/design-an-ordered-stream/,Design an Ordered Stream,Bloomberg,20\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,Facebook,156\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,Microsoft,5\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,LinkedIn,5\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,Amazon,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,Google,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,Spotify,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Common Ancestor of a Binary Tree III,Sumologic,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/,Lowest Common Ancestor of a Binary Tree II,Facebook,8\nhttps://leetcode.com/problems/furthest-building-you-can-reach/,Furthest Building You Can Reach,Amazon,5\nhttps://leetcode.com/problems/furthest-building-you-can-reach/,Furthest Building You Can Reach,Google,3\nhttps://leetcode.com/problems/furthest-building-you-can-reach/,Furthest Building You Can Reach,Microsoft,2\nhttps://leetcode.com/problems/count-sorted-vowel-strings/,Count Sorted Vowel Strings,Google,3\nhttps://leetcode.com/problems/count-sorted-vowel-strings/,Count Sorted Vowel Strings,Salesforce,2\nhttps://leetcode.com/problems/check-array-formation-through-concatenation/,Check Array Formation Through Concatenation,Facebook,2\nhttps://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/,Widest Vertical Area Between Two Points Containing No Points,Microsoft,1\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,Amazon,5\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,Oracle,3\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,Twilio,2\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,Google,2\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Increasing Frequency,C3 IoT,2\nhttps://leetcode.com/problems/arithmetic-subarrays/,Arithmetic Subarrays,Bloomberg,2\nhttps://leetcode.com/problems/slowest-key/,Slowest Key,Amazon,17\nhttps://leetcode.com/problems/slowest-key/,Slowest Key,Walmart Global Tech,2\nhttps://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/,Design an Expression Tree With Evaluate Function,Amazon,7\nhttps://leetcode.com/problems/best-team-with-no-conflicts/,Best Team With No Conflicts,Uber,2\nhttps://leetcode.com/problems/best-team-with-no-conflicts/,Best Team With No Conflicts,Morgan Stanley,1\nhttps://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/,Lexicographically Smallest String After Applying Operations,JP Morgan,JPMorgan\nhttps://leetcode.com/problems/largest-substring-between-two-equal-characters/,Largest Substring Between Two Equal Characters,Google,2\nhttps://leetcode.com/problems/coordinate-with-maximum-network-quality/,Coordinate With Maximum Network Quality,peak6,1\nhttps://leetcode.com/problems/mean-of-array-after-removing-some-elements/,Mean of Array After Removing Some Elements,Google,1\nhttps://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/,Maximum Nesting Depth of the Parentheses,Bloomberg,4\nhttps://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/,Maximum Nesting Depth of the Parentheses,Facebook,3\nhttps://leetcode.com/problems/even-odd-tree/,Even Odd Tree,JPMorgan,3\nhttps://leetcode.com/problems/even-odd-tree/,Even Odd Tree,Bloomberg,1\nhttps://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/,Special Array With X Elements Greater Than or Equal X,Google,1\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,Karat,16\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,Robinhood,8\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,Wayfair,5\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/,Alert Using Same Key-Card Three or More Times in a One Hour Period,Indeed,4\nhttps://leetcode.com/problems/design-parking-system/,Design Parking System,Amazon,12\nhttps://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/,Maximum Number of Achievable Transfer Requests,Adobe,2\nhttps://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/,Maximum Number of Achievable Transfer Requests,Amazon,1\nhttps://leetcode.com/problems/crawler-log-folder/,Crawler Log Folder,Mercari,1\nhttps://leetcode.com/problems/rearrange-spaces-between-words/,Rearrange Spaces Between Words,Google,4\nhttps://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Sum of All Odd Length Subarrays,Adobe,3\nhttps://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Sum of All Odd Length Subarrays,Amazon,2\nhttps://leetcode.com/problems/sum-of-all-odd-length-subarrays/,Sum of All Odd Length Subarrays,Apple,2\nhttps://leetcode.com/problems/count-unhappy-friends/,Count Unhappy Friends,Bloomberg,3\nhttps://leetcode.com/problems/special-positions-in-a-binary-matrix/,Special Positions in a Binary Matrix,Uber,2\nhttps://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/,Replace All ?'s to Avoid Consecutive Repeating Characters,Microsoft,2\nhttps://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/,Shortest Subarray to be Removed to Make Array Sorted,Amazon,4\nhttps://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/,Shortest Subarray to be Removed to Make Array Sorted,Flipkart,2\nhttps://leetcode.com/problems/matrix-diagonal-sum/,Matrix Diagonal Sum,Bloomberg,2\nhttps://leetcode.com/problems/matrix-diagonal-sum/,Matrix Diagonal Sum,Amazon,2\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,Facebook,121\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,Google,4\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,Amazon,2\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,Microsoft,2\nhttps://leetcode.com/problems/dot-product-of-two-sparse-vectors/,Dot Product of Two Sparse Vectors,Bloomberg,2\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maximum Length of Subarray With Positive Product,Amazon,29\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maximum Length of Subarray With Positive Product,Arcesium,4\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maximum Length of Subarray With Positive Product,Adobe,2\nhttps://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/,Detect Pattern of Length M Repeated K or More Times,HRT,1\nhttps://leetcode.com/problems/maximum-number-of-coins-you-can-get/,Maximum Number of Coins You Can Get,Flipkart,3\nhttps://leetcode.com/problems/maximum-number-of-coins-you-can-get/,Maximum Number of Coins You Can Get,Dunzo,2\nhttps://leetcode.com/problems/most-visited-sector-in-a-circular-track/,Most Visited Sector in a Circular Track,IBM,6\nhttps://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/,Minimum Numbers of Function Calls to Make Target Array,Amazon,1\nhttps://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/,Minimum Number of Vertices to Reach All Nodes,Google,2\nhttps://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/,Minimum Number of Vertices to Reach All Nodes,Amazon,2\nhttps://leetcode.com/problems/thousand-separator/,Thousand Separator,Uber,2\nhttps://leetcode.com/problems/minimum-operations-to-make-array-equal/,Minimum Operations to Make Array Equal,Microsoft,2\nhttps://leetcode.com/problems/three-consecutive-odds/,Three Consecutive Odds,DJI,1\nhttps://leetcode.com/problems/find-kth-bit-in-nth-binary-string/,Find Kth Bit in Nth Binary String,Rupeek,1\nhttps://leetcode.com/problems/make-the-string-great/,Make The String Great,Adobe,2\nhttps://leetcode.com/problems/make-the-string-great/,Make The String Great,Google,1\nhttps://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/,Minimum Insertions to Balance a Parentheses String,Facebook,4\nhttps://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/,Minimum Insertions to Balance a Parentheses String,Microsoft,4\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,Facebook,28\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,tiktok,3\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,Microsoft,2\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,Google,2\nhttps://leetcode.com/problems/kth-missing-positive-number/,Kth Missing Positive Number,Amazon,2\nhttps://leetcode.com/problems/find-the-winner-of-an-array-game/,Find the Winner of an Array Game,Directi,1\nhttps://leetcode.com/problems/count-good-triplets/,Count Good Triplets,Google,2\nhttps://leetcode.com/problems/shuffle-string/,Shuffle String,Google,2\nhttps://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/,Minimum Number of Increments on Subarrays to Form a Target Array,Google,4\nhttps://leetcode.com/problems/number-of-good-ways-to-split-a-string/,Number of Good Ways to Split a String,Amazon,2\nhttps://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/,Number of Sub-arrays With Odd Sum,Google,2\nhttps://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/,Number of Sub-arrays With Odd Sum,Apple,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,Accenture,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,Apple,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,Amazon,2\nhttps://leetcode.com/problems/count-odd-numbers-in-an-interval-range/,Count Odd Numbers in an Interval Range,Adobe,2\nhttps://leetcode.com/problems/water-bottles/,Water Bottles,IBM,4\nhttps://leetcode.com/problems/water-bottles/,Water Bottles,Amazon,2\nhttps://leetcode.com/problems/water-bottles/,Water Bottles,Microsoft,1\nhttps://leetcode.com/problems/path-with-maximum-probability/,Path with Maximum Probability,Google,5\nhttps://leetcode.com/problems/number-of-good-pairs/,Number of Good Pairs,Microsoft,3\nhttps://leetcode.com/problems/number-of-good-pairs/,Number of Good Pairs,Amazon,3\nhttps://leetcode.com/problems/number-of-good-pairs/,Number of Good Pairs,Adobe,2\nhttps://leetcode.com/problems/range-sum-of-sorted-subarray-sums/,Range Sum of Sorted Subarray Sums,Google,1\nhttps://leetcode.com/problems/reformat-date/,Reformat Date,Expedia,14\nhttps://leetcode.com/problems/reformat-date/,Reformat Date,tiktok,10\nhttps://leetcode.com/problems/reformat-date/,Reformat Date,Walmart Global Tech,2\nhttps://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/,Can Make Arithmetic Progression From Sequence,Amazon,1\nhttps://leetcode.com/problems/path-crossing/,Path Crossing,Google,2\nhttps://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/,Longest Subarray of 1's After Deleting One Element,Yandex,3\nhttps://leetcode.com/problems/the-kth-factor-of-n/,The kth Factor of n,Amazon,25\nhttps://leetcode.com/problems/the-kth-factor-of-n/,The kth Factor of n,Expedia,6\nhttps://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/,Average Salary Excluding the Minimum and Maximum Salary,Amazon,2\nhttps://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/,Average Salary Excluding the Minimum and Maximum Salary,Netsuite,1\nhttps://leetcode.com/problems/clone-n-ary-tree/,Clone N-ary Tree,Google,2\nhttps://leetcode.com/problems/making-file-names-unique/,Making File Names Unique,Expedia,14\nhttps://leetcode.com/problems/making-file-names-unique/,Making File Names Unique,Microsoft,2\nhttps://leetcode.com/problems/xor-operation-in-an-array/,XOR Operation in an Array,Bloomberg,2\nhttps://leetcode.com/problems/clone-binary-tree-with-random-pointer/,Clone Binary Tree With Random Pointer,Facebook,2\nhttps://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/,Minimum Number of Days to Make m Bouquets,Google,2\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,Amazon,5\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,Expedia,4\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,Booking.com,3\nhttps://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/,Least Number of Unique Integers after K Removals,Salesforce,2\nhttps://leetcode.com/problems/running-sum-of-1d-array/,Running Sum of 1d Array,Microsoft,2\nhttps://leetcode.com/problems/subrectangle-queries/,Subrectangle Queries,Nuro,1\nhttps://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/,Final Prices With a Special Discount in a Shop,Amazon,2\nhttps://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/,Delete N Nodes After M Nodes of a Linked List,Microsoft,1\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,Bloomberg,9\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,Roblox,5\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,Amazon,3\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,Oracle,2\nhttps://leetcode.com/problems/the-k-strongest-values-in-an-array/,The k Strongest Values in an Array,Google,1\nhttps://leetcode.com/problems/shuffle-the-array/,Shuffle the Array,Apple,3\nhttps://leetcode.com/problems/shuffle-the-array/,Shuffle the Array,Amazon,2\nhttps://leetcode.com/problems/find-all-the-lonely-nodes/,Find All The Lonely Nodes,Microsoft,1\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,DRW,4\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,Amazon,3\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,American Express,3\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/,Reorder Routes to Make All Paths Lead to the City Zero,Grab,2\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum Product of Two Elements in an Array,Yahoo,2\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum Product of Two Elements in an Array,Facebook,2\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum Product of Two Elements in an Array,Samsung,1\nhttps://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/,Check If a String Contains All Binary Codes of Size K,Google,1\nhttps://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/,Make Two Arrays Equal by Reversing Sub-arrays,Facebook,4\nhttps://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/,Pseudo-Palindromic Paths in a Binary Tree,Bloomberg,2\nhttps://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/,Maximum Number of Vowels in a Substring of Given Length,Amazon,1\nhttps://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/,Check If a Word Occurs As a Prefix of Any Word in a Sentence,Amazon,2\nhttps://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/,People Whose List of Favorite Companies Is Not a Subset of Another List,Google,1\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Sentence,Amazon,2\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Sentence,VMware,2\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Sentence,Expedia,1\nhttps://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/,Number of Students Doing Homework at a Given Time,Yandex,2\nhttps://leetcode.com/problems/count-good-nodes-in-binary-tree/,Count Good Nodes in Binary Tree,Microsoft,11\nhttps://leetcode.com/problems/count-good-nodes-in-binary-tree/,Count Good Nodes in Binary Tree,Salesforce,2\nhttps://leetcode.com/problems/simplified-fractions/,Simplified Fractions,Google,2\nhttps://leetcode.com/problems/consecutive-characters/,Consecutive Characters,Apple,3\nhttps://leetcode.com/problems/consecutive-characters/,Consecutive Characters,Google,2\nhttps://leetcode.com/problems/build-an-array-with-stack-operations/,Build an Array With Stack Operations,Google,2\nhttps://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/,Find the Kth Smallest Sum of a Matrix With Sorted Rows,Bloomberg,2\nhttps://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,Uber,14\nhttps://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,Amazon,12\nhttps://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/,Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit,Google,3\nhttps://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/,Check If All 1's Are at Least Length K Places Away,United Health Group,1\nhttps://leetcode.com/problems/destination-city/,Destination City,Yelp,5\nhttps://leetcode.com/problems/destination-city/,Destination City,Google,2\nhttps://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/,Max Difference You Can Get From Changing an Integer,Mercari,1\nhttps://leetcode.com/problems/kids-with-the-greatest-number-of-candies/,Kids With the Greatest Number of Candies,Amazon,3\nhttps://leetcode.com/problems/first-unique-number/,First Unique Number,Amazon,4\nhttps://leetcode.com/problems/first-unique-number/,First Unique Number,Facebook,2\nhttps://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Leftmost Column with at Least a One,Facebook,10\nhttps://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Leftmost Column with at Least a One,Uber,10\nhttps://leetcode.com/problems/leftmost-column-with-at-least-a-one/,Leftmost Column with at Least a One,Google,2\nhttps://leetcode.com/problems/perform-string-shifts/,Perform String Shifts,Goldman Sachs,1\nhttps://leetcode.com/problems/counting-elements/,Counting Elements,DRW,1\nhttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Maximum Points You Can Obtain from Cards,Google,17\nhttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Maximum Points You Can Obtain from Cards,Amazon,3\nhttps://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/,Maximum Points You Can Obtain from Cards,Adobe,2\nhttps://leetcode.com/problems/maximum-score-after-splitting-a-string/,Maximum Score After Splitting a String,Google,1\nhttps://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/,Display Table of Food Orders in a Restaurant,JP Morgan,JPMorgan\nhttps://leetcode.com/problems/reformat-the-string/,Reformat The String,Google,4\nhttps://leetcode.com/problems/reformat-the-string/,Reformat The String,Microsoft,1\nhttps://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/,The k-th Lexicographical String of All Happy Strings of Length n,Microsoft,1\nhttps://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/,Minimum Value to Get Positive Step by Step Sum,Amazon,2\nhttps://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/,Minimum Value to Get Positive Step by Step Sum,JPMorgan,2\nhttps://leetcode.com/problems/html-entity-parser/,HTML Entity Parser,Oracle,1\nhttps://leetcode.com/problems/queries-on-a-permutation-with-key/,Queries on a Permutation With Key,Amazon,1\nhttps://leetcode.com/problems/string-matching-in-an-array/,String Matching in an Array,Amazon,3\nhttps://leetcode.com/problems/string-matching-in-an-array/,String Matching in an Array,Bloomberg,2\nhttps://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/,Minimum Subsequence in Non-Increasing Order,Amazon,2\nhttps://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/,Minimum Subsequence in Non-Increasing Order,Mercari,1\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,American Express,2\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,Sony,2\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,OT,1\nhttps://leetcode.com/problems/circle-and-rectangle-overlapping/,Circle and Rectangle Overlapping,Adobe,2\nhttps://leetcode.com/problems/construct-k-palindrome-strings/,Construct K Palindrome Strings,Uber,7\nhttps://leetcode.com/problems/count-largest-group/,Count Largest Group,Mercari,1\nhttps://leetcode.com/problems/design-underground-system/,Design Underground System,Bloomberg,64\nhttps://leetcode.com/problems/count-number-of-teams/,Count Number of Teams,Goldman Sachs,7\nhttps://leetcode.com/problems/count-number-of-teams/,Count Number of Teams,Amazon,3\nhttps://leetcode.com/problems/count-number-of-teams/,Count Number of Teams,Facebook,2\nhttps://leetcode.com/problems/find-lucky-integer-in-an-array/,Find Lucky Integer in an Array,Microsoft,1\nhttps://leetcode.com/problems/longest-happy-prefix/,Longest Happy Prefix,Amazon,2\nhttps://leetcode.com/problems/four-divisors/,Four Divisors,Capital One,1\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target Array in the Given Order,Apple,2\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target Array in the Given Order,Amazon,2\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target Array in the Given Order,Visa,1\nhttps://leetcode.com/problems/pizza-with-3n-slices/,Pizza With 3n Slices,Google,2\nhttps://leetcode.com/problems/sort-integers-by-the-power-value/,Sort Integers by The Power Value,Bloomberg,2\nhttps://leetcode.com/problems/sort-integers-by-the-power-value/,Sort Integers by The Power Value,Qualtrics,2\nhttps://leetcode.com/problems/cinema-seat-allocation/,Cinema Seat Allocation,Microsoft,17\nhttps://leetcode.com/problems/cinema-seat-allocation/,Cinema Seat Allocation,Amazon,2\nhttps://leetcode.com/problems/find-the-distance-value-between-two-arrays/,Find the Distance Value Between Two Arrays,Uber,2\nhttps://leetcode.com/problems/balance-a-binary-search-tree/,Balance a Binary Search Tree,Facebook,11\nhttps://leetcode.com/problems/design-a-stack-with-increment-operation/,Design a Stack With Increment Operation,tiktok,13\nhttps://leetcode.com/problems/lucky-numbers-in-a-matrix/,Lucky Numbers in a Matrix,Apple,2\nhttps://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/,Find a Corresponding Node of a Binary Tree in a Clone of That Tree,Amazon,2\nhttps://leetcode.com/problems/frog-position-after-t-seconds/,Frog Position After T Seconds,Google,2\nhttps://leetcode.com/problems/frog-position-after-t-seconds/,Frog Position After T Seconds,Amazon,2\nhttps://leetcode.com/problems/time-needed-to-inform-all-employees/,Time Needed to Inform All Employees,Google,11\nhttps://leetcode.com/problems/time-needed-to-inform-all-employees/,Time Needed to Inform All Employees,Amazon,6\nhttps://leetcode.com/problems/bulb-switcher-iii/,Bulb Switcher III,Grab,4\nhttps://leetcode.com/problems/bulb-switcher-iii/,Bulb Switcher III,Microsoft,2\nhttps://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/,Generate a String With Characters That Have Odd Counts,Microsoft,2\nhttps://leetcode.com/problems/maximum-sum-bst-in-binary-tree/,Maximum Sum BST in Binary Tree,Amazon,3\nhttps://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/,Longest ZigZag Path in a Binary Tree,Amazon,6\nhttps://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/,Find the Longest Substring Containing Vowels in Even Counts,Microsoft,1\nhttps://leetcode.com/problems/increasing-decreasing-string/,Increasing Decreasing String,Akuna Capital,8\nhttps://leetcode.com/problems/increasing-decreasing-string/,Increasing Decreasing String,Amazon,2\nhttps://leetcode.com/problems/linked-list-in-binary-tree/,Linked List in Binary Tree,Amazon,2\nhttps://leetcode.com/problems/linked-list-in-binary-tree/,Linked List in Binary Tree,Microsoft,2\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,Atlassian,18\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,Google,2\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,Coursera,2\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,Square,2\nhttps://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/,How Many Numbers Are Smaller Than the Current Number,Amazon,2\nhttps://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/,How Many Numbers Are Smaller Than the Current Number,Yahoo,2\nhttps://leetcode.com/problems/closest-divisors/,Closest Divisors,Amazon,1\nhttps://leetcode.com/problems/validate-binary-tree-nodes/,Validate Binary Tree Nodes,Facebook,2\nhttps://leetcode.com/problems/number-of-days-between-two-dates/,Number of Days Between Two Dates,Amazon,5\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Number of Substrings Containing All Three Characters,Microsoft,2\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Number of Substrings Containing All Three Characters,Adobe,2\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,Number of Substrings Containing All Three Characters,DE Shaw,1\nhttps://leetcode.com/problems/apply-discount-every-n-orders/,Apply Discount Every n Orders,Facebook,1\nhttps://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/,Sort Integers by The Number of 1 Bits,Infosys,2\nhttps://leetcode.com/problems/construct-target-array-with-multiple-sums/,Construct Target Array With Multiple Sums,Quora,3\nhttps://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Maximum Number of Events That Can Be Attended,Amazon,3\nhttps://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Maximum Number of Events That Can Be Attended,Salesforce,2\nhttps://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/,Maximum Number of Events That Can Be Attended,JPMorgan,2\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,Google,7\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,Amazon,3\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,Apple,2\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K Numbers,Cruise Automation,2\nhttps://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/,Count Negative Numbers in a Sorted Matrix,Facebook,2\nhttps://leetcode.com/problems/maximum-students-taking-exam/,Maximum Students Taking Exam,SAP,1\nhttps://leetcode.com/problems/tweet-counts-per-frequency/,Tweet Counts Per Frequency,Twitter,6\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,Bloomberg,8\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,DoorDash,7\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,Twitter,2\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/,Minimum Number of Steps to Make Two Strings Anagram,tiktok,2\nhttps://leetcode.com/problems/check-if-n-and-its-double-exist/,Check If N and Its Double Exist,Google,2\nhttps://leetcode.com/problems/jump-game-iv/,Jump Game IV,Google,5\nhttps://leetcode.com/problems/jump-game-iv/,Jump Game IV,Amazon,4\nhttps://leetcode.com/problems/jump-game-iv/,Jump Game IV,tiktok,2\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,Facebook,11\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,Microsoft,5\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,Amazon,3\nhttps://leetcode.com/problems/angle-between-hands-of-a-clock/,Angle Between Hands of a Clock,Oracle,2\nhttps://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/,Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold,LinkedIn,1\nhttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Number of Steps to Reduce a Number to Zero,Microsoft,2\nhttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Number of Steps to Reduce a Number to Zero,Apple,2\nhttps://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/,Number of Steps to Reduce a Number to Zero,Grab,2\nhttps://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/,The K Weakest Rows in a Matrix,Amazon,1\nhttps://leetcode.com/problems/maximum-product-of-splitted-binary-tree/,Maximum Product of Splitted Binary Tree,Amazon,4\nhttps://leetcode.com/problems/maximum-product-of-splitted-binary-tree/,Maximum Product of Splitted Binary Tree,Two Sigma,4\nhttps://leetcode.com/problems/reduce-array-size-to-the-half/,Reduce Array Size to The Half,Amazon,2\nhttps://leetcode.com/problems/remove-palindromic-subsequences/,Remove Palindromic Subsequences,Bloomberg,2\nhttps://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/,\"Filter Restaurants by Vegan-Friendly, Price and Distance\",Yelp,4\nhttps://leetcode.com/problems/remove-palindromic-subsequences/,Remove Palindromic Subsequences,Bloomberg,2\nhttps://leetcode.com/problems/rank-transform-of-an-array/,Rank Transform of an Array,Facebook,3\nhttps://leetcode.com/problems/rank-transform-of-an-array/,Rank Transform of an Array,Google,2\nhttps://leetcode.com/problems/sort-the-matrix-diagonally/,Sort the Matrix Diagonally,Microsoft,2\nhttps://leetcode.com/problems/delete-leaves-with-a-given-value/,Delete Leaves With a Given Value,Amazon,2\nhttps://leetcode.com/problems/print-words-vertically/,Print Words Vertically,Postmates,2\nhttps://leetcode.com/problems/print-words-vertically/,Print Words Vertically,Microsoft,1\nhttps://leetcode.com/problems/maximum-69-number/,Maximum 69 Number,HRT,1\nhttps://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/,Convert Integer to the Sum of Two No-Zero Integers,HRT,1\nhttps://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/,Sum of Nodes with Even-Valued Grandparent,Amazon,2\nhttps://leetcode.com/problems/matrix-block-sum/,Matrix Block Sum,Amazon,2\nhttps://leetcode.com/problems/decompress-run-length-encoded-list/,Decompress Run-Length Encoded List,Apple,3\nhttps://leetcode.com/problems/decompress-run-length-encoded-list/,Decompress Run-Length Encoded List,Amazon,2\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,Facebook,5\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,Amazon,2\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,Google,2\nhttps://leetcode.com/problems/all-elements-in-two-binary-search-trees/,All Elements in Two Binary Search Trees,Bloomberg,2\nhttps://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/,Find N Unique Integers Sum up to Zero,Microsoft,22\nhttps://leetcode.com/problems/deepest-leaves-sum/,Deepest Leaves Sum,Apple,2\nhttps://leetcode.com/problems/sum-of-mutated-array-closest-to-target/,Sum of Mutated Array Closest to Target,Bloomberg,2\nhttps://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/,Replace Elements with Greatest Element on Right Side,Facebook,2\nhttps://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/,Maximum Number of Occurrences of a Substring,Amazon,2\nhttps://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/,Divide Array in Sets of K Consecutive Numbers,Google,4\nhttps://leetcode.com/problems/find-numbers-with-even-number-of-digits/,Find Numbers with Even Number of Digits,Amazon,2\nhttps://leetcode.com/problems/sequential-digits/,Sequential Digits,Amazon,3\nhttps://leetcode.com/problems/sequential-digits/,Sequential Digits,Apple,2\nhttps://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/,Convert Binary Number in a Linked List to Integer,Amazon,2\nhttps://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/,Convert Binary Number in a Linked List to Integer,Oracle,2\nhttps://leetcode.com/problems/minimum-falling-path-sum-ii/,Minimum Falling Path Sum II,Roblox,4\nhttps://leetcode.com/problems/minimum-falling-path-sum-ii/,Minimum Falling Path Sum II,Google,1\nhttps://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/,Element Appearing More Than 25% In Sorted Array,Facebook,5\nhttps://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/,Element Appearing More Than 25% In Sorted Array,Google,2\nhttps://leetcode.com/problems/iterator-for-combination/,Iterator for Combination,Uber,2\nhttps://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/,Find the Smallest Divisor Given a Threshold,Salesforce,3\nhttps://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/,Find the Smallest Divisor Given a Threshold,Airbnb,2\nhttps://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/,Group the People Given the Group Size They Belong To,Apple,2\nhttps://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/,Group the People Given the Group Size They Belong To,Bloomberg,2\nhttps://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/,Subtract the Product and Sum of Digits of an Integer,Uber,5\nhttps://leetcode.com/problems/count-square-submatrices-with-all-ones/,Count Square Submatrices with All Ones,Google,8\nhttps://leetcode.com/problems/count-square-submatrices-with-all-ones/,Count Square Submatrices with All Ones,Bloomberg,2\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,Amazon,14\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,Google,11\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,Microsoft,10\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,Facebook,4\nhttps://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/,Find Winner on a Tic Tac Toe Game,Tesla,2\nhttps://leetcode.com/problems/delete-tree-nodes/,Delete Tree Nodes,Microsoft,1\nhttps://leetcode.com/problems/hexspeak/,Hexspeak,Virtu Financial,2\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,Amazon,68\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,Google,3\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,Facebook,3\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,Oracle,3\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,Apple,2\nhttps://leetcode.com/problems/search-suggestions-system/,Search Suggestions System,Adobe,2\nhttps://leetcode.com/problems/count-servers-that-communicate/,Count Servers that Communicate,Microsoft,6\nhttps://leetcode.com/problems/minimum-time-visiting-all-points/,Minimum Time Visiting All Points,Apple,3\nhttps://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/,Find Elements in a Contaminated Binary Tree,Google,1\nhttps://leetcode.com/problems/shift-2d-grid/,Shift 2D Grid,Bloomberg,2\nhttps://leetcode.com/problems/synonymous-sentences/,Synonymous Sentences,Cruise Automation,3\nhttps://leetcode.com/problems/synonymous-sentences/,Synonymous Sentences,Amazon,3\nhttps://leetcode.com/problems/smallest-common-region/,Smallest Common Region,Airbnb,7\nhttps://leetcode.com/problems/cells-with-odd-values-in-a-matrix/,Cells with Odd Values in a Matrix,Google,2\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Facebook,282\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Bloomberg,8\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Amazon,6\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Microsoft,4\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Google,2\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Adobe,2\nhttps://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/,Minimum Remove to Make Valid Parentheses,Snapchat,2\nhttps://leetcode.com/problems/array-transformation/,Array Transformation,Virtu Financial,2\nhttps://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/,Find Positive Integer Solution for a Given Equation,Google,2\nhttps://leetcode.com/problems/check-if-it-is-a-straight-line/,Check If It Is a Straight Line,Microsoft,2\nhttps://leetcode.com/problems/check-if-it-is-a-straight-line/,Check If It Is a Straight Line,Palantir Technologies,1\nhttps://leetcode.com/problems/missing-number-in-arithmetic-progression/,Missing Number In Arithmetic Progression,VMware,2\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,Amazon,2\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,Bloomberg,2\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,Walmart Global Tech,2\nhttps://leetcode.com/problems/split-a-string-in-balanced-strings/,Split a String in Balanced Strings,Adobe,2\nhttps://leetcode.com/problems/path-with-maximum-gold/,Path with Maximum Gold,tiktok,2\nhttps://leetcode.com/problems/play-with-chips/,Play with Chips,Bloomberg,2\nhttps://leetcode.com/problems/two-sum-bsts/,Two Sum BSTs,Amazon,3\nhttps://leetcode.com/problems/intersection-of-three-sorted-arrays/,Intersection of Three Sorted Arrays,Facebook,3\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Bloomberg,26\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Amazon,8\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Facebook,7\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Apple,3\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Goldman Sachs,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Microsoft,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Spotify,2\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/,Remove All Adjacent Duplicates in String II,Visa,2\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,Amazon,5\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,Adobe,5\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,Facebook,4\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,Apple,4\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,Bloomberg,3\nhttps://leetcode.com/problems/unique-number-of-occurrences/,Unique Number of Occurrences,Google,2\nhttps://leetcode.com/problems/minimum-absolute-difference/,Minimum Absolute Difference,Salesforce,3\nhttps://leetcode.com/problems/minimum-absolute-difference/,Minimum Absolute Difference,Google,2\nhttps://leetcode.com/problems/minimum-absolute-difference/,Minimum Absolute Difference,JPMorgan,2\nhttps://leetcode.com/problems/find-smallest-common-element-in-all-rows/,Find Smallest Common Element in All Rows,Walmart Global Tech,2\nhttps://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/,How Many Apples Can You Put into the Basket,Virtu Financial,2\nhttps://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/,Reverse Substrings Between Each Pair of Parentheses,Microsoft,2\nhttps://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/,Reverse Substrings Between Each Pair of Parentheses,Paypal,2\nhttps://leetcode.com/problems/maximum-number-of-balloons/,Maximum Number of Balloons,Adobe,2\nhttps://leetcode.com/problems/day-of-the-week/,Day of the Week,Apple,2\nhttps://leetcode.com/problems/day-of-the-week/,Day of the Week,United Health Group,1\nhttps://leetcode.com/problems/distance-between-bus-stops/,Distance Between Bus Stops,Google,1\nhttps://leetcode.com/problems/shortest-distance-to-target-color/,Shortest Distance to Target Color,Uber,2\nhttps://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/,Count Substrings with Only One Distinct Letter,Virtu Financial,2\nhttps://leetcode.com/problems/diet-plan-performance/,Diet Plan Performance,Amazon,1\nhttps://leetcode.com/problems/prime-arrangements/,Prime Arrangements,Amazon,2\nhttps://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/,Remove Zero Sum Consecutive Nodes from Linked List,Amazon,2\nhttps://leetcode.com/problems/single-row-keyboard/,Single-Row Keyboard,Google,1\nhttps://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/,Maximum Level Sum of a Binary Tree,Facebook,3\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,Karat,12\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,Indeed,6\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,Amazon,2\nhttps://leetcode.com/problems/find-words-that-can-be-formed-by-characters/,Find Words That Can Be Formed by Characters,Google,2\nhttps://leetcode.com/problems/day-of-the-year/,Day of the Year,ZScaler,1\nhttps://leetcode.com/problems/analyze-user-website-visit-pattern/,Analyze User Website Visit Pattern,Amazon,50\nhttps://leetcode.com/problems/analyze-user-website-visit-pattern/,Analyze User Website Visit Pattern,Spotify,6\nhttps://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/,Minimum Swaps to Group All 1's Together,Amazon,21\nhttps://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/,Check If a Number Is Majority Element in a Sorted Array,Facebook,2\nhttps://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/,Check If a Number Is Majority Element in a Sorted Array,Salesforce,1\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,Google,36\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,Rubrik,5\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,Microsoft,2\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,Amazon,6\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,DoorDash,5\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,Bloomberg,3\nhttps://leetcode.com/problems/longest-common-subsequence/,Longest Common Subsequence,Karat,2\nhttps://leetcode.com/problems/alphabet-board-path/,Alphabet Board Path,Amazon,2\nhttps://leetcode.com/problems/n-th-tribonacci-number/,N-th Tribonacci Number,Amazon,3\nhttps://leetcode.com/problems/parallel-courses/,Parallel Courses,Amazon,2\nhttps://leetcode.com/problems/armstrong-number/,Armstrong Number,Amazon,1\nhttps://leetcode.com/problems/largest-unique-number/,Largest Unique Number,Amazon,1\nhttps://leetcode.com/problems/number-of-equivalent-domino-pairs/,Number of Equivalent Domino Pairs,Adobe,2\nhttps://leetcode.com/problems/number-of-equivalent-domino-pairs/,Number of Equivalent Domino Pairs,Amazon,1\nhttps://leetcode.com/problems/relative-sort-array/,Relative Sort Array,Google,2\nhttps://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/,Compare Strings by Frequency of the Smallest Character,Google,2\nhttps://leetcode.com/problems/remove-vowels-from-a-string/,Remove Vowels from a String,Amazon,3\nhttps://leetcode.com/problems/number-of-days-in-a-month/,Number of Days in a Month,Amazon,1\nhttps://leetcode.com/problems/print-in-order/,Print in Order,Google,2\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,Facebook,7\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,Google,6\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,Microsoft,2\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Return Forest,Intuit,2\nhttps://leetcode.com/problems/defanging-an-ip-address/,Defanging an IP Address,Google,2\nhttps://leetcode.com/problems/defanging-an-ip-address/,Defanging an IP Address,Amazon,2\nhttps://leetcode.com/problems/distribute-candies-to-people/,Distribute Candies to People,PayTM,2\nhttps://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/,Find K-Length Substrings With No Repeated Characters,Amazon,4\nhttps://leetcode.com/problems/two-sum-less-than-k/,Two Sum Less Than K,Amazon,3\nhttps://leetcode.com/problems/two-sum-less-than-k/,Two Sum Less Than K,Facebook,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Amazon,9\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,DoorDash,4\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Flipkart,4\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Google,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Microsoft,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Bloomberg,3\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Facebook,2\nhttps://leetcode.com/problems/car-pooling/,Car Pooling,Cruise Automation,2\nhttps://leetcode.com/problems/largest-values-from-labels/,Largest Values From Labels,Google,1\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,Facebook,76\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,Amazon,9\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,Microsoft,8\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,Google,5\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,Snapchat,3\nhttps://leetcode.com/problems/shortest-path-in-binary-matrix/,Shortest Path in Binary Matrix,Adobe,2\nhttps://leetcode.com/problems/brace-expansion/,Brace Expansion,Google,4\nhttps://leetcode.com/problems/brace-expansion/,Brace Expansion,Amazon,2\nhttps://leetcode.com/problems/high-five/,High Five,Goldman Sachs,12\nhttps://leetcode.com/problems/sum-of-digits-in-the-minimum-number/,Sum of Digits in the Minimum Number,Amazon,1\nhttps://leetcode.com/problems/letter-tile-possibilities/,Letter Tile Possibilities,Microsoft,3\nhttps://leetcode.com/problems/letter-tile-possibilities/,Letter Tile Possibilities,Google,1\nhttps://leetcode.com/problems/occurrences-after-bigram/,Occurrences After Bigram,Google,1\nhttps://leetcode.com/problems/greatest-common-divisor-of-strings/,Greatest Common Divisor of Strings,Goldman Sachs,3\nhttps://leetcode.com/problems/greatest-common-divisor-of-strings/,Greatest Common Divisor of Strings,Atlassian,2\nhttps://leetcode.com/problems/campus-bikes-ii/,Campus Bikes II,Google,2\nhttps://leetcode.com/problems/campus-bikes-ii/,Campus Bikes II,Amazon,2\nhttps://leetcode.com/problems/index-pairs-of-a-string/,Index Pairs of a String,Amazon,1\nhttps://leetcode.com/problems/longest-repeating-substring/,Longest Repeating Substring,VMware,2\nhttps://leetcode.com/problems/campus-bikes/,Campus Bikes,Amazon,2\nhttps://leetcode.com/problems/confusing-number/,Confusing Number,Google,2\nhttps://leetcode.com/problems/fixed-point/,Fixed Point,Qualtrics,2\nhttps://leetcode.com/problems/height-checker/,Height Checker,Goldman Sachs,20\nhttps://leetcode.com/problems/height-checker/,Height Checker,Apple,2\nhttps://leetcode.com/problems/height-checker/,Height Checker,Salesforce,1\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/,Remove All Adjacent Duplicates In String,Facebook,40\nhttps://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/,Remove All Adjacent Duplicates In String,Amazon,4\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,Visa,11\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,Nvidia,8\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,Amazon,4\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,Salesforce,2\nhttps://leetcode.com/problems/partition-array-for-maximum-sum/,Partition Array for Maximum Sum,Amazon,4\nhttps://leetcode.com/problems/partition-array-for-maximum-sum/,Partition Array for Maximum Sum,Adobe,3\nhttps://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/,Binary Search Tree to Greater Sum Tree,Amazon,2\nhttps://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/,Binary Search Tree to Greater Sum Tree,Facebook,2\nhttps://leetcode.com/problems/valid-boomerang/,Valid Boomerang,Google,1\nhttps://leetcode.com/problems/moving-stones-until-consecutive/,Moving Stones Until Consecutive,Facebook,1\nhttps://leetcode.com/problems/matrix-cells-in-distance-order/,Matrix Cells in Distance Order,Yahoo,1\nhttps://leetcode.com/problems/two-city-scheduling/,Two City Scheduling,Bloomberg,14\nhttps://leetcode.com/problems/two-city-scheduling/,Two City Scheduling,Facebook,2\nhttps://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Maximum Difference Between Node and Ancestor,Amazon,4\nhttps://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Maximum Difference Between Node and Ancestor,Google,2\nhttps://leetcode.com/problems/maximum-difference-between-node-and-ancestor/,Maximum Difference Between Node and Ancestor,Facebook,2\nhttps://leetcode.com/problems/divisor-game/,Divisor Game,Google,2\nhttps://leetcode.com/problems/divisor-game/,Divisor Game,Bloomberg,2\nhttps://leetcode.com/problems/video-stitching/,Video Stitching,Google,2\nhttps://leetcode.com/problems/video-stitching/,Video Stitching,Amazon,2\nhttps://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Sum of Root To Leaf Binary Numbers,Amazon,2\nhttps://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Sum of Root To Leaf Binary Numbers,Apple,2\nhttps://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/,Sum of Root To Leaf Binary Numbers,Yahoo,2\nhttps://leetcode.com/problems/remove-outermost-parentheses/,Remove Outermost Parentheses,Microsoft,2\nhttps://leetcode.com/problems/number-of-enclaves/,Number of Enclaves,Google,1\nhttps://leetcode.com/problems/next-greater-node-in-linked-list/,Next Greater Node In Linked List,Amazon,5\nhttps://leetcode.com/problems/next-greater-node-in-linked-list/,Next Greater Node In Linked List,Bloomberg,2\nhttps://leetcode.com/problems/best-sightseeing-pair/,Best Sightseeing Pair,Google,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,Amazon,14\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,Citadel,8\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,Bloomberg,3\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,C3 IoT,3\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,Cisco,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,ServiceNow,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,Oracle,2\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,Pairs of Songs With Total Durations Divisible by 60,Apple,2\nhttps://leetcode.com/problems/complement-of-base-10-integer/,Complement of Base 10 Integer,Adobe,4\nhttps://leetcode.com/problems/complement-of-base-10-integer/,Complement of Base 10 Integer,Apple,2\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,Amazon,4\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,Microsoft,3\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,Facebook,2\nhttps://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/,Construct Binary Search Tree from Preorder Traversal,Bloomberg,2\nhttps://leetcode.com/problems/maximize-sum-of-array-after-k-negations/,Maximize Sum Of Array After K Negations,Amazon,2\nhttps://leetcode.com/problems/maximize-sum-of-array-after-k-negations/,Maximize Sum Of Array After K Negations,Druva,1\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,Facebook,26\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,Microsoft,3\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,Google,3\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,Amazon,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,ByteDance,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,Apple,2\nhttps://leetcode.com/problems/max-consecutive-ones-iii/,Max Consecutive Ones III,Bloomberg,2\nhttps://leetcode.com/problems/check-if-word-is-valid-after-substitutions/,Check If Word Is Valid After Substitutions,Nutanix,1\nhttps://leetcode.com/problems/find-common-characters/,Find Common Characters,Amazon,4\nhttps://leetcode.com/problems/available-captures-for-rook/,Available Captures for Rook,Square,2\nhttps://leetcode.com/problems/broken-calculator/,Broken Calculator,Arcesium,2\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,Amazon,9\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,Lyft,7\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,Microsoft,5\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,Google,4\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,Oracle,3\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store,tiktok,3\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,Google,2\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,Amazon,2\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,Apple,2\nhttps://leetcode.com/problems/find-the-town-judge/,Find the Town Judge,Adobe,2\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,Amazon,35\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,Microsoft,12\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,VMware,4\nhttps://leetcode.com/problems/rotting-oranges/,Rotting Oranges,LinkedIn,2\nhttps://leetcode.com/problems/cousins-in-binary-tree/,Cousins in Binary Tree,Amazon,3\nhttps://leetcode.com/problems/cousins-in-binary-tree/,Cousins in Binary Tree,Facebook,2\nhttps://leetcode.com/problems/cousins-in-binary-tree/,Cousins in Binary Tree,Microsoft,2\nhttps://leetcode.com/problems/add-to-array-form-of-integer/,Add to Array-Form of Integer,Facebook,2\nhttps://leetcode.com/problems/smallest-string-starting-from-leaf/,Smallest String Starting From Leaf,Apple,2\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,Facebook,82\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,Amazon,10\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,Bloomberg,7\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,Microsoft,6\nhttps://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/,Vertical Order Traversal of a Binary Tree,Uber,2\nhttps://leetcode.com/problems/sum-of-even-numbers-after-queries/,Sum of Even Numbers After Queries,Indeed,1\nhttps://leetcode.com/problems/unique-paths-iii/,Unique Paths III,Amazon,3\nhttps://leetcode.com/problems/unique-paths-iii/,Unique Paths III,Facebook,2\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,Microsoft,4\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,Amazon,2\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,Apple,2\nhttps://leetcode.com/problems/distribute-coins-in-binary-tree/,Distribute Coins in Binary Tree,PhonePe,2\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,Facebook,29\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,Amazon,13\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,Google,5\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,Microsoft,5\nhttps://leetcode.com/problems/squares-of-a-sorted-array/,Squares of a Sorted Array,Paypal,2\nhttps://leetcode.com/problems/largest-perimeter-triangle/,Largest Perimeter Triangle,Tesla,3\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,Twilio,3\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,Amazon,3\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,Facebook,3\nhttps://leetcode.com/problems/subarray-sums-divisible-by-k/,Subarray Sums Divisible by K,Snapchat,3\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,Facebook,127\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,Amazon,49\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,Microsoft,6\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,Asana,5\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,Google,3\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,LinkedIn,2\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin,Sumologic,2\nhttps://leetcode.com/problems/powerful-integers/,Powerful Integers,Amazon,2\nhttps://leetcode.com/problems/vowel-spellchecker/,Vowel Spellchecker,Thumbtack,1\nhttps://leetcode.com/problems/univalued-binary-tree/,Univalued Binary Tree,Google,3\nhttps://leetcode.com/problems/n-repeated-element-in-size-2n-array/,N-Repeated Element in Size 2N Array,Akamai,1\nhttps://leetcode.com/problems/check-completeness-of-a-binary-tree/,Check Completeness of a Binary Tree,Facebook,11\nhttps://leetcode.com/problems/prison-cells-after-n-days/,Prison Cells After N Days,SAP,2\nhttps://leetcode.com/problems/array-of-doubled-pairs/,Array of Doubled Pairs,Google,3\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,Facebook,21\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,Uber,3\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,Amazon,2\nhttps://leetcode.com/problems/verifying-an-alien-dictionary/,Verifying an Alien Dictionary,LinkedIn,2\nhttps://leetcode.com/problems/flip-equivalent-binary-trees/,Flip Equivalent Binary Trees,Google,2\nhttps://leetcode.com/problems/reveal-cards-in-increasing-order/,Reveal Cards In Increasing Order,Adobe,2\nhttps://leetcode.com/problems/validate-stack-sequences/,Validate Stack Sequences,Amazon,4\nhttps://leetcode.com/problems/validate-stack-sequences/,Validate Stack Sequences,Microsoft,2\nhttps://leetcode.com/problems/validate-stack-sequences/,Validate Stack Sequences,tiktok,2\nhttps://leetcode.com/problems/delete-columns-to-make-sorted/,Delete Columns to Make Sorted,Google,1\nhttps://leetcode.com/problems/di-string-match/,DI String Match,Microsoft,2\nhttps://leetcode.com/problems/valid-mountain-array/,Valid Mountain Array,Amazon,2\nhttps://leetcode.com/problems/range-sum-of-bst/,Range Sum of BST,Facebook,149\nhttps://leetcode.com/problems/range-sum-of-bst/,Range Sum of BST,Amazon,4\nhttps://leetcode.com/problems/range-sum-of-bst/,Range Sum of BST,Apple,3\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,Bloomberg,10\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,Facebook,6\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,Amazon,3\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,Twilio,2\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,Microsoft,2\nhttps://leetcode.com/problems/knight-dialer/,Knight Dialer,Snapchat,2\nhttps://leetcode.com/problems/number-of-recent-calls/,Number of Recent Calls,Yandex,3\nhttps://leetcode.com/problems/number-of-recent-calls/,Number of Recent Calls,Bloomberg,1\nhttps://leetcode.com/problems/minimum-falling-path-sum/,Minimum Falling Path Sum,Google,2\nhttps://leetcode.com/problems/unique-email-addresses/,Unique Email Addresses,Intuit,6\nhttps://leetcode.com/problems/long-pressed-name/,Long Pressed Name,Google,2\nhttps://leetcode.com/problems/3sum-with-multiplicity/,3Sum With Multiplicity,Amazon,2\nhttps://leetcode.com/problems/3sum-with-multiplicity/,3Sum With Multiplicity,Adobe,2\nhttps://leetcode.com/problems/sort-array-by-parity-ii/,Sort Array By Parity II,Microsoft,2\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,Facebook,100\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,Microsoft,3\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,Amazon,3\nhttps://leetcode.com/problems/minimum-add-to-make-parentheses-valid/,Minimum Add to Make Parentheses Valid,Twitter,2\nhttps://leetcode.com/problems/maximum-sum-circular-subarray/,Maximum Sum Circular Subarray,Amazon,6\nhttps://leetcode.com/problems/maximum-sum-circular-subarray/,Maximum Sum Circular Subarray,Google,3\nhttps://leetcode.com/problems/reverse-only-letters/,Reverse Only Letters,Amazon,2\nhttps://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/,X of a Kind in a Deck of Cards,Google,2\nhttps://leetcode.com/problems/sort-an-array/,Sort an Array,Amazon,3\nhttps://leetcode.com/problems/sort-an-array/,Sort an Array,Bloomberg,2\nhttps://leetcode.com/problems/smallest-range-i/,Smallest Range I,Adobe,1\nhttps://leetcode.com/problems/online-stock-span/,Online Stock Span,Amazon,6\nhttps://leetcode.com/problems/online-stock-span/,Online Stock Span,Bloomberg,2\nhttps://leetcode.com/problems/online-stock-span/,Online Stock Span,Adobe,2\nhttps://leetcode.com/problems/fruit-into-baskets/,Fruit Into Baskets,Amazon,4\nhttps://leetcode.com/problems/rle-iterator/,RLE Iterator,Google,3\nhttps://leetcode.com/problems/increasing-order-search-tree/,Increasing Order Search Tree,Facebook,2\nhttps://leetcode.com/problems/monotonic-array/,Monotonic Array,Facebook,12\nhttps://leetcode.com/problems/monotonic-array/,Monotonic Array,Amazon,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,Amazon,5\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,Apple,4\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,Microsoft,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,LinkedIn,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,Facebook,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,Adobe,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,Twitter,2\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,MindTickle,2\nhttps://leetcode.com/problems/groups-of-special-equivalent-strings/,Groups of Special-Equivalent Strings,Facebook,1\nhttps://leetcode.com/problems/surface-area-of-3d-shapes/,Surface Area of 3D Shapes,Amazon,2\nhttps://leetcode.com/problems/find-and-replace-pattern/,Find and Replace Pattern,Apple,2\nhttps://leetcode.com/problems/fair-candy-swap/,Fair Candy Swap,Amazon,2\nhttps://leetcode.com/problems/fair-candy-swap/,Fair Candy Swap,Uber,2\nhttps://leetcode.com/problems/spiral-matrix-iii/,Spiral Matrix III,Tesla,2\nhttps://leetcode.com/problems/uncommon-words-from-two-sentences/,Uncommon Words from Two Sentences,Facebook,3\nhttps://leetcode.com/problems/uncommon-words-from-two-sentences/,Uncommon Words from Two Sentences,Google,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Salesforce,5\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Amazon,4\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Intuit,3\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Microsoft,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Uber,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Apple,2\nhttps://leetcode.com/problems/boats-to-save-people/,Boats to Save People,Bloomberg,2\nhttps://leetcode.com/problems/decoded-string-at-index/,Decoded String at Index,Amazon,2\nhttps://leetcode.com/problems/stone-game/,Stone Game,Amazon,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Amazon,5\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Adobe,4\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Facebook,3\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Google,3\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Microsoft,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Apple,2\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,Qualcomm,2\nhttps://leetcode.com/problems/leaf-similar-trees/,Leaf-Similar Trees,Google,2\nhttps://leetcode.com/problems/advantage-shuffle/,Advantage Shuffle,Facebook,2\nhttps://leetcode.com/problems/binary-gap/,Binary Gap,Twitter,eBay\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,Apple,3\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,Amazon,2\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,Microsoft,2\nhttps://leetcode.com/problems/transpose-matrix/,Transpose Matrix,Citadel,2\nhttps://leetcode.com/problems/score-after-flipping-matrix/,Score After Flipping Matrix,Amazon,2\nhttps://leetcode.com/problems/score-after-flipping-matrix/,Score After Flipping Matrix,IIT Bombay,1\nhttps://leetcode.com/problems/lemonade-change/,Lemonade Change,Atlassian,4\nhttps://leetcode.com/problems/lemonade-change/,Lemonade Change,Amazon,3\nhttps://leetcode.com/problems/lemonade-change/,Lemonade Change,Apple,2\nhttps://leetcode.com/problems/buddy-strings/,Buddy Strings,DoorDash,13\nhttps://leetcode.com/problems/buddy-strings/,Buddy Strings,Facebook,2\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,Amazon,4\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,Facebook,4\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,Bloomberg,3\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,Infosys,2\nhttps://leetcode.com/problems/score-of-parentheses/,Score of Parentheses,tiktok,2\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,Amazon,10\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,Bloomberg,3\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,Apple,3\nhttps://leetcode.com/problems/peak-index-in-a-mountain-array/,Peak Index in a Mountain Array,Google,2\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,Yandex,8\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,Microsoft,5\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,Google,3\nhttps://leetcode.com/problems/maximize-distance-to-closest-person/,Maximize Distance to Closest Person,Amazon,3\nhttps://leetcode.com/problems/shifting-letters/,Shifting Letters,Oracle,2\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,IBM,6\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,Google,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,Booking.com,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,Apple,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,Visa,3\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,Bloomberg,2\nhttps://leetcode.com/problems/backspace-string-compare/,Backspace String Compare,tiktok,2\nhttps://leetcode.com/problems/keys-and-rooms/,Keys and Rooms,Amazon,6\nhttps://leetcode.com/problems/keys-and-rooms/,Keys and Rooms,Hotstar,2\nhttps://leetcode.com/problems/magic-squares-in-grid/,Magic Squares In Grid,Google,3\nhttps://leetcode.com/problems/push-dominoes/,Push Dominoes,Bloomberg,2\nhttps://leetcode.com/problems/rectangle-overlap/,Rectangle Overlap,ServiceNow,2\nhttps://leetcode.com/problems/rectangle-overlap/,Rectangle Overlap,Facebook,2\nhttps://leetcode.com/problems/rectangle-overlap/,Rectangle Overlap,Docusign,2\nhttps://leetcode.com/problems/flipping-an-image/,Flipping an Image,Google,3\nhttps://leetcode.com/problems/positions-of-large-groups/,Positions of Large Groups,Google,3\nhttps://leetcode.com/problems/goat-latin/,Goat Latin,Facebook,5\nhttps://leetcode.com/problems/binary-trees-with-factors/,Binary Trees With Factors,Amazon,2\nhttps://leetcode.com/problems/shortest-distance-to-a-character/,Shortest Distance to a Character,Bloomberg,2\nhttps://leetcode.com/problems/shortest-distance-to-a-character/,Shortest Distance to a Character,Apple,2\nhttps://leetcode.com/problems/short-encoding-of-words/,Short Encoding of Words,Amazon,2\nhttps://leetcode.com/problems/short-encoding-of-words/,Short Encoding of Words,HBO,2\nhttps://leetcode.com/problems/most-common-word/,Most Common Word,Amazon,2\nhttps://leetcode.com/problems/ambiguous-coordinates/,Ambiguous Coordinates,Google,1\nhttps://leetcode.com/problems/binary-tree-pruning/,Binary Tree Pruning,Facebook,4\nhttps://leetcode.com/problems/binary-tree-pruning/,Binary Tree Pruning,Apple,2\nhttps://leetcode.com/problems/largest-triangle-area/,Largest Triangle Area,Google,1\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,Karat,40\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,Indeed,25\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,Wayfair,9\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,Intuit,2\nhttps://leetcode.com/problems/subdomain-visit-count/,Subdomain Visit Count,Walmart Global Tech,2\nhttps://leetcode.com/problems/expressive-words/,Expressive Words,Cisco,11\nhttps://leetcode.com/problems/expressive-words/,Expressive Words,Google,3\nhttps://leetcode.com/problems/expressive-words/,Expressive Words,Facebook,2\nhttps://leetcode.com/problems/max-increase-to-keep-city-skyline/,Max Increase to Keep City Skyline,Google,3\nhttps://leetcode.com/problems/max-increase-to-keep-city-skyline/,Max Increase to Keep City Skyline,Amazon,2\nhttps://leetcode.com/problems/unique-morse-code-words/,Unique Morse Code Words,Square,2\nhttps://leetcode.com/problems/similar-rgb-color/,Similar RGB Color,Google,1\nhttps://leetcode.com/problems/champagne-tower/,Champagne Tower,Uber,2\nhttps://leetcode.com/problems/champagne-tower/,Champagne Tower,Amazon,2\nhttps://leetcode.com/problems/champagne-tower/,Champagne Tower,Adobe,2\nhttps://leetcode.com/problems/rotate-string/,Rotate String,Zoom,4\nhttps://leetcode.com/problems/rotate-string/,Rotate String,Goldman Sachs,3\nhttps://leetcode.com/problems/rotate-string/,Rotate String,Apple,2\nhttps://leetcode.com/problems/rotate-string/,Rotate String,LinkedIn,2\nhttps://leetcode.com/problems/rotate-string/,Rotate String,Microsoft,2\nhttps://leetcode.com/problems/number-of-matching-subsequences/,Number of Matching Subsequences,Google,15\nhttps://leetcode.com/problems/number-of-matching-subsequences/,Number of Matching Subsequences,Roblox,2\nhttps://leetcode.com/problems/custom-sort-string/,Custom Sort String,Facebook,67\nhttps://leetcode.com/problems/custom-sort-string/,Custom Sort String,tiktok,2\nhttps://leetcode.com/problems/escape-the-ghosts/,Escape The Ghosts,Google,1\nhttps://leetcode.com/problems/rotated-digits/,Rotated Digits,Facebook,4\nhttps://leetcode.com/problems/rotated-digits/,Rotated Digits,Google,2\nhttps://leetcode.com/problems/letter-case-permutation/,Letter Case Permutation,Microsoft,2\nhttps://leetcode.com/problems/minimum-distance-between-bst-nodes/,Minimum Distance Between BST Nodes,Bloomberg,2\nhttps://leetcode.com/problems/minimum-distance-between-bst-nodes/,Minimum Distance Between BST Nodes,Microsoft,2\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,Adobe,2\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,Swiggy,2\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,Amazon,2\nhttps://leetcode.com/problems/k-th-symbol-in-grammar/,K-th Symbol in Grammar,Adobe,2\nhttps://leetcode.com/problems/split-bst/,Split BST,Google,3\nhttps://leetcode.com/problems/global-and-local-inversions/,Global and Local Inversions,Google,2\nhttps://leetcode.com/problems/jewels-and-stones/,Jewels and Stones,Amazon,3\nhttps://leetcode.com/problems/jewels-and-stones/,Jewels and Stones,Adobe,2\nhttps://leetcode.com/problems/jewels-and-stones/,Jewels and Stones,Google,2\nhttps://leetcode.com/problems/max-chunks-to-make-sorted/,Max Chunks To Make Sorted,Wayfair,2\nhttps://leetcode.com/problems/max-chunks-to-make-sorted/,Max Chunks To Make Sorted,Amazon,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,Amazon,17\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,Facebook,9\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,Google,4\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,eBay,3\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,Uber,2\nhttps://leetcode.com/problems/reorganize-string/,Reorganize String,Oracle,2\nhttps://leetcode.com/problems/toeplitz-matrix/,Toeplitz Matrix,Facebook,30\nhttps://leetcode.com/problems/toeplitz-matrix/,Toeplitz Matrix,Bloomberg,3\nhttps://leetcode.com/problems/couples-holding-hands/,Couples Holding Hands,Bloomberg,2\nhttps://leetcode.com/problems/largest-plus-sign/,Largest Plus Sign,Uber,3\nhttps://leetcode.com/problems/partition-labels/,Partition Labels,Amazon,4\nhttps://leetcode.com/problems/partition-labels/,Partition Labels,Google,2\nhttps://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/,Prime Number of Set Bits in Binary Representation,Amazon,1\nhttps://leetcode.com/problems/find-anagram-mappings/,Find Anagram Mappings,Google,1\nhttps://leetcode.com/problems/bold-words-in-string/,Bold Words in String,Google,2\nhttps://leetcode.com/problems/set-intersection-size-at-least-two/,Set Intersection Size At Least Two,Uber,7\nhttps://leetcode.com/problems/set-intersection-size-at-least-two/,Set Intersection Size At Least Two,Drawbridge,1\nhttps://leetcode.com/problems/pyramid-transition-matrix/,Pyramid Transition Matrix,Google,2\nhttps://leetcode.com/problems/pyramid-transition-matrix/,Pyramid Transition Matrix,Amazon,2\nhttps://leetcode.com/problems/pyramid-transition-matrix/,Pyramid Transition Matrix,Airbnb,1\nhttps://leetcode.com/problems/pour-water/,Pour Water,Airbnb,6\nhttps://leetcode.com/problems/reach-a-number/,Reach a Number,Amazon,5\nhttps://leetcode.com/problems/number-of-corner-rectangles/,Number Of Corner Rectangles,Facebook,1\nhttps://leetcode.com/problems/shortest-completing-word/,Shortest Completing Word,Google,2\nhttps://leetcode.com/problems/min-cost-climbing-stairs/,Min Cost Climbing Stairs,Amazon,5\nhttps://leetcode.com/problems/min-cost-climbing-stairs/,Min Cost Climbing Stairs,Adobe,4\nhttps://leetcode.com/problems/min-cost-climbing-stairs/,Min Cost Climbing Stairs,Bloomberg,2\nhttps://leetcode.com/problems/find-smallest-letter-greater-than-target/,Find Smallest Letter Greater Than Target,LinkedIn,4\nhttps://leetcode.com/problems/find-smallest-letter-greater-than-target/,Find Smallest Letter Greater Than Target,Amazon,2\nhttps://leetcode.com/problems/find-smallest-letter-greater-than-target/,Find Smallest Letter Greater Than Target,Bloomberg,2\nhttps://leetcode.com/problems/network-delay-time/,Network Delay Time,Google,8\nhttps://leetcode.com/problems/network-delay-time/,Network Delay Time,Amazon,3\nhttps://leetcode.com/problems/closest-leaf-in-a-binary-tree/,Closest Leaf in a Binary Tree,Facebook,3\nhttps://leetcode.com/problems/delete-and-earn/,Delete and Earn,Goldman Sachs,11\nhttps://leetcode.com/problems/delete-and-earn/,Delete and Earn,Amazon,5\nhttps://leetcode.com/problems/delete-and-earn/,Delete and Earn,Google,2\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,Facebook,17\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,Amazon,10\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,Microsoft,5\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,C3 IoT,3\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,Uber,2\nhttps://leetcode.com/problems/daily-temperatures/,Daily Temperatures,Salesforce,2\nhttps://leetcode.com/problems/monotone-increasing-digits/,Monotone Increasing Digits,SAP,9\nhttps://leetcode.com/problems/monotone-increasing-digits/,Monotone Increasing Digits,Microsoft,2\nhttps://leetcode.com/problems/monotone-increasing-digits/,Monotone Increasing Digits,Amazon,1\nhttps://leetcode.com/problems/sentence-similarity-ii/,Sentence Similarity II,Amazon,2\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Amazon,14\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Facebook,10\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,DoorDash,7\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,tiktok,5\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Lyft,4\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Microsoft,4\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Oracle,3\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Hotstar,3\nhttps://leetcode.com/problems/asteroid-collision/,Asteroid Collision,Goldman Sachs,3\nhttps://leetcode.com/problems/sentence-similarity/,Sentence Similarity,Facebook,2\nhttps://leetcode.com/problems/sentence-similarity/,Sentence Similarity,Google,1\nhttps://leetcode.com/problems/my-calendar-i/,My Calendar I,Amazon,4\nhttps://leetcode.com/problems/my-calendar-i/,My Calendar I,Uber,4\nhttps://leetcode.com/problems/my-calendar-i/,My Calendar I,Google,3\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,Adobe,2\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,Bloomberg,2\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,Amazon,2\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,Epic Systems,1\nhttps://leetcode.com/problems/minimum-window-subsequence/,Minimum Window Subsequence,Google,2\nhttps://leetcode.com/problems/split-linked-list-in-parts/,Split Linked List in Parts,Amazon,2\nhttps://leetcode.com/problems/split-linked-list-in-parts/,Split Linked List in Parts,Oracle,2\nhttps://leetcode.com/problems/split-linked-list-in-parts/,Split Linked List in Parts,Apple,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Facebook,14\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Goldman Sachs,9\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Apple,3\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Amazon,3\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Google,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Microsoft,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Cisco,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Expedia,2\nhttps://leetcode.com/problems/find-pivot-index/,Find Pivot Index,Adobe,2\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,Bloomberg,7\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,Capital One,3\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,Facebook,2\nhttps://leetcode.com/problems/candy-crush/,Candy Crush,eBay,2\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,Facebook,34\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,Apple,4\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,Google,3\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,Twitter,3\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,Amazon,2\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,LinkedIn,2\nhttps://leetcode.com/problems/accounts-merge/,Accounts Merge,Pinterest,2\nhttps://leetcode.com/problems/longest-word-in-dictionary/,Longest Word in Dictionary,Google,6\nhttps://leetcode.com/problems/find-k-th-smallest-pair-distance/,Find K-th Smallest Pair Distance,Facebook,3\nhttps://leetcode.com/problems/maximum-length-of-repeated-subarray/,Maximum Length of Repeated Subarray,Karat,16\nhttps://leetcode.com/problems/maximum-length-of-repeated-subarray/,Maximum Length of Repeated Subarray,Indeed,8\nhttps://leetcode.com/problems/maximum-length-of-repeated-subarray/,Maximum Length of Repeated Subarray,Wayfair,7\nhttps://leetcode.com/problems/1-bit-and-2-bit-characters/,1-bit and 2-bit Characters,Apple,2\nhttps://leetcode.com/problems/max-stack/,Max Stack,LinkedIn,33\nhttps://leetcode.com/problems/max-stack/,Max Stack,Microsoft,3\nhttps://leetcode.com/problems/max-stack/,Max Stack,Facebook,3\nhttps://leetcode.com/problems/max-stack/,Max Stack,Amazon,3\nhttps://leetcode.com/problems/max-stack/,Max Stack,VMware,3\nhttps://leetcode.com/problems/max-stack/,Max Stack,Yandex,3\nhttps://leetcode.com/problems/max-stack/,Max Stack,Lyft,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/,Best Time to Buy and Sell Stock with Transaction Fee,Amazon,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/,Best Time to Buy and Sell Stock with Transaction Fee,Facebook,2\nhttps://leetcode.com/problems/subarray-product-less-than-k/,Subarray Product Less Than K,Facebook,3\nhttps://leetcode.com/problems/subarray-product-less-than-k/,Subarray Product Less Than K,Amazon,3\nhttps://leetcode.com/problems/subarray-product-less-than-k/,Subarray Product Less Than K,Goldman Sachs,2\nhttps://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Minimum ASCII Delete Sum for Two Strings,TripleByte,4\nhttps://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Minimum ASCII Delete Sum for Two Strings,Activision,2\nhttps://leetcode.com/problems/to-lower-case/,To Lower Case,Amazon,2\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Amazon,10\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Microsoft,6\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,LinkedIn,5\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Oracle,4\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Salesforce,3\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Apple,3\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Goldman Sachs,3\nhttps://leetcode.com/problems/design-hashmap/,Design HashMap,Walmart Global Tech,3\nhttps://leetcode.com/problems/design-hashset/,Design HashSet,Amazon,3\nhttps://leetcode.com/problems/design-hashset/,Design HashSet,Microsoft,2\nhttps://leetcode.com/problems/binary-search/,Binary Search,Amazon,13\nhttps://leetcode.com/problems/binary-search/,Binary Search,Apple,5\nhttps://leetcode.com/problems/binary-search/,Binary Search,Google,4\nhttps://leetcode.com/problems/binary-search/,Binary Search,Microsoft,4\nhttps://leetcode.com/problems/binary-search/,Binary Search,Bloomberg,3\nhttps://leetcode.com/problems/binary-search/,Binary Search,Adobe,3\nhttps://leetcode.com/problems/binary-search/,Binary Search,Facebook,2\nhttps://leetcode.com/problems/binary-search/,Binary Search,Uber,2\nhttps://leetcode.com/problems/binary-search/,Binary Search,Yahoo,2\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,Amazon,4\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,Google,4\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,Adobe,4\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,Facebook,3\nhttps://leetcode.com/problems/kth-largest-element-in-a-stream/,Kth Largest Element in a Stream,LinkedIn,2\nhttps://leetcode.com/problems/insert-into-a-binary-search-tree/,Insert into a Binary Search Tree,LinkedIn,3\nhttps://leetcode.com/problems/insert-into-a-binary-search-tree/,Insert into a Binary Search Tree,Amazon,2\nhttps://leetcode.com/problems/insert-into-a-binary-search-tree/,Insert into a Binary Search Tree,Goldman Sachs,2\nhttps://leetcode.com/problems/search-in-a-binary-search-tree/,Search in a Binary Search Tree,Amazon,2\nhttps://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Partition to K Equal Sum Subsets,LinkedIn,10\nhttps://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Partition to K Equal Sum Subsets,Google,2\nhttps://leetcode.com/problems/partition-to-k-equal-sum-subsets/,Partition to K Equal Sum Subsets,Amazon,2\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,Expedia,5\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,Athenahealth,4\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,Walmart Global Tech,3\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,Mathworks,3\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,IBM,3\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,Adobe,2\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,Nvidia,2\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Amazon,19\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Facebook,18\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Microsoft,10\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Google,9\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Qualtrics,4\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,LinkedIn,3\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Apple,3\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Dropbox,2\nhttps://leetcode.com/problems/max-area-of-island/,Max Area of Island,Oracle,2\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,Amazon,8\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,Microsoft,4\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,Bloomberg,2\nhttps://leetcode.com/problems/number-of-distinct-islands/,Number of Distinct Islands,DoorDash,2\nhttps://leetcode.com/problems/binary-number-with-alternating-bits/,Binary Number with Alternating Bits,Yahoo,1\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Uber,17\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Amazon,12\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Microsoft,8\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Google,7\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Bloomberg,4\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Facebook,4\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Yahoo,4\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Apple,3\nhttps://leetcode.com/problems/top-k-frequent-words/,Top K Frequent Words,Two Sigma,2\nhttps://leetcode.com/problems/stickers-to-spell-word/,Stickers to Spell Word,Facebook,3\nhttps://leetcode.com/problems/employee-importance/,Employee Importance,Google,6\nhttps://leetcode.com/problems/employee-importance/,Employee Importance,Apple,2\nhttps://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/,Maximum Sum of 3 Non-Overlapping Subarrays,Facebook,3\nhttps://leetcode.com/problems/knight-probability-in-chessboard/,Knight Probability in Chessboard,Amazon,3\nhttps://leetcode.com/problems/longest-univalue-path/,Longest Univalue Path,Amazon,2\nhttps://leetcode.com/problems/longest-univalue-path/,Longest Univalue Path,Microsoft,2\nhttps://leetcode.com/problems/repeated-string-match/,Repeated String Match,Google,2\nhttps://leetcode.com/problems/redundant-connection-ii/,Redundant Connection II,Amazon,2\nhttps://leetcode.com/problems/redundant-connection/,Redundant Connection,Google,2\nhttps://leetcode.com/problems/redundant-connection/,Redundant Connection,Microsoft,2\nhttps://leetcode.com/problems/k-empty-slots/,K Empty Slots,Nvidia,2\nhttps://leetcode.com/problems/k-empty-slots/,K Empty Slots,Google,1\nhttps://leetcode.com/problems/baseball-game/,Baseball Game,Uber,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Facebook,252\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Amazon,5\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Microsoft,3\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Apple,3\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Bloomberg,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Oracle,2\nhttps://leetcode.com/problems/valid-palindrome-ii/,Valid Palindrome II,Walmart Global Tech,2\nhttps://leetcode.com/problems/24-game/,24 Game,HRT,3\nhttps://leetcode.com/problems/24-game/,24 Game,Google,2\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,LinkedIn,10\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,Amazon,5\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,Facebook,4\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,Google,3\nhttps://leetcode.com/problems/valid-parenthesis-string/,Valid Parenthesis String,Yahoo,3\nhttps://leetcode.com/problems/map-sum-pairs/,Map Sum Pairs,Google,2\nhttps://leetcode.com/problems/implement-magic-dictionary/,Implement Magic Dictionary,Facebook,3\nhttps://leetcode.com/problems/implement-magic-dictionary/,Implement Magic Dictionary,Google,2\nhttps://leetcode.com/problems/cut-off-trees-for-golf-event/,Cut Off Trees for Golf Event,Amazon,3\nhttps://leetcode.com/problems/cut-off-trees-for-golf-event/,Cut Off Trees for Golf Event,Apple,2\nhttps://leetcode.com/problems/longest-continuous-increasing-subsequence/,Longest Continuous Increasing Subsequence,Facebook,4\nhttps://leetcode.com/problems/number-of-longest-increasing-subsequence/,Number of Longest Increasing Subsequence,Amazon,2\nhttps://leetcode.com/problems/number-of-longest-increasing-subsequence/,Number of Longest Increasing Subsequence,Google,2\nhttps://leetcode.com/problems/bulb-switcher-ii/,Bulb Switcher II,Microsoft,1\nhttps://leetcode.com/problems/second-minimum-node-in-a-binary-tree/,Second Minimum Node In a Binary Tree,LinkedIn,11\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,Facebook,36\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,tiktok,8\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,Amazon,4\nhttps://leetcode.com/problems/maximum-swap/,Maximum Swap,ByteDance,2\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,Amazon,3\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,Facebook,3\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,Microsoft,2\nhttps://leetcode.com/problems/trim-a-binary-search-tree/,Trim a Binary Search Tree,Yahoo,2\nhttps://leetcode.com/problems/kth-smallest-number-in-multiplication-table/,Kth Smallest Number in Multiplication Table,Rubrik,4\nhttps://leetcode.com/problems/beautiful-arrangement-ii/,Beautiful Arrangement II,Google,1\nhttps://leetcode.com/problems/path-sum-iv/,Path Sum IV,Facebook,2\nhttps://leetcode.com/problems/path-sum-iv/,Path Sum IV,Alibaba,1\nhttps://leetcode.com/problems/non-decreasing-array/,Non-decreasing Array,Bloomberg,3\nhttps://leetcode.com/problems/strange-printer/,Strange Printer,Walmart Global Tech,4\nhttps://leetcode.com/problems/strange-printer/,Strange Printer,Google,3\nhttps://leetcode.com/problems/equal-tree-partition/,Equal Tree Partition,Amazon,2\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,Amazon,6\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,Google,4\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,Microsoft,3\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,Facebook,3\nhttps://leetcode.com/problems/maximum-width-of-binary-tree/,Maximum Width of Binary Tree,Bloomberg,2\nhttps://leetcode.com/problems/image-smoother/,Image Smoother,Microsoft,2\nhttps://leetcode.com/problems/remove-9/,Remove 9,Google,2\nhttps://leetcode.com/problems/split-array-into-consecutive-subsequences/,Split Array into Consecutive Subsequences,Google,2\nhttps://leetcode.com/problems/split-array-into-consecutive-subsequences/,Split Array into Consecutive Subsequences,Bloomberg,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,Facebook,21\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,Google,4\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,tiktok,4\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,Amazon,3\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,Uber,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,Bloomberg,2\nhttps://leetcode.com/problems/find-k-closest-elements/,Find K Closest Elements,Oracle,2\nhttps://leetcode.com/problems/coin-path/,Coin Path,Google,1\nhttps://leetcode.com/problems/print-binary-tree/,Print Binary Tree,LinkedIn,3\nhttps://leetcode.com/problems/print-binary-tree/,Print Binary Tree,Amazon,2\nhttps://leetcode.com/problems/maximum-binary-tree/,Maximum Binary Tree,Amazon,2\nhttps://leetcode.com/problems/two-sum-iv-input-is-a-bst/,Two Sum IV - Input is a BST,Amazon,2\nhttps://leetcode.com/problems/two-sum-iv-input-is-a-bst/,Two Sum IV - Input is a BST,Uber,2\nhttps://leetcode.com/problems/find-duplicate-subtrees/,Find Duplicate Subtrees,Google,13\nhttps://leetcode.com/problems/find-duplicate-subtrees/,Find Duplicate Subtrees,Amazon,7\nhttps://leetcode.com/problems/find-duplicate-subtrees/,Find Duplicate Subtrees,Bloomberg,2\nhttps://leetcode.com/problems/4-keys-keyboard/,4 Keys Keyboard,Microsoft,2\nhttps://leetcode.com/problems/2-keys-keyboard/,2 Keys Keyboard,Amazon,4\nhttps://leetcode.com/problems/2-keys-keyboard/,2 Keys Keyboard,Microsoft,3\nhttps://leetcode.com/problems/dota2-senate/,Dota2 Senate,Valve,1\nhttps://leetcode.com/problems/replace-words/,Replace Words,Facebook,2\nhttps://leetcode.com/problems/palindromic-substrings/,Palindromic Substrings,Facebook,24\nhttps://leetcode.com/problems/palindromic-substrings/,Palindromic Substrings,Twitter,2\nhttps://leetcode.com/problems/palindromic-substrings/,Palindromic Substrings,Expedia,2\nhttps://leetcode.com/problems/maximum-length-of-pair-chain/,Maximum Length of Pair Chain,Amazon,2\nhttps://leetcode.com/problems/maximum-length-of-pair-chain/,Maximum Length of Pair Chain,Flipkart,2\nhttps://leetcode.com/problems/set-mismatch/,Set Mismatch,Adobe,3\nhttps://leetcode.com/problems/maximum-average-subarray-ii/,Maximum Average Subarray II,Google,1\nhttps://leetcode.com/problems/maximum-average-subarray-i/,Maximum Average Subarray I,Facebook,7\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,Google,9\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,Amazon,9\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,Microsoft,4\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,LinkedIn,2\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,Twitter,2\nhttps://leetcode.com/problems/design-search-autocomplete-system/,Design Search Autocomplete System,Snapchat,2\nhttps://leetcode.com/problems/solve-the-equation/,Solve the Equation,Amazon,4\nhttps://leetcode.com/problems/solve-the-equation/,Solve the Equation,Google,3\nhttps://leetcode.com/problems/decode-ways-ii/,Decode Ways II,Microsoft,2\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,Google,3\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,Apple,2\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,Facebook,2\nhttps://leetcode.com/problems/shopping-offers/,Shopping Offers,Amazon,2\nhttps://leetcode.com/problems/average-of-levels-in-binary-tree/,Average of Levels in Binary Tree,Facebook,5\nhttps://leetcode.com/problems/average-of-levels-in-binary-tree/,Average of Levels in Binary Tree,Amazon,4\nhttps://leetcode.com/problems/average-of-levels-in-binary-tree/,Average of Levels in Binary Tree,Microsoft,2\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,Facebook,33\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,LinkedIn,8\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,Microsoft,3\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,Google,3\nhttps://leetcode.com/problems/exclusive-time-of-functions/,Exclusive Time of Functions,DoorDash,2\nhttps://leetcode.com/problems/design-log-storage-system/,Design Log Storage System,Twitter,5\nhttps://leetcode.com/problems/find-the-derangement-of-an-array/,Find the Derangement of An Array,Amazon,2\nhttps://leetcode.com/problems/find-the-derangement-of-an-array/,Find the Derangement of An Array,IXL,1\nhttps://leetcode.com/problems/sum-of-square-numbers/,Sum of Square Numbers,Amazon,2\nhttps://leetcode.com/problems/sum-of-square-numbers/,Sum of Square Numbers,Bloomberg,2\nhttps://leetcode.com/problems/design-excel-sum-formula/,Design Excel Sum Formula,Google,3\nhttps://leetcode.com/problems/design-excel-sum-formula/,Design Excel Sum Formula,Opendoor,3\nhttps://leetcode.com/problems/course-schedule-iii/,Course Schedule III,Bloomberg,2\nhttps://leetcode.com/problems/k-inverse-pairs-array/,K Inverse Pairs Array,ByteDance,2\nhttps://leetcode.com/problems/k-inverse-pairs-array/,K Inverse Pairs Array,Works Applications,1\nhttps://leetcode.com/problems/maximum-product-of-three-numbers/,Maximum Product of Three Numbers,Salesforce,7\nhttps://leetcode.com/problems/minimum-factorization/,Minimum Factorization,Tencent,1\nhttps://leetcode.com/problems/maximum-distance-in-arrays/,Maximum Distance in Arrays,Yahoo,1\nhttps://leetcode.com/problems/add-one-row-to-tree/,Add One Row to Tree,Gilt Groupe,1\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,Facebook,4\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,Amazon,4\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,Microsoft,4\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,Airbnb,3\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,Nvidia,3\nhttps://leetcode.com/problems/design-circular-queue/,Design Circular Queue,Apple,3\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,Facebook,3\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,Amazon,3\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,Uber,2\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,Rubrik,2\nhttps://leetcode.com/problems/task-scheduler/,Task Scheduler,Microsoft,2\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,Facebook,6\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,Amazon,3\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,Yahoo,3\nhttps://leetcode.com/problems/merge-two-binary-trees/,Merge Two Binary Trees,Uber,2\nhttps://leetcode.com/problems/add-bold-tag-in-string/,Add Bold Tag in String,Facebook,13\nhttps://leetcode.com/problems/valid-triangle-number/,Valid Triangle Number,LinkedIn,2\nhttps://leetcode.com/problems/valid-triangle-number/,Valid Triangle Number,Amazon,2\nhttps://leetcode.com/problems/valid-triangle-number/,Valid Triangle Number,Bloomberg,2\nhttps://leetcode.com/problems/find-duplicate-file-in-system/,Find Duplicate File in System,Dropbox,6\nhttps://leetcode.com/problems/find-duplicate-file-in-system/,Find Duplicate File in System,Apple,2\nhttps://leetcode.com/problems/construct-string-from-binary-tree/,Construct String from Binary Tree,Facebook,2\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,LinkedIn,21\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,Facebook,13\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,Amazon,3\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,Bloomberg,3\nhttps://leetcode.com/problems/can-place-flowers/,Can Place Flowers,Yahoo,2\nhttps://leetcode.com/problems/design-compressed-string-iterator/,Design Compressed String Iterator,Google,2\nhttps://leetcode.com/problems/non-negative-integers-without-consecutive-ones/,Non-negative Integers without Consecutive Ones,Pocket Gems,1\nhttps://leetcode.com/problems/minimum-index-sum-of-two-lists/,Minimum Index Sum of Two Lists,Oracle,2\nhttps://leetcode.com/problems/minimum-index-sum-of-two-lists/,Minimum Index Sum of Two Lists,Apple,2\nhttps://leetcode.com/problems/minimum-index-sum-of-two-lists/,Minimum Index Sum of Two Lists,Yelp,1\nhttps://leetcode.com/problems/range-addition-ii/,Range Addition II,Amazon,2\nhttps://leetcode.com/problems/longest-harmonious-subsequence/,Longest Harmonious Subsequence,LiveRamp,1\nhttps://leetcode.com/problems/valid-square/,Valid Square,Google,4\nhttps://leetcode.com/problems/valid-square/,Valid Square,Pure Storage,2\nhttps://leetcode.com/problems/valid-square/,Valid Square,Microsoft,2\nhttps://leetcode.com/problems/fraction-addition-and-subtraction/,Fraction Addition and Subtraction,Goldman Sachs,5\nhttps://leetcode.com/problems/tag-validator/,Tag Validator,Amazon,2\nhttps://leetcode.com/problems/tag-validator/,Tag Validator,Airbnb,2\nhttps://leetcode.com/problems/n-ary-tree-postorder-traversal/,N-ary Tree Postorder Traversal,Amazon,2\nhttps://leetcode.com/problems/n-ary-tree-preorder-traversal/,N-ary Tree Preorder Traversal,Google,3\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,Amazon,16\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,Microsoft,10\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,DoorDash,4\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,Salesforce,3\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,Google,3\nhttps://leetcode.com/problems/design-in-memory-file-system/,Design In-Memory File System,Goldman Sachs,2\nhttps://leetcode.com/problems/erect-the-fence/,Erect the Fence,Google,1\nhttps://leetcode.com/problems/delete-operation-for-two-strings/,Delete Operation for Two Strings,Amazon,2\nhttps://leetcode.com/problems/kill-process/,Kill Process,Amazon,8\nhttps://leetcode.com/problems/kill-process/,Kill Process,Microsoft,2\nhttps://leetcode.com/problems/shortest-unsorted-continuous-subarray/,Shortest Unsorted Continuous Subarray,Amazon,5\nhttps://leetcode.com/problems/shortest-unsorted-continuous-subarray/,Shortest Unsorted Continuous Subarray,Microsoft,3\nhttps://leetcode.com/problems/out-of-boundary-paths/,Out of Boundary Paths,Amazon,3\nhttps://leetcode.com/problems/out-of-boundary-paths/,Out of Boundary Paths,Baidu,1\nhttps://leetcode.com/problems/distribute-candies/,Distribute Candies,LiveRamp,1\nhttps://leetcode.com/problems/squirrel-simulation/,Squirrel Simulation,Square,1\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,Amazon,6\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,Facebook,5\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,Microsoft,3\nhttps://leetcode.com/problems/subtree-of-another-tree/,Subtree of Another Tree,Google,2\nhttps://leetcode.com/problems/maximum-vacation-days/,Maximum Vacation Days,Microsoft,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Microsoft,5\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Apple,4\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Yandex,4\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Oracle,4\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Amazon,3\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Google,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,Bloomberg,2\nhttps://leetcode.com/problems/permutation-in-string/,Permutation in String,ByteDance,2\nhttps://leetcode.com/problems/reshape-the-matrix/,Reshape the Matrix,Bloomberg,2\nhttps://leetcode.com/problems/reshape-the-matrix/,Reshape the Matrix,Facebook,2\nhttps://leetcode.com/problems/array-nesting/,Array Nesting,Adobe,3\nhttps://leetcode.com/problems/array-nesting/,Array Nesting,Apple,1\nhttps://leetcode.com/problems/binary-tree-tilt/,Binary Tree Tilt,Indeed,1\nhttps://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/,Longest Line of Consecutive One in Matrix,Google,5\nhttps://leetcode.com/problems/array-partition-i/,Array Partition I,Apple,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Facebook,141\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Amazon,19\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Google,15\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Microsoft,10\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Oracle,7\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,tiktok,5\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Bloomberg,4\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Visa,4\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Apple,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Quora,3\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Adobe,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Expedia,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Nvidia,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,ServiceNow,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,DoorDash,2\nhttps://leetcode.com/problems/subarray-sum-equals-k/,Subarray Sum Equals K,Bolt,2\nhttps://leetcode.com/problems/maximum-depth-of-n-ary-tree/,Maximum Depth of N-ary Tree,Microsoft,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,Microsoft,5\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,Amazon,3\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,Bolt,3\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,Yandex,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,Facebook,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,Apple,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-iii/,Reverse Words in a String III,PayTM,2\nhttps://leetcode.com/problems/split-concatenated-strings/,Split Concatenated Strings,Alibaba,1\nhttps://leetcode.com/problems/brick-wall/,Brick Wall,Bloomberg,2\nhttps://leetcode.com/problems/brick-wall/,Brick Wall,Grab,2\nhttps://leetcode.com/problems/optimal-division/,Optimal Division,Amazon,1\nhttps://leetcode.com/problems/student-attendance-record-ii/,Student Attendance Record II,Google,14\nhttps://leetcode.com/problems/student-attendance-record-i/,Student Attendance Record I,Google,5\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/,Binary Tree Longest Consecutive Sequence II,Google,4\nhttps://leetcode.com/problems/split-array-with-equal-sum/,Split Array with Equal Sum,Facebook,3\nhttps://leetcode.com/problems/friend-circles/,Friend Circles,Amazon,3\nhttps://leetcode.com/problems/friend-circles/,Friend Circles,Apple,3\nhttps://leetcode.com/problems/friend-circles/,Friend Circles,Bloomberg,2\nhttps://leetcode.com/problems/remove-boxes/,Remove Boxes,Uber,2\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,Amazon,12\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,Microsoft,9\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,Facebook,3\nhttps://leetcode.com/problems/boundary-of-binary-tree/,Boundary of Binary Tree,Bloomberg,2\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,Facebook,89\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,Amazon,12\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,Bloomberg,4\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,Google,3\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,Microsoft,3\nhttps://leetcode.com/problems/diameter-of-binary-tree/,Diameter of Binary Tree,Apple,2\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,Google,6\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,Amazon,6\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,Facebook,2\nhttps://leetcode.com/problems/01-matrix/,01 Matrix,Adobe,2\nhttps://leetcode.com/problems/reverse-string-ii/,Reverse String II,Adobe,3\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,Amazon,9\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,Facebook,5\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,Microsoft,5\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,Google,3\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,Apple,2\nhttps://leetcode.com/problems/single-element-in-a-sorted-array/,Single Element in a Sorted Array,Nvidia,2\nhttps://leetcode.com/problems/minimum-time-difference/,Minimum Time Difference,Google,30\nhttps://leetcode.com/problems/minimum-time-difference/,Minimum Time Difference,Amazon,2\nhttps://leetcode.com/problems/convert-bst-to-greater-tree/,Convert BST to Greater Tree,Facebook,3\nhttps://leetcode.com/problems/convert-bst-to-greater-tree/,Convert BST to Greater Tree,Amazon,3\nhttps://leetcode.com/problems/convert-bst-to-greater-tree/,Convert BST to Greater Tree,Bloomberg,2\nhttps://leetcode.com/problems/complex-number-multiplication/,Complex Number Multiplication,Amazon,1\nhttps://leetcode.com/problems/construct-binary-tree-from-string/,Construct Binary Tree from String,Facebook,7\nhttps://leetcode.com/problems/encode-and-decode-tinyurl/,Encode and Decode TinyURL,Microsoft,5\nhttps://leetcode.com/problems/encode-and-decode-tinyurl/,Encode and Decode TinyURL,Amazon,4\nhttps://leetcode.com/problems/encode-and-decode-tinyurl/,Encode and Decode TinyURL,Bloomberg,2\nhttps://leetcode.com/problems/lonely-pixel-ii/,Lonely Pixel II,Google,1\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Bloomberg,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Amazon,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Adobe,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Goldman Sachs,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Apple,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Uber,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,DoorDash,2\nhttps://leetcode.com/problems/k-diff-pairs-in-an-array/,K-diff Pairs in an Array,Zoho,2\nhttps://leetcode.com/problems/lonely-pixel-i/,Lonely Pixel I,Microsoft,3\nhttps://leetcode.com/problems/lonely-pixel-i/,Lonely Pixel I,Nvidia,3\nhttps://leetcode.com/problems/lonely-pixel-i/,Lonely Pixel I,Google,1\nhttps://leetcode.com/problems/minimum-absolute-difference-in-bst/,Minimum Absolute Difference in BST,Google,3\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,Uber,7\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,Facebook,6\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,LiveRamp,3\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,Microsoft,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,Amazon,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,Bloomberg,2\nhttps://leetcode.com/problems/minesweeper/,Minesweeper,Docusign,2\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Facebook,140\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Google,27\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Uber,13\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Amazon,11\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,LinkedIn,8\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Twitter,2\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Microsoft,2\nhttps://leetcode.com/problems/random-pick-with-weight/,Random Pick with Weight,Apple,2\nhttps://leetcode.com/problems/word-abbreviation/,Word Abbreviation,Google,3\nhttps://leetcode.com/problems/word-abbreviation/,Word Abbreviation,Snapchat,1\nhttps://leetcode.com/problems/beautiful-arrangement/,Beautiful Arrangement,Cisco,3\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,Amazon,7\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,Facebook,3\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,Microsoft,2\nhttps://leetcode.com/problems/contiguous-array/,Contiguous Array,Apple,2\nhttps://leetcode.com/problems/longest-word-in-dictionary-through-deleting/,Longest Word in Dictionary through Deleting,Google,4\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,Facebook,56\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,Amazon,5\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,ByteDance,3\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,Google,2\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,Apple,2\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,Walmart Global Tech,2\nhttps://leetcode.com/problems/continuous-subarray-sum/,Continuous Subarray Sum,tiktok,2\nhttps://leetcode.com/problems/longest-uncommon-subsequence-ii/,Longest Uncommon Subsequence II,Apple,2\nhttps://leetcode.com/problems/longest-uncommon-subsequence-i/,Longest Uncommon Subsequence I,Google,1\nhttps://leetcode.com/problems/detect-capital/,Detect Capital,Google,2\nhttps://leetcode.com/problems/detect-capital/,Detect Capital,Amazon,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,Apple,3\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,Goldman Sachs,3\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,Cisco,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,Google,2\nhttps://leetcode.com/problems/coin-change-2/,Coin Change 2,Bloomberg,2\nhttps://leetcode.com/problems/super-washing-machines/,Super Washing Machines,Microsoft,2\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,Amazon,6\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,LinkedIn,5\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,Microsoft,3\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,Apple,2\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,Bloomberg,2\nhttps://leetcode.com/problems/longest-palindromic-subsequence/,Longest Palindromic Subsequence,Oracle,2\nhttps://leetcode.com/problems/find-largest-value-in-each-tree-row/,Find Largest Value in Each Tree Row,Facebook,18\nhttps://leetcode.com/problems/freedom-trail/,Freedom Trail,DE Shaw,3\nhttps://leetcode.com/problems/freedom-trail/,Freedom Trail,Google,1\nhttps://leetcode.com/problems/find-bottom-left-tree-value/,Find Bottom Left Tree Value,Yahoo,2\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Amazon,10\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Microsoft,4\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Adobe,4\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Apple,4\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Facebook,3\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Oracle,3\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Goldman Sachs,3\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Zoom,3\nhttps://leetcode.com/problems/fibonacci-number/,Fibonacci Number,Google,2\nhttps://leetcode.com/problems/most-frequent-subtree-sum/,Most Frequent Subtree Sum,Apple,2\nhttps://leetcode.com/problems/perfect-number/,Perfect Number,Adobe,2\nhttps://leetcode.com/problems/relative-ranks/,Relative Ranks,Google,1\nhttps://leetcode.com/problems/the-maze-ii/,The Maze II,Microsoft,2\nhttps://leetcode.com/problems/the-maze-ii/,The Maze II,Google,2\nhttps://leetcode.com/problems/the-maze-ii/,The Maze II,ByteDance,2\nhttps://leetcode.com/problems/base-7/,Base 7,Google,3\nhttps://leetcode.com/problems/ipo/,IPO,Uber,5\nhttps://leetcode.com/problems/keyboard-row/,Keyboard Row,Mathworks,2\nhttps://leetcode.com/problems/the-maze-iii/,The Maze III,Google,2\nhttps://leetcode.com/problems/diagonal-traverse/,Diagonal Traverse,Facebook,48\nhttps://leetcode.com/problems/diagonal-traverse/,Diagonal Traverse,Microsoft,6\nhttps://leetcode.com/problems/diagonal-traverse/,Diagonal Traverse,Google,2\nhttps://leetcode.com/problems/teemo-attacking/,Teemo Attacking,Salesforce,2\nhttps://leetcode.com/problems/teemo-attacking/,Teemo Attacking,Riot Games,1\nhttps://leetcode.com/problems/target-sum/,Target Sum,Facebook,10\nhttps://leetcode.com/problems/target-sum/,Target Sum,Amazon,7\nhttps://leetcode.com/problems/target-sum/,Target Sum,Google,2\nhttps://leetcode.com/problems/target-sum/,Target Sum,Adobe,2\nhttps://leetcode.com/problems/target-sum/,Target Sum,Bloomberg,2\nhttps://leetcode.com/problems/reverse-pairs/,Reverse Pairs,Amazon,3\nhttps://leetcode.com/problems/construct-the-rectangle/,Construct the Rectangle,Bloomberg,2\nhttps://leetcode.com/problems/increasing-subsequences/,Increasing Subsequences,Google,2\nhttps://leetcode.com/problems/increasing-subsequences/,Increasing Subsequences,Apple,2\nhttps://leetcode.com/problems/increasing-subsequences/,Increasing Subsequences,Yahoo,1\nhttps://leetcode.com/problems/the-maze/,The Maze,ByteDance,4\nhttps://leetcode.com/problems/the-maze/,The Maze,Google,3\nhttps://leetcode.com/problems/the-maze/,The Maze,Snapchat,3\nhttps://leetcode.com/problems/the-maze/,The Maze,Amazon,2\nhttps://leetcode.com/problems/the-maze/,The Maze,Facebook,2\nhttps://leetcode.com/problems/the-maze/,The Maze,Microsoft,2\nhttps://leetcode.com/problems/the-maze/,The Maze,Square,2\nhttps://leetcode.com/problems/zuma-game/,Zuma Game,Salesforce,6\nhttps://leetcode.com/problems/zuma-game/,Zuma Game,Bloomberg,4\nhttps://leetcode.com/problems/zuma-game/,Zuma Game,Baidu,1\nhttps://leetcode.com/problems/max-consecutive-ones-ii/,Max Consecutive Ones II,tiktok,3\nhttps://leetcode.com/problems/max-consecutive-ones-ii/,Max Consecutive Ones II,Microsoft,2\nhttps://leetcode.com/problems/predict-the-winner/,Predict the Winner,Google,2\nhttps://leetcode.com/problems/predict-the-winner/,Predict the Winner,Snapchat,2\nhttps://leetcode.com/problems/max-consecutive-ones/,Max Consecutive Ones,Google,2\nhttps://leetcode.com/problems/max-consecutive-ones/,Max Consecutive Ones,Apple,2\nhttps://leetcode.com/problems/find-permutation/,Find Permutation,Goldman Sachs,2\nhttps://leetcode.com/problems/find-permutation/,Find Permutation,Google,1\nhttps://leetcode.com/problems/smallest-good-base/,Smallest Good Base,Microsoft,2\nhttps://leetcode.com/problems/license-key-formatting/,License Key Formatting,Capital One,18\nhttps://leetcode.com/problems/license-key-formatting/,License Key Formatting,Google,1\nhttps://leetcode.com/problems/magical-string/,Magical String,Google,1\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,Facebook,9\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,Spotify,4\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,Microsoft,3\nhttps://leetcode.com/problems/sliding-window-median/,Sliding Window Median,HBO,2\nhttps://leetcode.com/problems/largest-palindrome-product/,Largest Palindrome Product,Yahoo,1\nhttps://leetcode.com/problems/total-hamming-distance/,Total Hamming Distance,Adobe,2\nhttps://leetcode.com/problems/total-hamming-distance/,Total Hamming Distance,Amazon,2\nhttps://leetcode.com/problems/generate-random-point-in-a-circle/,Generate Random Point in a Circle,Leap Motion,1\nhttps://leetcode.com/problems/number-complement/,Number Complement,Apple,2\nhttps://leetcode.com/problems/number-complement/,Number Complement,Amazon,2\nhttps://leetcode.com/problems/heaters/,Heaters,Amazon,2\nhttps://leetcode.com/problems/heaters/,Heaters,Microsoft,2\nhttps://leetcode.com/problems/ones-and-zeroes/,Ones and Zeroes,Apple,2\nhttps://leetcode.com/problems/matchsticks-to-square/,Matchsticks to Square,Microsoft,2\nhttps://leetcode.com/problems/concatenated-words/,Concatenated Words,Amazon,30\nhttps://leetcode.com/problems/concatenated-words/,Concatenated Words,Microsoft,3\nhttps://leetcode.com/problems/encode-string-with-shortest-length/,Encode String with Shortest Length,Google,2\nhttps://leetcode.com/problems/convex-polygon/,Convex Polygon,Google,1\nhttps://leetcode.com/problems/validate-ip-address/,Validate IP Address,Cisco,8\nhttps://leetcode.com/problems/validate-ip-address/,Validate IP Address,Microsoft,2\nhttps://leetcode.com/problems/validate-ip-address/,Validate IP Address,Amazon,2\nhttps://leetcode.com/problems/unique-substrings-in-wraparound-string/,Unique Substrings in Wraparound String,Apple,2\nhttps://leetcode.com/problems/unique-substrings-in-wraparound-string/,Unique Substrings in Wraparound String,MAQ Software,1\nhttps://leetcode.com/problems/count-the-repetitions/,Count The Repetitions,Amazon,3\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,Uber,8\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,Google,4\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,Amazon,2\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,Affirm,2\nhttps://leetcode.com/problems/can-i-win/,Can I Win,LinkedIn,3\nhttps://leetcode.com/problems/island-perimeter/,Island Perimeter,Facebook,10\nhttps://leetcode.com/problems/island-perimeter/,Island Perimeter,Google,3\nhttps://leetcode.com/problems/island-perimeter/,Island Perimeter,Amazon,2\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/,Minimum Moves to Equal Array Elements II,Microsoft,5\nhttps://leetcode.com/problems/hamming-distance/,Hamming Distance,Google,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Microsoft,11\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Amazon,8\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Google,4\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Snapchat,3\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,LinkedIn,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Apple,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,VMware,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Walmart Global Tech,2\nhttps://leetcode.com/problems/lfu-cache/,LFU Cache,Oracle,2\nhttps://leetcode.com/problems/repeated-substring-pattern/,Repeated Substring Pattern,Google,2\nhttps://leetcode.com/problems/repeated-substring-pattern/,Repeated Substring Pattern,Facebook,2\nhttps://leetcode.com/problems/circular-array-loop/,Circular Array Loop,Goldman Sachs,2\nhttps://leetcode.com/problems/132-pattern/,132 Pattern,Amazon,4\nhttps://leetcode.com/problems/assign-cookies/,Assign Cookies,Apple,2\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,Amazon,6\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,Facebook,3\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,Adobe,2\nhttps://leetcode.com/problems/4sum-ii/,4Sum II,Bloomberg,2\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,Goldman Sachs,4\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,Twitter,3\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,Visa,3\nhttps://leetcode.com/problems/minimum-moves-to-equal-array-elements/,Minimum Moves to Equal Array Elements,Mathworks,3\nhttps://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Minimum Number of Arrows to Burst Balloons,Facebook,2\nhttps://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Minimum Number of Arrows to Burst Balloons,Google,2\nhttps://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/,Minimum Number of Arrows to Burst Balloons,Goldman Sachs,2\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,Microsoft,5\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,Facebook,3\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,Amazon,2\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,Bloomberg,2\nhttps://leetcode.com/problems/sort-characters-by-frequency/,Sort Characters By Frequency,Apple,2\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,Amazon,8\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,Microsoft,6\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,Oracle,4\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,Google,3\nhttps://leetcode.com/problems/delete-node-in-a-bst/,Delete Node in a BST,LinkedIn,3\nhttps://leetcode.com/problems/serialize-and-deserialize-bst/,Serialize and Deserialize BST,Amazon,3\nhttps://leetcode.com/problems/serialize-and-deserialize-bst/,Serialize and Deserialize BST,LinkedIn,2\nhttps://leetcode.com/problems/serialize-and-deserialize-bst/,Serialize and Deserialize BST,Microsoft,2\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,Facebook,7\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,Amazon,5\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,Microsoft,2\nhttps://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/,Find All Numbers Disappeared in an Array,Apple,2\nhttps://leetcode.com/problems/number-of-boomerangs/,Number of Boomerangs,Google,5\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,Adobe,2\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,Google,2\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,Uber,2\nhttps://leetcode.com/problems/arithmetic-slices-ii-subsequence/,Arithmetic Slices II - Subsequence,Baidu,1\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,Bloomberg,6\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,Microsoft,4\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,Amazon,3\nhttps://leetcode.com/problems/add-two-numbers-ii/,Add Two Numbers II,Oracle,2\nhttps://leetcode.com/problems/sequence-reconstruction/,Sequence Reconstruction,Google,2\nhttps://leetcode.com/problems/string-compression/,String Compression,Expedia,8\nhttps://leetcode.com/problems/string-compression/,String Compression,Amazon,8\nhttps://leetcode.com/problems/string-compression/,String Compression,Microsoft,6\nhttps://leetcode.com/problems/string-compression/,String Compression,Goldman Sachs,6\nhttps://leetcode.com/problems/string-compression/,String Compression,Apple,6\nhttps://leetcode.com/problems/string-compression/,String Compression,Facebook,5\nhttps://leetcode.com/problems/string-compression/,String Compression,Visa,4\nhttps://leetcode.com/problems/string-compression/,String Compression,Yandex,3\nhttps://leetcode.com/problems/string-compression/,String Compression,Redfin,3\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,Amazon,5\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,Microsoft,4\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,Google,2\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,Adobe,2\nhttps://leetcode.com/problems/find-all-duplicates-in-an-array/,Find All Duplicates in an Array,Apple,2\nhttps://leetcode.com/problems/k-th-smallest-in-lexicographical-order/,K-th Smallest in Lexicographical Order,ByteDance,2\nhttps://leetcode.com/problems/k-th-smallest-in-lexicographical-order/,K-th Smallest in Lexicographical Order,Hulu,1\nhttps://leetcode.com/problems/ternary-expression-parser/,Ternary Expression Parser,Snapchat,1\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Amazon,15\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Microsoft,11\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Facebook,5\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Apple,4\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Adobe,4\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Uber,3\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Yahoo,3\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Oracle,3\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Bloomberg,3\nhttps://leetcode.com/problems/find-all-anagrams-in-a-string/,Find All Anagrams in a String,Google,2\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,Facebook,4\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,tiktok,4\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,Google,3\nhttps://leetcode.com/problems/path-sum-iii/,Path Sum III,DoorDash,3\nhttps://leetcode.com/problems/find-right-interval/,Find Right Interval,Amazon,2\nhttps://leetcode.com/problems/find-right-interval/,Find Right Interval,Wish,2\nhttps://leetcode.com/problems/non-overlapping-intervals/,Non-overlapping Intervals,Facebook,7\nhttps://leetcode.com/problems/non-overlapping-intervals/,Non-overlapping Intervals,Amazon,4\nhttps://leetcode.com/problems/non-overlapping-intervals/,Non-overlapping Intervals,Microsoft,2\nhttps://leetcode.com/problems/number-of-segments-in-a-string/,Number of Segments in a String,Apple,2\nhttps://leetcode.com/problems/all-oone-data-structure/,All O`one Data Structure,LinkedIn,17\nhttps://leetcode.com/problems/all-oone-data-structure/,All O`one Data Structure,Amazon,3\nhttps://leetcode.com/problems/all-oone-data-structure/,All O`one Data Structure,VMware,2\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,Bloomberg,28\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,Google,2\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,Amazon,2\nhttps://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/,Flatten a Multilevel Doubly Linked List,Oracle,2\nhttps://leetcode.com/problems/n-ary-tree-level-order-traversal/,N-ary Tree Level Order Traversal,Microsoft,3\nhttps://leetcode.com/problems/word-squares/,Word Squares,Google,3\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,Google,7\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,Amazon,6\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,Uber,4\nhttps://leetcode.com/problems/longest-repeating-character-replacement/,Longest Repeating Character Replacement,Adobe,3\nhttps://leetcode.com/problems/reconstruct-original-digits-from-english/,Reconstruct Original Digits from English,JPMorgan,69\nhttps://leetcode.com/problems/valid-word-square/,Valid Word Square,Bloomberg,2\nhttps://leetcode.com/problems/valid-word-square/,Valid Word Square,Google,1\nhttps://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/,Maximum XOR of Two Numbers in an Array,Bloomberg,2\nhttps://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/,Maximum XOR of Two Numbers in an Array,Adobe,2\nhttps://leetcode.com/problems/strong-password-checker/,Strong Password Checker,Amazon,6\nhttps://leetcode.com/problems/strong-password-checker/,Strong Password Checker,Google,3\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,Google,10\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,Twitch,7\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,Facebook,4\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,Microsoft,4\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,Apple,2\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,Amazon,2\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,GoDaddy,2\nhttps://leetcode.com/problems/sentence-screen-fitting/,Sentence Screen Fitting,Google,8\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,Google,10\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,Uber,3\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,Amazon,2\nhttps://leetcode.com/problems/pacific-atlantic-water-flow/,Pacific Atlantic Water Flow,Salesforce,2\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,Facebook,11\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,Microsoft,5\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,Amazon,4\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,Apple,2\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,Google,2\nhttps://leetcode.com/problems/partition-equal-subset-sum/,Partition Equal Subset Sum,Walmart Global Tech,2\nhttps://leetcode.com/problems/add-strings/,Add Strings,Facebook,54\nhttps://leetcode.com/problems/add-strings/,Add Strings,Wayfair,20\nhttps://leetcode.com/problems/add-strings/,Add Strings,Microsoft,9\nhttps://leetcode.com/problems/add-strings/,Add Strings,Google,5\nhttps://leetcode.com/problems/add-strings/,Add Strings,Oracle,4\nhttps://leetcode.com/problems/add-strings/,Add Strings,Bloomberg,3\nhttps://leetcode.com/problems/add-strings/,Add Strings,Amazon,3\nhttps://leetcode.com/problems/add-strings/,Add Strings,Apple,2\nhttps://leetcode.com/problems/third-maximum-number/,Third Maximum Number,Amazon,2\nhttps://leetcode.com/problems/third-maximum-number/,Third Maximum Number,Apple,2\nhttps://leetcode.com/problems/third-maximum-number/,Third Maximum Number,Google,2\nhttps://leetcode.com/problems/arithmetic-slices/,Arithmetic Slices,Amazon,2\nhttps://leetcode.com/problems/arithmetic-slices/,Arithmetic Slices,Bloomberg,2\nhttps://leetcode.com/problems/fizz-buzz/,Fizz Buzz,Facebook,3\nhttps://leetcode.com/problems/fizz-buzz/,Fizz Buzz,Microsoft,3\nhttps://leetcode.com/problems/fizz-buzz/,Fizz Buzz,Apple,2\nhttps://leetcode.com/problems/minimum-unique-word-abbreviation/,Minimum Unique Word Abbreviation,Google,1\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,Google,8\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,Amazon,6\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,tiktok,6\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,Facebook,5\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,ByteDance,2\nhttps://leetcode.com/problems/split-array-largest-sum/,Split Array Largest Sum,Apple,2\nhttps://leetcode.com/problems/longest-palindrome/,Longest Palindrome,Amazon,2\nhttps://leetcode.com/problems/valid-word-abbreviation/,Valid Word Abbreviation,Facebook,114\nhttps://leetcode.com/problems/valid-word-abbreviation/,Valid Word Abbreviation,Google,3\nhttps://leetcode.com/problems/trapping-rain-water-ii/,Trapping Rain Water II,Google,4\nhttps://leetcode.com/problems/queue-reconstruction-by-height/,Queue Reconstruction by Height,Facebook,3\nhttps://leetcode.com/problems/convert-a-number-to-hexadecimal/,Convert a Number to Hexadecimal,Google,2\nhttps://leetcode.com/problems/convert-a-number-to-hexadecimal/,Convert a Number to Hexadecimal,Amazon,2\nhttps://leetcode.com/problems/sum-of-left-leaves/,Sum of Left Leaves,Adobe,2\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,Amazon,6\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,Microsoft,3\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,Google,2\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,ByteDance,2\nhttps://leetcode.com/problems/frog-jump/,Frog Jump,tiktok,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,Amazon,10\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,Microsoft,3\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,Bloomberg,3\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,Google,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,Adobe,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,Facebook,2\nhttps://leetcode.com/problems/remove-k-digits/,Remove K Digits,MakeMyTrip,2\nhttps://leetcode.com/problems/binary-watch/,Binary Watch,Google,1\nhttps://leetcode.com/problems/nth-digit/,Nth Digit,Apple,3\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Uber,14\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Amazon,10\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Google,8\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Facebook,8\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Snapchat,5\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,tiktok,4\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Adobe,3\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,Bloomberg,2\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,BlackRock,2\nhttps://leetcode.com/problems/random-pick-index/,Random Pick Index,Facebook,21\nhttps://leetcode.com/problems/random-pick-index/,Random Pick Index,Google,3\nhttps://leetcode.com/problems/random-pick-index/,Random Pick Index,Amazon,2\nhttps://leetcode.com/problems/integer-replacement/,Integer Replacement,Bloomberg,2\nhttps://leetcode.com/problems/rotate-function/,Rotate Function,Google,3\nhttps://leetcode.com/problems/rotate-function/,Rotate Function,Apple,2\nhttps://leetcode.com/problems/rotate-function/,Rotate Function,Amazon,1\nhttps://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/,Longest Substring with At Least K Repeating Characters,Amazon,3\nhttps://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/,Longest Substring with At Least K Repeating Characters,Microsoft,2\nhttps://leetcode.com/problems/decode-string/,Decode String,Bloomberg,33\nhttps://leetcode.com/problems/decode-string/,Decode String,Google,19\nhttps://leetcode.com/problems/decode-string/,Decode String,Microsoft,14\nhttps://leetcode.com/problems/decode-string/,Decode String,Amazon,12\nhttps://leetcode.com/problems/decode-string/,Decode String,Facebook,11\nhttps://leetcode.com/problems/decode-string/,Decode String,Cisco,8\nhttps://leetcode.com/problems/decode-string/,Decode String,Oracle,6\nhttps://leetcode.com/problems/decode-string/,Decode String,Snapchat,5\nhttps://leetcode.com/problems/decode-string/,Decode String,Apple,5\nhttps://leetcode.com/problems/decode-string/,Decode String,tiktok,5\nhttps://leetcode.com/problems/decode-string/,Decode String,Adobe,3\nhttps://leetcode.com/problems/decode-string/,Decode String,Uber,3\nhttps://leetcode.com/problems/decode-string/,Decode String,Intuit,2\nhttps://leetcode.com/problems/decode-string/,Decode String,Cruise Automation,2\nhttps://leetcode.com/problems/decode-string/,Decode String,ByteDance,2\nhttps://leetcode.com/problems/decode-string/,Decode String,Walmart Global Tech,2\nhttps://leetcode.com/problems/decode-string/,Decode String,Sumologic,2\nhttps://leetcode.com/problems/utf-8-validation/,UTF-8 Validation,Facebook,2\nhttps://leetcode.com/problems/utf-8-validation/,UTF-8 Validation,Palantir Technologies,2\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,Amazon,4\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,Google,3\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,Yandex,3\nhttps://leetcode.com/problems/is-subsequence/,Is Subsequence,Adobe,2\nhttps://leetcode.com/problems/perfect-rectangle/,Perfect Rectangle,Apple,4\nhttps://leetcode.com/problems/perfect-rectangle/,Perfect Rectangle,Google,2\nhttps://leetcode.com/problems/elimination-game/,Elimination Game,Bloomberg,4\nhttps://leetcode.com/problems/elimination-game/,Elimination Game,Goldman Sachs,4\nhttps://leetcode.com/problems/elimination-game/,Elimination Game,Adobe,2\nhttps://leetcode.com/problems/find-the-difference/,Find the Difference,Google,6\nhttps://leetcode.com/problems/find-the-difference/,Find the Difference,Amazon,3\nhttps://leetcode.com/problems/find-the-difference/,Find the Difference,Apple,2\nhttps://leetcode.com/problems/longest-absolute-file-path/,Longest Absolute File Path,Google,7\nhttps://leetcode.com/problems/longest-absolute-file-path/,Longest Absolute File Path,Amazon,2\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Amazon,30\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Bloomberg,13\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Apple,6\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Microsoft,6\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Oracle,5\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Goldman Sachs,4\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Facebook,4\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Yahoo,3\nhttps://leetcode.com/problems/first-unique-character-in-a-string/,First Unique Character in a String,Qualtrics,3\nhttps://leetcode.com/problems/mini-parser/,Mini Parser,Airbnb,1\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,Spotify,10\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,Apple,3\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,Google,3\nhttps://leetcode.com/problems/ransom-note/,Ransom Note,Adobe,2\nhttps://leetcode.com/problems/linked-list-random-node/,Linked List Random Node,Microsoft,2\nhttps://leetcode.com/problems/linked-list-random-node/,Linked List Random Node,Amazon,2\nhttps://leetcode.com/problems/linked-list-random-node/,Linked List Random Node,Google,1\nhttps://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Insert Delete GetRandom O(1) - Duplicates allowed,Facebook,5\nhttps://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Insert Delete GetRandom O(1) - Duplicates allowed,LinkedIn,4\nhttps://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/,Insert Delete GetRandom O(1) - Duplicates allowed,Affirm,3\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Facebook,23\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Bloomberg,23\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Amazon,17\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),LinkedIn,15\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Microsoft,12\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Affirm,10\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Uber,7\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Twitter,5\nhttps://leetcode.com/problems/insert-delete-getrandom-o1/,Insert Delete GetRandom O(1),Google,4\nhttps://leetcode.com/problems/design-phone-directory/,Design Phone Directory,Dropbox,2\nhttps://leetcode.com/problems/design-phone-directory/,Design Phone Directory,Amazon,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Facebook,18\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Amazon,6\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Microsoft,4\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Google,4\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Adobe,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Bloomberg,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,Uber,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/,Kth Smallest Element in a Sorted Matrix,ByteDance,2\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,Amazon,4\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,Google,3\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,Facebook,2\nhttps://leetcode.com/problems/combination-sum-iv/,Combination Sum IV,Microsoft,2\nhttps://leetcode.com/problems/wiggle-subsequence/,Wiggle Subsequence,Bloomberg,2\nhttps://leetcode.com/problems/guess-number-higher-or-lower-ii/,Guess Number Higher or Lower II,Google,2\nhttps://leetcode.com/problems/guess-number-higher-or-lower/,Guess Number Higher or Lower,Adobe,4\nhttps://leetcode.com/problems/guess-number-higher-or-lower/,Guess Number Higher or Lower,Bloomberg,2\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,LinkedIn,8\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,Apple,3\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,Amazon,2\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,Walmart Global Tech,2\nhttps://leetcode.com/problems/find-k-pairs-with-smallest-sums/,Find K Pairs with Smallest Sums,Hotstar,2\nhttps://leetcode.com/problems/super-pow/,Super Pow,Adobe,2\nhttps://leetcode.com/problems/sum-of-two-integers/,Sum of Two Integers,Facebook,2\nhttps://leetcode.com/problems/range-addition/,Range Addition,Amazon,18\nhttps://leetcode.com/problems/range-addition/,Range Addition,Citadel,5\nhttps://leetcode.com/problems/plus-one-linked-list/,Plus One Linked List,Google,1\nhttps://leetcode.com/problems/largest-divisible-subset/,Largest Divisible Subset,Google,2\nhttps://leetcode.com/problems/valid-perfect-square/,Valid Perfect Square,LinkedIn,3\nhttps://leetcode.com/problems/valid-perfect-square/,Valid Perfect Square,Google,3\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,Google,75\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,LinkedIn,13\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,Microsoft,4\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,Facebook,2\nhttps://leetcode.com/problems/find-leaves-of-binary-tree/,Find Leaves of Binary Tree,Amazon,2\nhttps://leetcode.com/problems/water-and-jug-problem/,Water and Jug Problem,Lyft,4\nhttps://leetcode.com/problems/nested-list-weight-sum-ii/,Nested List Weight Sum II,LinkedIn,48\nhttps://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/,Max Sum of Rectangle No Larger Than K,Dunzo,2\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Amazon,9\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Databricks,9\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Microsoft,8\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Twitter,7\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Affirm,6\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Google,2\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Apple,2\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,Uber,2\nhttps://leetcode.com/problems/bomb-enemy/,Bomb Enemy,Uber,4\nhttps://leetcode.com/problems/sort-transformed-array/,Sort Transformed Array,LinkedIn,10\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,Google,22\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,Atlassian,10\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,Microsoft,5\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,Amazon,3\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,Netflix,3\nhttps://leetcode.com/problems/logger-rate-limiter/,Logger Rate Limiter,Apple,2\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,Google,3\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,Twitter,3\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,Microsoft,2\nhttps://leetcode.com/problems/rearrange-string-k-distance-apart/,Rearrange String k Distance Apart,VMware,2\nhttps://leetcode.com/problems/count-numbers-with-unique-digits/,Count Numbers with Unique Digits,Bloomberg,2\nhttps://leetcode.com/problems/line-reflection/,Line Reflection,Yandex,2\nhttps://leetcode.com/problems/design-twitter/,Design Twitter,Google,3\nhttps://leetcode.com/problems/design-twitter/,Design Twitter,Amazon,2\nhttps://leetcode.com/problems/design-twitter/,Design Twitter,Walmart Global Tech,2\nhttps://leetcode.com/problems/russian-doll-envelopes/,Russian Doll Envelopes,Google,7\nhttps://leetcode.com/problems/russian-doll-envelopes/,Russian Doll Envelopes,tiktok,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,Amazon,5\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,Square,3\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,Atlassian,3\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,tiktok,3\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,Google,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,Microsoft,2\nhttps://leetcode.com/problems/design-snake-game/,Design Snake Game,IXL,2\nhttps://leetcode.com/problems/data-stream-as-disjoint-intervals/,Data Stream as Disjoint Intervals,Microsoft,2\nhttps://leetcode.com/problems/android-unlock-patterns/,Android Unlock Patterns,Snapchat,3\nhttps://leetcode.com/problems/android-unlock-patterns/,Android Unlock Patterns,Microsoft,2\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,Facebook,4\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,Amazon,4\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,Yahoo,4\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,Adobe,3\nhttps://leetcode.com/problems/intersection-of-two-arrays-ii/,Intersection of Two Arrays II,Bloomberg,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Amazon,9\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Facebook,6\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Apple,6\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Adobe,5\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Google,3\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Microsoft,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,Bloomberg,2\nhttps://leetcode.com/problems/intersection-of-two-arrays/,Intersection of Two Arrays,JPMorgan,2\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,Facebook,15\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,Amazon,15\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,Microsoft,7\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,Google,4\nhttps://leetcode.com/problems/design-tic-tac-toe/,Design Tic-Tac-Toe,Adobe,2\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Facebook,97\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Amazon,29\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Microsoft,12\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Google,8\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Oracle,7\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Uber,6\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Apple,5\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Bloomberg,4\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Adobe,3\nhttps://leetcode.com/problems/top-k-frequent-elements/,Top K Frequent Elements,Cisco,3\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,Facebook,43\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,Spotify,16\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,Amazon,4\nhttps://leetcode.com/problems/moving-average-from-data-stream/,Moving Average from Data Stream,Google,4\nhttps://leetcode.com/problems/reverse-vowels-of-a-string/,Reverse Vowels of a String,Bloomberg,2\nhttps://leetcode.com/problems/reverse-string/,Reverse String,Amazon,6\nhttps://leetcode.com/problems/reverse-string/,Reverse String,Microsoft,5\nhttps://leetcode.com/problems/reverse-string/,Reverse String,Adobe,5\nhttps://leetcode.com/problems/reverse-string/,Reverse String,Facebook,3\nhttps://leetcode.com/problems/reverse-string/,Reverse String,tcs,3\nhttps://leetcode.com/problems/reverse-string/,Reverse String,Apple,2\nhttps://leetcode.com/problems/reverse-string/,Reverse String,Intel,2\nhttps://leetcode.com/problems/integer-break/,Integer Break,Facebook,3\nhttps://leetcode.com/problems/power-of-four/,Power of Four,Two Sigma,Wix\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,LinkedIn,8\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Apple,5\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Facebook,4\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Airbnb,4\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Twitter,3\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Uber,2\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Amazon,2\nhttps://leetcode.com/problems/flatten-nested-list-iterator/,Flatten Nested List Iterator,Salesforce,2\nhttps://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/,Longest Substring with At Most K Distinct Characters,Amazon,2\nhttps://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/,Longest Substring with At Most K Distinct Characters,Google,2\nhttps://leetcode.com/problems/nested-list-weight-sum/,Nested List Weight Sum,Facebook,100\nhttps://leetcode.com/problems/nested-list-weight-sum/,Nested List Weight Sum,LinkedIn,34\nhttps://leetcode.com/problems/nested-list-weight-sum/,Nested List Weight Sum,Amazon,4\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,Amazon,3\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,Google,2\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,Bloomberg,2\nhttps://leetcode.com/problems/counting-bits/,Counting Bits,JPMorgan,2\nhttps://leetcode.com/problems/house-robber-iii/,House Robber III,Amazon,6\nhttps://leetcode.com/problems/house-robber-iii/,House Robber III,Google,5\nhttps://leetcode.com/problems/house-robber-iii/,House Robber III,Adobe,3\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,Airbnb,14\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,Apple,3\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,Google,3\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,Shopee,3\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,Facebook,2\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,Microsoft,2\nhttps://leetcode.com/problems/self-crossing/,Self Crossing,Amazon,3\nhttps://leetcode.com/problems/self-crossing/,Self Crossing,Google,2\nhttps://leetcode.com/problems/increasing-triplet-subsequence/,Increasing Triplet Subsequence,Google,3\nhttps://leetcode.com/problems/increasing-triplet-subsequence/,Increasing Triplet Subsequence,Facebook,2\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,Facebook,7\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,Oracle,2\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,Cohesity,2\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,Uber,10\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,Facebook,6\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,Google,4\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,Amazon,4\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,Twitter,4\nhttps://leetcode.com/problems/reconstruct-itinerary/,Reconstruct Itinerary,Netflix,2\nhttps://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/,Verify Preorder Serialization of a Binary Tree,Google,1\nhttps://leetcode.com/problems/patching-array/,Patching Array,Amazon,2\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,Facebook,6\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,Amazon,4\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,Adobe,4\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,eBay,2\nhttps://leetcode.com/problems/odd-even-linked-list/,Odd Even Linked List,tiktok,2\nhttps://leetcode.com/problems/power-of-three/,Power of Three,Amazon,2\nhttps://leetcode.com/problems/maximum-size-subarray-sum-equals-k/,Maximum Size Subarray Sum Equals k,Facebook,11\nhttps://leetcode.com/problems/maximum-size-subarray-sum-equals-k/,Maximum Size Subarray Sum Equals k,Amazon,2\nhttps://leetcode.com/problems/wiggle-sort-ii/,Wiggle Sort II,Adobe,2\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,Amazon,6\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,LinkedIn,3\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,Facebook,3\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,Google,2\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,Microsoft,2\nhttps://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/,Number of Connected Components in an Undirected Graph,Pinterest,2\nhttps://leetcode.com/problems/coin-change/,Coin Change,Amazon,18\nhttps://leetcode.com/problems/coin-change/,Coin Change,Microsoft,14\nhttps://leetcode.com/problems/coin-change/,Coin Change,Google,5\nhttps://leetcode.com/problems/coin-change/,Coin Change,Mathworks,5\nhttps://leetcode.com/problems/coin-change/,Coin Change,Bloomberg,4\nhttps://leetcode.com/problems/coin-change/,Coin Change,Facebook,2\nhttps://leetcode.com/problems/coin-change/,Coin Change,Yahoo,2\nhttps://leetcode.com/problems/coin-change/,Coin Change,Goldman Sachs,2\nhttps://leetcode.com/problems/create-maximum-number/,Create Maximum Number,Apple,2\nhttps://leetcode.com/problems/create-maximum-number/,Create Maximum Number,Google,1\nhttps://leetcode.com/problems/generalized-abbreviation/,Generalized Abbreviation,Google,1\nhttps://leetcode.com/problems/bulb-switcher/,Bulb Switcher,LinkedIn,4\nhttps://leetcode.com/problems/bulb-switcher/,Bulb Switcher,Microsoft,3\nhttps://leetcode.com/problems/maximum-product-of-word-lengths/,Maximum Product of Word Lengths,Bloomberg,2\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,Facebook,22\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,Microsoft,7\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,Google,6\nhttps://leetcode.com/problems/shortest-distance-from-all-buildings/,Shortest Distance from All Buildings,DoorDash,5\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,Apple,4\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,Facebook,2\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,Amazon,2\nhttps://leetcode.com/problems/remove-duplicate-letters/,Remove Duplicate Letters,Salesforce,2\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,Google,6\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,Microsoft,5\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,Amazon,3\nhttps://leetcode.com/problems/count-of-smaller-numbers-after-self/,Count of Smaller Numbers After Self,Adobe,2\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,Facebook,188\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,Bloomberg,8\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,Amazon,4\nhttps://leetcode.com/problems/binary-tree-vertical-order-traversal/,Binary Tree Vertical Order Traversal,Microsoft,3\nhttps://leetcode.com/problems/super-ugly-number/,Super Ugly Number,Google,2\nhttps://leetcode.com/problems/super-ugly-number/,Super Ugly Number,Bloomberg,2\nhttps://leetcode.com/problems/super-ugly-number/,Super Ugly Number,Apple,2\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,Google,7\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,Microsoft,6\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,Apple,4\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,Bloomberg,4\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,Uber,3\nhttps://leetcode.com/problems/burst-balloons/,Burst Balloons,Amazon,2\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,Facebook,10\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,Snapchat,5\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,Amazon,2\nhttps://leetcode.com/problems/sparse-matrix-multiplication/,Sparse Matrix Multiplication,Databricks,2\nhttps://leetcode.com/problems/minimum-height-trees/,Minimum Height Trees,Amazon,2\nhttps://leetcode.com/problems/minimum-height-trees/,Minimum Height Trees,Snapchat,2\nhttps://leetcode.com/problems/range-sum-query-2d-mutable/,Range Sum Query 2D - Mutable,Google,3\nhttps://leetcode.com/problems/range-sum-query-mutable/,Range Sum Query - Mutable,Google,6\nhttps://leetcode.com/problems/range-sum-query-mutable/,Range Sum Query - Mutable,Amazon,3\nhttps://leetcode.com/problems/additive-number/,Additive Number,Booking.com,3\nhttps://leetcode.com/problems/additive-number/,Additive Number,Epic Systems,2\nhttps://leetcode.com/problems/number-of-islands-ii/,Number of Islands II,Uber,5\nhttps://leetcode.com/problems/number-of-islands-ii/,Number of Islands II,Google,2\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,Facebook,10\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,Lyft,4\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,Amazon,3\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,Google,2\nhttps://leetcode.com/problems/range-sum-query-2d-immutable/,Range Sum Query 2D - Immutable,Samsung,2\nhttps://leetcode.com/problems/range-sum-query-immutable/,Range Sum Query - Immutable,Facebook,2\nhttps://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/,Smallest Rectangle Enclosing Black Pixels,Google,7\nhttps://leetcode.com/problems/remove-invalid-parentheses/,Remove Invalid Parentheses,Facebook,36\nhttps://leetcode.com/problems/remove-invalid-parentheses/,Remove Invalid Parentheses,Amazon,2\nhttps://leetcode.com/problems/bulls-and-cows/,Bulls and Cows,Google,12\nhttps://leetcode.com/problems/bulls-and-cows/,Bulls and Cows,Facebook,2\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Binary Tree Longest Consecutive Sequence,Facebook,3\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Binary Tree Longest Consecutive Sequence,Amazon,2\nhttps://leetcode.com/problems/binary-tree-longest-consecutive-sequence/,Binary Tree Longest Consecutive Sequence,Google,2\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,Amazon,21\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,Microsoft,20\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,LinkedIn,18\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,DoorDash,7\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,Uber,4\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,Nvidia,4\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,tiktok,4\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,Google,3\nhttps://leetcode.com/problems/serialize-and-deserialize-binary-tree/,Serialize and Deserialize Binary Tree,Oracle,3\nhttps://leetcode.com/problems/best-meeting-point/,Best Meeting Point,Expedia,4\nhttps://leetcode.com/problems/best-meeting-point/,Best Meeting Point,Google,2\nhttps://leetcode.com/problems/best-meeting-point/,Best Meeting Point,Facebook,2\nhttps://leetcode.com/problems/flip-game-ii/,Flip Game II,Google,1\nhttps://leetcode.com/problems/flip-game/,Flip Game,Google,1\nhttps://leetcode.com/problems/nim-game/,Nim Game,Adobe,3\nhttps://leetcode.com/problems/nim-game/,Nim Game,Microsoft,2\nhttps://leetcode.com/problems/word-pattern-ii/,Word Pattern II,Uber,3\nhttps://leetcode.com/problems/word-pattern-ii/,Word Pattern II,Bolt,2\nhttps://leetcode.com/problems/word-pattern-ii/,Word Pattern II,Pinterest,2\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,Amazon,4\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,Bolt,3\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,Uber,2\nhttps://leetcode.com/problems/word-pattern/,Word Pattern,Adobe,2\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Opendoor,10\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Amazon,6\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Dropbox,5\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Bloomberg,4\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Adobe,4\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Google,3\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Microsoft,3\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Snapchat,2\nhttps://leetcode.com/problems/game-of-life/,Game of Life,Apple,2\nhttps://leetcode.com/problems/unique-word-abbreviation/,Unique Word Abbreviation,Facebook,3\nhttps://leetcode.com/problems/unique-word-abbreviation/,Unique Word Abbreviation,Google,1\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Amazon,16\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Microsoft,11\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Facebook,4\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Uber,3\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Apple,3\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Google,2\nhttps://leetcode.com/problems/find-the-duplicate-number/,Find the Duplicate Number,Qualcomm,2\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,Facebook,15\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,DoorDash,11\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,Google,5\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,tiktok,5\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,Amazon,4\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,Microsoft,3\nhttps://leetcode.com/problems/walls-and-gates/,Walls and Gates,Bloomberg,2\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,Microsoft,11\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,Facebook,6\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,Google,3\nhttps://leetcode.com/problems/inorder-successor-in-bst/,Inorder Successor In BST,Adobe,2\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,Google,8\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,Apple,3\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,Amazon,3\nhttps://leetcode.com/problems/peeking-iterator/,Peeking Iterator,Microsoft,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Facebook,19\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Microsoft,10\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Apple,8\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Amazon,8\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Yandex,6\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Bloomberg,4\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,tcs,4\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Uber,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Adobe,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,IBM,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,Expedia,2\nhttps://leetcode.com/problems/move-zeroes/,Move Zeroes,tiktok,2\nhttps://leetcode.com/problems/expression-add-operators/,Expression Add Operators,Facebook,23\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,Yandex,6\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,Apple,2\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,Amazon,2\nhttps://leetcode.com/problems/zigzag-iterator/,Zigzag Iterator,Google,1\nhttps://leetcode.com/problems/wiggle-sort/,Wiggle Sort,Amazon,2\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,Apple,2\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,Amazon,2\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,Google,2\nhttps://leetcode.com/problems/perfect-squares/,Perfect Squares,Microsoft,2\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Google,19\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Amazon,12\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Facebook,7\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Microsoft,6\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Apple,5\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Adobe,4\nhttps://leetcode.com/problems/first-bad-version/,First Bad Version,Cisco,2\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,LinkedIn,6\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,Microsoft,5\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,Amazon,4\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,Pinterest,3\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,Apple,3\nhttps://leetcode.com/problems/find-the-celebrity/,Find the Celebrity,Facebook,2\nhttps://leetcode.com/problems/paint-fence/,Paint Fence,Google,2\nhttps://leetcode.com/problems/paint-fence/,Paint Fence,JPMorgan,2\nhttps://leetcode.com/problems/h-index-ii/,H-Index II,Goldman Sachs,2\nhttps://leetcode.com/problems/h-index/,H-Index,Google,9\nhttps://leetcode.com/problems/h-index/,H-Index,Alation,3\nhttps://leetcode.com/problems/h-index/,H-Index,Amazon,2\nhttps://leetcode.com/problems/h-index/,H-Index,Facebook,2\nhttps://leetcode.com/problems/h-index/,H-Index,Apple,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Facebook,20\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Amazon,19\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Microsoft,7\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,DoorDash,4\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Salesforce,3\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Expedia,3\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Apple,2\nhttps://leetcode.com/problems/integer-to-english-words/,Integer to English Words,Booking.com,2\nhttps://leetcode.com/problems/closest-binary-search-tree-value-ii/,Closest Binary Search Tree Value II,LinkedIn,26\nhttps://leetcode.com/problems/closest-binary-search-tree-value-ii/,Closest Binary Search Tree Value II,Google,2\nhttps://leetcode.com/problems/encode-and-decode-strings/,Encode and Decode Strings,Facebook,3\nhttps://leetcode.com/problems/encode-and-decode-strings/,Encode and Decode Strings,LinkedIn,2\nhttps://leetcode.com/problems/closest-binary-search-tree-value/,Closest Binary Search Tree Value,Facebook,21\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Facebook,16\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Airbnb,14\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Amazon,10\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Google,7\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Bloomberg,4\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Uber,3\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Microsoft,3\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Pinterest,2\nhttps://leetcode.com/problems/alien-dictionary/,Alien Dictionary,Snapchat,2\nhttps://leetcode.com/problems/missing-number/,Missing Number,Microsoft,13\nhttps://leetcode.com/problems/missing-number/,Missing Number,Amazon,8\nhttps://leetcode.com/problems/missing-number/,Missing Number,Facebook,6\nhttps://leetcode.com/problems/missing-number/,Missing Number,Adobe,3\nhttps://leetcode.com/problems/missing-number/,Missing Number,Apple,3\nhttps://leetcode.com/problems/missing-number/,Missing Number,Salesforce,2\nhttps://leetcode.com/problems/missing-number/,Missing Number,VMware,2\nhttps://leetcode.com/problems/missing-number/,Missing Number,Nvidia,2\nhttps://leetcode.com/problems/palindrome-permutation-ii/,Palindrome Permutation II,Google,3\nhttps://leetcode.com/problems/palindrome-permutation-ii/,Palindrome Permutation II,Cruise Automation,2\nhttps://leetcode.com/problems/palindrome-permutation/,Palindrome Permutation,Facebook,12\nhttps://leetcode.com/problems/paint-house-ii/,Paint House II,LinkedIn,3\nhttps://leetcode.com/problems/paint-house-ii/,Paint House II,Walmart Global Tech,2\nhttps://leetcode.com/problems/paint-house-ii/,Paint House II,Facebook,1\nhttps://leetcode.com/problems/ugly-number-ii/,Ugly Number II,Microsoft,2\nhttps://leetcode.com/problems/ugly-number/,Ugly Number,Facebook,3\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,LinkedIn,8\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,Google,3\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,Amazon,2\nhttps://leetcode.com/problems/graph-valid-tree/,Graph Valid Tree,Microsoft,2\nhttps://leetcode.com/problems/single-number-iii/,Single Number III,Google,2\nhttps://leetcode.com/problems/add-digits/,Add Digits,Bloomberg,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,Amazon,3\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,Bloomberg,3\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,Facebook,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,Google,2\nhttps://leetcode.com/problems/binary-tree-paths/,Binary Tree Paths,Microsoft,2\nhttps://leetcode.com/problems/paint-house/,Paint House,LinkedIn,5\nhttps://leetcode.com/problems/paint-house/,Paint House,Twitter,4\nhttps://leetcode.com/problems/paint-house/,Paint House,Amazon,3\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify Preorder Sequence in Binary Search Tree,VMware,4\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify Preorder Sequence in Binary Search Tree,Oracle,2\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify Preorder Sequence in Binary Search Tree,Zenefits,1\nhttps://leetcode.com/problems/factor-combinations/,Factor Combinations,LinkedIn,5\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Amazon,48\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Facebook,33\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Google,22\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Bloomberg,20\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Microsoft,14\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Oracle,13\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Visa,3\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Uber,2\nhttps://leetcode.com/problems/meeting-rooms-ii/,Meeting Rooms II,Snapchat,2\nhttps://leetcode.com/problems/meeting-rooms/,Meeting Rooms,Amazon,4\nhttps://leetcode.com/problems/meeting-rooms/,Meeting Rooms,Google,2\nhttps://leetcode.com/problems/flatten-2d-vector/,Flatten 2D Vector,Airbnb,9\nhttps://leetcode.com/problems/count-univalue-subtrees/,Count Univalue Subtrees,Microsoft,3\nhttps://leetcode.com/problems/count-univalue-subtrees/,Count Univalue Subtrees,Google,2\nhttps://leetcode.com/problems/group-shifted-strings/,Group Shifted Strings,Facebook,47\nhttps://leetcode.com/problems/group-shifted-strings/,Group Shifted Strings,Google,2\nhttps://leetcode.com/problems/strobogrammatic-number-iii/,Strobogrammatic Number III,Google,4\nhttps://leetcode.com/problems/strobogrammatic-number-ii/,Strobogrammatic Number II,Facebook,4\nhttps://leetcode.com/problems/strobogrammatic-number-ii/,Strobogrammatic Number II,Uber,3\nhttps://leetcode.com/problems/strobogrammatic-number-ii/,Strobogrammatic Number II,Google,2\nhttps://leetcode.com/problems/strobogrammatic-number/,Strobogrammatic Number,Facebook,19\nhttps://leetcode.com/problems/strobogrammatic-number/,Strobogrammatic Number,Uber,2\nhttps://leetcode.com/problems/shortest-word-distance-iii/,Shortest Word Distance III,LinkedIn,2\nhttps://leetcode.com/problems/shortest-word-distance-iii/,Shortest Word Distance III,Amazon,2\nhttps://leetcode.com/problems/shortest-word-distance-ii/,Shortest Word Distance II,LinkedIn,71\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,LinkedIn,11\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,Amazon,3\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,Microsoft,2\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,Facebook,2\nhttps://leetcode.com/problems/shortest-word-distance/,Shortest Word Distance,Salesforce,2\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Facebook,8\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Bloomberg,8\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Amazon,8\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Spotify,8\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Microsoft,6\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Goldman Sachs,3\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Affirm,3\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Google,2\nhttps://leetcode.com/problems/valid-anagram/,Valid Anagram,Apple,2\nhttps://leetcode.com/problems/different-ways-to-add-parentheses/,Different Ways to Add Parentheses,Google,3\nhttps://leetcode.com/problems/different-ways-to-add-parentheses/,Different Ways to Add Parentheses,Bloomberg,3\nhttps://leetcode.com/problems/different-ways-to-add-parentheses/,Different Ways to Add Parentheses,Snapchat,2\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,Amazon,10\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,Microsoft,5\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,Bloomberg,3\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,Apple,2\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,Facebook,2\nhttps://leetcode.com/problems/search-a-2d-matrix-ii/,Search a 2D Matrix II,Oracle,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Amazon,32\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Google,8\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Microsoft,6\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Salesforce,6\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Uber,5\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Facebook,5\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Adobe,4\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Citadel,4\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,ByteDance,4\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Apple,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Twilio,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,tiktok,3\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Bloomberg,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,VMware,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Booking.com,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,DoorDash,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,DE Shaw,2\nhttps://leetcode.com/problems/sliding-window-maximum/,Sliding Window Maximum,Quora,2\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Amazon,32\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Facebook,18\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Microsoft,15\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Asana,13\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Apple,10\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Uber,8\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Adobe,7\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Bloomberg,4\nhttps://leetcode.com/problems/product-of-array-except-self/,Product of Array Except Self,Oracle,4\nhttps://leetcode.com/problems/delete-node-in-a-linked-list/,Delete Node in a Linked List,Microsoft,3\nhttps://leetcode.com/problems/delete-node-in-a-linked-list/,Delete Node in a Linked List,Amazon,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Facebook,180\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Amazon,25\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,LinkedIn,11\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Microsoft,10\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Google,8\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Oracle,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Sumologic,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Karat,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/,Lowest Common Ancestor of a Binary Tree,Apple,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,LinkedIn,18\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,Facebook,5\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,Amazon,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,Apple,3\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,Google,2\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/,Lowest Common Ancestor of a Binary Search Tree,Microsoft,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Facebook,16\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Amazon,16\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Microsoft,10\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Apple,6\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Bloomberg,3\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Google,3\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Adobe,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,ServiceNow,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,VMware,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Yahoo,2\nhttps://leetcode.com/problems/palindrome-linked-list/,Palindrome Linked List,Intuit,2\nhttps://leetcode.com/problems/number-of-digit-one/,Number of Digit One,Microsoft,4\nhttps://leetcode.com/problems/number-of-digit-one/,Number of Digit One,Google,4\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,Amazon,8\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,Microsoft,3\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,Goldman Sachs,3\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,eBay,2\nhttps://leetcode.com/problems/implement-queue-using-stacks/,Implement Queue using Stacks,Google,2\nhttps://leetcode.com/problems/power-of-two/,Power of Two,Amazon,5\nhttps://leetcode.com/problems/power-of-two/,Power of Two,Apple,4\nhttps://leetcode.com/problems/power-of-two/,Power of Two,Google,3\nhttps://leetcode.com/problems/power-of-two/,Power of Two,Snapchat,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,Uber,11\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,Amazon,9\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,Facebook,6\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,Microsoft,2\nhttps://leetcode.com/problems/kth-smallest-element-in-a-bst/,Kth Smallest Element in a BST,LinkedIn,2\nhttps://leetcode.com/problems/majority-element-ii/,Majority Element II,Amazon,4\nhttps://leetcode.com/problems/majority-element-ii/,Majority Element II,Microsoft,3\nhttps://leetcode.com/problems/majority-element-ii/,Majority Element II,Adobe,2\nhttps://leetcode.com/problems/summary-ranges/,Summary Ranges,Yandex,6\nhttps://leetcode.com/problems/summary-ranges/,Summary Ranges,Qualtrics,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Facebook,118\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Amazon,13\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Microsoft,11\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,ByteDance,4\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Snapchat,3\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Oracle,3\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Uber,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Apple,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Tesla,2\nhttps://leetcode.com/problems/basic-calculator-ii/,Basic Calculator II,Yahoo,2\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,Amazon,5\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,Facebook,5\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,Google,3\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,Uber,3\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,Apple,3\nhttps://leetcode.com/problems/invert-binary-tree/,Invert Binary Tree,Bloomberg,2\nhttps://leetcode.com/problems/implement-stack-using-queues/,Implement Stack using Queues,Amazon,3\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Google,12\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Facebook,10\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Amazon,7\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,DoorDash,6\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Uber,5\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Microsoft,5\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,ByteDance,3\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Snapchat,2\nhttps://leetcode.com/problems/basic-calculator/,Basic Calculator,Adobe,2\nhttps://leetcode.com/problems/rectangle-area/,Rectangle Area,Amazon,2\nhttps://leetcode.com/problems/count-complete-tree-nodes/,Count Complete Tree Nodes,Google,7\nhttps://leetcode.com/problems/count-complete-tree-nodes/,Count Complete Tree Nodes,Amazon,5\nhttps://leetcode.com/problems/count-complete-tree-nodes/,Count Complete Tree Nodes,tiktok,4\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,Microsoft,7\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,Visa,6\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,Amazon,3\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,Google,3\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,IBM,3\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,Salesforce,3\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,ByteDance,2\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,FactSet,2\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,Google,4\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,Adobe,2\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,Apple,2\nhttps://leetcode.com/problems/contains-duplicate-iii/,Contains Duplicate III,Amazon,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Facebook,15\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Google,3\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Adobe,3\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Uber,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Amazon,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Bloomberg,2\nhttps://leetcode.com/problems/contains-duplicate-ii/,Contains Duplicate II,Microsoft,2\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,Microsoft,4\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,Cruise Automation,3\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,Google,2\nhttps://leetcode.com/problems/the-skyline-problem/,The Skyline Problem,Uber,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Amazon,19\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Adobe,12\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Google,6\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Apple,6\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Microsoft,3\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Bloomberg,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Uber,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,Yahoo,2\nhttps://leetcode.com/problems/contains-duplicate/,Contains Duplicate,tcs,2\nhttps://leetcode.com/problems/combination-sum-iii/,Combination Sum III,Google,3\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Facebook,140\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Amazon,16\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,LinkedIn,14\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Microsoft,12\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Google,8\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Bloomberg,5\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Adobe,5\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,tiktok,3\nhttps://leetcode.com/problems/kth-largest-element-in-an-array/,Kth Largest Element in an Array,Goldman Sachs,2\nhttps://leetcode.com/problems/shortest-palindrome/,Shortest Palindrome,Bloomberg,3\nhttps://leetcode.com/problems/shortest-palindrome/,Shortest Palindrome,Microsoft,3\nhttps://leetcode.com/problems/shortest-palindrome/,Shortest Palindrome,Apple,2\nhttps://leetcode.com/problems/house-robber-ii/,House Robber II,Google,9\nhttps://leetcode.com/problems/house-robber-ii/,House Robber II,Amazon,4\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Uber,36\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Amazon,31\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Cisco,16\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Microsoft,7\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Facebook,5\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Snapchat,5\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Google,5\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Twitter,5\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Karat,5\nhttps://leetcode.com/problems/word-search-ii/,Word Search II,Apple,4\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,Facebook,7\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,Amazon,7\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,Microsoft,4\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,Apple,2\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,Google,2\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,ByteDance,2\nhttps://leetcode.com/problems/add-and-search-word-data-structure-design/,Add and Search Word - Data structure design,Nvidia,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Amazon,34\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Google,11\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Microsoft,10\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Robinhood,7\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Facebook,5\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Apple,5\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Roblox,5\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Twilio,5\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Wayfair,4\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Karat,4\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,VMware,4\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Salesforce,3\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,ByteDance,3\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,Uber,2\nhttps://leetcode.com/problems/course-schedule-ii/,Course Schedule II,tiktok,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Facebook,8\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Amazon,6\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Microsoft,4\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Bloomberg,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Goldman Sachs,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Google,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Apple,2\nhttps://leetcode.com/problems/minimum-size-subarray-sum/,Minimum Size Subarray Sum,Arcesium,2\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Amazon,15\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Google,9\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Twitter,6\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Microsoft,5\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Snapchat,4\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Apple,3\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Facebook,2\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,Oracle,2\nhttps://leetcode.com/problems/implement-trie-prefix-tree/,Implement Trie,ByteDance,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Amazon,28\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Microsoft,10\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Facebook,9\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,tiktok,7\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Google,5\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Apple,3\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Uber,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Bloomberg,2\nhttps://leetcode.com/problems/course-schedule/,Course Schedule,Oracle,2\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Amazon,12\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Microsoft,10\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Apple,6\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Bloomberg,4\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Facebook,4\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Google,3\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Yandex,3\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Intuit,2\nhttps://leetcode.com/problems/reverse-linked-list/,Reverse Linked List,Nvidia,2\nhttps://leetcode.com/problems/isomorphic-strings/,Isomorphic Strings,Amazon,7\nhttps://leetcode.com/problems/isomorphic-strings/,Isomorphic Strings,LinkedIn,6\nhttps://leetcode.com/problems/isomorphic-strings/,Isomorphic Strings,Google,3\nhttps://leetcode.com/problems/count-primes/,Count Primes,Capital One,14\nhttps://leetcode.com/problems/count-primes/,Count Primes,Microsoft,4\nhttps://leetcode.com/problems/count-primes/,Count Primes,Amazon,4\nhttps://leetcode.com/problems/count-primes/,Count Primes,Apple,2\nhttps://leetcode.com/problems/count-primes/,Count Primes,Adobe,2\nhttps://leetcode.com/problems/count-primes/,Count Primes,SAP,2\nhttps://leetcode.com/problems/count-primes/,Count Primes,tiktok,2\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,Amazon,4\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,Microsoft,3\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,Facebook,2\nhttps://leetcode.com/problems/remove-linked-list-elements/,Remove Linked List Elements,Adobe,2\nhttps://leetcode.com/problems/happy-number/,Happy Number,Google,22\nhttps://leetcode.com/problems/happy-number/,Happy Number,Apple,7\nhttps://leetcode.com/problems/happy-number/,Happy Number,Amazon,6\nhttps://leetcode.com/problems/happy-number/,Happy Number,Adobe,4\nhttps://leetcode.com/problems/happy-number/,Happy Number,Paypal,4\nhttps://leetcode.com/problems/happy-number/,Happy Number,Uber,3\nhttps://leetcode.com/problems/bitwise-and-of-numbers-range/,Bitwise AND of Numbers Range,Adobe,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Amazon,103\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Microsoft,42\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Facebook,34\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Bloomberg,33\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Google,21\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,LinkedIn,16\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Apple,11\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Oracle,9\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Uber,7\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Salesforce,6\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,ByteDance,6\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,tiktok,6\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,DoorDash,5\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Docusign,5\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,SAP,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Karat,4\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Adobe,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Qualtrics,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Goldman Sachs,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Paypal,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Nvidia,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,VMware,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,ServiceNow,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Shopee,3\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,eBay,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Snapchat,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Dropbox,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Square,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Twitch,2\nhttps://leetcode.com/problems/number-of-islands/,Number of Islands,Cruise Automation,2\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Facebook,108\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Amazon,10\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Bloomberg,4\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Qualtrics,4\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Oracle,3\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Apple,2\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Uber,2\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,Microsoft,2\nhttps://leetcode.com/problems/binary-tree-right-side-view/,Binary Tree Right Side View,DoorDash,2\nhttps://leetcode.com/problems/house-robber/,House Robber,Amazon,21\nhttps://leetcode.com/problems/house-robber/,House Robber,Apple,8\nhttps://leetcode.com/problems/house-robber/,House Robber,Google,7\nhttps://leetcode.com/problems/house-robber/,House Robber,Cisco,6\nhttps://leetcode.com/problems/house-robber/,House Robber,Microsoft,5\nhttps://leetcode.com/problems/house-robber/,House Robber,Adobe,4\nhttps://leetcode.com/problems/house-robber/,House Robber,Bloomberg,2\nhttps://leetcode.com/problems/house-robber/,House Robber,Facebook,2\nhttps://leetcode.com/problems/house-robber/,House Robber,Walmart Global Tech,2\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,Box,12\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,Facebook,4\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,Cisco,4\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,Amazon,3\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,Google,2\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,Oracle,2\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,Apple,3\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,Facebook,3\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,Qualcomm,3\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,Microsoft,2\nhttps://leetcode.com/problems/reverse-bits/,Reverse Bits,Google,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,Amazon,9\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,Microsoft,7\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,Google,4\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,Facebook,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,Yahoo,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,tcs,2\nhttps://leetcode.com/problems/rotate-array/,Rotate Array,Salesforce,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,Amazon,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,Apple,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,Nvidia,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,Google,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/,Best Time to Buy and Sell Stock IV,Citadel,2\nhttps://leetcode.com/problems/repeated-dna-sequences/,Repeated DNA Sequences,LinkedIn,5\nhttps://leetcode.com/problems/repeated-dna-sequences/,Repeated DNA Sequences,Amazon,2\nhttps://leetcode.com/problems/reverse-words-in-a-string-ii/,Reverse Words in a String II,Microsoft,4\nhttps://leetcode.com/problems/largest-number/,Largest Number,Salesforce,6\nhttps://leetcode.com/problems/largest-number/,Largest Number,Microsoft,4\nhttps://leetcode.com/problems/largest-number/,Largest Number,Facebook,3\nhttps://leetcode.com/problems/largest-number/,Largest Number,Amazon,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,Apple,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,Adobe,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,Goldman Sachs,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,Visa,2\nhttps://leetcode.com/problems/largest-number/,Largest Number,Oracle,2\nhttps://leetcode.com/problems/dungeon-game/,Dungeon Game,Uber,12\nhttps://leetcode.com/problems/dungeon-game/,Dungeon Game,Amazon,2\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,Facebook,50\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,Microsoft,9\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,Amazon,4\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,Bloomberg,4\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,Salesforce,3\nhttps://leetcode.com/problems/binary-search-tree-iterator/,Binary Search Tree Iterator,Google,2\nhttps://leetcode.com/problems/factorial-trailing-zeroes/,Factorial Trailing Zeroes,Amazon,4\nhttps://leetcode.com/problems/factorial-trailing-zeroes/,Factorial Trailing Zeroes,Oracle,2\nhttps://leetcode.com/problems/excel-sheet-column-number/,Excel Sheet Column Number,Microsoft,6\nhttps://leetcode.com/problems/excel-sheet-column-number/,Excel Sheet Column Number,Google,2\nhttps://leetcode.com/problems/excel-sheet-column-number/,Excel Sheet Column Number,Apple,2\nhttps://leetcode.com/problems/two-sum-iii-data-structure-design/,Two Sum III - Data structure design,LinkedIn,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,Amazon,9\nhttps://leetcode.com/problems/majority-element/,Majority Element,Microsoft,6\nhttps://leetcode.com/problems/majority-element/,Majority Element,Adobe,5\nhttps://leetcode.com/problems/majority-element/,Majority Element,Apple,4\nhttps://leetcode.com/problems/majority-element/,Majority Element,Google,3\nhttps://leetcode.com/problems/majority-element/,Majority Element,Bloomberg,3\nhttps://leetcode.com/problems/majority-element/,Majority Element,Facebook,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,Uber,2\nhttps://leetcode.com/problems/majority-element/,Majority Element,Rubrik,2\nhttps://leetcode.com/problems/excel-sheet-column-title/,Excel Sheet Column Title,Microsoft,4\nhttps://leetcode.com/problems/excel-sheet-column-title/,Excel Sheet Column Title,Google,2\nhttps://leetcode.com/problems/excel-sheet-column-title/,Excel Sheet Column Title,Amazon,2\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,Amazon,11\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,Adobe,5\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,Google,4\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,Apple,3\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,Microsoft,2\nhttps://leetcode.com/problems/two-sum-ii-input-array-is-sorted/,Two Sum II - Input array is sorted,Yahoo,2\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,Mathworks,5\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,Facebook,4\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,Goldman Sachs,3\nhttps://leetcode.com/problems/fraction-to-recurring-decimal/,Fraction to Recurring Decimal,Airbnb,3\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,Amazon,7\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,Microsoft,4\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,Arista Networks,2\nhttps://leetcode.com/problems/compare-version-numbers/,Compare Version Numbers,Nutanix,2\nhttps://leetcode.com/problems/maximum-gap/,Maximum Gap,Amazon,2\nhttps://leetcode.com/problems/maximum-gap/,Maximum Gap,Facebook,2\nhttps://leetcode.com/problems/missing-ranges/,Missing Ranges,Facebook,8\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Facebook,82\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Amazon,8\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Google,7\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Uber,5\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Snapchat,4\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,HRT,3\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Apple,2\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Microsoft,2\nhttps://leetcode.com/problems/find-peak-element/,Find Peak Element,Roblox,2\nhttps://leetcode.com/problems/one-edit-distance/,One Edit Distance,Facebook,7\nhttps://leetcode.com/problems/one-edit-distance/,One Edit Distance,Google,5\nhttps://leetcode.com/problems/one-edit-distance/,One Edit Distance,Yahoo,2\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,Microsoft,8\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,Amazon,8\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,LinkedIn,6\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,Facebook,4\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,Adobe,3\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,Nvidia,3\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,tiktok,3\nhttps://leetcode.com/problems/intersection-of-two-linked-lists/,Intersection of Two Linked Lists,Airbnb,2\nhttps://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/,Longest Substring with At Most Two Distinct Characters,Amazon,4\nhttps://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/,Longest Substring with At Most Two Distinct Characters,Microsoft,2\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,Lyft,8\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,Google,4\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,Facebook,2\nhttps://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/,Read N Characters Given Read4 II - Call multiple times,Microsoft,2\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,Microsoft,4\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,Facebook,3\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,Rubrik,2\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,Amazon,2\nhttps://leetcode.com/problems/read-n-characters-given-read4/,Read N Characters Given Read4,Lyft,2\nhttps://leetcode.com/problems/binary-tree-upside-down/,Binary Tree Upside Down,LinkedIn,9\nhttps://leetcode.com/problems/min-stack/,Min Stack,Amazon,18\nhttps://leetcode.com/problems/min-stack/,Min Stack,Microsoft,10\nhttps://leetcode.com/problems/min-stack/,Min Stack,Bloomberg,7\nhttps://leetcode.com/problems/min-stack/,Min Stack,Facebook,4\nhttps://leetcode.com/problems/min-stack/,Min Stack,Google,3\nhttps://leetcode.com/problems/min-stack/,Min Stack,Salesforce,3\nhttps://leetcode.com/problems/min-stack/,Min Stack,Adobe,2\nhttps://leetcode.com/problems/min-stack/,Min Stack,Oracle,2\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/,Find Minimum in Rotated Sorted Array II,Google,2\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Amazon,8\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Facebook,8\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Microsoft,7\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Adobe,3\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Goldman Sachs,2\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Uber,2\nhttps://leetcode.com/problems/find-minimum-in-rotated-sorted-array/,Find Minimum in Rotated Sorted Array,Oracle,2\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,LinkedIn,29\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,Amazon,17\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,Microsoft,3\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,Bloomberg,3\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,Infosys,3\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,Google,2\nhttps://leetcode.com/problems/maximum-product-subarray/,Maximum Product Subarray,Adobe,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,Microsoft,34\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,Apple,3\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,LinkedIn,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,Amazon,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,Google,2\nhttps://leetcode.com/problems/reverse-words-in-a-string/,Reverse Words in a String,Visa,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,Google,73\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,LinkedIn,8\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,Amazon,6\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,Microsoft,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,Facebook,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,Oracle,2\nhttps://leetcode.com/problems/evaluate-reverse-polish-notation/,Evaluate Reverse Polish Notation,Yandex,2\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,LinkedIn,8\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,Amazon,4\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,Google,3\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,Oracle,3\nhttps://leetcode.com/problems/max-points-on-a-line/,Max Points on a Line,Sprinklr,2\nhttps://leetcode.com/problems/sort-list/,Sort List,Facebook,6\nhttps://leetcode.com/problems/sort-list/,Sort List,Microsoft,3\nhttps://leetcode.com/problems/sort-list/,Sort List,Amazon,3\nhttps://leetcode.com/problems/sort-list/,Sort List,ByteDance,3\nhttps://leetcode.com/problems/sort-list/,Sort List,Apple,2\nhttps://leetcode.com/problems/insertion-sort-list/,Insertion Sort List,Google,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Amazon,117\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Facebook,60\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Microsoft,52\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Apple,20\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Bloomberg,19\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Oracle,13\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Salesforce,10\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Google,9\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Intuit,8\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Twilio,7\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Goldman Sachs,6\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,tiktok,6\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,LinkedIn,5\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,ByteDance,5\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Adobe,4\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Walmart Global Tech,4\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Yahoo,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Snapchat,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Nvidia,3\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,VMware,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Uber,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Paypal,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,GoDaddy,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Morgan Stanley,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Docusign,2\nhttps://leetcode.com/problems/lru-cache/,LRU Cache,Shopee,2\nhttps://leetcode.com/problems/binary-tree-postorder-traversal/,Binary Tree Postorder Traversal,Facebook,2\nhttps://leetcode.com/problems/binary-tree-postorder-traversal/,Binary Tree Postorder Traversal,TuSimple,2\nhttps://leetcode.com/problems/binary-tree-preorder-traversal/,Binary Tree Preorder Traversal,Adobe,2\nhttps://leetcode.com/problems/binary-tree-preorder-traversal/,Binary Tree Preorder Traversal,Google,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Amazon,10\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Microsoft,4\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Adobe,3\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Facebook,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Bloomberg,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Uber,2\nhttps://leetcode.com/problems/reorder-list/,Reorder List,Samsung,2\nhttps://leetcode.com/problems/linked-list-cycle-ii/,Linked List Cycle II,Amazon,7\nhttps://leetcode.com/problems/linked-list-cycle-ii/,Linked List Cycle II,Microsoft,2\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Amazon,9\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Spotify,4\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Microsoft,3\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Oracle,3\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Visa,3\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Google,2\nhttps://leetcode.com/problems/linked-list-cycle/,Linked List Cycle,Goldman Sachs,2\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Facebook,22\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Amazon,11\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Bloomberg,7\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Apple,4\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Adobe,4\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Google,3\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Microsoft,3\nhttps://leetcode.com/problems/word-break-ii/,Word Break II,Snapchat,3\nhttps://leetcode.com/problems/word-break/,Word Break,Amazon,34\nhttps://leetcode.com/problems/word-break/,Word Break,Facebook,33\nhttps://leetcode.com/problems/word-break/,Word Break,Apple,10\nhttps://leetcode.com/problems/word-break/,Word Break,Qualtrics,7\nhttps://leetcode.com/problems/word-break/,Word Break,Microsoft,5\nhttps://leetcode.com/problems/word-break/,Word Break,Bloomberg,5\nhttps://leetcode.com/problems/word-break/,Word Break,Oracle,3\nhttps://leetcode.com/problems/word-break/,Word Break,Adobe,3\nhttps://leetcode.com/problems/word-break/,Word Break,Google,2\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,Facebook,64\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,Amazon,19\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,Microsoft,12\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,Bloomberg,3\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,Google,3\nhttps://leetcode.com/problems/copy-list-with-random-pointer/,Copy List with Random Pointer,Apple,2\nhttps://leetcode.com/problems/single-number-ii/,Single Number II,Amazon,5\nhttps://leetcode.com/problems/single-number/,Single Number,Amazon,8\nhttps://leetcode.com/problems/single-number/,Single Number,Microsoft,5\nhttps://leetcode.com/problems/single-number/,Single Number,Bloomberg,5\nhttps://leetcode.com/problems/single-number/,Single Number,Google,4\nhttps://leetcode.com/problems/single-number/,Single Number,Adobe,4\nhttps://leetcode.com/problems/single-number/,Single Number,Apple,4\nhttps://leetcode.com/problems/single-number/,Single Number,Facebook,4\nhttps://leetcode.com/problems/single-number/,Single Number,Uber,2\nhttps://leetcode.com/problems/single-number/,Single Number,Atlassian,2\nhttps://leetcode.com/problems/candy/,Candy,Amazon,8\nhttps://leetcode.com/problems/gas-station/,Gas Station,Amazon,19\nhttps://leetcode.com/problems/gas-station/,Gas Station,IBM,8\nhttps://leetcode.com/problems/gas-station/,Gas Station,Microsoft,7\nhttps://leetcode.com/problems/gas-station/,Gas Station,Apple,5\nhttps://leetcode.com/problems/gas-station/,Gas Station,tiktok,5\nhttps://leetcode.com/problems/gas-station/,Gas Station,Walmart Global Tech,3\nhttps://leetcode.com/problems/gas-station/,Gas Station,Bloomberg,3\nhttps://leetcode.com/problems/gas-station/,Gas Station,Adobe,3\nhttps://leetcode.com/problems/gas-station/,Gas Station,Uber,2\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,Facebook,38\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,Amazon,8\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,Bloomberg,6\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,Google,5\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,Microsoft,4\nhttps://leetcode.com/problems/clone-graph/,Clone Graph,Pinterest,2\nhttps://leetcode.com/problems/palindrome-partitioning-ii/,Palindrome Partitioning II,Amazon,2\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,Apple,3\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,Google,3\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,tiktok,3\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,Amazon,2\nhttps://leetcode.com/problems/palindrome-partitioning/,Palindrome Partitioning,Facebook,2\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,Google,5\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,Bloomberg,4\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,Uber,2\nhttps://leetcode.com/problems/surrounded-regions/,Surrounded Regions,tiktok,2\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers/,Sum Root to Leaf Numbers,Facebook,31\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers/,Sum Root to Leaf Numbers,Microsoft,4\nhttps://leetcode.com/problems/sum-root-to-leaf-numbers/,Sum Root to Leaf Numbers,Amazon,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Amazon,9\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Microsoft,8\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Google,7\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Adobe,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Spotify,3\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Bloomberg,2\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Apple,2\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Visa,2\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,Qualtrics,2\nhttps://leetcode.com/problems/longest-consecutive-sequence/,Longest Consecutive Sequence,eBay,2\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Amazon,41\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Facebook,13\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,LinkedIn,7\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Microsoft,6\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Qualtrics,6\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Apple,5\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Snapchat,4\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Lyft,4\nhttps://leetcode.com/problems/word-ladder/,Word Ladder,Adobe,4\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,Amazon,9\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,Box,4\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,Facebook,4\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,Snapchat,3\nhttps://leetcode.com/problems/word-ladder-ii/,Word Ladder II,Microsoft,2\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Facebook,94\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Amazon,8\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Microsoft,8\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Apple,5\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Adobe,3\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Bloomberg,3\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,American Express,3\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Yandex,2\nhttps://leetcode.com/problems/valid-palindrome/,Valid Palindrome,Wayfair,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,DoorDash,18\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Amazon,17\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Facebook,16\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Microsoft,7\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Google,6\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,ByteDance,6\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,tiktok,6\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Oracle,3\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Snapchat,3\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Bloomberg,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Adobe,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Twitter,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Twilio,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,Sprinklr,2\nhttps://leetcode.com/problems/binary-tree-maximum-path-sum/,Binary Tree Maximum Path Sum,TuSimple,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Best Time to Buy and Sell Stock III,Amazon,7\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Best Time to Buy and Sell Stock III,Uber,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/,Best Time to Buy and Sell Stock III,Apple,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Amazon,13\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Facebook,5\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Walmart Global Tech,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Microsoft,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Bloomberg,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Google,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,ByteDance,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/,Best Time to Buy and Sell Stock II,Oracle,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Amazon,56\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Facebook,16\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Microsoft,14\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Bloomberg,12\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Google,12\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Goldman Sachs,11\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Adobe,8\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Apple,8\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Uber,7\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Expedia,5\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Oracle,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Capital One,4\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,JPMorgan,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Walmart Global Tech,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,ByteDance,3\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Paypal,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,VMware,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,eBay,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Cisco,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Salesforce,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Atlassian,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,ServiceNow,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Visa,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Docusign,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Alation,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,tcs,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,tiktok,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Zoho,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Netflix,2\nhttps://leetcode.com/problems/best-time-to-buy-and-sell-stock/,Best Time to Buy and Sell Stock,Zoom,2\nhttps://leetcode.com/problems/triangle/,Triangle,Amazon,4\nhttps://leetcode.com/problems/triangle/,Triangle,Microsoft,3\nhttps://leetcode.com/problems/pascals-triangle-ii/,Pascal's Triangle II,Microsoft,2\nhttps://leetcode.com/problems/pascals-triangle-ii/,Pascal's Triangle II,Goldman Sachs,2\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Amazon,5\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Apple,4\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Microsoft,4\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Goldman Sachs,3\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Snapchat,2\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Uber,2\nhttps://leetcode.com/problems/pascals-triangle/,Pascal's Triangle,Yahoo,2\nhttps://leetcode.com/problems/distinct-subsequences/,Distinct Subsequences,Amazon,4\nhttps://leetcode.com/problems/distinct-subsequences/,Distinct Subsequences,Mathworks,3\nhttps://leetcode.com/problems/distinct-subsequences/,Distinct Subsequences,Google,2\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,Facebook,10\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,Amazon,6\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,Microsoft,6\nhttps://leetcode.com/problems/flatten-binary-tree-to-linked-list/,Flatten Binary Tree to Linked List,Salesforce,2\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,Amazon,5\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,Facebook,4\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,Google,3\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,Microsoft,2\nhttps://leetcode.com/problems/path-sum-ii/,Path Sum II,Oracle,2\nhttps://leetcode.com/problems/path-sum/,Path Sum,Facebook,8\nhttps://leetcode.com/problems/path-sum/,Path Sum,Microsoft,7\nhttps://leetcode.com/problems/path-sum/,Path Sum,Amazon,2\nhttps://leetcode.com/problems/path-sum/,Path Sum,Oracle,2\nhttps://leetcode.com/problems/path-sum/,Path Sum,Walmart Global Tech,2\nhttps://leetcode.com/problems/minimum-depth-of-binary-tree/,Minimum Depth of Binary Tree,Facebook,4\nhttps://leetcode.com/problems/minimum-depth-of-binary-tree/,Minimum Depth of Binary Tree,Bloomberg,2\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,Amazon,5\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,Spotify,4\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,Facebook,2\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,Google,2\nhttps://leetcode.com/problems/balanced-binary-tree/,Balanced Binary Tree,Adobe,2\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,Facebook,11\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,Amazon,7\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,Microsoft,3\nhttps://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/,Convert Sorted List to Binary Search Tree,Google,2\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,Amazon,3\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,Microsoft,2\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,Apple,2\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,Facebook,2\nhttps://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/,Convert Sorted Array to Binary Search Tree,Oracle,2\nhttps://leetcode.com/problems/binary-tree-level-order-traversal-ii/,Binary Tree Level Order Traversal II,Amazon,2\nhttps://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/,Construct Binary Tree from Inorder and Postorder Traversal,Shopee,3\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,Microsoft,4\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,Bloomberg,3\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,Google,3\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,Amazon,3\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,Uber,2\nhttps://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/,Construct Binary Tree from Preorder and Inorder Traversal,ByteDance,2\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,LinkedIn,10\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Amazon,4\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Spotify,4\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Google,4\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Microsoft,3\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Bloomberg,2\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Apple,2\nhttps://leetcode.com/problems/maximum-depth-of-binary-tree/,Maximum Depth of Binary Tree,Facebook,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Amazon,28\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Facebook,18\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Microsoft,13\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Bloomberg,5\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Google,3\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Apple,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,LinkedIn,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Oracle,2\nhttps://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/,Binary Tree Zigzag Level Order Traversal,Adobe,2\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,LinkedIn,9\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Amazon,8\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Microsoft,7\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Facebook,6\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Bloomberg,6\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Oracle,4\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Google,3\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,ServiceNow,3\nhttps://leetcode.com/problems/binary-tree-level-order-traversal/,Binary Tree Level Order Traversal,Apple,2\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Facebook,12\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Amazon,8\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,LinkedIn,5\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Google,5\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Microsoft,5\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Bloomberg,3\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Uber,2\nhttps://leetcode.com/problems/symmetric-tree/,Symmetric Tree,Adobe,2\nhttps://leetcode.com/problems/same-tree/,Same Tree,LinkedIn,6\nhttps://leetcode.com/problems/same-tree/,Same Tree,Amazon,5\nhttps://leetcode.com/problems/same-tree/,Same Tree,Google,3\nhttps://leetcode.com/problems/same-tree/,Same Tree,Apple,3\nhttps://leetcode.com/problems/same-tree/,Same Tree,Facebook,2\nhttps://leetcode.com/problems/same-tree/,Same Tree,Bloomberg,2\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,Amazon,15\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,Microsoft,4\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,Apple,3\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,Google,2\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,Adobe,2\nhttps://leetcode.com/problems/recover-binary-search-tree/,Recover Binary Search Tree,Bloomberg,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Amazon,25\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Bloomberg,14\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Facebook,8\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Microsoft,6\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Adobe,4\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Qualtrics,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,VMware,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,Oracle,2\nhttps://leetcode.com/problems/validate-binary-search-tree/,Validate Binary Search Tree,tiktok,2\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,Amazon,4\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,Apple,4\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,Google,3\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,Uber,2\nhttps://leetcode.com/problems/interleaving-string/,Interleaving String,Bloomberg,2\nhttps://leetcode.com/problems/unique-binary-search-trees/,Unique Binary Search Trees,Amazon,4\nhttps://leetcode.com/problems/unique-binary-search-trees-ii/,Unique Binary Search Trees II,Microsoft,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,Microsoft,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,Amazon,4\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,Apple,3\nhttps://leetcode.com/problems/binary-tree-inorder-traversal/,Binary Tree Inorder Traversal,Adobe,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,Yahoo,5\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,Amazon,3\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,Microsoft,3\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,tiktok,3\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,Facebook,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,ByteDance,2\nhttps://leetcode.com/problems/restore-ip-addresses/,Restore IP Addresses,Arista Networks,2\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,Facebook,7\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,Microsoft,5\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,Amazon,5\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,Google,3\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,Apple,2\nhttps://leetcode.com/problems/reverse-linked-list-ii/,Reverse Linked List II,Adobe,2\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Amazon,9\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Cisco,9\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Google,8\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Lyft,7\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Facebook,4\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Microsoft,4\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Bloomberg,3\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Apple,3\nhttps://leetcode.com/problems/decode-ways/,Decode Ways,Goldman Sachs,3\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,Facebook,3\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,Amazon,2\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,Bloomberg,2\nhttps://leetcode.com/problems/subsets-ii/,Subsets II,Adobe,2\nhttps://leetcode.com/problems/gray-code/,Gray Code,Amazon,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Facebook,89\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Microsoft,10\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Apple,8\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Amazon,5\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,LinkedIn,5\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Bloomberg,4\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Shopee,4\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Indeed,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Uber,2\nhttps://leetcode.com/problems/merge-sorted-array/,Merge Sorted Array,Oracle,2\nhttps://leetcode.com/problems/scramble-string/,Scramble String,Yahoo,2\nhttps://leetcode.com/problems/partition-list/,Partition List,Adobe,2\nhttps://leetcode.com/problems/maximal-rectangle/,Maximal Rectangle,Google,4\nhttps://leetcode.com/problems/maximal-rectangle/,Maximal Rectangle,Amazon,3\nhttps://leetcode.com/problems/maximal-rectangle/,Maximal Rectangle,Apple,2\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,Amazon,12\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,Microsoft,6\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,Adobe,4\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,Facebook,4\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,Uber,4\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,Bloomberg,2\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,ByteDance,2\nhttps://leetcode.com/problems/largest-rectangle-in-histogram/,Largest Rectangle in Histogram,DoorDash,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,Amazon,6\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,Facebook,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,Bloomberg,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,Adobe,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list/,Remove Duplicates from Sorted List,Microsoft,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Remove Duplicates from Sorted List II,Amazon,6\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Remove Duplicates from Sorted List II,Microsoft,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/,Remove Duplicates from Sorted List II,Facebook,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,Amazon,5\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,LinkedIn,4\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,Adobe,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array-ii/,Search in Rotated Sorted Array II,Facebook,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/,Remove Duplicates from Sorted Array II,Adobe,3\nhttps://leetcode.com/problems/word-search/,Word Search,Amazon,36\nhttps://leetcode.com/problems/word-search/,Word Search,Twitter,23\nhttps://leetcode.com/problems/word-search/,Word Search,Uber,17\nhttps://leetcode.com/problems/word-search/,Word Search,Karat,17\nhttps://leetcode.com/problems/word-search/,Word Search,Microsoft,16\nhttps://leetcode.com/problems/word-search/,Word Search,Bloomberg,14\nhttps://leetcode.com/problems/word-search/,Word Search,Facebook,12\nhttps://leetcode.com/problems/word-search/,Word Search,Indeed,9\nhttps://leetcode.com/problems/word-search/,Word Search,Snapchat,7\nhttps://leetcode.com/problems/subsets/,Subsets,Facebook,38\nhttps://leetcode.com/problems/subsets/,Subsets,Amazon,13\nhttps://leetcode.com/problems/subsets/,Subsets,Google,7\nhttps://leetcode.com/problems/subsets/,Subsets,Bloomberg,4\nhttps://leetcode.com/problems/subsets/,Subsets,Microsoft,3\nhttps://leetcode.com/problems/subsets/,Subsets,Apple,3\nhttps://leetcode.com/problems/subsets/,Subsets,Twitter,3\nhttps://leetcode.com/problems/subsets/,Subsets,Reddit,3\nhttps://leetcode.com/problems/subsets/,Subsets,Adobe,2\nhttps://leetcode.com/problems/subsets/,Subsets,Uber,2\nhttps://leetcode.com/problems/combinations/,Combinations,Facebook,5\nhttps://leetcode.com/problems/combinations/,Combinations,Google,5\nhttps://leetcode.com/problems/combinations/,Combinations,Amazon,2\nhttps://leetcode.com/problems/combinations/,Combinations,Microsoft,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Facebook,20\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Amazon,11\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,LinkedIn,10\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Lyft,9\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Microsoft,7\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Airbnb,6\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Apple,4\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Adobe,3\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Snapchat,2\nhttps://leetcode.com/problems/minimum-window-substring/,Minimum Window Substring,Oracle,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Microsoft,8\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Amazon,8\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,VMware,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Adobe,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Salesforce,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Nvidia,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Grab,3\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Uber,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Facebook,2\nhttps://leetcode.com/problems/sort-colors/,Sort Colors,Intel,2\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Facebook,14\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Amazon,12\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Microsoft,7\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Bloomberg,5\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Apple,4\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Adobe,3\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Goldman Sachs,2\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Oracle,2\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Nvidia,2\nhttps://leetcode.com/problems/search-a-2d-matrix/,Search a 2D Matrix,Salesforce,2\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,Microsoft,8\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,Amazon,6\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,Facebook,5\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,Apple,4\nhttps://leetcode.com/problems/set-matrix-zeroes/,Set Matrix Zeroes,Bloomberg,3\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Amazon,8\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,LinkedIn,7\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Microsoft,6\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Google,4\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Apple,3\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Bloomberg,2\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Facebook,2\nhttps://leetcode.com/problems/edit-distance/,Edit Distance,Rubrik,2\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,Facebook,112\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,Amazon,8\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,Google,5\nhttps://leetcode.com/problems/simplify-path/,Simplify Path,Apple,3\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Amazon,14\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Expedia,7\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Microsoft,7\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Uber,4\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Google,4\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Adobe,3\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Yahoo,3\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Goldman Sachs,2\nhttps://leetcode.com/problems/climbing-stairs/,Climbing Stairs,Bloomberg,2\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),LinkedIn,9\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),Amazon,9\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),Apple,5\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),Google,4\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),Adobe,4\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),Microsoft,3\nhttps://leetcode.com/problems/sqrtx/,Sqrt(x),Bloomberg,2\nhttps://leetcode.com/problems/text-justification/,Text Justification,Google,24\nhttps://leetcode.com/problems/text-justification/,Text Justification,LinkedIn,18\nhttps://leetcode.com/problems/text-justification/,Text Justification,Karat,10\nhttps://leetcode.com/problems/text-justification/,Text Justification,Uber,6\nhttps://leetcode.com/problems/text-justification/,Text Justification,Facebook,4\nhttps://leetcode.com/problems/text-justification/,Text Justification,Square,3\nhttps://leetcode.com/problems/text-justification/,Text Justification,Apple,3\nhttps://leetcode.com/problems/text-justification/,Text Justification,Reddit,3\nhttps://leetcode.com/problems/text-justification/,Text Justification,Twilio,3\nhttps://leetcode.com/problems/text-justification/,Text Justification,Indeed,3\nhttps://leetcode.com/problems/add-binary/,Add Binary,Facebook,10\nhttps://leetcode.com/problems/add-binary/,Add Binary,Amazon,6\nhttps://leetcode.com/problems/add-binary/,Add Binary,Snapchat,3\nhttps://leetcode.com/problems/add-binary/,Add Binary,Google,2\nhttps://leetcode.com/problems/add-binary/,Add Binary,Adobe,2\nhttps://leetcode.com/problems/add-binary/,Add Binary,Uber,2\nhttps://leetcode.com/problems/plus-one/,Plus One,Facebook,11\nhttps://leetcode.com/problems/plus-one/,Plus One,Google,5\nhttps://leetcode.com/problems/plus-one/,Plus One,Amazon,5\nhttps://leetcode.com/problems/plus-one/,Plus One,Adobe,2\nhttps://leetcode.com/problems/plus-one/,Plus One,Apple,2\nhttps://leetcode.com/problems/plus-one/,Plus One,ByteDance,2\nhttps://leetcode.com/problems/valid-number/,Valid Number,Facebook,53\nhttps://leetcode.com/problems/valid-number/,Valid Number,LinkedIn,10\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Amazon,7\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Microsoft,5\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Google,4\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Goldman Sachs,3\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Oracle,3\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Apple,3\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Uber,2\nhttps://leetcode.com/problems/minimum-path-sum/,Minimum Path Sum,Square,2\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Cruise Automation,9\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Facebook,8\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Amazon,7\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Qualtrics,4\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Google,3\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Cisco,3\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Microsoft,2\nhttps://leetcode.com/problems/unique-paths-ii/,Unique Paths II,Oracle,2\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Google,15\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Facebook,11\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Microsoft,9\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Amazon,8\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Apple,7\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Bloomberg,4\nhttps://leetcode.com/problems/unique-paths/,Unique Paths,Adobe,4\nhttps://leetcode.com/problems/rotate-list/,Rotate List,Microsoft,4\nhttps://leetcode.com/problems/rotate-list/,Rotate List,Bloomberg,3\nhttps://leetcode.com/problems/permutation-sequence/,Permutation Sequence,Facebook,2\nhttps://leetcode.com/problems/permutation-sequence/,Permutation Sequence,Adobe,2\nhttps://leetcode.com/problems/spiral-matrix-ii/,Spiral Matrix II,tiktok,6\nhttps://leetcode.com/problems/spiral-matrix-ii/,Spiral Matrix II,Apple,4\nhttps://leetcode.com/problems/spiral-matrix-ii/,Spiral Matrix II,Amazon,2\nhttps://leetcode.com/problems/length-of-last-word/,Length of Last Word,Amazon,3\nhttps://leetcode.com/problems/length-of-last-word/,Length of Last Word,Microsoft,2\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,Google,11\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,LinkedIn,9\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,Facebook,5\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,Amazon,5\nhttps://leetcode.com/problems/insert-interval/,Insert Intervals,Robinhood,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Facebook,110\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Amazon,87\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Google,28\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Bloomberg,20\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Salesforce,19\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Apple,18\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Microsoft,15\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Uber,14\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Adobe,8\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,IBM,8\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,LinkedIn,7\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Snapchat,5\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Walmart Global Tech,5\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,VMware,5\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Oracle,4\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Yandex,4\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Shopee,4\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Twitter,3\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Cisco,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Intuit,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Nvidia,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,Morgan Stanley,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,ByteDance,2\nhttps://leetcode.com/problems/merge-intervals/,Merge Intervals,tiktok,2\nhttps://leetcode.com/problems/jump-game/,Jump Game,Amazon,20\nhttps://leetcode.com/problems/jump-game/,Jump Game,Facebook,8\nhttps://leetcode.com/problems/jump-game/,Jump Game,Apple,3\nhttps://leetcode.com/problems/jump-game/,Jump Game,DoorDash,3\nhttps://leetcode.com/problems/jump-game/,Jump Game,Flipkart,3\nhttps://leetcode.com/problems/jump-game/,Jump Game,Google,2\nhttps://leetcode.com/problems/jump-game/,Jump Game,Bloomberg,2\nhttps://leetcode.com/problems/jump-game/,Jump Game,Qualtrics,2\nhttps://leetcode.com/problems/jump-game/,Jump Game,Salesforce,2\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Microsoft,26\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Amazon,13\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Apple,11\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Facebook,10\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Google,8\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Adobe,3\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,LiveRamp,3\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Zillow,2\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,Uber,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,LinkedIn,43\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Amazon,35\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Apple,17\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Microsoft,15\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Adobe,12\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Google,11\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Facebook,11\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Cisco,11\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,JPMorgan,5\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Shopee,5\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Bloomberg,4\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Uber,4\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,VMware,4\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Oracle,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Salesforce,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,ByteDance,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Docusign,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Samsung,3\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Goldman Sachs,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,ServiceNow,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Walmart Global Tech,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,PayTM,2\nhttps://leetcode.com/problems/maximum-subarray/,Maximum Subarray,Infosys,2\nhttps://leetcode.com/problems/n-queens-ii/,N-Queens II,ByteDance,2\nhttps://leetcode.com/problems/n-queens-ii/,N-Queens II,Zenefits,1\nhttps://leetcode.com/problems/n-queens/,N-Queens,Amazon,7\nhttps://leetcode.com/problems/n-queens/,N-Queens,Facebook,4\nhttps://leetcode.com/problems/n-queens/,N-Queens,Microsoft,4\nhttps://leetcode.com/problems/n-queens/,N-Queens,Google,3\nhttps://leetcode.com/problems/n-queens/,N-Queens,Bloomberg,3\nhttps://leetcode.com/problems/n-queens/,N-Queens,Adobe,3\nhttps://leetcode.com/problems/n-queens/,N-Queens,ByteDance,3\nhttps://leetcode.com/problems/n-queens/,N-Queens,tiktok,2\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Facebook,162\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Amazon,9\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Bloomberg,8\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",LinkedIn,7\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Google,5\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Microsoft,5\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Apple,5\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Adobe,3\nhttps://leetcode.com/problems/powx-n/,\"Pow(x, n)\",Yahoo,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Amazon,51\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Microsoft,29\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Facebook,17\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Apple,11\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,JPMorgan,8\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,BlackRock,6\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Google,5\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Walmart Global Tech,5\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,eBay,4\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Adobe,4\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Affirm,4\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Oracle,4\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Uber,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Salesforce,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Twilio,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Visa,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,ServiceNow,3\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Yahoo,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Goldman Sachs,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,VMware,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Alation,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,IBM,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,Cisco,2\nhttps://leetcode.com/problems/group-anagrams/,Group Anagrams,tiktok,2\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Cisco,16\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Facebook,12\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Microsoft,9\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Amazon,8\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Apple,8\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Adobe,5\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Google,4\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Bloomberg,3\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Rubrik,2\nhttps://leetcode.com/problems/rotate-image/,Rotate Image,Uber,2\nhttps://leetcode.com/problems/permutations-ii/,Permutations II,Amazon,4\nhttps://leetcode.com/problems/permutations-ii/,Permutations II,Microsoft,3\nhttps://leetcode.com/problems/permutations/,Permutations,Amazon,9\nhttps://leetcode.com/problems/permutations/,Permutations,Facebook,7\nhttps://leetcode.com/problems/permutations/,Permutations,LinkedIn,6\nhttps://leetcode.com/problems/permutations/,Permutations,Google,5\nhttps://leetcode.com/problems/permutations/,Permutations,Microsoft,5\nhttps://leetcode.com/problems/permutations/,Permutations,Apple,4\nhttps://leetcode.com/problems/permutations/,Permutations,Adobe,3\nhttps://leetcode.com/problems/permutations/,Permutations,Bloomberg,2\nhttps://leetcode.com/problems/permutations/,Permutations,Goldman Sachs,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Amazon,13\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Apple,4\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Bloomberg,3\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Google,3\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,DoorDash,3\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,tiktok,3\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Microsoft,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Adobe,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,Tesla,2\nhttps://leetcode.com/problems/jump-game-ii/,Jump Game II,payu,2\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,Microsoft,14\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,Amazon,5\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,Google,4\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,Facebook,2\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,Uber,2\nhttps://leetcode.com/problems/wildcard-matching/,Wildcard Matching,Coursera,2\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,Facebook,14\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,Microsoft,12\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,Amazon,5\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,Google,5\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,Two Sigma,4\nhttps://leetcode.com/problems/multiply-strings/,Multiply Strings,Adobe,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Amazon,45\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Goldman Sachs,38\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Facebook,34\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Bloomberg,15\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Microsoft,9\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Google,8\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Apple,8\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Adobe,7\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Uber,5\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Qualtrics,4\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Rubrik,4\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Snapchat,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Intel,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Oracle,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Paypal,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Tesla,3\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Intuit,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Citadel,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Visa,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,ServiceNow,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,National Instruments,2\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,Sapient,2\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Amazon,20\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Microsoft,16\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Adobe,8\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Google,5\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Facebook,4\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Databricks,2\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Grab,2\nhttps://leetcode.com/problems/first-missing-positive/,First Missing Positive,Walmart Global Tech,2\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,Facebook,4\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,Amazon,4\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,Reddit,3\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,Bloomberg,2\nhttps://leetcode.com/problems/combination-sum-ii/,Combination Sum II,Oracle,2\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Amazon,18\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Facebook,12\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Microsoft,6\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Airbnb,5\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Apple,4\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Adobe,3\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,Bloomberg,3\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,LinkedIn,3\nhttps://leetcode.com/problems/combination-sum/,Combination Sum,ByteDance,3\nhttps://leetcode.com/problems/count-and-say/,Count and Say,Facebook,5\nhttps://leetcode.com/problems/count-and-say/,Count and Say,Google,3\nhttps://leetcode.com/problems/count-and-say/,Count and Say,Amazon,2\nhttps://leetcode.com/problems/count-and-say/,Count and Say,Apple,2\nhttps://leetcode.com/problems/count-and-say/,Count and Say,Adobe,2\nhttps://leetcode.com/problems/count-and-say/,Count and Say,Walmart Global Tech,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Amazon,7\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Apple,6\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Microsoft,5\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Google,5\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,DoorDash,4\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Intuit,4\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Adobe,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Uber,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,tiktok,3\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Facebook,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Salesforce,2\nhttps://leetcode.com/problems/sudoku-solver/,Sudoku Solver,Nutanix,2\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Amazon,19\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Microsoft,8\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Uber,5\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Cruise Automation,5\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Apple,4\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Facebook,4\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Karat,3\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Wayfair,3\nhttps://leetcode.com/problems/valid-sudoku/,Valid Sudoku,Nvidia,3\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Amazon,9\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Apple,7\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Adobe,7\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Google,4\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Bloomberg,3\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Uber,2\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,Facebook,2\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,VMware,2\nhttps://leetcode.com/problems/search-insert-position/,Search Insert Position,tiktok,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Amazon,31\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Facebook,30\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Microsoft,24\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,LinkedIn,17\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Apple,7\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Bloomberg,7\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Adobe,7\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,ByteDance,6\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Walmart Global Tech,5\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Oracle,5\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,tiktok,4\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,VMware,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Google,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Visa,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,ServiceNow,3\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Expedia,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Nvidia,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Salesforce,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Goldman Sachs,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Morgan Stanley,2\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sorted Array,Splunk,2\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,Amazon,9\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,Facebook,4\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,Morgan Stanley,4\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,ByteDance,3\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,Microsoft,2\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,Oracle,2\nhttps://leetcode.com/problems/longest-valid-parentheses/,Longest Valid Parentheses,VMware,2\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,Amazon,3\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,Oracle,3\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,Google,2\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,Apple,2\nhttps://leetcode.com/problems/substring-with-concatenation-of-all-words/,Substring with Concatenation of All Words,Microsoft,2\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Facebook,11\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Amazon,9\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Google,5\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Microsoft,3\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Yahoo,2\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Bloomberg,2\nhttps://leetcode.com/problems/divide-two-integers/,Divide Two Integers,Adobe,2\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),Amazon,7\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),Microsoft,4\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),Google,4\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),Facebook,3\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),Apple,2\nhttps://leetcode.com/problems/implement-strstr/,Implement strStr(),Uber,2\nhttps://leetcode.com/problems/remove-element/,Remove Element,Amazon,5\nhttps://leetcode.com/problems/remove-element/,Remove Element,Apple,4\nhttps://leetcode.com/problems/remove-element/,Remove Element,Adobe,2\nhttps://leetcode.com/problems/remove-element/,Remove Element,Google,2\nhttps://leetcode.com/problems/remove-element/,Remove Element,Microsoft,2\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Facebook,16\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Amazon,9\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Adobe,7\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Microsoft,6\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,LinkedIn,5\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Bloomberg,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Google,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,Apple,4\nhttps://leetcode.com/problems/remove-duplicates-from-sorted-array/,Remove Duplicates from Sorted Array,VMware,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Amazon,14\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Microsoft,13\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Capital One,13\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Facebook,5\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Google,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Bloomberg,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Yahoo,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,ByteDance,2\nhttps://leetcode.com/problems/reverse-nodes-in-k-group/,Reverse Nodes in k-Group,Zoom,2\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,Facebook,9\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,Amazon,8\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,Microsoft,7\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,Bloomberg,2\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,Adobe,2\nhttps://leetcode.com/problems/swap-nodes-in-pairs/,Swap Nodes in Pairs,Apple,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Facebook,59\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Amazon,47\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Microsoft,17\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Apple,8\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Google,8\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,ByteDance,8\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,VMware,4\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Adobe,4\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Indeed,3\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,LinkedIn,3\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Oracle,3\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Yandex,3\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Bloomberg,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Walmart Global Tech,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Shopee,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,tiktok,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,Sprinklr,2\nhttps://leetcode.com/problems/merge-k-sorted-lists/,Merge k Sorted Lists,TuSimple,2\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Facebook,16\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Amazon,15\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Microsoft,13\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Apple,9\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Adobe,4\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Google,4\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Bloomberg,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Uber,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,C3 IoT,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Walmart Global Tech,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Oracle,3\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,ByteDance,2\nhttps://leetcode.com/problems/generate-parentheses/,Generate Parentheses,Tesla,2\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Amazon,20\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Microsoft,13\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Facebook,13\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Adobe,11\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Oracle,4\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Uber,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Google,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Bloomberg,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Shopee,3\nhttps://leetcode.com/problems/merge-two-sorted-lists/,Merge Two Sorted Lists,Accenture,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Amazon,43\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,LinkedIn,33\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Facebook,24\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Microsoft,22\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Bloomberg,14\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Spotify,13\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Apple,8\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Adobe,8\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Expedia,6\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Google,6\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Oracle,6\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,VMware,5\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Cisco,5\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Intel,4\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Yandex,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,tiktok,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Arista Networks,3\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Barclays,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,ServiceNow,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Uber,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Goldman Sachs,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Booking.com,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Salesforce,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Netflix,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,Dataminr,2\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,tcs,2\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Facebook,23\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Amazon,10\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Microsoft,6\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Google,5\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Bloomberg,3\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Walmart Global Tech,3\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Apple,2\nhttps://leetcode.com/problems/remove-nth-node-from-end-of-list/,Remove Nth Node From End of List,Uber,2\nhttps://leetcode.com/problems/4sum/,4 Sum,Amazon,6\nhttps://leetcode.com/problems/4sum/,4 Sum,Facebook,5\nhttps://leetcode.com/problems/4sum/,4 Sum,Apple,5\nhttps://leetcode.com/problems/4sum/,4 Sum,Microsoft,4\nhttps://leetcode.com/problems/4sum/,4 Sum,Adobe,3\nhttps://leetcode.com/problems/4sum/,4 Sum,Google,2\nhttps://leetcode.com/problems/4sum/,4 Sum,Yahoo,2\nhttps://leetcode.com/problems/4sum/,4 Sum,Infosys,2\nhttps://leetcode.com/problems/4sum/,4 Sum,LinkedIn,2\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Amazon,28\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Microsoft,20\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Facebook,14\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Uber,9\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Apple,7\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Google,5\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Bloomberg,5\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Epic Systems,3\nhttps://leetcode.com/problems/letter-combinations-of-a-phone-number/,Letter Combinations of a Phone Number,Swiggy,3\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Facebook,25\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Amazon,15\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Adobe,4\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Apple,3\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Google,3\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Microsoft,3\nhttps://leetcode.com/problems/3sum-closest/,3Sum Closest,Goldman Sachs,2\nhttps://leetcode.com/problems/3sum/,3Sum,Amazon,44\nhttps://leetcode.com/problems/3sum/,3Sum,Facebook,28\nhttps://leetcode.com/problems/3sum/,3Sum,Microsoft,20\nhttps://leetcode.com/problems/3sum/,3Sum,Apple,10\nhttps://leetcode.com/problems/3sum/,3Sum,Adobe,9\nhttps://leetcode.com/problems/3sum/,3Sum,Google,8\nhttps://leetcode.com/problems/3sum/,3Sum,Walmart Global Tech,7\nhttps://leetcode.com/problems/3sum/,3Sum,Bloomberg,6\nhttps://leetcode.com/problems/3sum/,3Sum,Uber,6\nhttps://leetcode.com/problems/3sum/,3Sum,Qualtrics,5\nhttps://leetcode.com/problems/3sum/,3Sum,Yahoo,5\nhttps://leetcode.com/problems/3sum/,3Sum,Goldman Sachs,4\nhttps://leetcode.com/problems/3sum/,3Sum,tiktok,4\nhttps://leetcode.com/problems/3sum/,3Sum,Salesforce,3\nhttps://leetcode.com/problems/3sum/,3Sum,VMware,3\nhttps://leetcode.com/problems/3sum/,3Sum,ByteDance,3\nhttps://leetcode.com/problems/3sum/,3Sum,Morgan Stanley,3\nhttps://leetcode.com/problems/3sum/,3Sum,Cisco,2\nhttps://leetcode.com/problems/3sum/,3Sum,Oracle,2\nhttps://leetcode.com/problems/3sum/,3Sum,Tesla,2\nhttps://leetcode.com/problems/3sum/,3Sum,American Express,2\nhttps://leetcode.com/problems/3sum/,3Sum,Infosys,2\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Facebook,26\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Apple,14\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Google,12\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Adobe,11\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Amazon,9\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Microsoft,5\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Bloomberg,5\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Uber,4\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,Quora,3\nhttps://leetcode.com/problems/longest-common-prefix/,Longest Common Prefix,SAP,3\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Amazon,27\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Adobe,16\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Apple,13\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Google,10\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Bloomberg,10\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Facebook,8\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Microsoft,6\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,tiktok,5\nhttps://leetcode.com/problems/roman-to-integer,Roman to Integer,Yahoo,4\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Amazon,27\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Microsoft,5\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Bloomberg,5\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Apple,3\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Capital One,3\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Adobe,2\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,Google,2\nhttps://leetcode.com/problems/integer-to-roman/,Integer to Roman,tiktok,2\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Amazon,21\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Microsoft,9\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Adobe,9\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Facebook,8\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Google,5\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Apple,5\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Bloomberg,5\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Swiggy,4\nhttps://leetcode.com/problems/container-with-most-water/,Container With Most Water,Goldman Sachs,3\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Facebook,19\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Microsoft,11\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Google,9\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Amazon,8\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Nvidia,4\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Bloomberg,3\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Adobe,2\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Apple,2\nhttps://leetcode.com/problems/regular-expression-matching/,Regular Expression Matching,Uber,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Google,11\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Facebook,8\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Amazon,7\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Bloomberg,6\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Adobe,5\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Apple,3\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Yahoo,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Uber,2\nhttps://leetcode.com/problems/palindrome-number/,Palindrome Number,Accenture,2\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Facebook,32\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Microsoft,16\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Amazon,9\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Google,6\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Bloomberg,5\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Adobe,4\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Goldman Sachs,3\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Redfin,3\nhttps://leetcode.com/problems/string-to-integer-atoi/,String to Integer (atoi),Apple,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Adobe,13\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Amazon,11\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Google,5\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Apple,4\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Facebook,4\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Microsoft,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Yahoo,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Oracle,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Bloomberg,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Visa,2\nhttps://leetcode.com/problems/reverse-integer/,Reverse Integer,Samsung,2\nhttps://leetcode.com/problems/zigzag-conversion/,ZigZag Conversion,Amazon,5\nhttps://leetcode.com/problems/zigzag-conversion/,ZigZag Conversion,Adobe,4\nhttps://leetcode.com/problems/zigzag-conversion/,ZigZag Conversion,Paypal,2\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Amazon,35\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Microsoft,18\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Google,12\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Adobe,12\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Facebook,7\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Apple,7\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Oracle,7\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Bloomberg,6\nhttps://leetcode.com/problems/longest-palindromic-substring/,Longest Palindromic Substring,Goldman Sachs,5\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Amazon,40\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Adobe,19\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Goldman Sachs,18\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Microsoft,15\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Apple,15\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Google,14\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Facebook,7\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,ServiceNow,4\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Paypal,3\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Bloomberg,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,VMware,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,LinkedIn,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Walmart Global Tech,2\nhttps://leetcode.com/problems/median-of-two-sorted-arrays/,Median of Two Sorted Arrays,Yandex,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Amazon,49\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Microsoft,29\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Facebook,23\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Bloomberg,23\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Apple,16\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Google,13\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Spotify,10\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Adobe,6\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Uber,5\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,VMware,5\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Yahoo,4\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Goldman Sachs,4\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Oracle,4\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Walmart Global Tech,3\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Salesforce,3\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Paypal,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Samsung,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Intuit,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Yandex,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,Zoho,2\nhttps://leetcode.com/problems/longest-substring-without-repeating-characters/,Longest Substring Without Repeating Characters,JPMorgan,2\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Amazon,36\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Apple,19\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Facebook,19\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Microsoft,17\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Bloomberg,16\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Google,10\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Adobe,10\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Yahoo,6\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Oracle,4\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Uber,4\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,JPMorgan,3\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,SAP,2\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Capital One,2\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Visa,2\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,Huawei,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,Amazon,117\nhttps://leetcode.com/problems/two-sum/,Two Sum,Adobe,52\nhttps://leetcode.com/problems/two-sum/,Two Sum,Google,44\nhttps://leetcode.com/problems/two-sum/,Two Sum,Apple,40\nhttps://leetcode.com/problems/two-sum/,Two Sum,Microsoft,39\nhttps://leetcode.com/problems/two-sum/,Two Sum,Facebook,21\nhttps://leetcode.com/problems/two-sum/,Two Sum,Bloomberg,16\nhttps://leetcode.com/problems/two-sum/,Two Sum,Uber,11\nhttps://leetcode.com/problems/two-sum/,Two Sum,Spotify,8\nhttps://leetcode.com/problems/two-sum/,Two Sum,Goldman Sachs,7\nhttps://leetcode.com/problems/two-sum/,Two Sum,Expedia,7\nhttps://leetcode.com/problems/two-sum/,Two Sum,Oracle,6\nhttps://leetcode.com/problems/two-sum/,Two Sum,Yahoo,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,Zoho,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,Visa,4\nhttps://leetcode.com/problems/two-sum/,Two Sum,Morgan Stanley,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,IBM,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Paypal,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,JPMorgan,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Walmart Global Tech,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Intel,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Salesforce,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Dell,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,American Express,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Accenture,3\nhttps://leetcode.com/problems/two-sum/,Two Sum,Samsung,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,Intuit,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,Zillow,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,Zoom,2\nhttps://leetcode.com/problems/two-sum/,Two Sum,Zomato,2\n" }, { "path": "data/leetcode_repo_readme.csv", "content": "Title,Solutions,Video,Difficulty,Tag,Company\n[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/),[Java](../master/src/main/java/com/fishercoder/solutions/_2264.java) ,,Easy ,,\n[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/),[Java](../master/src/main/java/com/fishercoder/solutions/_2260.java) ,,Medium ,,\n[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/),[Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) ,,Easy ,,\n[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/),[Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) ,,Medium ,,\n[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/),[Java](../master/src/main/java/com/fishercoder/solutions/_2255.java) ,,Easy ,,\n[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/),[Java](../master/src/main/java/com/fishercoder/solutions/_2248.java) ,,Easy ,,\n[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/),[Java](../master/src/main/java/com/fishercoder/solutions/_2244.java) ,,Medium ,,\n[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/),[Java](../master/src/main/java/com/fishercoder/solutions/_2243.java) ,,Easy ,,\n[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/),[Java](../master/src/main/java/com/fishercoder/solutions/_2239.java) ,,Easy ,,\n[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/),[Java](../master/src/main/java/com/fishercoder/solutions/_2236.java) ,,Easy ,,\n[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/),[Java](../master/src/main/java/com/fishercoder/solutions/_2236.java) ,,Easy ,,\n[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/),[Java](../master/src/main/java/com/fishercoder/solutions/_2220.java) ,,Easy ,,\n[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/),[Java](../master/src/main/java/com/fishercoder/solutions/_2215.java) ,,Easy ,,\n[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2210.java) ,,Easy ,,\n[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/),[Java](../master/src/main/java/com/fishercoder/solutions/_2208.java) ,,Medium ,,\n[Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/),[Java](../master/src/main/java/com/fishercoder/solutions/_2206.java) ,,Easy ,,\n[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/),[Java](../master/src/main/java/com/fishercoder/solutions/_2201.java) ,,Medium ,,\n[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2200.java) ,,Easy ,,\n[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/),[Java](../master/src/main/java/com/fishercoder/solutions/_2194.java) ,,Easy ,,\n[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2190.java) ,,Easy ,,\n[Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/),[Java](../master/src/main/java/com/fishercoder/solutions/_2186.java) ,,Medium ,,\n[Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/),[Java](../master/src/main/java/com/fishercoder/solutions/_2185.java) ,,Easy ,,\n[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/),[Java](../master/src/main/java/com/fishercoder/solutions/_2182.java) ,,Medium ,,\n[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/),[Java](../master/src/main/java/com/fishercoder/solutions/_2181.java) ,,Medium ,,\n[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/),[Java](../master/src/main/java/com/fishercoder/solutions/_2180.java) ,,Easy ,,\n[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/),[Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) ,,Medium ,,\n[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2176.java) ,,Easy ,,\n[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/),[Java](../master/src/main/java/com/fishercoder/solutions/_2169.java) ,,Easy ,,\n[Design Bitset](https://leetcode.com/problems/design-bitset/),[Java](../master/src/main/java/com/fishercoder/solutions/_2166.java) ,,Medium ,,\n[Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/),[Java](../master/src/main/java/com/fishercoder/solutions/_2165.java) ,,Medium ,,\n[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/),[Java](../master/src/main/java/com/fishercoder/solutions/_2164.java) ,,Easy ,,\n[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/),[Java](../master/src/main/java/com/fishercoder/solutions/_2161.java) ,,Medium ,,\n[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/),[Java](../master/src/main/java/com/fishercoder/solutions/_2160.java) ,,Easy ,,\n[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/),[Java](../master/src/main/java/com/fishercoder/solutions/_2156.java) ,,Medium ,,\n[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) ,,Medium ,,\n[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/),[Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) ,,Easy ,,\n[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2150.java) ,,Medium ,,\n[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/),[Java](../master/src/main/java/com/fishercoder/solutions/_2149.java) ,,Medium ,,\n[Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/),[Java](../master/src/main/java/com/fishercoder/solutions/_2148.java) ,,Easy ,,\n[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/),[Java](../master/src/main/java/com/fishercoder/solutions/_2144.java) ,,Easy ,,\n[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/),[Java](../master/src/main/java/com/fishercoder/solutions/_2139.java) ,,Medium ,,\n[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/),[Java](../master/src/main/java/com/fishercoder/solutions/_2138.java) ,,Easy ,,\n[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/),[Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) ,,Medium ,,\n[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/),[Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) ,,Easy ,,\n[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/),[Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) ,,Medium ,,\n[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/),[Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) ,,Easy ,,\n[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/),[Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) ,,Medium ,,\n[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/),[Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) ,,Medium ,,\n[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/),[Java](../master/src/main/java/com/fishercoder/solutions/_2124.java) ,,Easy ,,\n[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/),[Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) ,,Medium ,,\n[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/),[Java](../master/src/main/java/com/fishercoder/solutions/_2119.java) ,,Easy ,,\n[Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/),[Java](../master/src/main/java/com/fishercoder/solutions/_2116.java) ,,Medium ,,\n[Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/),[Java](../master/src/main/java/com/fishercoder/solutions/_2114.java) ,,Easy ,,\n[Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/),[Java](../master/src/main/java/com/fishercoder/solutions/_2110.java) ,,Medium ,,\n[Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/),[Java](../master/src/main/java/com/fishercoder/solutions/_2109.java) ,,Medium ,,\n[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2108.java) ,,Easy ,,\n[Rings and Rods](https://leetcode.com/problems/rings-and-rods/),[Java](../master/src/main/java/com/fishercoder/solutions/_2103.java) ,,Easy ,,\n[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/),[Java](../master/src/main/java/com/fishercoder/solutions/_2099.java) ,,Easy ,,\n[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/),[Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) ,,Medium ,,\n[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/),[Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) ,,Easy ,,\n[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) ,,Medium ,,\n[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/),[Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) ,,Medium ,,\n[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) ,,Easy ,,\n[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/),[Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) ,,Medium ,,\n[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/),[Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) ,,Easy ,,\n[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/),[Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) ,,Medium ,\"Array, Binary Search\",\n[Watering Plants](https://leetcode.com/problems/watering-plants/),[Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) ,,Medium ,,\n[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/),[Java](../master/src/main/java/com/fishercoder/solutions/_2078.java) ,,Easy ,,\n[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/),[Java](../master/src/main/java/com/fishercoder/solutions/_2076.java) ,,Hard ,,\n[Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext/),[Java](../master/src/main/java/com/fishercoder/solutions/_2075.java) ,,Medium ,,\n[Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/),[Java](../master/src/main/java/com/fishercoder/solutions/_2074.java) ,,Medium ,,\n[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/),[Java](../master/src/main/java/com/fishercoder/solutions/_2073.java) ,,Easy ,,\n[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/),[Java](../master/src/main/java/com/fishercoder/solutions/_2070.java) ,,Medium ,,\n[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/),[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) ,,Easy ,,\n[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/),[Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) ,,Medium ,,\n[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/),[Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) ,,Easy ,,\n[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/),[Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) ,,Medium ,,\n[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/),[Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) ,,Easy ,,\n[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/),[Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) ,,Medium ,,\n[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/),[Java](../master/src/main/java/com/fishercoder/solutions/_2054.java) ,,Medium ,,\n[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2053.java) ,,Easy ,,\n[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/),[Java](../master/src/main/java/com/fishercoder/solutions/_2050.java) ,,Hard ,,\n[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/),[Java](../master/src/main/java/com/fishercoder/solutions/_2048.java) ,,Medium ,,\n[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/),[Java](../master/src/main/java/com/fishercoder/solutions/_2047.java) ,,Easy ,,\n[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/),[Java](../master/src/main/java/com/fishercoder/solutions/_2044.java) ,,Medium ,,\n[Simple Bank System](https://leetcode.com/problems/simple-bank-system/),[Java](../master/src/main/java/com/fishercoder/solutions/_2043.java) ,,Medium ,,\n[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/),[Java](../master/src/main/java/com/fishercoder/solutions/_2042.java) ,,Easy ,,\n[The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/),[Java](../master/src/main/java/com/fishercoder/solutions/_2039.java) ,,Medium ,,\n[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/),[Java](../master/src/main/java/com/fishercoder/solutions/_2038.java) ,,Medium ,,\n[Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/),[Java](../master/src/main/java/com/fishercoder/solutions/_2037.java) ,,Easy ,,\n[Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/),[Java](../master/src/main/java/com/fishercoder/solutions/_2034.java) ,,Medium ,,\n[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/),[Java](../master/src/main/java/com/fishercoder/solutions/_2033.java) ,,Medium ,,\n[Two Out of Three](https://leetcode.com/problems/two-out-of-three/),[Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) ,,Easy ,,\n[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/),[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ,,Medium ,,\n[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/),[Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) ,,Easy ,,\n[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/),[Java](../master/src/main/java/com/fishercoder/solutions/_2024.java) ,,Medium ,,\n[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/),[Java](../master/src/main/java/com/fishercoder/solutions/_2023.java) ,,Medium ,,\n[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) ,,Easy ,,\n[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/),[Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) ,,Medium ,,\n[Grid Game](https://leetcode.com/problems/grid-game/),[Java](../master/src/main/java/com/fishercoder/solutions/_2017.java) ,,Medium ,\"Array, Matrix, Prefix Sum\",\n[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/),[Java](../master/src/main/java/com/fishercoder/solutions/_2016.java) ,,Easy ,,\n[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2012.java) ,,Medium ,,\n[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/),[Java](../master/src/main/java/com/fishercoder/solutions/_2011.java) ,,Easy ,,\n[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/),[Java](../master/src/main/java/com/fishercoder/solutions/_2007.java) ,,Medium ,,\n[Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/),[Java](../master/src/main/java/com/fishercoder/solutions/_2006.java) ,,Easy ,,\n[Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/),\"[Python3](../master/python3/2001.py), [Java](../master/src/main/java/com/fishercoder/solutions/_2001.java) \",,Medium ,,\n[Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/),[Solution](../master/src/main/java/com/fishercoder/solutions/_2000.java) ,,Easy ,,\n[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1996.java) ,,Medium ,,\n[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1995.java) ,,Easy ,,\n[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java) ,,Medium ,,\n[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1991.java) ,,Easy ,,\n[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1985.java) ,,Medium ,,\n[Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1984.java) ,,Easy ,,\n[Minimize the Difference Between Target and Chosen Elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1981.java) ,,Medium ,DP,\n[Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1980.java) ,,Medium ,,\n[Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1979.java) ,,Easy ,,\n[Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1974.java) ,,Easy ,,\n[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1971.java) ,,Easy ,\"BFS, DFS, Graph\",\n[Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1968.java) ,,Medium ,,\n[Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1967.java) ,,Easy ,,\n[Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1966.java) ,,Medium ,\"Array, Binary Search\",\n[Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1961.java) ,,Easy ,,\n[Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1957.java) ,,Easy ,String,\n[Three Divisors](https://leetcode.com/problems/three-divisors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1952.java) ,,Easy ,,\n[Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1945.java) ,,Easy ,,\n[Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1941.java) ,,Easy ,,\n[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java) ,,Medium ,,\n[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java) ,,Easy ,String,\n[Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1933.java) ,,Easy ,String,\n[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1929.java) ,,Easy ,,\n[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java) ,,Medium ,\"DP, DFS, BFS\",\n[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) ,,Easy ,\"Array, Greedy\",\n[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java) ,,Easy ,,\n[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java) ,,Easy ,Sort,\n[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) ,[:tv:](https://youtu.be/d74CJIqw268) ,Medium,String,\n[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java) ,,Easy ,Array,\n[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) ,,Medium ,\"String, Greedy\",\n[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1903.java) ,[:tv:](https://youtu.be/IIt_ARZzclY) ,Easy,Greedy,\n[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) ,,Easy ,\"String, Greedy\",\n[Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1893.java) ,,Easy ,\"Array, HashTable, Prefix Sum\",\n[Cutting Ribbons](https://leetcode.com/problems/cutting-ribbons/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1891.java) ,,Medium ,\"Array, Binary Search\",\n[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) ,,Easy ,Array,\n[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) ,,Easy ,String,\n[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) ,,Medium ,\"Greedy, Sort\",\n[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java) ,,Easy ,String,\n[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java) ,,Medium ,\"Array, Greedy, Sorting\",\n[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java) ,,Easy ,\"Array, Two Pointers\",\n[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java) ,,Easy ,\"Backtracking, Recursion\",\n[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java) ,,Hard ,Math,\n[Rotating the Box](https://leetcode.com/problems/rotating-the-box/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java) ,[:tv:](https://youtu.be/2LRnTMOiqSI) ,Medium,\"Array, Two Pointers\",\n[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) ,,Medium ,Math,\n[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java) ,,Easy ,\"String, Sort\",\n[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java) ,,Easy ,Array,\n[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java) ,,Easy ,Array,\n[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java) ,,Medium ,\"Heap, Design\",\n[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) ,,Easy ,String,\n[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java) ,,Easy ,\"Math, Bit Manipulation\",\n[Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1836.java) ,,Medium ,\"HashTable, LinkedList\",\n[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) ,,Medium ,\"Array, Sort\",\n[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) ,,Easy ,String,\n[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1829.java) ,,Medium ,Bit Manipulation,\n[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1828.java) ,[:tv:](https://youtu.be/fU4oOBSsVMg) ,Medium,Math,\n[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1827.java) ,,Easy ,\"Array, Greedy\",\n[Faulty Sensor](https://leetcode.com/problems/faulty-sensor/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1826.java) ,,Easy ,\"Array, Two Pointers\",\n[Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1823.java) ,,Medium ,Array,\n[Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1822.java) ,,Easy ,Math,\n[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1817.java) ,,Medium ,HashTable,\n[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1816.java) ,,Easy ,String,\n[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1814.java) ,,Medium ,\"Array, HashTable\",\n[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1813.java) ,[:tv:](https://youtu.be/MMMd7dMv4Ak) ,Medium,String,\n[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1812.java) ,,Easy ,String,\n[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1807.java) ,,Medium ,\"HashTable, String\",\n[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1806.java) ,,Medium ,\"Array, Greedy\",\n[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java) ,,Medium ,String,\n[Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1804.java) ,,Medium ,\"Trie, Design\",\n[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java) ,,Easy ,Two Pointers,\n[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java) ,,Medium ,\"HashTable, Design\",\n[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java) ,,Easy ,String,\n[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) ,,Medium ,Heap,\n[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java) ,,Medium ,Graph,\n[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java) ,,Easy ,String,\n[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java) ,,Medium ,Greedy,\n[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1784.java) ,,Easy ,Greedy,\n[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1781.java) ,,Medium ,\"HashTable, String\",\n[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1780.java) ,,Medium ,\"Math, Backtracking, Recursion\",\n[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1779.java) ,,Easy ,Array,\n[Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1775.java) ,,Medium ,Greedy,\n[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java) ,,Medium ,Greedy,\n[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java) ,[:tv:](https://youtu.be/eHk8TQIhvCk) ,Easy,\"Array, String\",\n[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1772.java) ,[:tv:](https://youtu.be/5629LqqeLAM) ,Medium,\"HashTable, Sort\",\n[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java) ,,Medium ,\"Array, Greedy\",\n[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java) ,,Easy ,String,\n[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java) ,,Medium ,\"BFS, Graph\",\n[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java) ,,Medium ,\"Array, Greedy\",\n[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java) ,,Easy ,String,\n[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) ,,Medium ,\"String ,Greedy\",\n[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) ,,Easy ,\"Greedy, Array\",\n[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1756.java) ,,Medium ,\"Array, Design, Dequeue\",\n[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) ,,Medium ,\"Greedy, Suffix Array\",\n[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) ,,Medium ,\"Math, Heap\",\n[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) ,,Easy ,Array,\n[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1750.java) ,,Medium ,Two Pointers,\n[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1749.java) ,,Medium ,Greedy,\n[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1748.java) ,,Easy ,\"Array, HashTable\",\n[Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1746.java) ,,Medium ,DP,\n[Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1745.java) ,,Hard ,\"String, DP\",\n[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1743.java) ,,Medium ,Greedy,\n[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1742.java) ,,Easy ,Array,\n[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1736.java) ,,Easy ,\"String, Greedy\",\n[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1733.java) ,,Medium ,\"Array, Greedy\",\n[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1732.java) ,,Easy ,Array,\n[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1727.java) ,,Medium ,\"Greedy, Sort\",\n[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1726.java) ,[:tv:](https://youtu.be/asI_UBkXI0M) ,Medium,Array,\n[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1725.java) ,,Easy ,Greedy,\n[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java) ,,Medium ,LinkedList,\n[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1720.java) ,,Easy ,Bit Manipulation,\n[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1718.java) ,,Medium ,\"Backtracking, Recursion\",\n[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1717.java) ,[:tv:](https://youtu.be/9wZ-TWBreTg) ,Medium,Greedy,\n[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1716.java) ,,Easy ,\"Math, Greedy\",\n[Count Good Meals](https://leetcode.com/problems/count-good-meals/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java) ,,Medium ,\"Array, HashTable, Two Pointers\",\n[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java) ,,Easy ,\"Greedy, Sort\",\n[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java) ,,Easy ,\"Array, Greedy\",\n[Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1705.java) ,,Medium ,\"Heap, Greedy\",\n[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1704.java) ,,Easy ,String,\n[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java) ,,Easy ,Array,\n[Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1695.java) ,,Medium ,Two Pointers,\n[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1694.java) ,,Easy ,String,\n[Stone Game VII](https://leetcode.com/problems/stone-game-vii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1690.java) ,,Medium ,DP,\n[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1689.java) ,,Medium ,Greedy,\n[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1688.java) ,,Easy ,Backtracking,\n[Stone Game VI](https://leetcode.com/problems/stone-game-vi/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1686.java) ,,Medium ,Greedy,\n[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1685.java) ,[:tv:](https://youtu.be/WYe644djV30) ,Medium,\"Math, Greedy\",\n[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1684.java) ,,Easy ,String,\n[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1680.java) ,,Medium ,Math,\n[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) ,,Medium ,HashTable,\n[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java) ,,Easy ,String,\n[Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1676.java) ,,Medium ,\"Tree, DFS, Binary Tree\",\n[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1675.java) ,,Hard ,\"Heap, Ordered Map\",\n[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) ,[:tv:](https://youtu.be/GBJFxSD3B_s) ,Medium,\"Stack, Greedy\",\n[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) ,,Easy ,Array,\n[Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1670.java) ,,Medium ,\"Linked List, Design, Dequeu\",\n[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) ,,Medium ,LinedList,\n[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) ,,Easy ,String,\n[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/),[Javascript](./javascript/_1664.js) ,,Medium ,Greedy,\n[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) ,[:tv:](https://youtu.be/o3MRJfsoUrw) ,Medium,Greedy,\n[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) ,,Easy ,String,\n[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/),\"[Javascript](./javascript/_1658.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1658.java) \",,Medium ,Greedy,\n[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) ,[:tv:](https://youtu.be/-jXQK-UeChU) ,Medium,Greedy,\n[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) ,,Easy ,\"Array, Design\",\n[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) ,,Easy ,Array,\n[Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1650.java) ,,Medium ,\"HashTable, Binary Tree, Tree\",\n[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1646.java) ,,Easy ,Array,\n[Lowest Common Ancestor of a Binary Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1644.java) ,,Medium ,\"Binary Tree, DFS\",\n[Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1642.java) ,,Medium ,\"Binary Search, Heap\",\n[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1641.java) ,[:tv:](https://youtu.be/gdH4yfgfwiU) ,Medium,\"Math, DP, Backtracking\",\n[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) ,,Easy ,\"Array, Sort\",\n[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/),\"[Javascript](./javascript/_1637.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1637.java) \",,Medium ,Sort ,\n[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) ,,Easy ,\"Array, Sort\",\n[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) ,,Medium ,Sort,\n[Slowest Key](https://leetcode.com/problems/slowest-key/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java) ,,Easy ,Array,\n[Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1628.java) ,,Medium ,\"Stack, Binary Tree, Design, Math\",\n[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) ,,Medium ,DP,\n[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) ,,Medium ,\"BFS, DFS\",\n[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) ,[:tv:](https://youtu.be/rfjeFs3JuYM) ,Easy,String,\n[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) ,[:tv:](https://youtu.be/TqKDnzkRsh0) ,Medium,Greedy,\n[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1619.java) ,[:tv:](https://youtu.be/vyrEra_OfDo) ,Easy,Array,\n[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1614.java) ,,Easy ,String,\n[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java) ,,Medium ,Tree,\n[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java) ,,Easy ,Array,\n[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1604.java) ,,Medium ,\"String, Ordered Map\",\n[Design Parking System](https://leetcode.com/problems/design-parking-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1603.java) ,,Easy ,Design,\n[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1601.java) ,,Hard ,Backtracking,\n[Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1598.java) ,,Easy ,Stack,\n[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java) ,,Easy ,String,\n[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java) ,,Easy ,Array,\n[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java) ,,Medium ,Array,\n[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) ,,Easy ,Array,\n[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1577.java) ,,Medium ,\"HashTable, Math\",\n[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) ,[:tv:](https://youtu.be/SJBDLYqrIsM) ,Easy,String,\n[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) ,,Medium ,\"Array, Binary Search\",\n[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) ,,Easy ,Array,\n[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1570.java) ,,Easy ,\"Array, HashTable, Two Pointers\",\n[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) ,[:tv:](https://youtu.be/bFer5PdsgpY) ,Medium,Greedy,\n[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) ,[:tv:](https://youtu.be/aJAV_VgmjdE) ,Easy,Array,\n[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) ,[:tv:](https://youtu.be/hPe9Z3TiUrA) ,Medium,Sort,\n[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) ,,Easy ,Array,\n[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) ,,Medium ,Greedy,\n[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) ,[:tv:](https://youtu.be/IfsiNU7J-6c) ,Medium,Graph,\n[Thousand Separator](https://leetcode.com/problems/thousand-separator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1556.java) ,[:tv:](https://youtu.be/re2BnNbg598) ,Easy,String,\n[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1551.java) ,[:tv:](https://youtu.be/A-i2sxmBqAA) ,Medium,Math,\n[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1550.java) ,,Easy,Array,\n[Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1545.java) ,[:tv:](https://youtu.be/34QYE5HAFy4) ,Medium,String,\n[Make The String Great](https://leetcode.com/problems/make-the-string-great/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1544.java) ,[:tv:](https://youtu.be/Q-ycCXbUOck) ,Easy,\"String, Stack\",\n[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1541.java) ,[:tv:](https://youtu.be/PEKAlnmbBCc) ,Medium,\"String, Stack\",\n[Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1539.java) ,[:tv:](https://youtu.be/p0P1JNHAB-c) ,Easy,\"Array, HashTable\",\n[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1535.java) ,[:tv:](https://youtu.be/v6On1TQfMTU) ,Medium,Array,\n[Count Good Triplets](https://leetcode.com/problems/count-good-triplets/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1534.java) ,,Easy,Array,\n[Shuffle String](https://leetcode.com/problems/shuffle-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1528.java) ,,Easy,Sort,\n[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1526.java) ,,Hard,Segment Tree,\n[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1525.java) ,[:tv:](https://youtu.be/lRVpVUC5mQ4) ,Medium,\"String, Bit Manipulation\",\n[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1524.java) ,,Medium,\"Array, Math\",\n[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1523.java) ,[:tv:](https://youtu.be/TkT-6WsmqY0) ,Easy,Math,\n[Water Bottles](https://leetcode.com/problems/water-bottles/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1518.java) ,,Easy,Greedy,\n[Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1514.java) ,,Medium,Graph,\n[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1512.java) ,,Easy,\"Array, HashTable, Math\",\n[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1508.java) ,,Medium,\"Array, Sort\",\n[Reformat Date](https://leetcode.com/problems/reformat-date/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1507.java) ,,Easy,String,\n[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java) ,,Easy,\"Array, Sort\",\n[Path Crossing](https://leetcode.com/problems/path-crossing/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) ,,Easy,String,\n[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) ,[:tv:](https://youtu.be/nKhteIRZ2Ok) ,Medium,Array,\n[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) ,,Medium,Math,\n[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1491.java) ,,Easy,\"Array, Sort\",\n[Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1490.java) ,[:tv:](https://youtu.be/3Wnja3Bxeos) ,Medium,\"HashTable, Tree, DFS, BFS\",\n[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) ,,Medium,\"HashTable, String\",\n[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java) ,,Medium,\"Array, Bit Manipulation\",\n[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1485.java) ,,Medium,\"HashTable, Tree, DFS, BFS\",\n[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1482.java) ,,Medium,\"Array, Binary Search\",\n[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java) ,,Medium,\"Array, Sort\",\n[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp) \",,Easy,Array,\n[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) ,,Medium,Array,\n[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) ,,Easy,Array,\n[Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1474.java) ,,Easy,LinkedList,\n[Design Browser History](https://leetcode.com/problems/design-browser-history/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1472.java) ,,Medium,\"Array, Design\",\n[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) ,,Medium,\"Array, Sort\",\n[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) \",,Easy,Array,\n[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1469.java) ,,Easy,\"Tree, DFS\",\n[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) ,,Medium,\"Tree, DFS\",\n[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) ,,Easy,Array,\n[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1461.java) ,,Medium,\"String, Bit Manipulation\",\n[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) ,,Easy,Array,\n[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1457.java) ,,Medium,\"Bit Manipulation, Tree, DFS\",\n[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1456.java) ,,Medium,\"String, Sliding Window\",\n[Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1455.java) ,,Easy,String,\n[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1452.java) ,,Medium,\"String, Sort\",\n[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1451.java) ,,Medium,\"String, Sort\",\n[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1450.java) ,,Easy,Array,\n[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1448.java) ,,Medium,\"Tree, DFS\",\n[Simplified Fractions](https://leetcode.com/problems/simplified-fractions/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1447.java) ,,Medium,Math,\n[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java) ,,Easy,String,\n[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java) ,,Easy,Stack,\n[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1439.java) ,,Hard,\"Array, Binary Search, PriorityQueue, Matrix\",\n[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1438.java) ,,Medium,\"Array, Queue, Sliding Window, PriorityQueue, Monotonic Queue\",\n[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) ,,Medium,Array,\n[Destination City](https://leetcode.com/problems/destination-city/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) ,,Easy,String,\n[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) ,,Medium,String,\n[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java), [C++](../master/cpp/_1431.cpp) \",,Easy,Array,\n[First Unique Number](https://leetcode.com/problems/first-unique-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1429.java) ,,Medium,\"Array, HashTable, Design, Data Streams\",\n[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1428.java) ,,Medium,Array,\n[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1427.java) ,,Easy,\"Array, Math\",\n[Counting Elements](https://leetcode.com/problems/counting-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1426.java) ,,Easy,Array,\n[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1423.java) ,,Medium,\"Array, DP, Sliding Window\",\n[Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1422.java) ,,Easy,String,\n[Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1418.java) ,,Medium,HashTable,\n[Reformat The String](https://leetcode.com/problems/reformat-the-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1417.java) ,,Easy,String,\n[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1415.java) ,,Medium,Backtracking,\n[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1413.java) ,,Easy,Array,\n[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1410.java) ,,Medium,\"String, Stack\",\n[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) ,,Medium,Array,\n[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) ,,Easy,String,\n[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) ,,Easy,\"Greedy, Sort\",\n[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/),[Solution](../master/cpp/_1402.cpp) ,,Hard,Dynamic Programming,\n[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) ,,Medium,Geometry,\n[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) ,,Medium,Greedy,\n[Count Largest Group](https://leetcode.com/problems/count-largest-group/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) ,,Easy,Array,\n[Design Underground System](https://leetcode.com/problems/design-underground-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1396.java) ,,Medium,Design,\n[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1395.java) ,,Medium,Array,\n[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1394.java) ,,Easy,Array,\n[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1392.java) ,,Hard,\"String, Rolling Hash\",\n[Four Divisors](https://leetcode.com/problems/four-divisors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1390.java) ,,Medium,Math,\n[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1389.java) ,,Easy,Array,\n[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1388.java) ,,Hard,DP,\n[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1387.java) ,,Medium,\"Sort, Graph\",\n[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1386.java) ,,Medium,\"Array, Greedy\",\n[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1385.java) ,,Easy,Array,\n[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1382.java) ,,Medium,Binary Search Tree,\n[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1381.java) ,,Medium,\"Stack, Design\",\n[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1380.java) ,,Easy,Array,\n[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1379.java) ,,Medium,Tree,\n[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1377.java) ,,Hard,\"DFS, BFS\",\n[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1376.java) ,,Medium,DFS,\n[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1375.java) ,,Medium,Array,\n[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1374.java) ,,Easy,String,\n[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1373.java) ,,Hard,\"DP, BST\",\n[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1372.java) ,,Hard,\"DP, Tree\",\n[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1371.java) ,,Medium,String,\n[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1370.java) ,,Easy,\"String, Sort\",\n[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1367.java) ,,Medium,\"DP, Linked List, Tree\",\n[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1366.java) ,,Medium,\"Array, Sort\",\n[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1365.java) ,,Easy,\"Array, HashTable\",\n[Closest Divisors](https://leetcode.com/problems/closest-divisors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1362.java) ,,Medium,Math,\n[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1361.java) ,,Medium,Graph,\n[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1360.java) ,,Easy,,\n[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) ,,Medium,String,\n[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1357.java) ,,Medium,Design,\n[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1356.java) ,,Easy,\"Sort, Bit Manipulation\",\n[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1354.java) ,,Hard,Greedy,\n[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1353.java) ,,Medium,\"Greedy, Sort, Segment Tree\",\n[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1352.java) ,,Medium,\"Array, Design\",\n[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1351.java) ,,Easy,\"Array, Binary Search\",\n[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1349.java) ,,Hard,Dynamic Programming,\n[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1348.java) ,,Medium,Design,\n[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1347.java) ,,Easy,String,\n[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1346.java) ,,Easy,Array,\n[Jump Game IV](https://leetcode.com/problems/jump-game-iv/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1345.java) ,,Hard,BFS,\n[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1344.java) ,,Medium,Math,\n[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) ,,Medium,Array,\n[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) ,,Easy,Bit Manipulation,\n[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) ,,Easy,,\n[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1339.java) ,,Medium,\"DP, Tree\",\n[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) ,,Medium,,\n[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) ,,Easy,String,\n\"[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)\",[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) ,,Medium,,\n[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1332.java) ,,Easy,String,\n[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) ,,Easy,,\n[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) ,,Medium,,\n[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1325.java) ,,Medium,Tree,\n[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1324.java) ,,Medium,String,\n[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1323.java) ,,Easy,Math,\n[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) ,,Easy,,\n[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1315.java) ,,Medium,\"Tree, DFS\",\n[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1314.java) ,,Medium,Dynamic Programming,\n[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1313.java) ,,Easy,Array,\n[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) ,,Medium,,\n[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) ,,Easy,,\n[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) ,,Medium,,\n[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) ,,Medium,\"Binary Search, Sorting\",\n[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) ,,Easy,,\n[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) ,,Medium,,\n[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) ,,Medium,,\n[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/),[Java](../master/src/main/java/com/fishercoder/solutions/_1295.java) [Javascript](../master/javascript/_1295.js) ,[:tv:](https://youtu.be/HRp8mNJvLZ0) ,Easy,,\n[Sequential Digits](https://leetcode.com/problems/sequential-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1291.java) ,,Medium,,\n[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) ,,Easy,,\n[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1289.java) ,,Hard,Dynamic Programming,\n[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) ,[:tv:](https://youtu.be/G74W8v2yVjY) ,Easy,,\n[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1286.java) ,,Medium,\"Backtracking, Design\",\n[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1283.java) ,Medium ,,,\n[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1282.java) ,[:tv:](https://www.youtube.com/watch?v=wGgcRCpSAa8) ,Medium,,\n[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1281.java) ,,Easy,,\n[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1277.java) ,,Medium,,\n[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1275.java) ,,Easy,Array,\n[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1273.java) ,,Medium,\"Dynamic Programming, DFS \",\n[Hexspeak](https://leetcode.com/problems/hexspeak/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1271.java) ,,Easy,,\n[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1268.java) ,[:tv:](https://youtu.be/PLNDfB0Vg9Y) ,Medium,String,\n[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1267.java) ,,Medium,,\n[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1266.java) ,,Easy,,\n[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse//),[Solution](../master/src/main/java/com/fishercoder/solutions/_1265.java) ,,Medium,,\n[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1261.java) ,,Medium ,\"Tree, HashTable\",\n[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) ,[:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s) ,Easy,,\n[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1258.java) ,,Medium ,Backtracking,\n[Smallest Common Region](https://leetcode.com/problems/smallest-common-region/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1257.java) ,,Medium ,\"Tree, HashTable, DFS, BFS\",\n[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) ,,Easy,,\n[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1249.java) ,,Medium,\"String, Stack\",\n[Array Transformation](https://leetcode.com/problems/array-transformation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1243.java) ,[:tv:](https://www.youtube.com/watch?v=MQ2i4T1l-Gs) ,Easy,,\n[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) ,,Easy,,\n[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1232.java) ,[:tv:](https://www.youtube.com/watch?v=_tfiTQNZCbs) ,Easy,,\n[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1228.java) ,,Easy,,\n[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1221.java) ,,Easy,Greedy,\n[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1219.java) ,,Medium,Backtracking,\n[Play with Chips](https://leetcode.com/problems/play-with-chips/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) ,,Easy,\"Array, Math, Greedy\",\n[Two Sum BSTs](https://leetcode.com/problems/two-sum-bsts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1214.java) ,,Medium,Binary Search Tree,\n[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) ,[:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ) ,Easy,,\n[Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) ,,Medium ,Stack,\n[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) ,[:tv:](https://www.youtube.com/watch?v=_NYimlZY1PE) ,Easy,,\n[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) ,[:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ) ,Easy,,\n[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) ,[:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo) ,Easy,,\n[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1196.java) ,[:tv:](https://www.youtube.com/watch?v=UelshlMQNJM) ,Easy,,\n[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1190.java) ,,Medium,Stack,\n[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1189.java) ,[:tv:](https://youtu.be/LGgMZC0vj5s) ,Easy,,\n[Day of the Week](https://leetcode.com/problems/day-of-the-week/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) ,,Easy,,\n[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) ,[:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI) ,Easy,,\n[Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1182.java) ,,Medium ,Binary Search,\n[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1180.java) ,,Easy,\"Math, String\",\n[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1176.java) ,,Easy,\"Array, Sliding Window\",\n[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1175.java) ,,Easy,Math,\n[Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1171.java) ,,Medium,LinkedList,\n[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) ,,Easy,,\n[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1161.java) ,,Medium,Graph,\n[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) ,,Easy,,\n[Day of the Year](https://leetcode.com/problems/day-of-the-year/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) ,,Easy,,\n[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java) ,[:tv:](https://youtu.be/V510Lbtrm5s) ,Medium,\"HashTable, Sort, Array\",\n[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1151.java) ,,Medium ,\"Array, Sliding Window\",\n[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java) ,[:tv:](https://youtu.be/-t2cdVs9cKk) ,Easy,,\n[Snapshot Array](https://leetcode.com/problems/snapshot-array/),[Javascript](./javascript/_1146.js) ,,Easy ,,\n[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1143.java) ,,Medium,,\"String, DP\"\n[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1138.java) ,[:tv:](https://youtu.be/rk-aB4rEOyU) ,Medium ,\"HashTable, String\",\n[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) ,,Easy,,\n[Parallel Courses](https://leetcode.com/problems/parallel-courses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1136.java) ,,Medium,,\n[Armstrong Number](https://leetcode.com/problems/armstrong-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) ,[:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4) ,Easy,,\n[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1133.java) ,[:tv:](https://youtu.be/Fecpt1YZlCs) ,Easy,,\n[Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1128.java) ,[:tv:](https://www.youtube.com/watch?v=7EpEEHAAxyw) ,Easy,,\n[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) ,,Easy,,\n[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) ,,Easy,,\n[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) ,[:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw) ,Easy,,\n[Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1118.java) ,,Easy,,\n[Print in Order](https://leetcode.com/problems/print-in-order/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1114.java) ,,Easy,,\n[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1110.java) ,,Medium,\"Tree, DFS\",\n[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) ,[:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk) ,Easy,,\n[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1104.java) ,,Medium,\"Math, Tree\",\n[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) ,,Easy,Math,\n[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1100.java) ,,Medium,\"String, Sliding Window\",\n[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) ,[:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI) ,Easy,,\n[Car Pooling](https://leetcode.com/problems/car-pooling/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1094.java) ,,Medium,\"Array, Sorting, Heap, Simulation, Prefix Sum\",\n[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1090.java) ,[:tv:](https://youtu.be/E0OkE3G95vU) ,Medium,\"HashTable, Greedy\",\n[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1091.java) ,,Medium,BFS,\n[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) ,,Easy,,\n[Brace Expansion](https://leetcode.com/problems/brace-expansion/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1087.java) ,,Medium,Backtracking,\n[High Five](https://leetcode.com/problems/high-five/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) ,[:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc) ,Easy,,\n[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1085.java) ,[:tv:](https://www.youtube.com/watch?v=GKYmPuHZpQg) ,Easy,,\n[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1079.java) ,,Medium,,\n[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) ,,Easy,,\n[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) ,,Easy,,\n[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java) ,,Medium,\"Backtracking, DP\",\n[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) ,,Medium,,\n[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) ,,Medium,\"String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function\",\n[Campus Bikes](https://leetcode.com/problems/campus-bikes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java) ,,Medium,,\"Greedy, Sort\"\n[Confusing Number](https://leetcode.com/problems/confusing-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) ,,Easy,,\n[Fixed Point](https://leetcode.com/problems/fixed-point/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) ,,Easy,,\n[Height Checker](https://leetcode.com/problems/height-checker/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) ,,Easy,,\n[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) ,,Easy,,\n[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1046.java) ,[:tv:](https://youtu.be/IfElFyaEV8s) ,Easy,,\n[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1043.java) ,,Medium,DP,\n[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1038.java) ,,Medium,\"DFS, tree\",\n[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) ,,Easy,Math,\n[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) ,,Easy,Math,\n[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) ,,Easy,,\n[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1029.java) ,,Easy,,\n[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1026.java) ,,Medium,\"Tree, DFS, Binary Tree\",\n[Divisor Game](https://leetcode.com/problems/divisor-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java) ,,Easy,\"Math, DP, Brainteaser, Game Theory\",\n[Video Stitching](https://leetcode.com/problems/video-stitching/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1024.java) ,,Medium,\"Array, DP, Greedy\",\n[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) ,,Easy,,\n[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1021.java) ,,Easy,,\n[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1020.java) ,,Medium,\"Graph, DFS, BFS, recursion\",\n[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1019.java) ,,Medium,\"Linked List, Stack\",\n[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1018.java) ,,Easy,,\n[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1014.java) ,,Medium,,\n[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1013.java) ,,Easy,,\n[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1011.java) ,,Medium,Binary Search,\n[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1010.java) ,,Easy,,\n[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1009.java) ,,Easy,,\n[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1008.java) ,,Medium,Recursion,\n[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1005.java) ,[:tv:](https://youtu.be/spiwTAuz1_4) ,Easy,,\n[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1004.java) ,[:tv:](https://youtu.be/nKhteIRZ2Ok) ,Medium,\"Two Pointers, Sliding Window\",\n[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1003.java) ,,Medium,,\n[Find Common Characters](https://leetcode.com/problems/find-common-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_1002.java) ,,Easy,,\n[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/),[Solution](../master/src/main/java/com/fishercoder/solutions/_999.java) ,,Easy,,\n[Broken Calculator](https://leetcode.com/problems/broken-calculator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_991.java) ,,Medium,\"Math, Greedy\",\n[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/),[Solution](../master/src/main/java/com/fishercoder/solutions/_981.java) ,[:tv:](https://youtu.be/eVi4gDimCoo) ,Medium,,\n[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/),[Solution](../master/src/main/java/com/fishercoder/solutions/_997.java) ,,Easy,,\n[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/),[Solution](../master/src/main/java/com/fishercoder/solutions/_994.java) ,,Medium,BFS,\n[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_993.java) ,,Easy,\"Tree, BFS\",\n[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_989.java) ,,Easy,Array,\n[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/),[Solution](../master/src/main/java/com/fishercoder/solutions/_988.java) ,,Medium,\"Tree, DFS\",\n[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_987.java) ,,Medium,Recursion,\n[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/),[Solution](../master/src/main/java/com/fishercoder/solutions/_986.java) ,,Medium,Two Pointers,\n[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/),[Solution](../master/src/main/java/com/fishercoder/solutions/_985.java) ,,Easy,Array,\n[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_980.java) ,,Hard,\"Backtracking, DFS\",\n[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_979.java) ,,Medium,Recursion,\n[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_977.java) ,,Easy,Array,\n[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_976.java) ,,Easy,Math Array ,\n[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_974.java) ,,Medium,Array,\n[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/),[Solution](../master/src/main/java/com/fishercoder/solutions/_973.java) ,,Easy,Math Sort,\n[Powerful Integers](https://leetcode.com/problems/powerful-integers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_970.java) ,,Easy,Math,\n[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/),[Solution](../master/src/main/java/com/fishercoder/solutions/_966.java) ,,Medium,\"Hash Table, String\",\n[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_965.java) ,,Easy,\"DFS, recursion\",\n[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_961.java) ,,Easy,,\n[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_958.java) ,,Medium,Tree,\n[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/),[Solution](../master/src/main/java/com/fishercoder/solutions/_957.java) ,[:tv:](https://youtu.be/mQQp6I985bw) ,Medium,,\n[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_954.java) ,[:tv:](https://youtu.be/Q0WKzdpR74o) ,Medium,,\n[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_953.java) ,,Easy,,\n[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_951.java) ,,Medium,\"Tree, DFS, recursion\",\n[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/),[Solution](../master/src/main/java/com/fishercoder/solutions/_950.java) ,,Medium,,\n[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_946.java) ,,Medium,Stack,\n[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/),[Solution](../master/src/main/java/com/fishercoder/solutions/_944.java) ,,Easy,,\n[DI String Match](https://leetcode.com/problems/di-string-match/),[Solution](../master/src/main/java/com/fishercoder/solutions/_942.java) ,,Easy,,\n[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_941.java) ,,Easy,,\n[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_938.java) ,,Medium,\"BST, recursion, DFS\",\n[Reorder Log Files](https://leetcode.com/problems/reorder-log-files/),[Solution](../master/src/main/java/com/fishercoder/solutions/_937.java) ,,Easy,,\n[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_936.java) ,,Hard,\"String, Greedy\",\n[Knight Dialer](https://leetcode.com/problems/knight-dialer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_935.java) ,,Medium,,\n[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/),[Solution](../master/src/main/java/com/fishercoder/solutions/_933.java) ,,Easy,,\n[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_931.java) ,,Medium,Dynamic Programming,\n[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_929.java) ,,Easy,,\n[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/),[Solution](../master/src/main/java/com/fishercoder/solutions/_925.java) ,,Easy,,\n[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/),[Solution](../master/src/main/java/com/fishercoder/solutions/_923.java) ,,Medium,Two Pointers,\n[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_922.java) ,,Easy,,\n[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/),[Solution](../master/src/main/java/com/fishercoder/solutions/_921.java) ,,Medium,\"Stack, Greedy\",\n[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/),[Solution](../master/src/main/java/com/fishercoder/solutions/_918.java) ,,Medium,\"Array, DP, Monotonic Queue\",\n[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_917.java) ,,Easy,,\n[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/),[Solution](../master/src/main/java/com/fishercoder/solutions/_914.java) ,,Easy,,\n[Sort an Array](https://leetcode.com/problems/sort-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_912.java) ,,Easy,,\n[Smallest Range I](https://leetcode.com/problems/smallest-range-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_908.java) ,,Easy,,\n[Online Stock Span](https://leetcode.com/problems/online-stock-span/),[Solution](../master/src/main/java/com/fishercoder/solutions/_901.java) ,,Medium,Stack,\n[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/),[Solution](../master/src/main/java/com/fishercoder/solutions/_904.java) ,[:tv:](https://youtu.be/GVecnelW8mA) ,Medium,Two Pointers,\n[RLE Iterator](https://leetcode.com/problems/rle-iterator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) ,,Medium,,\n[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_897.java) ,,Easy,\"DFS, recursion\",\n[Monotonic Array](https://leetcode.com/problems/monotonic-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) ,,Easy,,\n[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/),[Solution](../master/src/main/java/com/fishercoder/solutions/_895.java) ,\"HashTable, Stack \",Hard,,\n[Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_893.java) ,[:tv:](https://youtu.be/tbtXPKkA2Zw) ,Easy,,\n[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_892.java) ,\"Array, Math, Geometry, Matrix \",Easy,,\n[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/),[Solution](../master/src/main/java/com/fishercoder/solutions/_890.java) ,,Medium,,\n[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap/),[Solution](../master/src/main/java/com/fishercoder/solutions/_888.java) ,,Easy,,\n[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_885.java) ,[:tv:](https://www.youtube.com/watch?v=0qep3f9cqVs) ,Medium,,\n[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) ,,Easy,,\n[Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_883.java) ,,Easy,Math,\n[Boats to Save People](https://leetcode.com/problems/boats-to-save-people/),[Solution](../master/src/main/java/com/fishercoder/solutions/_881.java) ,,Medium,\"Two Pointers, Greedy\",\n[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/),[Solution](../master/src/main/java/com/fishercoder/solutions/_880.java) ,,Medium,Stack,\n[Stone Game](https://leetcode.com/problems/stone-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_877.java) ,,Medium,\"Math, DP, Minimax\",\n[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_876.java) ,,Easy,,\n[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_872.java) ,,Easy,\"DFS, recursion\",\n[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_870.java) ,,Medium,\"Array, Greedy\",\n[Binary Gap](https://leetcode.com/problems/binary-gap/),[Solution](../master/src/main/java/com/fishercoder/solutions/_868.java) ,,Easy,,\n[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_867.java) ,,Easy,,\n[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_861.java) ,,Medium,Greedy,\n[Lemonade Change](https://leetcode.com/problems/lemonade-change/),[Solution](../master/src/main/java/com/fishercoder/solutions/_860.java) ,,Easy,,\n[Buddy Strings](https://leetcode.com/problems/buddy-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_859.java) ,,Easy,,\n[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_856.java) ,,Medium,\"Stack, String\",\n[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_852.java) ,,Easy,,\n[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/),[Solution](../master/src/main/java/com/fishercoder/solutions/_849.java) ,,Easy,,\n[Shifting Letters](https://leetcode.com/problems/shifting-letters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_848.java) ,,Medium,\"Array, String\",\n[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/),[Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) ,,Easy,,\n[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/),[Solution](../master/src/main/java/com/fishercoder/solutions/_841.java) ,,Easy,\"DFS, Graph\",\n[Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/),[Solution](../master/src/main/java/com/fishercoder/solutions/_840.java) ,,Easy,,\n[Push Dominoes](https://leetcode.com/problems/push-dominoes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_838.java) ,[:tv:](https://youtu.be/0_XmKkgHSdI) ,Medium,\"Two Pointers, DP\",\n[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/),[Solution](../master/src/main/java/com/fishercoder/solutions/_836.java) ,[:tv:](https://youtu.be/o6hHUk4DOW0) ,Easy,,\n[Flipping an Image](https://leetcode.com/problems/flipping-an-image/),[Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) ,,Easy,,\n[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/),[Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) ,,Easy,,\n[Goat Latin](https://leetcode.com/problems/goat-latin/),[Solution](../master/src/main/java/com/fishercoder/solutions/_824.java) ,,Easy,,\n[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_823.java) ,,Medium,,\n[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/),[Solution](../master/src/main/java/com/fishercoder/solutions/_821.java) ,,Easy,,\n[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_820.java) ,,Medium,,\n[Most Common Word](https://leetcode.com/problems/most-common-word/),[Solution](../master/src/main/java/com/fishercoder/solutions/_819.java) ,,Easy,HashMap,\n[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/),[Solution](../master/src/main/java/com/fishercoder/solutions/_816.java) ,,Medium,String,\n[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/),[Solution](../master/src/main/java/com/fishercoder/solutions/_814.java) ,,Medium,\"recursion, DFS \",\n[Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/),[Solution](../master/src/main/java/com/fishercoder/solutions/_812.java) ,,Easy,\"Array, Math, Geometry\",\n[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/),[Solution](../master/src/main/java/com/fishercoder/solutions/_811.java) ,,Easy,HashMap,\n[Expressive Words](https://leetcode.com/problems/expressive-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_809.java) ,,Medium,,\n[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/),[Solution](../master/src/main/java/com/fishercoder/solutions/_807.java) ,,Medium,,\n[Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_806.java) ,,Easy,,\n[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_804.java) ,,Easy,,\n[Similar RGB Color](https://leetcode.com/problems/similar-rgb-color/),[Solution](../master/src/main/java/com/fishercoder/solutions/_800.java) ,,Easy,,\n[Champagne Tower](https://leetcode.com/problems/champagne-tower/),[Solution](../master/src/main/java/com/fishercoder/solutions/_799.java) ,,Medium,,\n[Rotate String](https://leetcode.com/problems/rotate-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_796.java) ,,Easy,,\n[Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_792.java) ,,Medium,\"HashTable, String, Trie, Sorting\",\n[Custom Sort String](https://leetcode.com/problems/custom-sort-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_791.java) ,,Medium,,\n[Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_789.java) ,,Medium,Math,\n[Rotated Digits](https://leetcode.com/problems/rotated-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_788.java) ,,Easy,,\n[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_784.java) ,,Easy,,\n[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_783.java) ,,Easy,,\n[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/),[Solution](../master/src/main/java/com/fishercoder/solutions/_781.java) ,[:tv:](https://youtu.be/leiSa1i-QrI) ,Medium,\"HashTable, Math\",\n[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/),[Solution](../master/src/main/java/com/fishercoder/solutions/_779.java) ,,Medium,,\n[Split BST](https://leetcode.com/problems/split-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_776.java) ,,Medium,Recursion,\n[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/),[Solution](../master/src/main/java/com/fishercoder/solutions/_775.java) ,,Medium,\"Array, Math\",\n[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/),[Solution](../master/src/main/java/com/fishercoder/solutions/_771.java) ,,Easy,,\n[Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/),[Solution](../master/src/main/java/com/fishercoder/solutions/_769.java) ,,Medium,Array,\n[Reorganize String](https://leetcode.com/problems/reorganize-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_767.java) ,,Medium,,\n[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_766.java) ,,Easy,,\n[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/),[Solution](../master/src/main/java/com/fishercoder/solutions/_765.java) ,,Hard,,\n[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/),[Solution](../master/src/main/java/com/fishercoder/solutions/_764.java) ,,Medium,DP,\n[Partition Labels](https://leetcode.com/problems/partition-labels/),[Solution](../master/src/main/java/com/fishercoder/solutions/_763.java) ,,Medium,,\n[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_762.java) ,,Easy,,\n[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_760.java) ,,Easy,,\n[Bold Words in String](https://leetcode.com/problems/bold-words-in-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_758.java) ,,Easy,,\n[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/),[Solution](../master/src/main/java/com/fishercoder/solutions/_757.java) ,,Hard,,\n[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_756.java) ,,Medium,Backtracking,\n[Pour Water](https://leetcode.com/problems/pour-water/),[Solution](../master/src/main/java/com/fishercoder/solutions/_755.java) ,,Medium ,Array,\n[Reach a Number](https://leetcode.com/problems/reach-a-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_754.java) ,,Medium ,Math,\n[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/),[Solution](../master/src/main/java/com/fishercoder/solutions/_750.java) ,,Medium,,\n[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/),[Solution](../master/src/main/java/com/fishercoder/solutions/_748.java) ,,Easy,,\n[Largest Number Greater Than Twice of Others](https://leetcode.com/problems/largest-number-greater-than-twice-of-others/),[Solution](../master/src/main/java/com/fishercoder/solutions/_747.java) ,,Easy,,\n[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_746.java) ,,Easy,,\n[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/),[Solution](../master/src/main/java/com/fishercoder/solutions/_744.java) ,,Easy,,\n[Network Delay Time](https://leetcode.com/problems/network-delay-time/),[Solution](../master/src/main/java/com/fishercoder/solutions/_743.java) ,,Medium ,\"Graph, Djikstra\",\n[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_742.java) ,,Medium,Tree,\n[Delete and Earn](https://leetcode.com/problems/delete-and-earn/),[Solution](../master/src/main/java/com/fishercoder/solutions/_740.java) ,,Medium,,\n[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/),[Solution](../master/src/main/java/com/fishercoder/solutions/_739.java) ,,Medium,,\n[Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_738.java) ,,Medium,,\n[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_737.java) ,,Medium,Union Find,\n[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/),[Solution](../master/src/main/java/com/fishercoder/solutions/_735.java) ,,Medium ,Stack,\n[Sentence Similarity](https://leetcode.com/problems/sentence-similarity/),[Solution](../master/src/main/java/com/fishercoder/solutions/_734.java) ,,Easy ,HashTable,\n[Flood Fill](https://leetcode.com/problem**__**s/flood-fill/),[Solution](../master/src/main/java/com/fishercoder/solutions/_733.java) ,,Easy ,\"BFS, DFS\",\n[My Calendar I](https://leetcode.com/problems/my-calendar-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_729.java) ,,Medium ,,\n[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_728.java) ,,Easy ,,\n[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_727.java) ,,Hard ,DP,\n[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/),[Solution](../master/src/main/java/com/fishercoder/solutions/_725.java) ,,Medium ,LinkedList,\n[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/),[Solution](../master/src/main/java/com/fishercoder/solutions/_724.java) ,,Easy ,Array,\n[Candy Crush](https://leetcode.com/problems/candy-crush/),[Solution](../master/src/main/java/com/fishercoder/solutions/_723.java) ,,Medium ,\"Array, Two Pointers\",\n[Accounts Merge](https://leetcode.com/problems/accounts-merge/),[Solution](../master/src/main/java/com/fishercoder/solutions/_721.java) ,,Medium ,\"DFS, Union Find\",\n[Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_720.java) ,,Easy ,Trie,\n[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_719.java) ,,Hard ,Binary Search,\n[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/),[Solution](../master/src/main/java/com/fishercoder/solutions/_718.java) ,,Medium ,DP,\n[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_717.java) ,,Easy ,,\n[Max Stack](https://leetcode.com/problems/max-stack/),[Solution](../master/src/main/java/com/fishercoder/solutions/_716.java) ,,Hard,Design,\n[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/),[Solution](../master/src/main/java/com/fishercoder/solutions/_714.java) ,,Medium ,DP,\n[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_713.java) ,,Medium ,,\n[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_712.java) ,,Medium ,DP,\n[To Lower Case](https://leetcode.com/problems/to-lower-case/),[Solution](../master/src/main/java/com/fishercoder/solutions/_709.java) ,,Easy,String,\n[Design HashMap](https://leetcode.com/problems/design-hashmap/),[Solution](../master/src/main/java/com/fishercoder/solutions/_706.java) ,,Easy,Design,\n[Design HashSet](https://leetcode.com/problems/design-hashset/),[Solution](../master/src/main/java/com/fishercoder/solutions/_705.java) ,,Easy,Design,\n[Binary Search](https://leetcode.com/problems/binary-search/),[Solution](../master/src/main/java/com/fishercoder/solutions/_704.java) ,,Easy,Binary Search,\n[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/),[Solution](../master/src/main/java/com/fishercoder/solutions/_703.java) ,,Easy,,\n[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_701.java) ,,Medium ,\"DFS, recursion\",\n[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_700.java) ,,Easy,\"recusion, dfs\",\n[Falling Squares](https://leetcode.com/problems/falling-squares/),[Solution](../master/src/main/java/com/fishercoder/solutions/_699.java) ,,Hard ,Segment Tree,\n[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_698.java), [C++](../master/cpp/_698.cpp) \",,Medium ,Backtracking + DP,\n[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_697.java) ,,Easy ,,\n[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_696.java) ,,Easy ,,\n[Max Area of Island](https://leetcode.com/problems/max-area-of-island/),[Solution](../master/src/main/java/com/fishercoder/solutions/_695.java) ,,Medium ,\"DFS, FBS, Union Find, Matrix\",\n[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/),[Solution](../master/src/main/java/com/fishercoder/solutions/_694.java) ,,Medium ,DFS,\n[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_693.java) ,,Easy ,,\n[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_692.java) ,,Medium ,,\n[Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word/),[Solution](../master/src/main/java/com/fishercoder/solutions/_691.java) ,,Hard ,DP,\n[Employee Importance](https://leetcode.com/problems/employee-importance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_690.java) ,,Easy ,DFS,\n[Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_689.java) ,,Hard ,DP,\n[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/),[Solution](../master/src/main/java/com/fishercoder/solutions/_688.java) ,,Medium ,DP,\n[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/),[Solution](../master/src/main/java/com/fishercoder/solutions/_687.java) ,,Easy ,DFS,\n[Repeated String Match](https://leetcode.com/problems/repeated-string-match/),[Solution](../master/src/main/java/com/fishercoder/solutions/_686.java) ,,Easy ,,\n[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_685.java) ,,Hard ,Union Find,\n[Redundant Connection](https://leetcode.com/problems/redundant-connection/),[Solution](../master/src/main/java/com/fishercoder/solutions/_684.java) ,,Medium ,Union Find,\n[K Empty Slots](https://leetcode.com/problems/k-empty-slots/),[Solution](../master/src/main/java/com/fishercoder/solutions/_683.java) ,,Hard ,,\n[Baseball Game](https://leetcode.com/problems/baseball-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_682.java) ,,Easy ,,\n[Next Closest Time](https://leetcode.com/problems/parents-closest-time/),[Solution](../master/src/main/java/com/fishercoder/solutions/_681.java) ,,Medium ,,\n[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_680.java) ,,Easy ,String,\n[24 Game](https://leetcode.com/problems/24-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_679.java) ,,Hard ,Recursion,\n[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_678.java) ,,Medium,\"Recursion, Greedy\",\n[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_677.java) ,,Medium ,\"HashMap, Trie\",\n[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_676.java) ,,Medium ,,\n[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/),[Solution](../master/src/main/java/com/fishercoder/solutions/_675.java) ,,Hard ,BFS,\n[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_674.java) ,,Easy ,,\n[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_673.java) ,,Medium ,DP,\n[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_672.java) ,,Medium ,Math ,\n[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_671.java) ,,Easy ,\"Tree, DFS\",\n[Maximum Swap](https://leetcode.com/problems/maximum-swap/),[Solution](../master/src/main/java/com/fishercoder/solutions/_670.java) ,,Medium ,String,\n[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_669.java) ,,Easy ,\"Tree, DFS\",\n[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/),[Solution](../master/src/main/java/com/fishercoder/solutions/_668.java) ,,Hard ,Binary Search,\n[Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_667.java) ,,Medium ,Array,\n[Path Sum IV](https://leetcode.com/problems/path-sum-iv/),[Solution](../master/src/main/java/com/fishercoder/solutions/_666.java) ,,Medium ,\"Tree, DFS\",\n[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_665.java) ,,Easy ,,\n[Strange Printer](https://leetcode.com/problems/strange-printer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_664.java) ,,Hard ,DP,\n[Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition/),[Solution](../master/src/main/java/com/fishercoder/solutions/_663.java) ,,Medium ,Tree,\n[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_662.java) ,,Medium ,\"BFS, DFS\",\n[Image Smoother](https://leetcode.com/problems/image-smoother/),[Solution](../master/src/main/java/com/fishercoder/solutions/_661.java) ,,Easy ,Array ,\n[Remove 9](https://leetcode.com/problems/remove-9/),[Solution](../master/src/main/java/com/fishercoder/solutions/_660.java) ,,Hard ,Math,\n[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_659.java) ,,Medium ,HashMap,\n[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_658.java) ,,Medium ,,\n[Judge Route Circle](https://leetcode.com/problems/judge-route-circle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_657.java) ,,Easy ,,\n[Coin Path](https://leetcode.com/problems/coin-path/),[Solution](../master/src/main/java/com/fishercoder/solutions/_656.java) ,,Hard ,DP,\n[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_655.java) ,,Medium ,Recursion,\n[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_654.java) ,,Medium ,Tree,\n[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_653.java) ,,Easy ,Tree,\n[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_652.java) ,,Medium ,Tree,\n[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/),[Solution](../master/src/main/java/com/fishercoder/solutions/_651.java) ,,Medium ,DP,\n[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/),[Solution](../master/src/main/java/com/fishercoder/solutions/_650.java) ,,Medium ,DP,\n[Dota2 Senate](https://leetcode.com/problems/dota2-senate/),[Solution](../master/src/main/java/com/fishercoder/solutions/_649.java) ,,Medium ,Greedy,\n[Replace Words](https://leetcode.com/problems/replace-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_648.java) ,,Medium ,Trie,\n[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_647.java) ,,Medium ,DP,\n[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/),[Solution](../master/src/main/java/com/fishercoder/solutions/_646.java) ,,Medium ,\"DP, Greedy\",\n[Set Mismatch](https://leetcode.com/problems/set-mismatch/),[Solution](../master/src/main/java/com/fishercoder/solutions/_645.java) ,,Easy ,,\n[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_644.java) ,,Hard ,Binary Search,\n[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_643.java) ,,Easy ,,\n[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_642.java) ,,Hard ,Design,\n[Solve the Equation](https://leetcode.com/problems/solve-the-equation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_640.java) ,,Medium ,,\n[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_639.java) ,,Hard,DP,\n[Shopping Offers](https://leetcode.com/problems/shopping-offers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_638.java) ,,Medium ,\"DP, DFS\",\n[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_637.java) ,,Easy ,,\n[Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions/),[Solution](../master/src/main/java/com/fishercoder/solutions/_636.java) ,,Medium ,Stack,\n[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_635.java) ,,Medium ,Design,\n[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_634.java) ,,Medium ,Math,\n[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_633.java) ,,Easy ,Binary Search,\n[Smallest Range](https://leetcode.com/problems/smallest-range/),[Solution](../master/src/main/java/com/fishercoder/solutions/_632.java) ,,Hard,Heap,\n[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/),[Solution](../master/src/main/java/com/fishercoder/solutions/_631.java) ,,Hard,\"Design, Topological Sort\",\n[Course Schedule III](https://leetcode.com/problems/course-schedule-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_630.java) ,,Hard,\"Heap, Greedy\",\n[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_629.java) ,,Hard,DP,\n[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_628.java) ,,Easy ,,\n[Minimum Factorization](https://leetcode.com/problems/minimum-factorization/),[Solution](../master/src/main/java/com/fishercoder/solutions/_625.java) ,,Medium ,,\n[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_624.java) ,,Easy ,\"Sort, Array\",\n[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_623.java) ,,Medium ,Tree,\n[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/),[Solution](../master/src/main/java/com/fishercoder/solutions/_622.java) ,,Medium ,\"Design, Queue\",\n[Task Scheduler](https://leetcode.com/problems/task-scheduler/),[Solution](../master/src/main/java/com/fishercoder/solutions/_621.java) ,,Medium ,\"Greedy, Queue\",\n[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_617.java) ,,Easy ,\"Tree, Recursion\",\n[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_616.java) ,,Medium ,String ,\n[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_611.java) ,,Medium ,Binary Search,\n[Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_609.java) ,,Medium ,HashMap,\n[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_606.java) ,,Easy ,\"Tree, Recursion\",\n[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_605.java) ,,Easy ,Array,\n[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_604.java) ,,Easy ,\"Design, String\",\n[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/),[Solution](../master/src/main/java/com/fishercoder/solutions/_600.java) ,,Hard ,\"Bit Manipulation, DP\",\n[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/),[Solution](../master/src/main/java/com/fishercoder/solutions/_599.java) ,,Easy ,HashMap,\n[Range Addition II](https://leetcode.com/problems/range-addition-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_598.java) ,,Easy ,,\n[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_594.java) ,,Easy ,\"Array, HashMap\",\n[Valid Square](https://leetcode.com/problems/valid-square/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) \",,Medium ,Math,\n[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/),[Solution](../master/src/main/java/com/fishercoder/solutions/_592.java) ,,Medium ,Math,\n[Tag Validator](https://leetcode.com/problems/tag-validator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_591.java) ,,Hard ,\"Stack, String\",\n[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_590.java) ,,Easy,\"DFS, recursion\",\n[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_589.java) ,,Easy ,\"DFS, recursion\",\n[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/),[Solution](../master/src/main/java/com/fishercoder/solutions/_588.java) ,,Hard ,\"Trie, Design\",\n[Erect the Fence](https://leetcode.com/problems/erect-the-fence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_587.java) ,,Hard ,Geometry,\n[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_583.java) ,,Medium ,DP,\n[Kill Process](https://leetcode.com/problems/kill-process/),[Solution](../master/src/main/java/com/fishercoder/solutions/_582.java) ,,Medium ,Stack,\n[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/),[Solution](../master/src/main/java/com/fishercoder/solutions/_581.java) ,,Easy ,\"Array, Sort\",\n[Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/),[Solution](../master/src/main/java/com/fishercoder/solutions/_576.java) ,,Hard ,\"DP, DFS\",\n[Distribute Candies](https://leetcode.com/problems/distribute-candies/),[Solution](../master/src/main/java/com/fishercoder/solutions/_575.java) ,,Easy ,Array,\n[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_573.java) ,,Medium ,Math,\n[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_572.java) ,,Easy ,Tree,\n[Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/),[Solution](../master/src/main/java/com/fishercoder/solutions/_568.java) ,,Hard ,DP,\n[Permutation in String](https://leetcode.com/problems/permutation-in-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_567.java) ,,Medium ,\"Sliding Windows, Two Pointers\",\n[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_566.java) ,,Easy ,,\n[Array Nesting](https://leetcode.com/problems/array-nesting/),[Solution](../master/src/main/java/com/fishercoder/solutions/_565.java) ,,Medium ,,\n[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/),[Solution](../master/src/main/java/com/fishercoder/solutions/_563.java) ,,Easy ,Tree Recursion,\n[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_562.java) ,,Medium ,Matrix DP,\n[Array Partition I](https://leetcode.com/problems/array-partition-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_561.java) ,,Easy ,Array,\n[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_560.java) ,,Medium ,\"Array, HashMap\",\n[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_559.java) ,,Easy ,\"DFS, recursion\",\n[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_557.java) ,,Easy ,String,\n[Next Greater Element III](https://leetcode.com/problems/parents-greater-element-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_556.java) ,,Medium ,String,\n[Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_555.java) ,,Medium ,String,\n[Brick Wall](https://leetcode.com/problems/brick-wall/),[Solution](../master/src/main/java/com/fishercoder/solutions/_554.java) ,,Medium ,HashMap,\n[Optimal Division](https://leetcode.com/problems/optimal-division/),[Solution](../master/src/main/java/com/fishercoder/solutions/_553.java) ,,Medium ,\"String, Math\",\n[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_552.java) ,,Hard,DP,\n[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_551.java) ,,Easy,String ,\n[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_549.java) ,,Medium ,Tree,\n[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_548.java) ,,Medium ,Array,\n[Friend Circles](https://leetcode.com/problems/friend-circles/),[Solution](../master/src/main/java/com/fishercoder/solutions/_547.java) ,,Medium ,Union Find,\n[Remove Boxes](https://leetcode.com/problems/remove-boxes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_546.java) ,,Hard,\"DFS, DP\",\n[Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_545.java) ,,Medium ,Recursion,\n[Output Contest Matches](https://leetcode.com/problems/output-a824-matches/),[Solution](../master/src/main/java/com/fishercoder/solutions/_544.java) ,,Medium ,Recursion,\n[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_543.java) ,,Easy ,Tree/DFS/Recursion,\n[01 Matrix](https://leetcode.com/problems/01-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_542.java) ,,Medium ,BFS,\n[Reverse String II](https://leetcode.com/problems/reverse-string-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_541.java) ,,Easy ,String,\n[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_540.java) ,,Medium ,\"Array, Binary Search \",\n[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/),[Solution](../master/src/main/java/com/fishercoder/solutions/_539.java) ,,Medium ,String,\n[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_538.java) ,,Easy ,Tree,\n[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/),[Solution](../master/src/main/java/com/fishercoder/solutions/_537.java) ,,Medium ,\"Math, String\",\n[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_536.java) ,,Medium ,\"Recursion, Stack\",\n[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/),[Solution](../master/src/main/java/com/fishercoder/solutions/_535.java) ,,Medium ,Design,\n[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) ,,Medium ,HashMap,\n[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) ,,Easy ,HashMap,\n[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_531.java) ,,Medium ,,\n[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_530.java) ,,Easy,DFS,\n[Minesweeper](https://leetcode.com/problems/minesweeper/),[Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) ,,Medium ,BFS,\n[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/),[Solution](../master/src/main/java/com/fishercoder/solutions/_528.java) ,,Medium ,\"Math, Binary Search, Prefix Sum, Randomized\",\n[Word Abbreviation](https://leetcode.com/problems/word-abbreviation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_527.java) ,,Hard ,,\n[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/),[Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) ,,Medium ,Backtracking,\n[Contiguous Array](https://leetcode.com/problems/contiguous-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_525.java) ,,Medium ,HashMap,\n[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/),[Solution](../master/src/main/java/com/fishercoder/solutions/_524.java) ,,Medium ,Sort,\n[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_523.java) ,,Medium,DP,\n[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_522.java) ,,Medium,,\n[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_521.java) ,,Easy,,\n[Detect Capital](https://leetcode.com/problems/detect-capital/),[Solution](../master/src/main/java/com/fishercoder/solutions/_520.java) ,,Easy,,\n[Coin Change 2](https://leetcode.com/problems/coin-change-2/),[Solution](../master/src/main/java/com/fishercoder/solutions/_518.java) ,,Medium,\"Array, DP\",\n[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/),[Solution](../master/src/main/java/com/fishercoder/solutions/_517.java) ,,Hard,DP,\n[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_516.java) ,,Medium,DP,\n[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/),[Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) ,,Medium,BFS,\n[Freedom Trail](https://leetcode.com/problems/freedom-trail/),[Solution](../master/src/main/java/com/fishercoder/solutions/_514.java) ,,Hard ,DP,\n[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/),[Solution](../master/src/main/java/com/fishercoder/solutions/_513.java) ,,Medium ,BFS,\n[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_509.java) ,[:tv:](https://www.youtube.com/watch?v=WPBTYmvcHXs) ,Easy,Array ,\n[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_508.java) ,,Medium ,\"DFS, Tree\",\n[Perfect Number](https://leetcode.com/problems/perfect-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_507.java) ,,Easy,Math,\n[Relative Ranks](https://leetcode.com/problems/relative-ranks/),[Solution](../master/src/main/java/com/fishercoder/solutions/_506.java) ,,Easy,,\n[The Maze II](https://leetcode.com/problems/the-maze-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_505.java) ,,Medium,BFS,\n[Base 7](https://leetcode.com/problems/base-7/),[Solution](../master/src/main/java/com/fishercoder/solutions/_504.java) ,,Easy,,\n[Next Greater Element II](https://leetcode.com/problems/parents-greater-element-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_503.java) ,,Medium,Stack,\n[IPO](https://leetcode.com/problems/ipo/),[Solution](../master/src/main/java/com/fishercoder/solutions/_502.java) ,,Hard,\"Heap, Greedy\",\n[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_501.java) ,,Easy,Binary Tree,\n[Keyboard Row](https://leetcode.com/problems/keyboard-row/),[Solution](../master/src/main/java/com/fishercoder/solutions/_500.java) ,,Easy,,\n[The Maze III](https://leetcode.com/problems/the-maze-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_499.java) ,,Hard,BFS,\n[Next Greater Element I](https://leetcode.com/problems/parents-greater-element-i/),[Solution](../master/src/main/java/com/fishercoder/solutions/_496.java) ,,Easy,,\n[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/),[Solution](../master/src/main/java/com/fishercoder/solutions/_498.java) ,,Medium,,\n[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/),[Solution](../master/src/main/java/com/fishercoder/solutions/_495.java) ,,Medium,Array,\n[Target Sum](https://leetcode.com/problems/target-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_494.java) ,,Medium,,\n[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_493.java) ,,Hard,Recursion,\n[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_492.java) ,,Easy,Array,\n[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_491.java) ,,Medium,\"Backtracking, DFS\",\n[The Maze](https://leetcode.com/problems/the-maze/),[Solution](../master/src/main/java/com/fishercoder/solutions/_490.java) ,,Medium,BFS,\n[Zuma Game](https://leetcode.com/problems/zuma-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) ,,Hard ,\"DFS, Backtracking\",\n[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) ,[:tv:](https://youtu.be/nKhteIRZ2Ok) ,Medium,\"Array, Sliding Window\",\n[Predict the Winner](https://leetcode.com/problems/predict-the-winner/),[Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) ,,Medium ,DP,\n[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/),[Java](../master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](../master/javascript/_485.js) ,[:tv:](https://youtu.be/nKhteIRZ2Ok) ,Easy,Array,\n[Find Permutation](https://leetcode.com/problems/find-permutation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_484.java) ,,Medium ,\"Array, String, Greedy\",\n[Smallest Good Base](https://leetcode.com/problems/smallest-good-base/),[Solution](../master/src/main/java/com/fishercoder/solutions/_483.java) ,,Hard ,\"Binary Search, Math\",\n[License Key Formatting](https://leetcode.com/problems/license-key-formatting/),[Solution](../master/src/main/java/com/fishercoder/solutions/_482.java) ,,Medium,,\n[Magical String](https://leetcode.com/problems/magical-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_481.java) ,,Medium ,,\n[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/),[Solution](../master/src/main/java/com/fishercoder/solutions/_480.java) ,,Hard,Heap,\n[Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/),[Solution](../master/src/main/java/com/fishercoder/solutions/_479.java) ,,Easy,,\n[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_477.java) ,,Medium,Bit Manipulation,\n[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_478.java) ,,Medium,\"Math, Random, Rejection Sampling\",\n[Number Complement](https://leetcode.com/problems/number-complement/),[Solution](../master/src/main/java/com/fishercoder/solutions/_476.java) ,,Easy,Bit Manipulation,\n[Heaters](https://leetcode.com/problems/heaters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_475.java) ,,Easy ,Array Binary Search,\n[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_474.java) ,,Medium,DP,\n[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/),[Solution](../master/src/main/java/com/fishercoder/solutions/_473.java) ,,Medium,\"Backtracking, DFS\",\n[Concatenated Words](https://leetcode.com/problems/concatenated-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_472.java) ,,Hard,\"Trie, DP, DFS\",\n[Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/),[Solution](../master/src/main/java/com/fishercoder/solutions/_471.java) ,,Hard,DP,\n[Convex Polygon](https://leetcode.com/problems/convex-polygon/),[Solution](../master/src/main/java/com/fishercoder/solutions/_469.java) ,,Medium,Math,\n[Validate IP Address](https://leetcode.com/problems/validate-ip-address/),[Solution](../master/src/main/java/com/fishercoder/solutions/_468.java) ,,Medium ,String,\n[Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_467.java) ,,Medium ,DP,\n[Count The Repetitions](https://leetcode.com/problems/count-the-repetitions/),[Solution](../master/src/main/java/com/fishercoder/solutions/_466.java) ,,Hard,DP,\n[Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/),[Solution](../master/src/main/java/com/fishercoder/solutions/_465.java) ,,Hard,DP,\n[Can I Win](https://leetcode.com/problems/can-i-win/),[Solution](../master/src/main/java/com/fishercoder/solutions/_464.java) ,,Medium,DP,\n[Island Perimeter](https://leetcode.com/problems/island-perimeter/),[Solution](../master/src/main/java/com/fishercoder/solutions/_463.java) ,,Easy,,\n[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_462.java) ,,Medium ,,\n[Hamming Distance](https://leetcode.com/problems/hamming-distance/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_461.java), [C++](../master/cpp/_461.cpp) \",,Easy,,\n[LFU Cache](https://leetcode.com/problems/lfu-cache/),[Solution](../master/src/main/java/com/fishercoder/solutions/_460.java) ,,Hard,\"Design, LinkedHashMap, HashMap\",\n[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/),[Solution](../master/src/main/java/com/fishercoder/solutions/_459.java) ,,Easy,\"String, KMP\",\n[Poor Pigs](https://leetcode.com/problems/poor-pigs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_458.java) ,,Easy,Math,\n[Circular Array Loop](https://leetcode.com/problems/circular-array-loop/),[Solution](../master/src/main/java/com/fishercoder/solutions/_457.java) ,,Medium ,,\n[132 Pattern](https://leetcode.com/problems/132-pattern/),[Solution](../master/src/main/java/com/fishercoder/solutions/_456.java) ,,Medium,Stack,\n[Assign Cookies](https://leetcode.com/problems/assign-cookies/),[Solution](../master/src/main/java/com/fishercoder/solutions/_455.java) ,,Easy,,\n[4Sum II](https://leetcode.com/problems/4sum-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_454.java) ,,Medium,HashMap,\n[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_453.java) ,,Easy,,\n[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/),[Solution](../master/src/main/java/com/fishercoder/solutions/_452.java) ,,Medium,\"Array, Greedy\",\n[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/),[Solution](../master/src/main/java/com/fishercoder/solutions/_451.java) ,,Medium,HashMap,\n[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_450.java) ,,Medium,\"Tree, Recursion\",\n[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_449.java) ,,Medium,BFS,\n[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_448.java) ,,Easy,\"Array, HashMap\",\n[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_447.java) ,,Easy,HashMap,\n[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_446.java) ,,Hard,DP,\n[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_445.java) ,,Medium,\"Stack, LinkedList\",\n[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/),[Solution](../master/src/main/java/com/fishercoder/solutions/_444.java) ,,Medium,\"Topological Sort, Graph\",\n[String Compression](https://leetcode.com/problems/string-compression/),[Solution](../master/src/main/java/com/fishercoder/solutions/_443.java) ,,Easy ,,\n[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_442.java) ,,Medium,Array,\n[Arranging Coins](https://leetcode.com/problems/arrange-coins/),[Solution](../master/src/main/java/com/fishercoder/solutions/_441.java) ,,Easy,,\n[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/),[Solution](../master/src/main/java/com/fishercoder/solutions/_440.java) ,,Hard,,\n[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/),[Solution](../master/src/main/java/com/fishercoder/solutions/_439.java) ,,Medium,Stack,\n[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_438.java) ,,Easy,Sliding Window,\n[Path Sum III](https://leetcode.com/problems/path-sum-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_437.java) ,,Easy,\"DFS, recursion\",\n[Find Right Interval](https://leetcode.com/problems/find-right-interval/),[Solution](../master/src/main/java/com/fishercoder/solutions/_436.java) ,,Medium,Binary Search,\n[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/),[Solution](../master/src/main/java/com/fishercoder/solutions/_435.java) ,,Medium,Greedy,\n[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_434.java) ,,Easy,,\n[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/),[Solution](../master/src/main/java/com/fishercoder/solutions/_432.java) ,,Hard,Design,\n[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_430.java) ,,Medium,\"LinkedList, DFS, Doubly-Linked List \",\n[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_429.java) ,,Easy,\"BFS, Tree\",\n[Word Squares](https://leetcode.com/problems/word-squares/),[Solution](../master/src/main/java/com/fishercoder/solutions/_425.java) ,,Hard,\"Trie, Backtracking, Recursion\",\n[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/),[Solution](../master/src/main/java/com/fishercoder/solutions/_424.java) ,,Medium,Sliding Window,\n[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/),[Solution](../master/src/main/java/com/fishercoder/solutions/_423.java) ,,Medium,Math,\n[Valid Word Square](https://leetcode.com/problems/valid-word-square/),[Solution](../master/src/main/java/com/fishercoder/solutions/_422.java) ,,Easy,,\n[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_421.java) ,,Medium ,\"Bit Manipulation, Trie\",\n[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/),[Solution](../master/src/main/java/com/fishercoder/solutions/_420.java) ,,Hard,,\n[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/),[Solution](../master/src/main/java/com/fishercoder/solutions/_419.java) ,,Medium,DFS,\n[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/),[Solution](../master/src/main/java/com/fishercoder/solutions/_418.java) ,,Medium,,\n[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/),[Solution](../master/src/main/java/com/fishercoder/solutions/_417.java) ,,Medium,DFS,\n[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_416.java), [C++](../master/cpp/_416.cpp) \",,Medium ,DP,\n[Add Strings](https://leetcode.com/problems/add-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_415.java) ,,Easy,,\n[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_414.java) ,,Easy,,\n[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/),[Solution](../master/src/main/java/com/fishercoder/solutions/_413.java) ,,Medium,DP,\n[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/),[Solution](../master/src/main/java/com/fishercoder/solutions/_412.java) ,,Easy,,\n[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_411.java) ,,Hard,\"NP-Hard, Backtracking, Trie, Recursion\",\n[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_410.java) ,,Hard,\"Binary Search, DP\",\n[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/),[Solution](../master/src/main/java/com/fishercoder/solutions/_409.java) ,,Easy,,\n[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_408.java) ,,Easy,,\n[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_407.java) ,,Hard,Heap,\n[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/),[Solution](../master/src/main/java/com/fishercoder/solutions/_406.java) ,,Medium,\"LinkedList, PriorityQueue\",\n[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_405.java) ,,Easy,,\n[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/),[Solution](../master/src/main/java/com/fishercoder/solutions/_404.java) ,,Easy,,\n[Frog Jump](https://leetcode.com/problems/frog-jump/),[Solution](../master/src/main/java/com/fishercoder/solutions/_403.java) ,,Hard,DP,\n[Remove K Digits](https://leetcode.com/problems/remove-k-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_402.java) ,,Medium,\"Greedy, Stack\",\n[Binary Watch](https://leetcode.com/problems/binary-watch/),[Solution](../master/src/main/java/com/fishercoder/solutions/_401.java) ,,Easy,,\n[Nth Digit](https://leetcode.com/problems/nth-digit/),[Solution](../master/src/main/java/com/fishercoder/solutions/_400.java) ,,Easy,,\n[Evaluate Division](https://leetcode.com/problems/evaluate-division/),[Solution](../master/src/main/java/com/fishercoder/solutions/_399.java) ,,Medium,\"Graph, DFS, Backtracking\",\n[Random Pick Index](https://leetcode.com/problems/random-pick-index/),[Solution](../master/src/main/java/com/fishercoder/solutions/_398.java) ,,Medium,Reservoir Sampling,\n[Integer Replacement](https://leetcode.com/problems/integer-replacement/),[Solution](../master/src/main/java/com/fishercoder/solutions/_397.java) ,,Easy,BFS,\n[Rotate Function](https://leetcode.com/problems/rotate-function/),[Solution](../master/src/main/java/com/fishercoder/solutions/_396.java) ,,Easy,,\n[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_395.java) ,,Medium,Recursion,\n[Decode String](https://leetcode.com/problems/decode-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_394.java) ,,Medium,Stack Depth-first-search,\n[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_393.java) ,,Medium,Bit Manipulation,\n[Is Subsequence](https://leetcode.com/problems/is-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_392.java) ,,Medium,\"Array, String\",\n[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_391.java) ,,Hard,,\n[Elimination Game](https://leetcode.com/problems/elimination-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_390.java) ,,Medium,,\n[Find the Difference](https://leetcode.com/problems/find-the-difference/),[Solution](../master/src/main/java/com/fishercoder/solutions/_389.java) ,,,Easy,\n[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/),[Solution](../master/src/main/java/com/fishercoder/solutions/_388.java) ,,Medium,Stack,\n[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_387.java) ,,Easy,HashMap,\n[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_386.java) ,,Medium,,\n[Mini Parser](https://leetcode.com/problems/mini-parser/),[Solution](../master/src/main/java/com/fishercoder/solutions/_385.java) ,,Medium,Stack,\n[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_384.java) ,,Medium,,\n[Ransom Note](https://leetcode.com/problems/ransom-note/),[Solution](../master/src/main/java/com/fishercoder/solutions/_383.java) ,,Easy ,String,\n[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/),[Solution](../master/src/main/java/com/fishercoder/solutions/_382.java) ,,Medium,Reservoir Sampling,\n[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/),[Solution](../master/src/main/java/com/fishercoder/solutions/_381.java) ,,Hard ,,\n[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/),[Solution](../master/src/main/java/com/fishercoder/solutions/_380.java) ,,Medium,\"Design, HashMap\",\n[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/),[Solution](../master/src/main/java/com/fishercoder/solutions/_379.java) ,,Medium,,\n[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_378.java) ,,Medium,Binary Search,\n[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/),[Solution](../master/src/main/java/com/fishercoder/solutions/_377.java) ,,Medium,DP,\n[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_376.java) ,,Medium,\"DP, Greedy\",\n[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_375.java) ,,Medium,DP,\n[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/),[Solution](../master/src/main/java/com/fishercoder/solutions/_374.java) ,,Easy,Binary Search,\n[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/),[Solution](../master/src/main/java/com/fishercoder/solutions/_373.java) ,,Medium,Heap,\n[Super Pow](https://leetcode.com/problems/super-pow/),[Solution](../master/src/main/java/com/fishercoder/solutions/_372.java) ,,Medium,Math,\n[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_371.java) ,,Easy,,\n[Range Addition](https://leetcode.com/problems/range-addition/),[Solution](../master/src/main/java/com/fishercoder/solutions/_370.java) ,,Medium,Array ,\n[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_369.java) ,,Medium,Linked List,\n[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/),[Solution](../master/src/main/java/com/fishercoder/solutions/_368.java) ,,Medium,DP,\n[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/),[Solution](../master/src/main/java/com/fishercoder/solutions/_367.java) ,,Medium,,\n[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_366.java) ,,Medium,DFS,\n[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/),[Solution](../master/src/main/java/com/fishercoder/solutions/_365.java) ,,Medium,Math,\n[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_364.java) ,,Medium,DFS,\n[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_363.java) ,,Hard,DP ,\n[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/),[Solution](../master/src/main/java/com/fishercoder/solutions/_362.java) ,,Medium,Design,\n[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/),[Solution](../master/src/main/java/com/fishercoder/solutions/_361.java) ,,Medium,,\n[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_360.java) ,,Medium,\"Two Pointers, Math\",\n[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/),[Solution](../master/src/main/java/com/fishercoder/solutions/_359.java) ,,Easy,HashMap,\n[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/),[Solution](../master/src/main/java/com/fishercoder/solutions/_358.java) ,,Hard,\"HashMap, Heap, Greedy\",\n[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_357.java) ,,Medium,\"DP, Math\",\n[Line Reflection](https://leetcode.com/problems/line-reflection/),[Solution](../master/src/main/java/com/fishercoder/solutions/_356.java) ,,Medium,HashSet,\n[Design Twitter](https://leetcode.com/problems/design-twitter/),[Solution](../master/src/main/java/com/fishercoder/solutions/_355.java) ,,Medium,\"Design, HashMap, Heap\",\n[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_354.java) ,,Hard,\"DP, Binary Search\",\n[Design Snake Game](https://leetcode.com/problems/design-snake-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_353.java) ,,Medium,,\n[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/),[Solution](../master/src/main/java/com/fishercoder/solutions/_352.java) ,,Hard,TreeMap,\n[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/),[Solution](../master/src/main/java/com/fishercoder/solutions/_351.java) ,,Medium,,\n[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_350.java) ,[:tv:](https://youtu.be/lKuK69-hMcc) ,Easy,\"HashMap, Binary Search\",\n[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/),[Solution](../master/src/main/java/com/fishercoder/solutions/_349.java) ,[:tv:](https://youtu.be/XxStWmfXJRs) ,Easy,\"Two Pointers, Binary Search\",\n[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/),[Solution](../master/src/main/java/com/fishercoder/solutions/_348.java) ,,Medium,Design ,\n[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_347.java) ,,Medium,\"HashTable, Heap, Bucket Sort\",\n[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/),[Solution](../master/src/main/java/com/fishercoder/solutions/_346.java) ,,Easy,Queue,\n[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_345.java) ,,Easy ,String,\n[Reverse String](https://leetcode.com/problems/reverse-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) ,[:tv:](https://youtu.be/P68JPXtFyYg) ,Easy ,String,\n[Integer Break](https://leetcode.com/problems/integer-break/),[Solution](../master/src/main/java/com/fishercoder/solutions/_343.java) ,,Medium,Math,\n[Power of Four](https://leetcode.com/problems/power-of-four/),[Solution](../master/src/main/java/com/fishercoder/solutions/_342.java) ,,Easy,Math,\n[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_341.java) ,,Medium,Stack,\n[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_340.java) ,,Hard,Sliding Window,\n[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_339.java) ,,Easy,DFS,\n[Counting Bits](https://leetcode.com/problems/counting-bits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_338.java) ,,Medium,,\n[House Robber III](https://leetcode.com/problems/house-robber-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_337.java) ,,Medium ,DP,\n[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_336.java) ,,Hard,,\n[Self Crossing](https://leetcode.com/problems/self-crossing/),[Solution](../master/src/main/java/com/fishercoder/solutions/_335.java) ,,Hard,Math,\n[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_334.java) ,,Medium,,\n[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_333.java) ,,Medium,Tree ,\n[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_332.java) ,,Medium,\"Graph, DFS\",\n[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_331.java) ,,Medium,Stack,\n[Patching Array](https://leetcode.com/problems/patching-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_330.java) ,,Hard,Greedy,\n[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_329.java) ,,Hard,\"DFS, DP\",\n[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_328.java) ,,Medium,Linked List,\n[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_327.java) ,,Hard,\"BST, Divide and Conquer\",\n[Power of Three](https://leetcode.com/problems/power-of-three/),[Solution](../master/src/main/java/com/fishercoder/solutions/_326.java) ,,Easy,Math,\n[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/),[Solution](../master/src/main/java/com/fishercoder/solutions/_325.java) ,,Medium,HashTable,\n[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_324.java) ,,Medium,Sort,\n[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/),[Solution](../master/src/main/java/com/fishercoder/solutions/_323.java) ,,Medium,,\n[Coin Change](https://leetcode.com/problems/coin-change/),[Solution](../master/src/main/java/com/fishercoder/solutions/_322.java) ,,Medium,DP,\n[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_321.java) ,,Hard,,\n[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_320.java) ,,Medium,\"Backtracking, Bit Manipulation\",\n[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/),[Solution](../master/src/main/java/com/fishercoder/solutions/_319.java) ,,Medium,Brainteaser,\n[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/),[Solution](../master/src/main/java/com/fishercoder/solutions/_318.java) ,,Medium,,\n[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_317.java) ,,Hard,,\n[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_316.java) ,,Hard,\"Stack, Recursion, Greedy\",\n[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/),[Solution](../master/src/main/java/com/fishercoder/solutions/_315.java) ,,Hard,Tree,\n[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_314.java) ,,Medium,\"HashMap, BFS\",\n[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_313.java) ,,Medium,,\n[Burst Balloons](https://leetcode.com/problems/burst-balloons/),[Solution](../master/src/main/java/com/fishercoder/solutions/_312.java) ,,Hard,DP,\n[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/),[Solution](../master/src/main/java/com/fishercoder/solutions/_311.java) ,,Medium,,\n[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_310.java) ,,Medium,,\n[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-cooldown/),[Solution](../master/src/main/java/com/fishercoder/solutions/_309.java) ,,Medium,DP,\n[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/),[Solution](../master/src/main/java/com/fishercoder/solutions/_308.java) ,,Hard,Tree,\n[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/),[Solution](../master/src/main/java/com/fishercoder/solutions/_307.java) ,,Medium,Tree,\n[Additive Number](https://leetcode.com/problems/additive-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_306.java) ,,Medium,,\n[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_305.java) ,,Hard,Union Find,\n[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/),[Solution](../master/src/main/java/com/fishercoder/solutions/_304.java) ,,Medium,,\n[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/),[Solution](../master/src/main/java/com/fishercoder/solutions/_303.java) ,,Easy,,\n[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/),[Solution](../master/src/main/java/com/fishercoder/solutions/_302.java) ,,Hard,\"DFS, BFS\",\n[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_301.java) ,,Hard,BFS,\n[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_300.java) ,,Medium,DP,\n[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/),[Solution](../master/src/main/java/com/fishercoder/solutions/_299.java) ,,Easy,,\n[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_298.java) ,,Medium ,Tree,\n[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_297.java) ,,Hard,BFS,\n[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/),[Solution](../master/src/main/java/com/fishercoder/solutions/_296.java) ,,Hard,,\n[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/),[Solution](../master/src/main/java/com/fishercoder/solutions/_295.java) ,,Hard,Heap,\n[Flip Game II](https://leetcode.com/problems/flip-game-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_294.java) ,,Medium,Backtracking,\n[Flip Game](https://leetcode.com/problems/flip-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_293.java) ,,Easy,,\n[Nim Game](https://leetcode.com/problems/nim-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_292.java) ,,Easy,,\n[Word Pattern II](https://leetcode.com/problems/word-pattern-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_291.java) ,,Hard,\"Recursion, Backtracking\",\n[Word Pattern](https://leetcode.com/problems/word-pattern/),[Solution](../master/src/main/java/com/fishercoder/solutions/_290.java) ,,Easy,HashMap ,\n[Game of Life](https://leetcode.com/problems/game-of-life/),[Solution](../master/src/main/java/com/fishercoder/solutions/_289.java) ,[:tv:](https://youtu.be/YZ-W5DrKPQ0) ,Medium,,\n[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_288.java) ,,Easy,,\n[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_287.java) ,,Medium,,\n[Walls and Gates](https://leetcode.com/problems/walls-and-gates/),[Solution](../master/src/main/java/com/fishercoder/solutions/_286.java) ,,Medium,BFS,\n[Inorder Successor In BST](https://leetcode.com/problems/inorder-successor-in-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_285.java) ,,Medium,Tree,\n[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_284.java) ,,Medium,Design,\n[Move Zeroes](https://leetcode.com/problems/move-zeroes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_283.java) ,[:tv:](https://youtu.be/39VJV4KVyi8) ,Easy,,\n[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/),[Solution](../master/src/main/java/com/fishercoder/solutions/_282.java) ,,Hard,,\n[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_281.java) ,,Medium,,\n[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/),[Solution](../master/src/main/java/com/fishercoder/solutions/_280.java) ,,Medium,,\n[Perfect Squares](https://leetcode.com/problems/perfect-squares/),[Solution](../master/src/main/java/com/fishercoder/solutions/_279.java) ,,Medium,,\n[First Bad Version](https://leetcode.com/problems/first-bad-version/),[Solution](../master/src/main/java/com/fishercoder/solutions/_278.java) ,[:tv:](https://youtu.be/E15djRphPj0) ,Easy,Binary Search,\n[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/),[Solution](../master/src/main/java/com/fishercoder/solutions/_277.java) ,,Medium,,\n[Paint Fence](https://leetcode.com/problems/paint-fence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_276.java) ,,Easy,DP,\n[H-Index II](https://leetcode.com/problems/h-index-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_275.java) ,,Medium,Binary Search,\n[H-Index](https://leetcode.com/problems/h-index/),[Solution](../master/src/main/java/com/fishercoder/solutions/_274.java) ,,Medium,,\n[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_273.java) ,,Hard,\"Math, String \",\n[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_272.java) ,,Hard,Stack,\n[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_271.java) ,,,Medium,\n[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/),[Solution](../master/src/main/java/com/fishercoder/solutions/_270.java) ,,,Easy,DFS\n[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_269.java) ,,,Hard,Topological Sort\n[Missing Number](https://leetcode.com/problems/missing-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_268.java) ,,,Easy,Bit Manipulation\n[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_267.java) ,,Medium,,\n[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_266.java) ,,Easy,,\n[Paint House II](https://leetcode.com/problems/paint-house-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_265.java) ,,Hard,DP ,\n[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_264.java) ,,Medium,DP,\n[Ugly Number](https://leetcode.com/problems/ugly-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_263.java) ,,Easy,,\n[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_261.java) ,,Medium,,\n[Single Number III](https://leetcode.com/problems/single-number-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_260.java) ,,Medium,,\n[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/),[Solution](../master/src/main/java/com/fishercoder/solutions/_259.java) ,,Medium,,\n[Add Digits](https://leetcode.com/problems/add-digits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_258.java) ,,Easy,,\n[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/),[Solution](../master/src/main/java/com/fishercoder/solutions/_257.java) ,,,DFS/Recursion,\n[Paint House](https://leetcode.com/problems/paint-house/),[Solution](../master/src/main/java/com/fishercoder/solutions/_256.java) ,,Medium,DP,\n[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_255.java) ,,Medium,Tree,\n[Factor Combinations](https://leetcode.com/problems/factor-combinations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_254.java) ,,Medium,Backtracking,\n[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_253.java) ,,Medium,Heap,\n[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/),[Solution](../master/src/main/java/com/fishercoder/solutions/_252.java) ,,Easy,,\n[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/),[Solution](../master/src/main/java/com/fishercoder/solutions/_251.java) ,,Medium,,\n[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_250.java) ,,Medium,DFS,\n[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_249.java) ,,,,\n[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_248.java) ,,Hard ,\"Recursion, DFS \",\n[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_247.java) ,,Medium ,Recursion,\n[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_246.java) ,,Easy ,,\n[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_245.java) ,,Medium ,,\n[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_244.java) ,,Medium ,HashMap,\n[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_243.java) ,,Easy,,\n[Valid Anagram](https://leetcode.com/problems/valid-anagram/),[Solution](../master/src/main/java/com/fishercoder/solutions/_242.java) ,,Easy,,\n[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_241.java) ,,Medium ,Divide and Conquer,\n[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_240.java) ,,Medium,Binary Search,\n[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_239.java) ,,Hard,Heap,\n[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/),[Solution](../master/src/main/java/com/fishercoder/solutions/_238.java) ,,Medium,Array,\n[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_237.java) ,[:tv:](https://youtu.be/sW8ZaOTtvgI) ,Easy,LinkedList,\n[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_236.java) ,,Medium,DFS,\n[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_235.java) ,,Easy,DFS,\n[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_234.java) ,[:tv:](https://youtu.be/bOGh_3MTrdE) ,Easy,Linked List ,\n[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/),[Solution](../master/src/main/java/com/fishercoder/solutions/_233.java) ,,Hard,Math,\n[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/),[Solution](../master/src/main/java/com/fishercoder/solutions/_232.java) ,,Medium,\"Stack, Design\",\n[Power of Two](https://leetcode.com/problems/power-of-two/),[Solution](../master/src/main/java/com/fishercoder/solutions/_231.java) ,,Easy,,\n[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/),[Solution](../master/src/main/java/com/fishercoder/solutions/_230.java) ,,Medium,Tree,\n[Majority Element II](https://leetcode.com/problems/majority-element-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_229.java) ,,Medium,,\n[Summary Ranges](https://leetcode.com/problems/summary-ranges/),[Solution](../master/src/main/java/com/fishercoder/solutions/_228.java) ,,Medium,Array,\n[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_227.java) ,,Medium,String,\n[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_226.java) ,,Easy,\"DFS, recursion\",\n[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/),[Solution](../master/src/main/java/com/fishercoder/solutions/_225.java) ,,Easy,\"Stack, Queue\",\n[Basic Calculator](https://leetcode.com/problems/basic-calculator/),[Solution](../master/src/main/java/com/fishercoder/solutions/_224.java) ,,Hard,,\n[Rectangle Area](https://leetcode.com/problems/rectangle-area/),[Solution](../master/src/main/java/com/fishercoder/solutions/_223.java) ,,Easy,,\n[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_222.java) ,,Medium,Recursion,\n[Maximal Square](https://leetcode.com/problems/maximal-square/),[Solution](../master/src/main/java/com/fishercoder/solutions/_221.java) ,,Medium,Recursion,\n[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_220.java) ,[:tv:](https://youtu.be/Cu7g9ovYHNI) ,Medium,TreeSet,\n[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_219.java) ,[:tv:](https://youtu.be/SFMCxqSeM94) ,Easy,HashMap,\n[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/),[Solution](../master/src/main/java/com/fishercoder/solutions/_218.java) ,,Hard,\"TreeMap, Design\",\n[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/),[Solution](../master/src/main/java/com/fishercoder/solutions/_217.java) ,[:tv:](https://youtu.be/SFMCxqSeM94) ,Easy,HashSet,\n[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_216.java) ,,Medium,Backtracking,\n[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_215.java) ,,Medium,Heap,\n[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/),[Solution](../master/src/main/java/com/fishercoder/solutions/_214.java) ,,Hard ,KMP,\n[House Robber II](https://leetcode.com/problems/house-robber-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_213.java) ,,Medium ,DP,\n[Word Search II](https://leetcode.com/problems/word-search-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/WordSearchII.java) ,,Hard ,Trie,\n[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/),[Solution](../master/src/main/java/com/fishercoder/solutions/_211.java) ,,Medium,Trie,\n[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_210.java) ,,Medium,,\n[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_209.java) ,,Medium,,\n[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_208.java) ,[:tv:](https://youtu.be/Br7Wt4V5o1c) ,Medium,Trie,\n[Course Schedule](https://leetcode.com/problems/course-schedule/),[Solution](../master/src/main/java/com/fishercoder/solutions/_207.java) ,,Medium,,\n[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_206.java) ,[:tv:](https://youtu.be/N_Y12-5oa-w) ,Easy ,Linked List,\n[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_205.java) ,,Easy,,\n[Count Primes](https://leetcode.com/problems/count-primes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_204.java) ,,Easy ,The Sieve of Eratosthenes,\n[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/),[Solution](../master/src/main/java/com/fishercoder/solutions/_203.java) ,,Easy,,\n[Happy Number](https://leetcode.com/problems/happy-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_202.java) ,,Easy,,\n[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/),[Solution](../master/src/main/java/com/fishercoder/solutions/_201.java) ,,Medium ,Bit Manipulation,\n[Number of Islands](https://leetcode.com/problems/number-of-islands/),[Solution](../master/src/main/java/com/fishercoder/solutions/_200.java) ,,Medium,\"Union Find, DFS\",\n[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/),[Solution](../master/src/main/java/com/fishercoder/solutions/_199.java) ,,Medium ,BFS ,\n[House Robber](https://leetcode.com/problems/house-robber/),[Solution](../master/src/main/java/com/fishercoder/solutions/_198.java) ,,Easy ,DP,\n[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_191.java) ,,Easy ,Bit Manipulation,\n[Reverse Bits](https://leetcode.com/problems/reverse-bits/),[Solution](../master/src/main/java/com/fishercoder/solutions/_190.java) ,,Easy ,Bit Manipulation,\n[Rotate Array](https://leetcode.com/problems/rotate-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_189.java) ,[:tv:](https://youtu.be/lTHTR_jsqAQ) ,Easy,,\n[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/),[Solution](../master/src/main/java/com/fishercoder/solutions/_188.java) ,,Hard ,DP,\n[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_187.java) ,,Medium,,\n[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_186.java) ,,Medium,,\n[Largest Number](https://leetcode.com/problems/largest-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_179.java) ,,Medium,,\n[Dungeon Game](https://leetcode.com/problems/dungeon-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_174.java) ,,Hard,DP,\n[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/),[Solution](../../blmaster/MEDIUM/src/medium/_173.java) ,,Medium,\"Stack, Design\",\n[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_172.java) ,,Easy,,\n[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_171.java) ,,Easy,,\n[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/),[Solution](../master/src/main/java/com/fishercoder/solutions/_170.java) ,,Easy,,\n[Majority Element](https://leetcode.com/problems/majority-element/),[Solution](../master/src/main/java/com/fishercoder/solutions/_169.java) ,[:tv:](https://youtu.be/M1IL4hz0QrE) ,Easy,,\n[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/),[Solution](../master/src/main/java/com/fishercoder/solutions/_168.java) ,,Easy,,\n[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_167.java), [Javascript](../master/javascript/_167.js) \",,Easy,Binary Search,\n[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_166.java) ,,Medium,HashMap,\n[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_165.java) ,,Easy,,\n[Maximum Gap](https://leetcode.com/problems/maximum-gap/),[Solution](../master/src/main/java/com/fishercoder/solutions/_164.java) ,,Hard,,\n[Missing Ranges](https://leetcode.com/problems/missing-ranges/),[Solution](../master/src/main/java/com/fishercoder/solutions/_163.java) ,,,,\n[Find Peak Element](https://leetcode.com/problems/find-peak-element/),[Solution](../master/src/main/java/com/fishercoder/solutions/_162.java) ,,Binary Search,,\n[One Edit Distance](https://leetcode.com/problems/one-edit-distance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_161.java) ,,,,\n[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/),[Solution](../master/src/main/java/com/fishercoder/solutions/_160.java) ,,Easy,Linked List,\n[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/),[Solution](../master/src/main/java/com/fishercoder/solutions/_159.java) ,,Hard,\"String, Sliding Window\",\n[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/),[Solution](../master/src/main/java/com/fishercoder/solutions/_158.java) ,,Hard,,\n[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/),[Solution](../master/src/main/java/com/fishercoder/solutions/_157.java) ,,Easy,,\n[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/),[Solution](../master/src/main/java/com/fishercoder/solutions/_156.java) ,,Medium,\"Tree, Recursion\",\n[Min Stack](https://leetcode.com/problems/min-stack/),[Solution](../master/src/main/java/com/fishercoder/solutions/_155.java) ,,Easy,Stack,\n[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_154.java) ,,Hard,\"Array, Binary Search\",\n[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_153.java) ,,Medium,\"Array, Binary Search\",\n[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/),[Solution](../master/src/main/java/com/fishercoder/solutions/_152.java) ,,Medium,Array,\n[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_151.java) ,,Medium,String,\n[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/),[Solution](../master/src/main/java/com/fishercoder/solutions/_150.java) ,,Medium,,\n[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/),[Solution](../master/src/main/java/com/fishercoder/solutions/_149.java) ,,Hard,,\n[Sort List](https://leetcode.com/problems/sort-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_148.java) ,,Medium ,\"Linked List, Sorting\",\n[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_147.java) ,,Medium ,Linked List,\n[LRU Cache](https://leetcode.com/problems/lru-cache/),[Solution](../master/src/main/java/com/fishercoder/solutions/_146.java) ,,Hard,\"Doubly Linked List, LinkedHashMap\",\n[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_145.java) ,[:tv:](https://youtu.be/B6XTLPpsW7k) ,Easy,Binary Tree,\n[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_144.java) ,[:tv:](https://youtu.be/367McfIeBDM) and [:tv:](https://youtu.be/vMHaqhiTn7Y) ,Medium,Binary Tree,\n[Reorder List](https://leetcode.com/problems/reorder-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_143.java) ,,Medium,,\n[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_142.java) ,,Medium,Linked List,\n[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_141.java) ,[:tv:](https://youtu.be/agkyC-rbgKM) ,Easy,Linked List,\n[Word Break II](https://leetcode.com/problems/word-break-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_140.java) ,,Hard,Backtracking/DFS,\n[Word Break](https://leetcode.com/problems/word-break/),[Solution](../master/src/main/java/com/fishercoder/solutions/_139.java) ,[:tv:](https://youtu.be/iWenZCZEBIA) ,Medium,\"DP, Pruning\",\n[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/),[Solution](../master/src/main/java/com/fishercoder/solutions/_138.java) ,,Medium,\"LinkedList, HashMap \",\n[Single Number II](https://leetcode.com/problems/single-number-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_137.java) ,,Medium,Bit Manipulation,\n[Single Number](https://leetcode.com/problems/single-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_136.java) ,[:tv:](https://youtu.be/gJ8VcJ8f_Vk) ,Easy ,Bit Manipulation,\n[Candy](https://leetcode.com/problems/candy/),[Solution](../master/src/main/java/com/fishercoder/solutions/_135.java) ,,Hard,Greedy,\n[Gas Station](https://leetcode.com/problems/gas-station/),[Solution](../master/src/main/java/com/fishercoder/solutions/_134.java) ,,Medium,Greedy,\n[Clone Graph](https://leetcode.com/problems/clone-graph/),[Solution](../master/src/main/java/com/fishercoder/solutions/_133.java) ,,Medium,\"HashMap, BFS, Graph \",\n[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_132.java) ,,Hard,,\n[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/),[Solution](../master/src/main/java/com/fishercoder/solutions/_131.java) ,,Medium,,\n[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/),[Solution](../master/src/main/java/com/fishercoder/solutions/_130.java) ,,Medium,,\n[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_129.java) ,,Medium,DFS,\n[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_128.java) ,,Hard,Union Find ,\n[Word Ladder](https://leetcode.com/problems/word-ladder/),[Solution](../master/src/main/java/com/fishercoder/solutions/_127.java) ,,Hard,BFS,\n[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_126.java) ,,Hard,BFS,\n[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/),[Solution](../master/src/main/java/com/fishercoder/solutions/_125.java) ,,Easy,Two Pointers,\n[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_124.java) ,,Hard ,\"Tree, DFS\",\n[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_123.java) ,,Hard ,DP,\n[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_122.java) ,,Easy ,Greedy,\n[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/),[Solution](../master/src/main/java/com/fishercoder/solutions/_121.java) ,,Easy,,\n[Triangle](https://leetcode.com/problems/triangle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_120.java) ,,Medium,DP,\n[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_119.java) ,[:tv:](https://www.youtube.com/watch?v=iVhmR1bzKoo) ,Easy,,\n[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_118.java) ,[:tv:](https://www.youtube.com/watch?v=TXd5lfP3Gac) ,Easy,,\n[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_117.java) ,,Medium,BFS,\n[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node/),[Solution](../master/src/main/java/com/fishercoder/solutions/_116.java) ,,Medium,BFS,\n[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/),[Solution](../master/src/main/java/com/fishercoder/solutions/_115.java) ,,Hard,DP,\n[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_114.java) ,,Medium,Tree,\n[Path Sum II](https://leetcode.com/problems/path-sum-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_113.java) ,,Medium,\"DFS, Backtracking\",\n[Path Sum](https://leetcode.com/problems/path-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_112.java) ,,Easy,DFS,\n[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_111.java) ,,Easy,\"BFS, DFS\",\n[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_110.java) ,,Easy,DFS,\n[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_109.java) ,,Medium ,\"DFS, Recursion\",\n[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_108.java) ,[:tv:](https://youtu.be/VVSnM5DGvjg) ,Easy ,Tree,\n[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_107.java) ,,Easy,BFS,\n[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_106.java) ,,Medium,\"Recursion, Tree\",\n[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_105.java) ,,Medium,\"Recursion, Tree \",\n[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_104.java) ,[:tv:](https://youtu.be/dvmoHr5cN80) ,Easy,DFS,\n[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_103.java) ,,Medium,\"BFS,DFS\",\n[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_102.java) ,[:tv:](https://youtu.be/sFDNL6r5aDM) ,Medium,BFS,\n[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_101.java) ,[:tv:](https://www.youtube.com/watch?v=F85boSPtfKg) ,Easy,DFS,\n[Same Tree](https://leetcode.com/problems/same-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_100.java) ,[:tv:](https://www.youtube.com/watch?v=2Pe6e0KbgFI) ,Easy,DFS,\n[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_99.java) ,,Hard ,,\n[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/),[Solution](../master/src/main/java/com/fishercoder/solutions/_98.java) ,[:tv:](https://youtu.be/kR5AxWHa9nc) ,Medium ,DFS/Recursion,\n[Interleaving String](https://leetcode.com/problems/interleaving-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_97.java) ,,Hard,DP,\n[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/),[Solution](../master/src/main/java/com/fishercoder/solutions/_96.java) ,,Medium ,\"Recursion, DP\",\n[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_95.java) ,,Medium ,Recursion,\n[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/),[Solution](../master/src/main/java/com/fishercoder/solutions/_94.java) ,[:tv:](https://youtu.be/o_T8MswDI_Y) [:tv:](https://youtu.be/QxFOR8sQuB4) ,Medium,Binary Tree,\n[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_93.java) ,,Medium ,Backtracking,\n[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_92.java) ,,Medium,,\n[Decode Ways](https://leetcode.com/problems/decode-ways/),[Solution](../master/src/main/java/com/fishercoder/solutions/_91.java) ,,Medium,DP,\n[Subsets II](https://leetcode.com/problems/subsets-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_90.java) ,,Medium ,Backtracking,\n[Gray Code](https://leetcode.com/problems/gray-code/),[Solution](../master/src/main/java/com/fishercoder/solutions/_89.java) ,,Medium ,Bit Manipulation,\n[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_88.java) ,,Easy ,,\n[Scramble String](https://leetcode.com/problems/scramble-string/),[Solution](../master/src/main/java/com/fishercoder/solutions/_87.java) ,,Hard ,Recursion,\n[Partition List](https://leetcode.com/problems/partition-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_86.java) ,,Medium ,Linked List,\n[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/),[Solution](../master/src/main/java/com/fishercoder/solutions/_85.java) ,,Hard ,DP,\n[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/),[Solution](../master/src/main/java/com/fishercoder/solutions/_84.java) ,,Hard ,\"Array, Stack\",\n[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_83.java) ,,Easy ,Linked List,\n[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_82.java) ,,Medium ,Linked List,\n[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_81.java) ,,Medium ,Binary Search,\n[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_80.java) ,,Medium ,,\n[Word Search](https://leetcode.com/problems/word-search/),[Solution](../master/src/main/java/com/fishercoder/solutions/_79.java) ,,Medium ,\"Backtracking, DFS\",\n[Subsets](https://leetcode.com/problems/subsets/),[Solution](../master/src/main/java/com/fishercoder/solutions/_78.java) ,,Medium ,Backtracking,\n[Combinations](https://leetcode.com/problems/combinations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_77.java) ,,Medium ,Backtracking,\n[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_76.java) ,,Hard ,Two Pointers,\n[Sort Colors](https://leetcode.com/problems/sort-colors/),[Solution](../master/src/main/java/com/fishercoder/solutions/_75.java) ,,Medium ,Two Pointers,\n[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_74.java) ,,Medium ,Binary Search,\n[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/),[Solution](../master/src/main/java/com/fishercoder/solutions/_73.java) ,,Medium ,,\n[Edit Distance](https://leetcode.com/problems/edit-distance/),[Solution](../master/src/main/java/com/fishercoder/solutions/_72.java) ,,Hard ,,\n[Simplify Path](https://leetcode.com/problems/simplify-path/),[Solution](../master/src/main/java/com/fishercoder/solutions/_71.java) ,,Medium ,Stack,\n[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_70.java) ,[:tv:](https://youtu.be/ZMNRb9TYiQM) ,Easy,DP,\n[Sqrt(x)](https://leetcode.com/problems/sqrtx/),[Solution](../master/src/main/java/com/fishercoder/solutions/_69.java) ,,Easy ,,\n[Text Justification](https://leetcode.com/problems/text-justification/),[Solution](../master/src/main/java/com/fishercoder/solutions/_68.java) ,,Hard ,,\n[Add Binary](https://leetcode.com/problems/add-binary/),[Solution](../master/src/main/java/com/fishercoder/solutions/_67.java) ,,Easy ,,\n[Plus One](https://leetcode.com/problems/plus-one/),[Solution](../master/src/main/java/com/fishercoder/solutions/_66.java) ,[:tv:](https://youtu.be/HKjt0f1N0GA) ,Easy,,\n[Valid Number](https://leetcode.com/problems/valid-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_65.java) ,,Hard ,,\n[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_64.java) ,,Medium ,DP,\n[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_63.java) ,,Medium ,DP,\n[Unique Paths](https://leetcode.com/problems/unique-paths/),[Solution](../master/src/main/java/com/fishercoder/solutions/_62.java) ,,Medium ,DP,\n[Rotate List](https://leetcode.com/problems/rotate-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_61.java) ,,Medium ,Linked List,\n[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/),[Solution](../master/src/main/java/com/fishercoder/solutions/_60.java) ,,Medium ,\"Math, Backtracking\",\n[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_59.java) ,[:tv:](https://www.youtube.com/watch?v=Sv9DK2C4rtc) ,Medium,,\n[Length of Last Word](https://leetcode.com/problems/length-of-last-word/),[Solution](../master/src/main/java/com/fishercoder/solutions/_58.java) ,,Easy ,,\n[Insert Intervals](https://leetcode.com/problems/insert-interval/),[Solution](../master/src/main/java/com/fishercoder/solutions/_57.java) ,,Hard ,\"Array, Sort\",\n[Merge Intervals](https://leetcode.com/problems/merge-intervals/),[Solution](../master/src/main/java/com/fishercoder/solutions/_56.java) ,,Medium ,\"Array, Sort\",\n[Jump Game](https://leetcode.com/problems/jump-game/),[Solution](../master/src/main/java/com/fishercoder/solutions/_55.java) ,,Medium ,Greedy,\n[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_54.java) ,[:tv:](https://www.youtube.com/watch?v=uYgoo8BdUAA) ,Medium,Array,\n[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/),[Solution](../master/src/main/java/com/fishercoder/solutions/_53.java) ,,Easy ,Array,\n[N-Queens II](https://leetcode.com/problems/n-queens-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_52.java) ,,Hard ,Backtracking,\n[N-Queens](https://leetcode.com/problems/n-queens/),[Solution](../master/src/main/java/com/fishercoder/solutions/_51.java) ,,Hard ,,\n\"[Pow(x, n)](https://leetcode.com/problems/powx-n/)\",[Solution](../master/src/main/java/com/fishercoder/solutions/_50.java) ,,Medium ,,\n[Group Anagrams](https://leetcode.com/problems/group-anagrams/),[Solution](../master/src/main/java/com/fishercoder/solutions/_49.java) ,,Medium ,HashMap,\n[Rotate Image](https://leetcode.com/problems/rotate-image/),[Solution](../master/src/main/java/com/fishercoder/solutions/_48.java) ,[:tv:](https://youtu.be/gCciKhaK2v8) ,Medium ,Array,\n[Permutations II](https://leetcode.com/problems/permutations-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_47.java) ,,Medium ,Backtracking,\n[Permutations](https://leetcode.com/problems/permutations/),[Solution](../master/src/main/java/com/fishercoder/solutions/_46.java) ,,Medium ,Backtracking,\n[Jump Game II](https://leetcode.com/problems/jump-game-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_45.java) ,,Hard ,\"Array, Greedy\",\n[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/),[Solution](../master/src/main/java/com/fishercoder/solutions/_44.java) ,,Hard ,\"Backtracking, DP, Greedy, String\",\n[Multiply Strings](https://leetcode.com/problems/multiply-strings/),[Solution](../master/src/main/java/com/fishercoder/solutions/_43.java) ,,Medium ,\"Array, String\",\n[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/),[Solution](../master/src/main/java/com/fishercoder/solutions/_42.java) ,,Hard ,,\n[First Missing Positive](https://leetcode.com/problems/first-missing-positive/),[Solution](../master/src/main/java/com/fishercoder/solutions/_41.java) ,,Hard ,Array,\n[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/),[Solution](../master/src/main/java/com/fishercoder/solutions/_40.java) ,,Medium ,Backtracking,\n[Combination Sum](https://leetcode.com/problems/combination-sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_39.java) ,,Medium ,Backtracking,\n[Count and Say](https://leetcode.com/problems/count-and-say/),[Solution](../master/src/main/java/com/fishercoder/solutions/_38.java) ,,Easy ,\"Recursion, LinkedList\",\n[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/),[Solution](../master/src/main/java/com/fishercoder/solutions/_37.java) ,,Hard ,,\n[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) \",,Medium ,,\n[Search Insert Position](https://leetcode.com/problems/search-insert-position/),[Solution](../master/src/main/java/com/fishercoder/solutions/_35.java) ,,Easy ,Array,\n[Search for a Range](https://leetcode.com/problems/search-for-a-range/),[Solution](../master/src/main/java/com/fishercoder/solutions/_34.java) ,,Medium ,\"Array, Binary Search\",\n[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_33.java) ,,Medium ,Binary Search,\n[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_32.java) ,,Hard ,\"Stack, DP\",\n[Next Permutation](https://leetcode.com/problems/parents-permutation),\"[Java](../master/src/main/java/com/fishercoder/solutions/_31.java), [C++](../master/cpp/_31.cpp) \",,Medium ,Array,\n[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/),[Solution](../master/src/main/java/com/fishercoder/solutions/_30.java) ,,Hard ,HashMap,\n[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_29.java) ,,Medium ,,\n[Implement strStr()](https://leetcode.com/problems/implement-strstr/),[Solution](../master/src/main/java/com/fishercoder/solutions/_28.java) ,,Easy ,String,\n[Remove Element](https://leetcode.com/problems/remove-element/),[Solution](../master/src/main/java/com/fishercoder/solutions/_27.java) ,,Easy ,,\n[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/),[Solution](../master/src/main/java/com/fishercoder/solutions/_26.java) ,[:tv:](https://youtu.be/nRKZC2JF7LU) ,Easy,Array ,\n[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/),[Solution](../master/src/main/java/com/fishercoder/solutions/_25.java) ,,Hard ,\"Recursion, LinkedList\",\n[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/),[Solution](../master/src/main/java/com/fishercoder/solutions/_24.java) ,,Medium ,\"Recursion, LinkedList\",\n[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/),[Solution](../master/src/main/java/com/fishercoder/solutions/_23.java) ,[:tv:](https://www.youtube.com/watch?v=Llse1tImXQA) ,Hard,Heap,\n[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_22.java) ,,Medium ,Backtracking,\n[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/),[Solution](../master/src/main/java/com/fishercoder/solutions/_21.java) ,[:tv:](https://youtu.be/N8WTaSSivEI) ,Easy,Recursion,\n[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/),[Solution](../master/src/main/java/com/fishercoder/solutions/_20.java) ,[:tv:](https://www.youtube.com/watch?v=eBbg5pnq5Zg) ,Easy,Stack,\n[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/),[Solution](../master/src/main/java/com/fishercoder/solutions/_19.java) ,[:tv:](https://youtu.be/Kka8VgyFZfc) ,Medium,Linked List,\n[4 Sum](https://leetcode.com/problems/4sum/),[Solution](../master/src/main/java/com/fishercoder/solutions/_18.java) ,,Medium ,Two Pointers,\n[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/),[Solution](../master/src/main/java/com/fishercoder/solutions/_17.java) ,,Medium ,Backtracking,\n[3Sum Closest](https://leetcode.com/problems/3sum-closest/),[Solution](../master/src/main/java/com/fishercoder/solutions/_16.java) ,,Medium ,Two Pointers,\n[3Sum](https://leetcode.com/problems/3sum/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_15.java), [C++](../master/cpp/_15.cpp) \",[:tv:](https://www.youtube.com/watch?v=jeim_j8VdiM) ,Medium,\"Two Pointers, Binary Search\",\n[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/),[Solution](../master/src/main/java/com/fishercoder/solutions/_14.java) ,[:tv:](https://www.youtube.com/watch?v=K1ps6d7YCy4) ,Easy,,\n[Roman to Integer](https://leetcode.com/problems/roman-to-integer),[Solution](../master/src/main/java/com/fishercoder/solutions/_13.java) ,,Easy ,\"Math, String\",\n[Integer to Roman](https://leetcode.com/problems/integer-to-roman/),[Solution](../master/src/main/java/com/fishercoder/solutions/_12.java) ,,Medium ,\"Math, String\",\n[Container With Most Water](https://leetcode.com/problems/container-with-most-water/),[Solution](../master/src/main/java/com/fishercoder/solutions/_11.java) ,,Medium ,,\n[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](../master/javascript/_10.js) \",,Hard ,DP,\n[Palindrome Number](https://leetcode.com/problems/palindrome-number/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_9.java), [C++](../master/cpp/_9.cpp) \",,Easy,,\n[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/),[Solution](../master/src/main/java/com/fishercoder/solutions/_8.java) ,,Medium,,\n[Reverse Integer](https://leetcode.com/problems/reverse-integer/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_7.java), [C++](../master/cpp/_7.cpp) \",[:tv:](https://youtu.be/tm1Yrb_SfBM) ,Easy ,,\n[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/),[Solution](../master/src/main/java/com/fishercoder/solutions/_6.java) ,,Easy ,,\n[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/),[Solution](../master/src/main/java/com/fishercoder/solutions/_5.java) ,,Medium,,\n[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_4.java), [C++](../master/cpp/_4.cpp) \",,Hard ,Divide and Conquer,\n[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/),\"[Solution](../master/src/main/java/com/fishercoder/solutions/_3.java), [C++](../master/cpp/_3.cpp) \",,Medium ,\"HashMap, Sliding Window\",\n[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/),[Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) ,,Medium ,LinkedList,\n[Two Sum](https://leetcode.com/problems/two-sum/),\"[Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp), [Javascript](../master/javascript/_1.js) \",[:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=) ,Easy,HashMap ,\n" }, { "path": "data/leetcode_repo_readme.md", "content": "| ID | Title | Solutions | Video | Difficulty | Tag | Company \n|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|-------------|-------------\n| 2264 |[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/largest-3-same-digit-number-in-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2264.java) || Easy ||\n| 2260 |[Minimum Consecutive Cards to Pick Up](https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2260.java) || Medium ||\n| 2259 |[Remove Digit From Number to Maximize Result](https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2259.java) || Easy ||\n| 2256 |[Minimum Average Difference](https://leetcode.com/problems/minimum-average-difference/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2256.java) || Medium ||\n| 2255 |[Count Prefixes of a Given String](https://leetcode.com/problems/count-prefixes-of-a-given-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2255.java) || Easy ||\n| 2248 |[Intersection of Multiple Arrays](https://leetcode.com/problems/intersection-of-multiple-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2248.java) || Easy ||\n| 2244 |[Minimum Rounds to Complete All Tasks](https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2244.java) || Medium ||\n| 2243 |[Calculate Digit Sum of a String](https://leetcode.com/problems/calculate-digit-sum-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2243.java) || Easy ||\n| 2239 |[Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2239.java) || Easy ||\n| 2236 |[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2236.java) || Easy ||\n| 223 |[Root Equals Sum of Children](https://leetcode.com/problems/root-equals-sum-of-children/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2236.java) || Easy ||\n| 2220 |[Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2220.java) || Easy ||\n| 2215 |[Find the Difference of Two Arrays](https://leetcode.com/problems/find-the-difference-of-two-arrays/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2215.java) || Easy ||\n| 2210 |[Count Hills and Valleys in an Array](https://leetcode.com/problems/count-hills-and-valleys-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2210.java) || Easy ||\n| 2208 |[Minimum Operations to Halve Array Sum](https://leetcode.com/problems/minimum-operations-to-halve-array-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2208.java) || Medium ||\n| 2206 |[Divide Array Into Equal Pairs](https://leetcode.com/problems/divide-array-into-equal-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2206.java) || Easy ||\n| 2201 |[Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2201.java) || Medium ||\n| 2200 |[Find All K-Distant Indices in an Array](https://leetcode.com/problems/find-all-k-distant-indices-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2200.java) || Easy ||\n| 2194 |[Cells in a Range on an Excel Sheet](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2194.java) || Easy ||\n| 2190 |[Most Frequent Number Following Key In an Array](https://leetcode.com/problems/most-frequent-number-following-key-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2190.java) || Easy ||\n| 2186 |[Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2186.java) || Medium ||\n| 2185 |[Counting Words With a Given Prefix](https://leetcode.com/problems/counting-words-with-a-given-prefix/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2185.java) || Easy ||\n| 2182 |[Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2182.java) || Medium ||\n| 2181 |[Merge Nodes in Between Zeros](https://leetcode.com/problems/merge-nodes-in-between-zeros/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2181.java) || Medium ||\n| 2180 |[Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2180.java) || Easy ||\n| 2177 |[Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2177.java) || Medium ||\n| 2176 |[Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2176.java) || Easy ||\n| 2169 |[Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2169.java) || Easy ||\n| 2166 |[Design Bitset](https://leetcode.com/problems/design-bitset/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2166.java) || Medium ||\n| 2165 |[Smallest Value of the Rearranged Number](https://leetcode.com/problems/smallest-value-of-the-rearranged-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2165.java) || Medium ||\n| 2164 |[Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2164.java) || Easy ||\n| 2161 |[Partition Array According to Given Pivot](https://leetcode.com/problems/partition-array-according-to-given-pivot/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2161.java) || Medium ||\n| 2160 |[Minimum Sum of Four Digit Number After Splitting Digits](https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2160.java) || Easy ||\n| 2156 |[Find Substring With Given Hash Value](https://leetcode.com/problems/find-substring-with-given-hash-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2156.java) || Medium ||\n| 2155 |[All Divisions With the Highest Score of a Binary Array](https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2155.java) || Medium ||\n| 2154 |[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) || Easy ||\n| 2150 |[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2150.java) || Medium ||\n| 2149 |[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2149.java) || Medium ||\n| 2148 |[Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2148.java) || Easy ||\n| 2144 |[Minimum Cost of Buying Candies With Discount](https://leetcode.com/problems/minimum-cost-of-buying-candies-with-discount/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2144.java) || Easy ||\n| 2139 |[Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2139.java) || Medium ||\n| 2138 |[Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2138.java) || Easy ||\n| 2134 |[Minimum Swaps to Group All 1's Together II](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2134.java) || Medium ||\n| 2133 |[Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2133.java) || Easy ||\n| 2130 |[Maximum Twin Sum of a Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2130.java) || Medium ||\n| 2129 |[Capitalize the Title](https://leetcode.com/problems/capitalize-the-title/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2129.java) || Easy ||\n| 2126 |[Destroying Asteroids](https://leetcode.com/problems/destroying-asteroids/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2126.java) || Medium ||\n| 2125 |[Number of Laser Beams in a Bank](https://leetcode.com/problems/number-of-laser-beams-in-a-bank/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2125.java) || Medium ||\n| 2124 |[Check if All A's Appears Before All B's](https://leetcode.com/problems/check-if-all-as-appears-before-all-bs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2124.java) || Easy ||\n| 2120 |[Execution of All Suffix Instructions Staying in a Grid](https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2120.java) || Medium ||\n| 2119 |[A Number After a Double Reversal](https://leetcode.com/problems/a-number-after-a-double-reversal/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2119.java) || Easy ||\n| 2116 |[Check if a Parentheses String Can Be Valid](https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2116.java) || Medium ||\n| 2114 |[Maximum Number of Words Found in Sentences](https://leetcode.com/problems/maximum-number-of-words-found-in-sentences/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2114.java) || Easy ||\n| 2110 |[Number of Smooth Descent Periods of a Stock](https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2110.java) || Medium ||\n| 2109 |[Adding Spaces to a String](https://leetcode.com/problems/adding-spaces-to-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2109.java) || Medium ||\n| 2108 |[Find First Palindromic String in the Array](https://leetcode.com/problems/find-first-palindromic-string-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2108.java) || Easy ||\n| 2103 |[Rings and Rods](https://leetcode.com/problems/rings-and-rods/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2103.java) || Easy ||\n| 2099 |[Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2099.java) || Easy ||\n| 2095 |[Delete the Middle Node of a Linked List](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2095.java) || Medium ||\n| 2094 |[Finding 3-Digit Even Numbers](https://leetcode.com/problems/finding-3-digit-even-numbers/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2094.java) || Easy ||\n| 2091 |[Removing Minimum and Maximum From Array](https://leetcode.com/problems/removing-minimum-and-maximum-from-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2091.java) || Medium ||\n| 2090 |[K Radius Subarray Averages](https://leetcode.com/problems/k-radius-subarray-averages/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2090.java) || Medium ||\n| 2089 |[Find Target Indices After Sorting Array](https://leetcode.com/problems/find-target-indices-after-sorting-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2089.java) || Easy ||\n| 2086 |[Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2086.java) || Medium ||\n| 2085 |[Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2085.java) || Easy ||\n| 2080 |[Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2080.java) || Medium |Array, Binary Search|\n| 2079 |[Watering Plants](https://leetcode.com/problems/watering-plants/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2079.java) || Medium ||\n| 2078 |[Two Furthest Houses With Different Colors](https://leetcode.com/problems/two-furthest-houses-with-different-colors/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2078.java) || Easy ||\n| 2076 |[Process Restricted Friend Requests](https://leetcode.com/problems/process-restricted-friend-requests/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2076.java) || Hard ||\n| 2075 |[Decode the Slanted Ciphertext](https://leetcode.com/problems/decode-the-slanted-ciphertext/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2075.java) || Medium ||\n| 2074 |[Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2074.java) || Medium ||\n| 2073 |[Time Needed to Buy Tickets](https://leetcode.com/problems/time-needed-to-buy-tickets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2073.java) || Easy ||\n| 2070 |[Most Beautiful Item for Each Query](https://leetcode.com/problems/most-beautiful-item-for-each-query/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2070.java) || Medium ||\n| 2068 |[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2068.java) || Easy ||\n| 2063 |[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2063.java) || Medium ||\n| 2062 |[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) || Easy ||\n| 2058 |[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) || Medium ||\n| 2057 |[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) || Easy ||\n| 2055 |[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) || Medium ||\n| 2054 |[Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2054.java) || Medium ||\n| 2053 |[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2053.java) || Easy ||\n| 2050 |[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2050.java) || Hard ||\n| 2048 |[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2048.java) || Medium ||\n| 2047 |[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2047.java) || Easy ||\n| 2044 |[Count Number of Maximum Bitwise-OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2044.java) || Medium ||\n| 2043 |[Simple Bank System](https://leetcode.com/problems/simple-bank-system/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2043.java) || Medium ||\n| 2042 |[Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2042.java) || Easy ||\n| 2039 |[The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2039.java) || Medium ||\n| 2038 |[Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2038.java) || Medium ||\n| 2037 |[Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2037.java) || Easy ||\n| 2034 |[Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2034.java) || Medium ||\n| 2033 |[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2033.java) || Medium ||\n| 2032 |[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) || Easy ||\n| 2028 |[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) || Medium ||\n| 2027 |[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) || Easy ||\n| 2024 |[Maximize the Confusion of an Exam](https://leetcode.com/problems/maximize-the-confusion-of-an-exam/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2024.java) || Medium ||\n| 2023 |[Number of Pairs of Strings With Concatenation Equal to Target](https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2023.java) || Medium ||\n| 2022 |[Convert 1D Array Into 2D Array](https://leetcode.com/problems/convert-1d-array-into-2d-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2022.java) || Easy ||\n| 2018 |[Check if Word Can Be Placed In Crossword](https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2018.java) || Medium ||\n| 2017 |[Grid Game](https://leetcode.com/problems/grid-game/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2017.java) || Medium |Array, Matrix, Prefix Sum|\n| 2016 |[Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2016.java) || Easy ||\n| 2012 |[Sum of Beauty in the Array](https://leetcode.com/problems/sum-of-beauty-in-the-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2012.java) || Medium ||\n| 2011 |[Final Value of Variable After Performing Operations](https://leetcode.com/problems/final-value-of-variable-after-performing-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2011.java) || Easy ||\n| 2007 |[Find Original Array From Doubled Array](https://leetcode.com/problems/find-original-array-from-doubled-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2007.java) || Medium ||\n| 2006 |[Count Number of Pairs With Absolute Difference K](https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2006.java) || Easy ||\n| 2001 |[Number of Pairs of Interchangeable Rectangles](https://leetcode.com/problems/number-of-pairs-of-interchangeable-rectangles/)| [Python3](../master/python3/2001.py), [Java](../master/src/main/java/com/fishercoder/solutions/_2001.java) || Medium ||\n| 2000 |[Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_2000.java) || Easy ||\n| 1996 |[The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1996.java) || Medium ||\n| 1995 |[Count Special Quadruplets](https://leetcode.com/problems/count-special-quadruplets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1995.java) || Easy ||\n| 1992 |[Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1992.java) || Medium ||\n| 1991 |[Find the Middle Index in Array](https://leetcode.com/problems/find-the-middle-index-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1991.java) || Easy ||\n| 1985 |[Find the Kth Largest Integer in the Array](https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1985.java) || Medium ||\n| 1984 |[Minimum Difference Between Highest and Lowest of K Scores](https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1984.java) || Easy ||\n| 1981 |[Minimize the Difference Between Target and Chosen Elements](https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1981.java) || Medium |DP|\n| 1980 |[Find Unique Binary String](https://leetcode.com/problems/find-unique-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1980.java) || Medium ||\n| 1979 |[Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1979.java) || Easy ||\n| 1974 |[Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1974.java) || Easy ||\n| 1971 |[Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1971.java) || Easy |BFS, DFS, Graph|\n| 1968 |[Array With Elements Not Equal to Average of Neighbors](https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1968.java) || Medium ||\n| 1967 |[Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1967.java) || Easy ||\n| 1966 |[Binary Searchable Numbers in an Unsorted Array](https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1966.java) || Medium |Array, Binary Search|\n| 1961 |[Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1961.java) || Easy ||\n| 1957 |[Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1957.java) || Easy |String|\n| 1952 |[Three Divisors](https://leetcode.com/problems/three-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1952.java) || Easy ||\n| 1945 |[Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1945.java) || Easy ||\n| 1941 |[Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1941.java) || Easy ||\n| 1936 |[Add Minimum Number of Rungs](https://leetcode.com/problems/add-minimum-number-of-rungs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1936.java) || Medium ||\n| 1935 |[Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1935.java) || Easy |String|\n| 1933 |[Check if String Is Decomposable Into Value-Equal Substrings](https://leetcode.com/problems/check-if-string-is-decomposable-into-value-equal-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1933.java) || Easy |String|\n| 1929 |[Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1929.java) || Easy ||\n| 1926 |[Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1926.java) || Medium |DP, DFS, BFS|\n| 1925 |[Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1925.java) || Easy |Array, Greedy|\n| 1920 |[Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1920.java) || Easy ||\n| 1913 |[Maximum Product Difference Between Two Pairs](https://leetcode.com/problems/maximum-product-difference-between-two-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1913.java) || Easy |Sort|\n| 1910 |[Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) | [:tv:](https://youtu.be/d74CJIqw268) |Medium|String|\n| 1909 |[Remove One Element to Make the Array Strictly Increasing](https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1909.java) || Easy |Array|\n| 1904 |[The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1904.java) || Medium |String, Greedy|\n| 1903 |[Largest Odd Number in String](https://leetcode.com/problems/largest-odd-number-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1903.java) | [:tv:](https://youtu.be/IIt_ARZzclY) |Easy|Greedy|\n| 1897 |[Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1897.java) || Easy |String, Greedy|\n| 1893 |[Check if All the Integers in a Range Are Covered](https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1893.java) || Easy |Array, HashTable, Prefix Sum|\n| 1891 |[Cutting Ribbons](https://leetcode.com/problems/cutting-ribbons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1891.java) || Medium |Array, Binary Search|\n| 1886 |[Determine Whether Matrix Can Be Obtained By Rotation](https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1886.java) || Easy |Array|\n| 1880 |[Check if Word Equals Summation of Two Words](https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1880.java) || Easy |String|\n| 1877 |[Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1877.java) || Medium |Greedy, Sort|\n| 1876 |[Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1876.java) || Easy |String|\n| 1874 |[Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1874.java) || Medium |Array, Greedy, Sorting|\n| 1869 |[Longer Contiguous Segments of Ones than Zeros](https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1869.java) || Easy |Array, Two Pointers|\n| 1863 |[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java) || Easy |Backtracking, Recursion|\n| 1862 |[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java) || Hard |Math|\n| 1861 |[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java) | [:tv:](https://youtu.be/2LRnTMOiqSI) |Medium|Array, Two Pointers|\n| 1860 |[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java) || Medium |Math|\n| 1859 |[Sorting the Sentence](https://leetcode.com/problems/sorting-the-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1859.java) || Easy |String, Sort|\n| 1854 |[Maximum Population Year](https://leetcode.com/problems/maximum-population-year/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1854.java) || Easy |Array|\n| 1848 |[Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1848.java) || Easy |Array|\n| 1845 |[Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1845.java) || Medium |Heap, Design|\n| 1844 |[Replace All Digits with Characters](https://leetcode.com/problems/replace-all-digits-with-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1844.java) || Easy |String|\n| 1837 |[Sum of Digits in Base K](https://leetcode.com/problems/sum-of-digits-in-base-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1837.java) || Easy |Math, Bit Manipulation|\n| 1836 |[Remove Duplicates From an Unsorted Linked List](https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1836.java) || Medium |HashTable, LinkedList|\n| 1833 |[Maximum Ice Cream Bars](https://leetcode.com/problems/maximum-ice-cream-bars/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1833.java) || Medium |Array, Sort|\n| 1832 |[Check if the Sentence Is Pangram](https://leetcode.com/problems/check-if-the-sentence-is-pangram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1832.java) || Easy |String|\n| 1829 |[Maximum XOR for Each Query](https://leetcode.com/problems/maximum-xor-for-each-query/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1829.java) || Medium |Bit Manipulation|\n| 1828 |[Queries on Number of Points Inside a Circle](https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1828.java) | [:tv:](https://youtu.be/fU4oOBSsVMg) |Medium|Math|\n| 1827 |[Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1827.java) || Easy |Array, Greedy|\n| 1826 |[Faulty Sensor](https://leetcode.com/problems/faulty-sensor/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1826.java) || Easy |Array, Two Pointers|\n| 1823 |[Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1823.java) || Medium |Array|\n| 1822 |[Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1822.java) || Easy |Math|\n| 1817 |[Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1817.java) || Medium |HashTable|\n| 1816 |[Truncate Sentence](https://leetcode.com/problems/truncate-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1816.java) || Easy |String|\n| 1814 |[Count Nice Pairs in an Array](https://leetcode.com/problems/count-nice-pairs-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1814.java) || Medium |Array, HashTable|\n| 1813 |[Sentence Similarity III](https://leetcode.com/problems/sentence-similarity-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1813.java) | [:tv:](https://youtu.be/MMMd7dMv4Ak) |Medium|String|\n| 1812 |[Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1812.java) || Easy |String|\n| 1807 |[Evaluate the Bracket Pairs of a String](https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1807.java) || Medium |HashTable, String|\n| 1806 |[Minimum Number of Operations to Reinitialize a Permutation](https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1806.java) || Medium |Array, Greedy|\n| 1805 |[Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1805.java) || Medium |String|\n| 1804 |[Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1804.java) || Medium |Trie, Design|\n| 1800 |[Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1800.java) || Easy |Two Pointers|\n| 1797 |[Design Authentication Manager](https://leetcode.com/problems/design-authentication-manager/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1797.java) || Medium |HashTable, Design|\n| 1796 |[Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1796.java) || Easy |String|\n| 1792 |[Maximum Average Pass Ratio](https://leetcode.com/problems/maximum-average-pass-ratio/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1792.java) || Medium |Heap|\n| 1791 |[Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1791.java) || Medium |Graph|\n| 1790 |[Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1790.java) || Easy |String|\n| 1785 |[Minimum Elements to Add to Form a Given Sum](https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1785.java) || Medium |Greedy|\n| 1784 |[Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1784.java) || Easy |Greedy|\n| 1781 |[Sum of Beauty of All Substrings](https://leetcode.com/problems/sum-of-beauty-of-all-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1781.java) || Medium |HashTable, String|\n| 1780 |[Check if Number is a Sum of Powers of Three](https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1780.java) || Medium |Math, Backtracking, Recursion|\n| 1779 |[Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1779.java) || Easy |Array|\n| 1775 |[Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1775.java) || Medium |Greedy|\n| 1774 |[Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1774.java) || Medium |Greedy|\n| 1773 |[Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1773.java) | [:tv:](https://youtu.be/eHk8TQIhvCk) |Easy|Array, String|\n| 1772 |[Sort Features by Popularity](https://leetcode.com/problems/sort-features-by-popularity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1772.java) | [:tv:](https://youtu.be/5629LqqeLAM) |Medium|HashTable, Sort|\n| 1769 |[Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1769.java) || Medium |Array, Greedy|\n| 1768 |[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1768.java) || Easy |String|\n| 1765 |[Map of Highest Peak](https://leetcode.com/problems/map-of-highest-peak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1765.java) || Medium |BFS, Graph|\n| 1764 |[Form Array by Concatenating Subarrays of Another Array](https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1764.java) || Medium |Array, Greedy|\n| 1763 |[Longest Nice Substring](https://leetcode.com/problems/longest-nice-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1763.java) || Easy |String|\n| 1759 |[Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) || Medium |String ,Greedy|\n| 1758 |[Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1758.java) || Easy |Greedy, Array|\n| 1756 |[Design Most Recently Used Queue](https://leetcode.com/problems/design-most-recently-used-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1756.java) || Medium |Array, Design, Dequeue|\n| 1754 |[Largest Merge Of Two Strings](https://leetcode.com/problems/largest-merge-of-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) || Medium |Greedy, Suffix Array|\n| 1753 |[Maximum Score From Removing Stones](https://leetcode.com/problems/maximum-score-from-removing-stones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1753.java) || Medium |Math, Heap|\n| 1752 |[Check if Array Is Sorted and Rotated](https://leetcode.com/problems/check-if-array-is-sorted-and-rotated/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1752.java) || Easy |Array|\n| 1750 |[Minimum Length of String After Deleting Similar Ends](https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1750.java) || Medium |Two Pointers|\n| 1749 |[Maximum Absolute Sum of Any Subarray](https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1749.java) || Medium |Greedy|\n| 1748 |[Sum of Unique Elements](https://leetcode.com/problems/sum-of-unique-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1748.java) || Easy |Array, HashTable|\n| 1746 |[Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1746.java) || Medium |DP|\n| 1745 |[Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1745.java) || Hard |String, DP|\n| 1743 |[Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1743.java) || Medium |Greedy|\n| 1742 |[Maximum Number of Balls in a Box](https://leetcode.com/problems/maximum-number-of-balls-in-a-box/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1742.java) || Easy |Array|\n| 1736 |[Latest Time by Replacing Hidden Digits](https://leetcode.com/problems/latest-time-by-replacing-hidden-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1736.java) || Easy |String, Greedy|\n| 1733 |[Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1733.java) || Medium |Array, Greedy|\n| 1732 |[Find the Highest Altitude](https://leetcode.com/problems/find-the-highest-altitude/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1732.java) || Easy |Array|\n| 1727 |[Largest Submatrix With Rearrangements](https://leetcode.com/problems/largest-submatrix-with-rearrangements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1727.java) || Medium |Greedy, Sort|\n| 1726 |[Tuple with Same Product](https://leetcode.com/problems/tuple-with-same-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1726.java) | [:tv:](https://youtu.be/asI_UBkXI0M) |Medium|Array|\n| 1725 |[Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1725.java) || Easy |Greedy|\n| 1721 |[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java) || Medium |LinkedList|\n| 1720 |[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1720.java) || Easy |Bit Manipulation|\n| 1718 |[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1718.java) || Medium |Backtracking, Recursion|\n| 1717 |[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1717.java) | [:tv:](https://youtu.be/9wZ-TWBreTg) |Medium|Greedy|\n| 1716 |[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1716.java) || Easy |Math, Greedy|\n| 1711 |[Count Good Meals](https://leetcode.com/problems/count-good-meals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java) || Medium |Array, HashTable, Two Pointers|\n| 1710 |[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java) || Easy |Greedy, Sort|\n| 1708 |[Largest Subarray Length K](https://leetcode.com/problems/largest-subarray-length-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1708.java) || Easy |Array, Greedy|\n| 1705 |[Maximum Number of Eaten Apples](https://leetcode.com/problems/maximum-number-of-eaten-apples/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1705.java) || Medium |Heap, Greedy|\n| 1704 |[Determine if String Halves Are Alike](https://leetcode.com/problems/determine-if-string-halves-are-alike/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1704.java) || Easy |String|\n| 1700 |[Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1700.java) || Easy |Array|\n| 1695 |[Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1695.java) || Medium |Two Pointers|\n| 1694 |[Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1694.java) || Easy |String|\n| 1690 |[Stone Game VII](https://leetcode.com/problems/stone-game-vii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1690.java) || Medium |DP|\n| 1689 |[Partitioning Into Minimum Number Of Deci-Binary Numbers](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1689.java) || Medium |Greedy|\n| 1688 |[Count of Matches in Tournament](https://leetcode.com/problems/count-of-matches-in-tournament/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1688.java) || Easy |Backtracking|\n| 1686 |[Stone Game VI](https://leetcode.com/problems/stone-game-vi/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1686.java) || Medium |Greedy|\n| 1685 |[Sum of Absolute Differences in a Sorted Array](https://leetcode.com/problems/sum-of-absolute-differences-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1685.java) | [:tv:](https://youtu.be/WYe644djV30) |Medium|Math, Greedy|\n| 1684 |[Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1684.java) || Easy |String|\n| 1680 |[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1680.java) || Medium |Math|\n| 1679 |[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) || Medium |HashTable|\n| 1678 |[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java) || Easy |String|\n| 1676 |[Lowest Common Ancestor of a Binary Tree IV](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1676.java) || Medium |Tree, DFS, Binary Tree|\n| 1675 |[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1675.java) || Hard |Heap, Ordered Map|\n| 1673 |[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) | [:tv:](https://youtu.be/GBJFxSD3B_s) |Medium|Stack, Greedy|\n| 1672 |[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) || Easy |Array|\n| 1670 |[Design Front Middle Back Queue](https://leetcode.com/problems/design-front-middle-back-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1670.java) || Medium |Linked List, Design, Dequeu|\n| 1669 |[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) || Medium |LinedList|\n| 1668 |[Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1668.java) || Easy |String|\n| 1664 |[Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/)| [Javascript](./javascript/_1664.js) || Medium |Greedy|\n| 1663 |[Smallest String With A Given Numeric Value](https://leetcode.com/problems/smallest-string-with-a-given-numeric-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1663.java) | [:tv:](https://youtu.be/o3MRJfsoUrw) |Medium|Greedy|\n| 1662 |[Check If Two String Arrays are Equivalent](https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1662.java) || Easy |String|\n| 1658 |[Minimum Operations to Reduce X to Zero](https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero/)| [Javascript](./javascript/_1658.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1658.java) || Medium |Greedy|\n| 1657 |[Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1657.java) | [:tv:](https://youtu.be/-jXQK-UeChU) |Medium|Greedy|\n| 1656 |[Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1656.java) || Easy |Array, Design|\n| 1652 |[Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1652.java) || Easy |Array|\n| 1650 |[Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1650.java) || Medium |HashTable, Binary Tree, Tree|\n| 1646 |[Get Maximum in Generated Array](https://leetcode.com/problems/get-maximum-in-generated-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1646.java) || Easy |Array|\n| 1644 |[Lowest Common Ancestor of a Binary Tree II](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1644.java) || Medium |Binary Tree, DFS|\n| 1642 |[Furthest Building You Can Reach](https://leetcode.com/problems/furthest-building-you-can-reach/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1642.java) || Medium |Binary Search, Heap|\n| 1641 |[Count Sorted Vowel Strings](https://leetcode.com/problems/count-sorted-vowel-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1641.java) | [:tv:](https://youtu.be/gdH4yfgfwiU) |Medium|Math, DP, Backtracking|\n| 1640 |[Check Array Formation Through Concatenation](https://leetcode.com/problems/check-array-formation-through-concatenation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1640.java) || Easy |Array, Sort|\n| 1637 |[Widest Vertical Area Between Two Points Containing No Points](https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/)| [Javascript](./javascript/_1637.js), [Java](../master/src/main/java/com/fishercoder/solutions/_1637.java) | | Medium | Sort |\n| 1636 |[Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1636.java) || Easy |Array, Sort|\n| 1630 |[Arithmetic Subarrays](https://leetcode.com/problems/arithmetic-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1630.java) || Medium |Sort|\n| 1629 |[Slowest Key](https://leetcode.com/problems/slowest-key/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1629.java) || Easy |Array|\n| 1628 |[Design an Expression Tree With Evaluate Function](https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1628.java) || Medium |Stack, Binary Tree, Design, Math|\n| 1626 |[Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1626.java) || Medium |DP|\n| 1625 |[Lexicographically Smallest String After Applying Operations](https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1625.java) || Medium |BFS, DFS|\n| 1624 |[Largest Substring Between Two Equal Characters](https://leetcode.com/problems/largest-substring-between-two-equal-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1624.java) | [:tv:](https://youtu.be/rfjeFs3JuYM) |Easy|String|\n| 1620 |[Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1620.java) | [:tv:](https://youtu.be/TqKDnzkRsh0) |Medium|Greedy|\n| 1619 |[Mean of Array After Removing Some Elements](https://leetcode.com/problems/mean-of-array-after-removing-some-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1619.java) | [:tv:](https://youtu.be/vyrEra_OfDo) |Easy|Array|\n| 1614 |[Maximum Nesting Depth of the Parentheses](https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1614.java) || Easy |String|\n| 1609 |[Even Odd Tree](https://leetcode.com/problems/even-odd-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1609.java) || Medium |Tree|\n| 1608 |[Special Array With X Elements Greater Than or Equal X](https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1608.java) || Easy |Array|\n| 1604 |[Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1604.java) || Medium |String, Ordered Map|\n| 1603 |[Design Parking System](https://leetcode.com/problems/design-parking-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1603.java) || Easy |Design|\n| 1601 |[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1601.java) || Hard |Backtracking|\n| 1598 |[Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1598.java) || Easy |Stack|\n| 1592 |[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java) || Easy |String|\n| 1588 |[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java) || Easy |Array|\n| 1583 |[Count Unhappy Friends](https://leetcode.com/problems/count-unhappy-friends/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1583.java) || Medium |Array|\n| 1582 |[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) || Easy |Array|\n| 1577 |[Number of Ways Where Square of Number Is Equal to Product of Two Numbers](https://leetcode.com/problems/number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1577.java) || Medium |HashTable, Math|\n| 1576 |[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) | [:tv:](https://youtu.be/SJBDLYqrIsM) |Easy|String|\n| 1574 |[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) || Medium |Array, Binary Search|\n| 1572 |[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) || Easy |Array|\n| 1570 |[Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1570.java) || Easy |Array, HashTable, Two Pointers|\n| 1567 |[Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1567.java) | [:tv:](https://youtu.be/bFer5PdsgpY) |Medium|Greedy|\n| 1566 |[Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1566.java) | [:tv:](https://youtu.be/aJAV_VgmjdE) |Easy|Array|\n| 1561 |[Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1561.java) | [:tv:](https://youtu.be/hPe9Z3TiUrA) |Medium|Sort|\n| 1560 |[Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1560.java) || Easy |Array|\n| 1558 |[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) || Medium |Greedy|\n| 1557 |[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) | [:tv:](https://youtu.be/IfsiNU7J-6c) |Medium|Graph|\n| 1556 |[Thousand Separator](https://leetcode.com/problems/thousand-separator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1556.java) | [:tv:](https://youtu.be/re2BnNbg598) |Easy|String|\n| 1551 |[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1551.java) | [:tv:](https://youtu.be/A-i2sxmBqAA) |Medium|Math|\n| 1550 |[Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1550.java) | |Easy|Array|\n| 1545 |[Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1545.java) | [:tv:](https://youtu.be/34QYE5HAFy4) |Medium|String|\n| 1544 |[Make The String Great](https://leetcode.com/problems/make-the-string-great/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1544.java) | [:tv:](https://youtu.be/Q-ycCXbUOck) |Easy|String, Stack|\n| 1541 |[Minimum Insertions to Balance a Parentheses String](https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1541.java) | [:tv:](https://youtu.be/PEKAlnmbBCc) |Medium|String, Stack|\n| 1539 |[Kth Missing Positive Number](https://leetcode.com/problems/kth-missing-positive-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1539.java) | [:tv:](https://youtu.be/p0P1JNHAB-c) |Easy|Array, HashTable|\n| 1535 |[Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1535.java) | [:tv:](https://youtu.be/v6On1TQfMTU) |Medium|Array|\n| 1534 |[Count Good Triplets](https://leetcode.com/problems/count-good-triplets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1534.java) | |Easy|Array|\n| 1528 |[Shuffle String](https://leetcode.com/problems/shuffle-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1528.java) | |Easy|Sort|\n| 1526 |[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1526.java) | |Hard|Segment Tree|\n| 1525 |[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1525.java) | [:tv:](https://youtu.be/lRVpVUC5mQ4) |Medium|String, Bit Manipulation|\n| 1524 |[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1524.java) | |Medium|Array, Math|\n| 1523 |[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1523.java) | [:tv:](https://youtu.be/TkT-6WsmqY0) |Easy|Math|\n| 1518 |[Water Bottles](https://leetcode.com/problems/water-bottles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1518.java) | |Easy|Greedy|\n| 1514 |[Path with Maximum Probability](https://leetcode.com/problems/path-with-maximum-probability/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1514.java) | |Medium|Graph|\n| 1512 |[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1512.java) | |Easy|Array, HashTable, Math|\n| 1508 |[Range Sum of Sorted Subarray Sums](https://leetcode.com/problems/range-sum-of-sorted-subarray-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1508.java) | |Medium|Array, Sort|\n| 1507 |[Reformat Date](https://leetcode.com/problems/reformat-date/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1507.java) | |Easy|String|\n| 1502 |[Can Make Arithmetic Progression From Sequence](https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1502.java) | |Easy|Array, Sort|\n| 1496 |[Path Crossing](https://leetcode.com/problems/path-crossing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1496.java) | |Easy|String|\n| 1493 |[Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1493.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) |Medium|Array|\n| 1492 |[The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1492.java) | |Medium|Math|\n| 1491 |[Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1491.java) | |Easy|Array, Sort|\n| 1490 |[Clone N-ary Tree](https://leetcode.com/problems/clone-n-ary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1490.java) | [:tv:](https://youtu.be/3Wnja3Bxeos) |Medium|HashTable, Tree, DFS, BFS|\n| 1487 |[Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1487.java) | |Medium|HashTable, String|\n| 1486 |[XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1486.java) | |Medium|Array, Bit Manipulation|\n| 1485 |[Clone Binary Tree With Random Pointer](https://leetcode.com/problems/clone-binary-tree-with-random-pointer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1485.java) | |Medium|HashTable, Tree, DFS, BFS|\n| 1482 |[Minimum Number of Days to Make m Bouquets](https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1482.java) | |Medium|Array, Binary Search|\n| 1481 |[Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1481.java) | |Medium|Array, Sort|\n| 1480 |[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1480.java), [C++](../master/cpp/_1480.cpp) | |Easy|Array|\n| 1476 |[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Medium|Array|\n| 1475 |[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | |Easy|Array|\n| 1474 |[Delete N Nodes After M Nodes of a Linked List](https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1474.java) | |Easy|LinkedList|\n| 1472 |[Design Browser History](https://leetcode.com/problems/design-browser-history/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1472.java) | |Medium|Array, Design|\n| 1471 |[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | |Medium|Array, Sort|\n| 1470 |[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java), [C++](../master/cpp/_1470.cpp) | |Easy|Array|\n| 1469 |[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1469.java) | |Easy|Tree, DFS|\n| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|\n| 1464 |[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | |Easy|Array|\n| 1461 |[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1461.java) | |Medium|String, Bit Manipulation|\n| 1460 |[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | |Easy|Array|\n| 1457 |[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1457.java) | |Medium|Bit Manipulation, Tree, DFS|\n| 1456 |[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1456.java) | |Medium|String, Sliding Window|\n| 1455 |[Check If a Word Occurs As a Prefix of Any Word in a Sentence](https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1455.java) | |Easy|String|\n| 1452 |[People Whose List of Favorite Companies Is Not a Subset of Another List](https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1452.java) | |Medium|String, Sort|\n| 1451 |[Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1451.java) | |Medium|String, Sort|\n| 1450 |[Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1450.java) | |Easy|Array|\n| 1448 |[Count Good Nodes in Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1448.java) | |Medium|Tree, DFS|\n| 1447 |[Simplified Fractions](https://leetcode.com/problems/simplified-fractions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1447.java) | |Medium|Math|\n| 1446 |[Consecutive Characters](https://leetcode.com/problems/consecutive-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1446.java) | |Easy|String|\n| 1441 |[Build an Array With Stack Operations](https://leetcode.com/problems/build-an-array-with-stack-operations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1441.java) | |Easy|Stack|\n| 1439 |[Find the Kth Smallest Sum of a Matrix With Sorted Rows](https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1439.java) | |Hard|Array, Binary Search, PriorityQueue, Matrix|\n| 1438 |[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1438.java) | |Medium|Array, Queue, Sliding Window, PriorityQueue, Monotonic Queue|\n| 1437 |[Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1437.java) | |Medium|Array|\n| 1436 |[Destination City](https://leetcode.com/problems/destination-city/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1436.java) | |Easy|String|\n| 1432 |[Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1432.java) | |Medium|String|\n| 1431 |[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1431.java), [C++](../master/cpp/_1431.cpp) | |Easy|Array|\n| 1429 |[First Unique Number](https://leetcode.com/problems/first-unique-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1429.java) | |Medium|Array, HashTable, Design, Data Streams|\n| 1428 |[Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1428.java) | |Medium|Array|\n| 1427 |[Perform String Shifts](https://leetcode.com/problems/perform-string-shifts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1427.java) | |Easy|Array, Math|\n| 1426 |[Counting Elements](https://leetcode.com/problems/counting-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1426.java) | |Easy|Array|\n| 1423 |[Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1423.java) | |Medium|Array, DP, Sliding Window|\n| 1422 |[Maximum Score After Splitting a String](https://leetcode.com/problems/maximum-score-after-splitting-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1422.java) | |Easy|String|\n| 1418 |[Display Table of Food Orders in a Restaurant](https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1418.java) | |Medium|HashTable|\n| 1417 |[Reformat The String](https://leetcode.com/problems/reformat-the-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1417.java) | |Easy|String|\n| 1415 |[The k-th Lexicographical String of All Happy Strings of Length n](https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1415.java) | |Medium|Backtracking|\n| 1413 |[Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1413.java) | |Easy|Array|\n| 1410 |[HTML Entity Parser](https://leetcode.com/problems/html-entity-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1410.java) | |Medium|String, Stack|\n| 1409 |[Queries on a Permutation With Key](https://leetcode.com/problems/queries-on-a-permutation-with-key/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1409.java) | |Medium|Array|\n| 1408 |[String Matching in an Array](https://leetcode.com/problems/string-matching-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1408.java) | |Easy|String|\n| 1403 |[Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1403.java) | |Easy|Greedy, Sort|\n| 1402 |[Reducing Dishes](https://leetcode.com/problems/reducing-dishes/)| [Solution](../master/cpp/_1402.cpp) | |Hard|Dynamic Programming|\n| 1401 |[Circle and Rectangle Overlapping](https://leetcode.com/problems/circle-and-rectangle-overlapping/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1401.java) | |Medium|Geometry|\n| 1400 |[Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1400.java) | |Medium|Greedy|\n| 1399 |[Count Largest Group](https://leetcode.com/problems/count-largest-group/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1399.java) | |Easy|Array|\n| 1396 |[Design Underground System](https://leetcode.com/problems/design-underground-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1396.java) | |Medium|Design|\n| 1395 |[Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1395.java) | |Medium|Array|\n| 1394 |[Find Lucky Integer in an Array](https://leetcode.com/problems/find-lucky-integer-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1394.java) | |Easy|Array|\n| 1392 |[Longest Happy Prefix](https://leetcode.com/problems/longest-happy-prefix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1392.java) | |Hard|String, Rolling Hash|\n| 1390 |[Four Divisors](https://leetcode.com/problems/four-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1390.java) | |Medium|Math|\n| 1389 |[Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1389.java) | |Easy|Array|\n| 1388 |[Pizza With 3n Slices](https://leetcode.com/problems/pizza-with-3n-slices/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1388.java) | |Hard|DP|\n| 1387 |[Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1387.java) | |Medium|Sort, Graph|\n| 1386 |[Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1386.java) | |Medium|Array, Greedy|\n| 1385 |[Find the Distance Value Between Two Arrays](https://leetcode.com/problems/find-the-distance-value-between-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1385.java) | |Easy|Array|\n| 1382 |[Balance a Binary Search Tree](https://leetcode.com/problems/balance-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1382.java) | |Medium|Binary Search Tree|\n| 1381 |[Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1381.java) | |Medium|Stack, Design|\n| 1380 |[Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1380.java) | |Easy|Array|\n| 1379 |[Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1379.java) | |Medium|Tree|\n| 1377 |[Frog Position After T Seconds](https://leetcode.com/problems/frog-position-after-t-seconds/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1377.java) | |Hard|DFS, BFS|\n| 1376 |[Time Needed to Inform All Employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1376.java) | |Medium|DFS|\n| 1375 |[Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1375.java) | |Medium|Array|\n| 1374 |[Generate a String With Characters That Have Odd Counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1374.java) | |Easy|String|\n| 1373 |[Maximum Sum BST in Binary Tree](https://leetcode.com/problems/maximum-sum-bst-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1373.java) | |Hard|DP, BST|\n| 1372 |[Longest ZigZag Path in a Binary Tree](https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1372.java) | |Hard|DP, Tree|\n| 1371 |[Find the Longest Substring Containing Vowels in Even Counts](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1371.java) | |Medium|String|\n| 1370 |[Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1370.java) | |Easy|String, Sort|\n| 1367 |[Linked List in Binary Tree](https://leetcode.com/problems/linked-list-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1367.java) | |Medium|DP, Linked List, Tree|\n| 1366 |[Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1366.java) | |Medium|Array, Sort|\n| 1365 |[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1365.java) | |Easy|Array, HashTable|\n| 1362 |[Closest Divisors](https://leetcode.com/problems/closest-divisors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1362.java) | |Medium|Math|\n| 1361 |[Validate Binary Tree Nodes](https://leetcode.com/problems/validate-binary-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1361.java) | |Medium|Graph\n| 1360 |[Number of Days Between Two Dates](https://leetcode.com/problems/number-of-days-between-two-dates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1360.java) | |Easy||\n| 1358 |[Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1358.java) | |Medium|String|\n| 1357 |[Apply Discount Every n Orders](https://leetcode.com/problems/apply-discount-every-n-orders/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1357.java) | |Medium|Design|\n| 1356 |[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1356.java) | |Easy|Sort, Bit Manipulation|\n| 1354 |[Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1354.java) | |Hard|Greedy|\n| 1353 |[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1353.java) | |Medium|Greedy, Sort, Segment Tree|\n| 1352 |[Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1352.java) | |Medium|Array, Design|\n| 1351 |[Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1351.java) | |Easy|Array, Binary Search|\n| 1349 |[Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1349.java) | |Hard|Dynamic Programming|\n| 1348 |[Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1348.java) | |Medium|Design|\n| 1347 |[Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1347.java) | |Easy|String|\n| 1346 |[Check If N and Its Double Exist](https://leetcode.com/problems/check-if-n-and-its-double-exist/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1346.java) | |Easy|Array|\n| 1345 |[Jump Game IV](https://leetcode.com/problems/jump-game-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1345.java) | |Hard|BFS|\n| 1344 |[Angle Between Hands of a Clock](https://leetcode.com/problems/angle-between-hands-of-a-clock/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1344.java) | |Medium|Math|\n| 1343 |[Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold](https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1343.java) | |Medium|Array|\n| 1342 |[Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1342.java) | |Easy|Bit Manipulation|\n| 1341 |[The K Weakest Rows in a Matrix](https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1341.java) | |Easy||\n| 1339 |[Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1339.java) | |Medium|DP, Tree|\n| 1338 |[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1338.java) | |Medium||\n| 1337 |[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1337.java) | |Easy|String|\n| 1333 |[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||\n| 1332 |[Remove Palindromic Subsequences](https://leetcode.com/problems/remove-palindromic-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1332.java) | |Easy|String|\n| 1331 |[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||\n| 1329 |[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||\n| 1325 |[Delete Leaves With a Given Value](https://leetcode.com/problems/delete-leaves-with-a-given-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1325.java) | |Medium|Tree|\n| 1324 |[Print Words Vertically](https://leetcode.com/problems/print-words-vertically/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1324.java) | |Medium|String|\n| 1323 |[Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1323.java) | |Easy|Math|\n| 1317 |[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | |Easy||\n| 1315 |[Sum of Nodes with Even-Valued Grandparent](https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1315.java) | |Medium|Tree, DFS|\n| 1314 |[Matrix Block Sum](https://leetcode.com/problems/matrix-block-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1314.java) | |Medium|Dynamic Programming|\n| 1313 |[Decompress Run-Length Encoded List](https://leetcode.com/problems/decompress-run-length-encoded-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1313.java) | |Easy|Array|\n| 1305 |[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||\n| 1304 |[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||\n| 1302 |[Deepest Leaves Sum](https://leetcode.com/problems/deepest-leaves-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1302.java) | |Medium||\n| 1300 |[Sum of Mutated Array Closest to Target](https://leetcode.com/problems/sum-of-mutated-array-closest-to-target/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1300.java) | |Medium|Binary Search, Sorting|\n| 1299 |[Replace Elements with Greatest Element on Right Side](https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1299.java) | |Easy||\n| 1297 |[Maximum Number of Occurrences of a Substring](https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1297.java) | |Medium||\n| 1296 |[Divide Array in Sets of K Consecutive Numbers](https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1296.java) | |Medium||\n| 1295 |[Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/)| [Java](../master/src/main/java/com/fishercoder/solutions/_1295.java) [Javascript](../master/javascript/_1295.js) | [:tv:](https://youtu.be/HRp8mNJvLZ0) |Easy||\n| 1291 |[Sequential Digits](https://leetcode.com/problems/sequential-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1291.java) | |Medium||\n| 1290 |[Convert Binary Number in a Linked List to Integer](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1290.java) | |Easy||\n| 1289 |[Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1289.java) | |Hard|Dynamic Programming|\n| 1287 |[Element Appearing More Than 25% In Sorted Array](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1287.java) | [:tv:](https://youtu.be/G74W8v2yVjY) |Easy||\n| 1286 |[Iterator for Combination](https://leetcode.com/problems/iterator-for-combination/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1286.java) | |Medium|Backtracking, Design|\n| 1283 |[Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1283.java) | Medium |\n| 1282 |[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1282.java) | [:tv:](https://www.youtube.com/watch?v=wGgcRCpSAa8) |Medium||\n| 1281 |[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1281.java) | |Easy||\n| 1277 |[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1277.java) | |Medium||\n| 1275 |[Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1275.java) | |Easy|Array|\n| 1273 |[Delete Tree Nodes](https://leetcode.com/problems/delete-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1273.java) | |Medium|Dynamic Programming, DFS |\n| 1271 |[Hexspeak](https://leetcode.com/problems/hexspeak/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1271.java) | |Easy||\n| 1268 |[Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1268.java) | [:tv:](https://youtu.be/PLNDfB0Vg9Y) |Medium|String|\n| 1267 |[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1267.java) | |Medium||\n| 1266 |[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1266.java) | |Easy||\n| 1265 |[Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse//)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1265.java) | |Medium||\n| 1261 |[Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1261.java) || Medium |Tree, HashTable|\n| 1260 |[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) | [:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s) |Easy||\n| 1258 |[Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1258.java) || Medium |Backtracking|\n| 1257 |[Smallest Common Region](https://leetcode.com/problems/smallest-common-region/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1257.java) || Medium |Tree, HashTable, DFS, BFS|\n| 1252 |[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | |Easy||\n| 1249 |[Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1249.java) | |Medium|String, Stack|\n| 1243 |[Array Transformation](https://leetcode.com/problems/array-transformation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1243.java) | [:tv:](https://www.youtube.com/watch?v=MQ2i4T1l-Gs) |Easy||\n| 1237 |[Find Positive Integer Solution for a Given Equation](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1237.java) | |Easy||\n| 1232 |[Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1232.java) | [:tv:](https://www.youtube.com/watch?v=_tfiTQNZCbs) |Easy||\n| 1228 |[Missing Number In Arithmetic Progression](https://leetcode.com/problems/missing-number-in-arithmetic-progression/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1228.java) | |Easy||\n| 1221 |[Split a String in Balanced Strings](https://leetcode.com/problems/split-a-string-in-balanced-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1221.java) | |Easy|Greedy|\n| 1219 |[Path with Maximum Gold](https://leetcode.com/problems/path-with-maximum-gold/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1219.java) | |Medium|Backtracking|\n| 1217 |[Play with Chips](https://leetcode.com/problems/play-with-chips/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1217.java) | |Easy|Array, Math, Greedy|\n| 1214 |[Two Sum BSTs](https://leetcode.com/problems/two-sum-bsts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1214.java) | |Medium| Binary Search Tree|\n| 1213 |[Intersection of Three Sorted Arrays](https://leetcode.com/problems/intersection-of-three-sorted-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1213.java) | [:tv:](https://www.youtube.com/watch?v=zceoOrHSHNQ) |Easy||\n| 1209 |[Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) || Medium |Stack|\n| 1207 |[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1207.java) | [:tv:](https://www.youtube.com/watch?v=_NYimlZY1PE) |Easy||\n| 1200 |[Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1200.java) | [:tv:](https://www.youtube.com/watch?v=mH1aEjOEjcQ) |Easy||\n| 1198 |[Find Smallest Common Element in All Rows](https://leetcode.com/problems/find-smallest-common-element-in-all-rows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1198.java) | [:tv:](https://www.youtube.com/watch?v=RMiofZrTmWo) |Easy||\n| 1196 |[How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1196.java) | [:tv:](https://www.youtube.com/watch?v=UelshlMQNJM) |Easy||\n| 1190 |[Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1190.java) | |Medium|Stack|\n| 1189 |[Maximum Number of Balloons](https://leetcode.com/problems/maximum-number-of-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1189.java) | [:tv:](https://youtu.be/LGgMZC0vj5s) |Easy||\n| 1185 |[Day of the Week](https://leetcode.com/problems/day-of-the-week/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1185.java) | |Easy||\n| 1184 |[Distance Between Bus Stops](https://leetcode.com/problems/distance-between-bus-stops/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1184.java) | [:tv:](https://www.youtube.com/watch?v=RFq7yA5iyhI) |Easy||\n| 1182 |[Shortest Distance to Target Color](https://leetcode.com/problems/shortest-distance-to-target-color/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1182.java) || Medium |Binary Search|\n| 1180 |[Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1180.java) | |Easy|Math, String|\n| 1176 |[Diet Plan Performance](https://leetcode.com/problems/diet-plan-performance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1176.java) | |Easy|Array, Sliding Window|\n| 1175 |[Prime Arrangements](https://leetcode.com/problems/prime-arrangements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1175.java) | |Easy|Math|\n| 1171 |[Remove Zero Sum Consecutive Nodes from Linked List](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1171.java) | |Medium|LinkedList|\n| 1165 |[Single-Row Keyboard](https://leetcode.com/problems/single-row-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1165.java) | |Easy||\n| 1161 |[Maximum Level Sum of a Binary Tree](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1161.java) | |Medium|Graph|\n| 1160 |[Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1160.java) | |Easy||\n| 1154 |[Day of the Year](https://leetcode.com/problems/day-of-the-year/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1154.java) | |Easy||\n| 1152 |[Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1152.java) | [:tv:](https://youtu.be/V510Lbtrm5s) |Medium|HashTable, Sort, Array|\n| 1151 |[Minimum Swaps to Group All 1's Together](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1151.java) || Medium |Array, Sliding Window|\n| 1150 |[Check If a Number Is Majority Element in a Sorted Array](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1150.java) | [:tv:](https://youtu.be/-t2cdVs9cKk) |Easy||\n| 1146 |[Snapshot Array](https://leetcode.com/problems/snapshot-array/)| [Javascript](./javascript/_1146.js) | | Easy ||\n| 1143 |[Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1143.java) | |Medium||String, DP\n| 1138 |[Alphabet Board Path](https://leetcode.com/problems/alphabet-board-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1138.java) | [:tv:](https://youtu.be/rk-aB4rEOyU) | Medium |HashTable, String|\n| 1137 |[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java) | |Easy||\n| 1136 |[Parallel Courses](https://leetcode.com/problems/parallel-courses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1136.java) | |Medium||\n| 1134 |[Armstrong Number](https://leetcode.com/problems/armstrong-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1134.java) | [:tv:](https://www.youtube.com/watch?v=HTL7fd4HPf4) |Easy||\n| 1133 |[Largest Unique Number](https://leetcode.com/problems/largest-unique-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1133.java) | [:tv:](https://youtu.be/Fecpt1YZlCs) |Easy||\n| 1128 |[Number of Equivalent Domino Pairs](https://leetcode.com/problems/number-of-equivalent-domino-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1128.java) | [:tv:](https://www.youtube.com/watch?v=7EpEEHAAxyw) |Easy||\n| 1122 |[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java) | |Easy||\n| 1170 |[Compare Strings by Frequency of the Smallest Character](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1170.java) | |Easy||\n| 1119 |[Remove Vowels from a String](https://leetcode.com/problems/remove-vowels-from-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1119.java) | [:tv:](https://www.youtube.com/watch?v=6KCBrIWEauw) |Easy||\n| 1118 |[Number of Days in a Month](https://leetcode.com/problems/number-of-days-in-a-month/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1118.java) | |Easy||\n| 1114 |[Print in Order](https://leetcode.com/problems/print-in-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1114.java) | |Easy||\n| 1110 |[Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1110.java) | |Medium|Tree, DFS|\n| 1108 |[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) | [:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk) |Easy||\n| 1104 |[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1104.java) | |Medium|Math, Tree|\n| 1103 |[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | |Easy|Math|\n| 1100 |[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1100.java) | |Medium|String, Sliding Window|\n| 1099 |[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) | [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI) |Easy||\n| 1094 |[Car Pooling](https://leetcode.com/problems/car-pooling/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1094.java) | |Medium|Array, Sorting, Heap, Simulation, Prefix Sum|\n| 1090 |[Largest Values From Labels](https://leetcode.com/problems/largest-values-from-labels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1090.java) | [:tv:](https://youtu.be/E0OkE3G95vU) |Medium|HashTable, Greedy|\n| 1091 |[Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1091.java) | |Medium|BFS|\n| 1089 |[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | |Easy||\n| 1087 |[Brace Expansion](https://leetcode.com/problems/brace-expansion/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1087.java) | |Medium|Backtracking|\n| 1086 |[High Five](https://leetcode.com/problems/high-five/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc) |Easy||\n| 1085 |[Sum of Digits in the Minimum Number](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1085.java) | [:tv:](https://www.youtube.com/watch?v=GKYmPuHZpQg) |Easy||\n| 1079 |[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1079.java) | |Medium||\n| 1078 |[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1078.java) | |Easy||\n| 1071 |[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) | |Easy||\n| 1066 |[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java) | |Medium|Backtracking, DP|\n| 1065 |[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | |Medium||\n| 1062 |[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | |Medium|String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function|\n| 1057 |[Campus Bikes](https://leetcode.com/problems/campus-bikes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java) | |Medium||Greedy, Sort\n| 1056 |[Confusing Number](https://leetcode.com/problems/confusing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | |Easy||\n| 1055 |[Fixed Point](https://leetcode.com/problems/fixed-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) | |Easy||\n| 1051 |[Height Checker](https://leetcode.com/problems/height-checker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1051.java) | |Easy||\n| 1047 |[Remove All Adjacent Duplicates In String](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1047.java) | |Easy||\n| 1046 |[Last Stone Weight](https://leetcode.com/problems/last-stone-weight/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1046.java) | [:tv:](https://youtu.be/IfElFyaEV8s) |Easy||\n| 1043 |[Partition Array for Maximum Sum](https://leetcode.com/problems/partition-array-for-maximum-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1043.java) | |Medium|DP|\n| 1038 |[Binary Search Tree to Greater Sum Tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1038.java) | |Medium|DFS, tree|\n| 1037 |[Valid Boomerang](https://leetcode.com/problems/valid-boomerang/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1037.java) | |Easy|Math|\n| 1033 |[Moving Stones Until Consecutive](https://leetcode.com/problems/moving-stones-until-consecutive/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1033.java) | |Easy|Math|\n| 1030 |[Matrix Cells in Distance Order](https://leetcode.com/problems/matrix-cells-in-distance-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1030.java) | |Easy|\n| 1029 |[Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1029.java) | |Easy|\n| 1026 |[Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1026.java) | |Medium|Tree, DFS, Binary Tree|\n| 1025 |[Divisor Game](https://leetcode.com/problems/divisor-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1025.java) | |Easy|Math, DP, Brainteaser, Game Theory|\n| 1024 |[Video Stitching](https://leetcode.com/problems/video-stitching/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1024.java) | |Medium|Array, DP, Greedy|\n| 1022 |[Sum of Root To Leaf Binary Numbers](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1022.java) | |Easy|\n| 1021 |[Remove Outermost Parentheses](https://leetcode.com/problems/remove-outermost-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1021.java) | |Easy|\n| 1020 |[Number of Enclaves](https://leetcode.com/problems/number-of-enclaves/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1020.java) | |Medium|Graph, DFS, BFS, recursion|\n| 1019 |[Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1019.java) | |Medium|Linked List, Stack|\n| 1018 |[Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1018.java) | |Easy|\n| 1014 |[Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1014.java) | |Medium|\n| 1013 |[Partition Array Into Three Parts With Equal Sum](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1013.java) | |Easy|\n| 1011 |[Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1011.java) | |Medium|Binary Search|\n| 1010 |[Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1010.java) | |Easy|\n| 1009 |[Complement of Base 10 Integer](https://leetcode.com/problems/complement-of-base-10-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1009.java) | |Easy|\n| 1008 |[Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1008.java) | |Medium| Recursion\n| 1005 |[Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1005.java) | [:tv:](https://youtu.be/spiwTAuz1_4) |Easy|\n| 1004 |[Max Consecutive Ones III](https://leetcode.com/problems/max-consecutive-ones-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1004.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) |Medium| Two Pointers, Sliding Window\n| 1003 |[Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1003.java) | |Medium|\n| 1002 |[Find Common Characters](https://leetcode.com/problems/find-common-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1002.java) | |Easy|\n| 999 |[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_999.java) | |Easy|\n| 991 |[Broken Calculator](https://leetcode.com/problems/broken-calculator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_991.java) | |Medium|Math, Greedy\n| 981 |[Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_981.java) | [:tv:](https://youtu.be/eVi4gDimCoo) |Medium|\n| 997 |[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_997.java) | |Easy| \n| 994 |[Rotting Oranges](https://leetcode.com/problems/rotting-oranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_994.java) | |Medium| BFS\n| 993 |[Cousins in Binary Tree](https://leetcode.com/problems/cousins-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_993.java) | |Easy| Tree, BFS\n| 989 |[Add to Array-Form of Integer](https://leetcode.com/problems/add-to-array-form-of-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_989.java) | |Easy| Array\n| 988 |[Smallest String Starting From Leaf](https://leetcode.com/problems/smallest-string-starting-from-leaf/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_988.java) | |Medium| Tree, DFS\n| 987 |[Vertical Order Traversal of a Binary Tree](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_987.java) | |Medium| Recursion\n| 986 |[Interval List Intersections](https://leetcode.com/problems/interval-list-intersections/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_986.java) | |Medium| Two Pointers\n| 985 |[Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_985.java) | |Easy| Array\n| 980 |[Unique Paths III](https://leetcode.com/problems/unique-paths-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_980.java) | |Hard| Backtracking, DFS\n| 979 |[Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_979.java) | |Medium| Recursion\n| 977 |[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_977.java) | |Easy| Array\n| 976 |[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_976.java) | |Easy| Math Array \n| 974 |[Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_974.java) | |Medium| Array|\n| 973 |[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_973.java) | |Easy| Math Sort|\n| 970 |[Powerful Integers](https://leetcode.com/problems/powerful-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_970.java) | |Easy| Math\n| 966 |[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_966.java) | |Medium| Hash Table, String\n| 965 |[Univalued Binary Tree](https://leetcode.com/problems/univalued-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_965.java) | |Easy| DFS, recursion|\n| 961 |[N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_961.java) | |Easy|\n| 958 |[Check Completeness of a Binary Tree](https://leetcode.com/problems/check-completeness-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_958.java) | |Medium|Tree\n| 957 |[Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_957.java) | [:tv:](https://youtu.be/mQQp6I985bw) |Medium|\n| 954 |[Array of Doubled Pairs](https://leetcode.com/problems/array-of-doubled-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_954.java) | [:tv:](https://youtu.be/Q0WKzdpR74o) |Medium|\n| 953 |[Verifying an Alien Dictionary](https://leetcode.com/problems/verifying-an-alien-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_953.java) | |Easy|\n| 951 |[Flip Equivalent Binary Trees](https://leetcode.com/problems/flip-equivalent-binary-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_951.java) | |Medium| Tree, DFS, recursion|\n| 950 |[Reveal Cards In Increasing Order](https://leetcode.com/problems/reveal-cards-in-increasing-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_950.java) | |Medium|\n| 946 |[Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_946.java) | |Medium|Stack\n| 944 |[Delete Columns to Make Sorted](https://leetcode.com/problems/delete-columns-to-make-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_944.java) | |Easy|\n| 942 |[DI String Match](https://leetcode.com/problems/di-string-match/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_942.java) | |Easy|\n| 941 |[Valid Mountain Array](https://leetcode.com/problems/valid-mountain-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_941.java) | |Easy|\n| 938 |[Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_938.java) | |Medium| BST, recursion, DFS\n| 937 |[Reorder Log Files](https://leetcode.com/problems/reorder-log-files/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_937.java) | |Easy|\n| 936 |[Stamping The Sequence](https://leetcode.com/problems/stamping-the-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_936.java) | |Hard| String, Greedy\n| 935 |[Knight Dialer](https://leetcode.com/problems/knight-dialer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_935.java) | |Medium|\n| 933 |[Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_933.java) | |Easy|\n| 931 |[Minimum Falling Path Sum](https://leetcode.com/problems/minimum-falling-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_931.java) | |Medium|Dynamic Programming\n| 929 |[Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_929.java) | |Easy|\n| 925 |[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_925.java) | |Easy|\n| 923 |[3Sum With Multiplicity](https://leetcode.com/problems/3sum-with-multiplicity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_923.java) | |Medium|Two Pointers\n| 922 |[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_922.java) | |Easy|\n| 921 |[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_921.java) | |Medium|Stack, Greedy\n| 918 |[Maximum Sum Circular Subarray](https://leetcode.com/problems/maximum-sum-circular-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_918.java) | |Medium|Array, DP, Monotonic Queue\n| 917 |[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_917.java) | |Easy|\n| 914 |[X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_914.java) | |Easy|\n| 912 |[Sort an Array](https://leetcode.com/problems/sort-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_912.java) | |Easy|\n| 908 |[Smallest Range I](https://leetcode.com/problems/smallest-range-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_908.java) | |Easy|\n| 901 |[Online Stock Span](https://leetcode.com/problems/online-stock-span/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_901.java) | |Medium| Stack\n| 904 |[Fruit Into Baskets](https://leetcode.com/problems/fruit-into-baskets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_904.java) | [:tv:](https://youtu.be/GVecnelW8mA) |Medium| Two Pointers\n| 900 |[RLE Iterator](https://leetcode.com/problems/rle-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) | |Medium|\n| 897 |[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_897.java) | |Easy| DFS, recursion\n| 896 |[Monotonic Array](https://leetcode.com/problems/monotonic-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | |Easy|\n| 895 |[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_895.java) | HashTable, Stack |Hard|\n| 893 |[Groups of Special-Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_893.java) | [:tv:](https://youtu.be/tbtXPKkA2Zw) |Easy|\n| 892 |[Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_892.java) | Array, Math, Geometry, Matrix |Easy|\n| 890 |[Find and Replace Pattern](https://leetcode.com/problems/find-and-replace-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_890.java) | |Medium|\n| 888 |[Fair Candy Swap](https://leetcode.com/problems/fair-candy-swap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_888.java) | |Easy|\n| 885 |[Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_885.java) | [:tv:](https://www.youtube.com/watch?v=0qep3f9cqVs) |Medium|\n| 884 |[Uncommon Words from Two Sentences](https://leetcode.com/problems/uncommon-words-from-two-sentences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_884.java) | |Easy|\n| 883 |[Projection Area of 3D Shapes](https://leetcode.com/problems/projection-area-of-3d-shapes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_883.java) | |Easy|Math\n| 881 |[Boats to Save People](https://leetcode.com/problems/boats-to-save-people/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_881.java) | |Medium|Two Pointers, Greedy\n| 880 |[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_880.java) | |Medium|Stack\n| 877 |[Stone Game](https://leetcode.com/problems/stone-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_877.java) | |Medium| Math, DP, Minimax\n| 876 |[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_876.java) | |Easy|\n| 872 |[Leaf-Similar Trees](https://leetcode.com/problems/leaf-similar-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_872.java) | |Easy| DFS, recursion\n| 870 |[Advantage Shuffle](https://leetcode.com/problems/advantage-shuffle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_870.java) | |Medium|Array, Greedy\n| 868 |[Binary Gap](https://leetcode.com/problems/binary-gap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_868.java) | |Easy|\n| 867 |[Transpose Matrix](https://leetcode.com/problems/transpose-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_867.java) | |Easy|\n| 861 |[Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_861.java) | |Medium| Greedy\n| 860 |[Lemonade Change](https://leetcode.com/problems/lemonade-change/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_860.java) | |Easy|\n| 859 |[Buddy Strings](https://leetcode.com/problems/buddy-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_859.java) | |Easy|\n| 856 |[Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_856.java) | |Medium| Stack, String\n| 852 |[Peak Index in a Mountain Array](https://leetcode.com/problems/peak-index-in-a-mountain-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_852.java) | |Easy|\n| 849 |[Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_849.java) | |Easy|\n| 848 |[Shifting Letters](https://leetcode.com/problems/shifting-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_848.java) | |Medium| Array, String\n| 844 |[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_844.java) | |Easy|\n| 841 |[Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_841.java) | |Easy|DFS, Graph\n| 840 |[Magic Squares In Grid](https://leetcode.com/problems/magic-squares-in-grid/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_840.java) | |Easy|\n| 838 |[Push Dominoes](https://leetcode.com/problems/push-dominoes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_838.java) | [:tv:](https://youtu.be/0_XmKkgHSdI) |Medium| Two Pointers, DP\n| 836 |[Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_836.java) | [:tv:](https://youtu.be/o6hHUk4DOW0) |Easy|\n| 832 |[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_832.java) | |Easy|\n| 830 |[Positions of Large Groups](https://leetcode.com/problems/positions-of-large-groups/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_830.java) | |Easy|\n| 824 |[Goat Latin](https://leetcode.com/problems/goat-latin/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_824.java) | |Easy|\n| 823 |[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_823.java) | |Medium|\n| 821 |[Shortest Distance to a Character](https://leetcode.com/problems/shortest-distance-to-a-character/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_821.java) | |Easy|\n| 820 |[Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_820.java) | |Medium|\n| 819 |[Most Common Word](https://leetcode.com/problems/most-common-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_819.java) | |Easy| HashMap\n| 816 |[Ambiguous Coordinates](https://leetcode.com/problems/ambiguous-coordinates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_816.java) | |Medium| String\n| 814 |[Binary Tree Pruning](https://leetcode.com/problems/binary-tree-pruning/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_814.java) | |Medium| recursion, DFS \n| 812 |[Largest Triangle Area](https://leetcode.com/problems/largest-triangle-area/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_812.java) | |Easy| Array, Math, Geometry\n| 811 |[Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_811.java) | |Easy| HashMap\n| 809 |[Expressive Words](https://leetcode.com/problems/expressive-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_809.java) | |Medium|\n| 807 |[Max Increase to Keep City Skyline](https://leetcode.com/problems/max-increase-to-keep-city-skyline/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_807.java) | |Medium|\n| 806 |[Number of Lines To Write String](https://leetcode.com/problems/number-of-lines-to-write-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_806.java) | |Easy|\n| 804 |[Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_804.java) | |Easy|\n| 800 |[Similar RGB Color](https://leetcode.com/problems/similar-rgb-color/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_800.java) | |Easy|\n| 799 |[Champagne Tower](https://leetcode.com/problems/champagne-tower/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_799.java) | |Medium|\n| 796 |[Rotate String](https://leetcode.com/problems/rotate-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_796.java) | |Easy|\n| 792 |[Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_792.java) | |Medium|HashTable, String, Trie, Sorting\n| 791 |[Custom Sort String](https://leetcode.com/problems/custom-sort-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_791.java) | |Medium|\n| 789 |[Escape The Ghosts](https://leetcode.com/problems/escape-the-ghosts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_789.java) | |Medium| Math|\n| 788 |[Rotated Digits](https://leetcode.com/problems/rotated-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_788.java) | |Easy|\n| 784 |[Letter Case Permutation](https://leetcode.com/problems/letter-case-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_784.java) | |Easy|\n| 783 |[Minimum Distance Between BST Nodes](https://leetcode.com/problems/minimum-distance-between-bst-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_783.java) | |Easy|\n| 781 |[Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_781.java) | [:tv:](https://youtu.be/leiSa1i-QrI) |Medium| HashTable, Math\n| 779 |[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_779.java) | |Medium|\n| 776 |[Split BST](https://leetcode.com/problems/split-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_776.java) | |Medium| Recursion\n| 775 |[Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_775.java) | |Medium| Array, Math\n| 771 |[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_771.java) | |Easy|\n| 769 |[Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_769.java) | |Medium| Array\n| 767 |[Reorganize String](https://leetcode.com/problems/reorganize-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_767.java) | |Medium|\n| 766 |[Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_766.java) | |Easy|\n| 765 |[Couples Holding Hands](https://leetcode.com/problems/couples-holding-hands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_765.java) | |Hard| \n| 764 |[Largest Plus Sign](https://leetcode.com/problems/largest-plus-sign/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_764.java) | |Medium| DP\n| 763 |[Partition Labels](https://leetcode.com/problems/partition-labels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_763.java) | |Medium|\n| 762 |[Prime Number of Set Bits in Binary Representation](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_762.java) | |Easy|\n| 760 |[Find Anagram Mappings](https://leetcode.com/problems/find-anagram-mappings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_760.java) | |Easy| \n| 758 |[Bold Words in String](https://leetcode.com/problems/bold-words-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_758.java) | |Easy|\n| 757 |[Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_757.java) | |Hard|\n| 756 |[Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_756.java) | |Medium| Backtracking\n| 755 |[Pour Water](https://leetcode.com/problems/pour-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_755.java) || Medium | Array\n| 754 |[Reach a Number](https://leetcode.com/problems/reach-a-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_754.java) || Medium | Math\n| 750 |[Number Of Corner Rectangles](https://leetcode.com/problems/number-of-corner-rectangles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_750.java) | |Medium|\n| 748 |[Shortest Completing Word](https://leetcode.com/problems/shortest-completing-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_748.java) | |Easy|\n| 747 |[Largest Number Greater Than Twice of Others](https://leetcode.com/problems/largest-number-greater-than-twice-of-others/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_747.java) | |Easy|\n| 746 |[Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_746.java) | |Easy|\n| 744 |[Find Smallest Letter Greater Than Target](https://leetcode.com/problems/find-smallest-letter-greater-than-target/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_744.java) | | Easy|\n| 743 |[Network Delay Time](https://leetcode.com/problems/network-delay-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_743.java) || Medium |Graph, Djikstra|\n| 742 |[Closest Leaf in a Binary Tree](https://leetcode.com/problems/closest-leaf-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_742.java) | |Medium|Tree\n| 740 |[Delete and Earn](https://leetcode.com/problems/delete-and-earn/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_740.java) | |Medium|\n| 739 |[Daily Temperatures](https://leetcode.com/problems/daily-temperatures/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_739.java) | |Medium| \n| 738 |[Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_738.java) | |Medium|\n| 737 |[Sentence Similarity II](https://leetcode.com/problems/sentence-similarity-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_737.java) | |Medium| Union Find\n| 735 |[Asteroid Collision](https://leetcode.com/problems/asteroid-collision/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_735.java) | |Medium | Stack\n| 734 |[Sentence Similarity](https://leetcode.com/problems/sentence-similarity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_734.java) | |Easy | HashTable\n| 733 |[Flood Fill](https://leetcode.com/problem**__**s/flood-fill/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_733.java) | | Easy | BFS, DFS\n| 729 |[My Calendar I](https://leetcode.com/problems/my-calendar-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_729.java) || Medium |\n| 728 |[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_728.java) | |Easy | \n| 727 |[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_727.java) | |Hard | DP\n| 725 |[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_725.java) | |Medium | LinkedList\n| 724 |[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_724.java) | |Easy | Array\n| 723 |[Candy Crush](https://leetcode.com/problems/candy-crush/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_723.java) | |Medium | Array, Two Pointers\n| 721 |[Accounts Merge](https://leetcode.com/problems/accounts-merge/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_721.java) | |Medium | DFS, Union Find\n| 720 |[Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_720.java) | |Easy | Trie\n| 719 |[Find K-th Smallest Pair Distance](https://leetcode.com/problems/find-k-th-smallest-pair-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_719.java) | |Hard | Binary Search\n| 718 |[Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_718.java) | |Medium | DP\n| 717 |[1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_717.java) | |Easy |\n| 716 |[Max Stack](https://leetcode.com/problems/max-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_716.java) | |Hard| Design\n| 714 |[Best Time to Buy and Sell Stock with Transaction Fee](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_714.java) | |Medium | DP\n| 713 |[Subarray Product Less Than K](https://leetcode.com/problems/subarray-product-less-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_713.java) || Medium |\n| 712 |[Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_712.java) | |Medium | DP\n| 709 |[To Lower Case](https://leetcode.com/problems/to-lower-case/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_709.java) | |Easy| String\n| 706 |[Design HashMap](https://leetcode.com/problems/design-hashmap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_706.java) | |Easy| Design\n| 705 |[Design HashSet](https://leetcode.com/problems/design-hashset/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_705.java) | |Easy| Design\n| 704 |[Binary Search](https://leetcode.com/problems/binary-search/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_704.java) | |Easy| Binary Search\n| 703 |[Kth Largest Element in a Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_703.java) | |Easy| \n| 701 |[Insert into a Binary Search Tree](https://leetcode.com/problems/insert-into-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_701.java) | |Medium | DFS, recursion\n| 700 |[Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_700.java) | |Easy| recusion, dfs\n| 699 |[Falling Squares](https://leetcode.com/problems/falling-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_699.java) || Hard | Segment Tree\n| 698 |[Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets/)| [Java](../master/src/main/java/com/fishercoder/solutions/_698.java), [C++](../master/cpp/_698.cpp) | |Medium | Backtracking + DP\n| 697 |[Degree of an Array](https://leetcode.com/problems/degree-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_697.java) || Easy | \n| 696 |[Count Binary Substrings](https://leetcode.com/problems/count-binary-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_696.java) | |Easy | \n| 695 |[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_695.java) | |Medium | DFS, FBS, Union Find, Matrix\n| 694 |[Number of Distinct Islands](https://leetcode.com/problems/number-of-distinct-islands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_694.java) | |Medium | DFS\n| 693 |[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_693.java) | |Easy | \n| 692 |[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_692.java) | | Medium | \n| 691 |[Stickers to Spell Word](https://leetcode.com/problems/stickers-to-spell-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_691.java) | | Hard | DP\n| 690 |[Employee Importance](https://leetcode.com/problems/employee-importance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_690.java) | |Easy | DFS\n| 689 |[Maximum Sum of 3 Non-Overlapping Subarrays](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_689.java) | |Hard | DP\n| 688 |[Knight Probability in Chessboard](https://leetcode.com/problems/knight-probability-in-chessboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_688.java) | |Medium | DP\n| 687 |[Longest Univalue Path](https://leetcode.com/problems/longest-univalue-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_687.java) | |Easy | DFS\n| 686 |[Repeated String Match](https://leetcode.com/problems/repeated-string-match/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_686.java) | |Easy | \n| 685 |[Redundant Connection II](https://leetcode.com/problems/redundant-connection-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_685.java) | | Hard | Union Find\n| 684 |[Redundant Connection](https://leetcode.com/problems/redundant-connection/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_684.java) | |Medium | Union Find\n| 683 |[K Empty Slots](https://leetcode.com/problems/k-empty-slots/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_683.java) | |Hard |\n| 682 |[Baseball Game](https://leetcode.com/problems/baseball-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_682.java) | |Easy | \n| 681 |[Next Closest Time](https://leetcode.com/problems/parents-closest-time/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_681.java) | |Medium |\n| 680 |[Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_680.java) | |Easy | String\n| 679 |[24 Game](https://leetcode.com/problems/24-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_679.java) | |Hard | Recursion\n| 678 |[Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_678.java) | |Medium| Recursion, Greedy\n| 677 |[Map Sum Pairs](https://leetcode.com/problems/map-sum-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_677.java) | |Medium | HashMap, Trie\n| 676 |[Implement Magic Dictionary](https://leetcode.com/problems/implement-magic-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_676.java) | | Medium |\n| 675 |[Cut Off Trees for Golf Event](https://leetcode.com/problems/cut-off-trees-for-golf-event/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_675.java) | |Hard | BFS\n| 674 |[Longest Continuous Increasing Subsequence](https://leetcode.com/problems/longest-continuous-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_674.java) | |Easy | \n| 673 |[Number of Longest Increasing Subsequence](https://leetcode.com/problems/number-of-longest-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_673.java) | |Medium | DP\n| 672 |[Bulb Switcher II](https://leetcode.com/problems/bulb-switcher-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_672.java) | |Medium | Math \n| 671 |[Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_671.java) | |Easy | Tree, DFS\n| 670 |[Maximum Swap](https://leetcode.com/problems/maximum-swap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_670.java) | |Medium | String\n| 669 |[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_669.java) | |Easy | Tree, DFS\n| 668 |[Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_668.java) | |Hard | Binary Search\n| 667 |[Beautiful Arrangement II](https://leetcode.com/problems/beautiful-arrangement-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_667.java) | |Medium | Array\n| 666 |[Path Sum IV](https://leetcode.com/problems/path-sum-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_666.java) | |Medium | Tree, DFS\n| 665 |[Non-decreasing Array](https://leetcode.com/problems/non-decreasing-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_665.java) | |Easy |\n| 664 |[Strange Printer](https://leetcode.com/problems/strange-printer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_664.java) | |Hard | DP\n| 663 |[Equal Tree Partition](https://leetcode.com/problems/equal-tree-partition/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_663.java) | |Medium | Tree\n| 662 |[Maximum Width of Binary Tree](https://leetcode.com/problems/maximum-width-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_662.java) | |Medium | BFS, DFS\n| 661 |[Image Smoother](https://leetcode.com/problems/image-smoother/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_661.java) | |Easy | Array \n| 660 |[Remove 9](https://leetcode.com/problems/remove-9/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_660.java) | |Hard | Math\n| 659 |[Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_659.java) | |Medium | HashMap\n| 658 |[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_658.java) | |Medium |\n| 657 |[Judge Route Circle](https://leetcode.com/problems/judge-route-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_657.java) | |Easy | \n| 656 |[Coin Path](https://leetcode.com/problems/coin-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_656.java) | |Hard | DP\n| 655 |[Print Binary Tree](https://leetcode.com/problems/print-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_655.java) | |Medium | Recursion\n| 654 |[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_654.java) | |Medium | Tree\n| 653 |[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_653.java) | |Easy | Tree\n| 652 |[Find Duplicate Subtrees](https://leetcode.com/problems/find-duplicate-subtrees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_652.java) | |Medium | Tree\n| 651 |[4 Keys Keyboard](https://leetcode.com/problems/4-keys-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_651.java) | |Medium | DP\n| 650 |[2 Keys Keyboard](https://leetcode.com/problems/2-keys-keyboard/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_650.java) | |Medium | DP\n| 649 |[Dota2 Senate](https://leetcode.com/problems/dota2-senate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_649.java) | |Medium | Greedy\n| 648 |[Replace Words](https://leetcode.com/problems/replace-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_648.java) | |Medium | Trie\n| 647 |[Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_647.java) | |Medium | DP\n| 646 |[Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_646.java) | |Medium | DP, Greedy\n| 645 |[Set Mismatch](https://leetcode.com/problems/set-mismatch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_645.java) | |Easy | \n| 644 |[Maximum Average Subarray II](https://leetcode.com/problems/maximum-average-subarray-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_644.java) | |Hard | Binary Search\n| 643 |[Maximum Average Subarray I](https://leetcode.com/problems/maximum-average-subarray-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_643.java) | | Easy |\n| 642 |[Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_642.java) | |Hard | Design\n| 640 |[Solve the Equation](https://leetcode.com/problems/solve-the-equation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_640.java) | |Medium |\n| 639 |[Decode Ways II](https://leetcode.com/problems/decode-ways-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_639.java) | |Hard| DP\n| 638 |[Shopping Offers](https://leetcode.com/problems/shopping-offers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_638.java) | |Medium | DP, DFS\n| 637 |[Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_637.java) | |Easy | \n| 636 |[Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_636.java) | |Medium | Stack\n| 635 |[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_635.java) | |Medium | Design\n| 634 |[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_634.java) | |Medium | Math\n| 633 |[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_633.java) | |Easy | Binary Search\n| 632 |[Smallest Range](https://leetcode.com/problems/smallest-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_632.java) | |Hard| Heap\n| 631 |[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_631.java) | |Hard| Design, Topological Sort\n| 630 |[Course Schedule III](https://leetcode.com/problems/course-schedule-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_630.java) | |Hard| Heap, Greedy\n| 629 |[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_629.java) | |Hard| DP\n| 628 |[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_628.java) | |Easy |\n| 625 |[Minimum Factorization](https://leetcode.com/problems/minimum-factorization/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_625.java) | |Medium | \n| 624 |[Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_624.java) | |Easy | Sort, Array\n| 623 |[Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_623.java) | |Medium | Tree\n| 622 |[Design Circular Queue](https://leetcode.com/problems/design-circular-queue/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_622.java) | |Medium | Design, Queue\n| 621 |[Task Scheduler](https://leetcode.com/problems/task-scheduler/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_621.java) | |Medium | Greedy, Queue\n| 617 |[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_617.java) | |Easy | Tree, Recursion\n| 616 |[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_616.java) | | Medium | String \n| 611 |[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_611.java) | |Medium | Binary Search\n| 609 |[Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_609.java) | |Medium | HashMap\n| 606 |[Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_606.java) | |Easy | Tree, Recursion\n| 605 |[Can Place Flowers](https://leetcode.com/problems/can-place-flowers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_605.java) | |Easy | Array\n| 604 |[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_604.java) | |Easy |Design, String\n| 600 |[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_600.java) | |Hard | Bit Manipulation, DP\n| 599 |[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_599.java) | |Easy | HashMap\n| 598 |[Range Addition II](https://leetcode.com/problems/range-addition-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_598.java) | |Easy | \n| 594 |[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_594.java) | |Easy | Array, HashMap\n| 593 |[Valid Square](https://leetcode.com/problems/valid-square/)| [Java](../master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) | |Medium | Math\n| 592 |[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_592.java) | |Medium | Math\n| 591 |[Tag Validator](https://leetcode.com/problems/tag-validator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_591.java) | |Hard | Stack, String\n| 590 |[N-ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_590.java) | |Easy| DFS, recursion\n| 589 |[N-ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_589.java) | |Easy | DFS, recursion\n| 588 |[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_588.java) | |Hard | Trie, Design\n| 587 |[Erect the Fence](https://leetcode.com/problems/erect-the-fence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_587.java) | |Hard | Geometry\n| 583 |[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_583.java) | |Medium | DP\n| 582 |[Kill Process](https://leetcode.com/problems/kill-process/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_582.java) | |Medium | Stack\n| 581 |[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_581.java) | |Easy | Array, Sort\n| 576 |[Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_576.java) | |Hard | DP, DFS\n| 575 |[Distribute Candies](https://leetcode.com/problems/distribute-candies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_575.java) | |Easy | Array\n| 573 |[Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_573.java) | |Medium | Math\n| 572 |[Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_572.java) | |Easy | Tree\n| 568 |[Maximum Vacation Days](https://leetcode.com/problems/maximum-vacation-days/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_568.java) | |Hard | DP\n| 567 |[Permutation in String](https://leetcode.com/problems/permutation-in-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_567.java) | | Medium | Sliding Windows, Two Pointers\n| 566 |[Reshape the Matrix](https://leetcode.com/problems/reshape-the-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_566.java) | |Easy | \n| 565 |[Array Nesting](https://leetcode.com/problems/array-nesting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_565.java) | | Medium | \n| 563 |[Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_563.java) | |Easy | Tree Recursion\n| 562 |[Longest Line of Consecutive One in Matrix](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_562.java) | |Medium | Matrix DP\n| 561 |[Array Partition I](https://leetcode.com/problems/array-partition-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_561.java) | |Easy | Array\n| 560 |[Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_560.java) || Medium | Array, HashMap\n| 559 |[Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_559.java) | |Easy | DFS, recursion\n| 557 |[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_557.java) | |Easy | String\n| 556 |[Next Greater Element III](https://leetcode.com/problems/parents-greater-element-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_556.java) | |Medium | String\n| 555 |[Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_555.java) | |Medium | String\n| 554 |[Brick Wall](https://leetcode.com/problems/brick-wall/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_554.java) | |Medium | HashMap\n| 553 |[Optimal Division](https://leetcode.com/problems/optimal-division/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_553.java) | |Medium | String, Math\n| 552 |[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_552.java) | |Hard| DP\n| 551 |[Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_551.java) | |Easy| String \n| 549 |[Binary Tree Longest Consecutive Sequence II](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_549.java) | |Medium | Tree\n| 548 |[Split Array with Equal Sum](https://leetcode.com/problems/split-array-with-equal-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_548.java) | |Medium | Array\n| 547 |[Friend Circles](https://leetcode.com/problems/friend-circles/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_547.java) | |Medium | Union Find\n| 546 |[Remove Boxes](https://leetcode.com/problems/remove-boxes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_546.java) | |Hard| DFS, DP\n| 545 |[Boundary of Binary Tree](https://leetcode.com/problems/boundary-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_545.java) | |Medium | Recursion\n| 544 |[Output Contest Matches](https://leetcode.com/problems/output-a824-matches/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_544.java) | |Medium | Recursion\n| 543 |[Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_543.java) | | Easy | Tree/DFS/Recursion\n| 542 |[01 Matrix](https://leetcode.com/problems/01-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_542.java) | |Medium | BFS\n| 541 |[Reverse String II](https://leetcode.com/problems/reverse-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_541.java) | |Easy | String\n| 540 |[Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_540.java) | |Medium |Array, Binary Search \n| 539 |[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_539.java) | | Medium | String\n| 538 |[Convert BST to Greater Tree](https://leetcode.com/problems/convert-bst-to-greater-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_538.java) | |Easy | Tree\n| 537 |[Complex Number Multiplication](https://leetcode.com/problems/complex-number-multiplication/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_537.java) | |Medium | Math, String\n| 536 |[Construct Binary Tree from String](https://leetcode.com/problems/construct-binary-tree-from-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_536.java) | | Medium | Recursion, Stack\n| 535 |[Encode and Decode TinyURL](https://leetcode.com/problems/encode-and-decode-tinyurl/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_535.java) | |Medium | Design\n| 533 |[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_533.java) | | Medium | HashMap\n| 532 |[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_532.java) | |Easy | HashMap\n| 531 |[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_531.java) | |Medium | \n| 530 |[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_530.java) | |Easy| DFS\n| 529 |[Minesweeper](https://leetcode.com/problems/minesweeper/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_529.java) | |Medium | BFS\n| 528 |[Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_528.java) | |Medium | Math, Binary Search, Prefix Sum, Randomized\n| 527 |[Word Abbreviation](https://leetcode.com/problems/word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_527.java) | |Hard | \n| 526 |[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) | |Medium | Backtracking\n| 525 |[Contiguous Array](https://leetcode.com/problems/contiguous-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_525.java) | |Medium | HashMap\n| 524 |[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_524.java) | |Medium | Sort\n| 523 |[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_523.java) | |Medium| DP\n| 522 |[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_522.java) | | Medium|\n| 521 |[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_521.java) | | Easy|\n| 520 |[Detect Capital](https://leetcode.com/problems/detect-capital/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_520.java) | |Easy|\n| 518 |[Coin Change 2](https://leetcode.com/problems/coin-change-2/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_518.java) | |Medium| Array, DP\n| 517 |[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_517.java) | |Hard| DP\n| 516 |[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_516.java) | |Medium| DP\n| 515 |[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_515.java) | |Medium| BFS\n| 514 |[Freedom Trail](https://leetcode.com/problems/freedom-trail/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_514.java) | |Hard | DP\n| 513 |[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_513.java) || Medium | BFS\n| 509 |[Fibonacci Number](https://leetcode.com/problems/fibonacci-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_509.java) | [:tv:](https://www.youtube.com/watch?v=WPBTYmvcHXs) |Easy| Array \n| 508 |[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_508.java) || Medium | DFS, Tree\n| 507 |[Perfect Number](https://leetcode.com/problems/perfect-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_507.java) | |Easy| Math\n| 506 |[Relative Ranks](https://leetcode.com/problems/relative-ranks/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_506.java) | |Easy|\n| 505 |[The Maze II](https://leetcode.com/problems/the-maze-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_505.java) | |Medium| BFS\n| 504 |[Base 7](https://leetcode.com/problems/base-7/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_504.java) | |Easy| \n| 503 |[Next Greater Element II](https://leetcode.com/problems/parents-greater-element-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_503.java) | |Medium| Stack\n| 502 |[IPO](https://leetcode.com/problems/ipo/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_502.java) | |Hard| Heap, Greedy\n| 501 |[Find Mode in Binary Tree](https://leetcode.com/problems/find-mode-in-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_501.java) | |Easy| Binary Tree\n| 500 |[Keyboard Row](https://leetcode.com/problems/keyboard-row/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_500.java) | |Easy|\n| 499 |[The Maze III](https://leetcode.com/problems/the-maze-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_499.java) | |Hard| BFS\n| 496 |[Next Greater Element I](https://leetcode.com/problems/parents-greater-element-i/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_496.java) | |Easy|\n| 498 |[Diagonal Traverse](https://leetcode.com/problems/diagonal-traverse/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_498.java) | |Medium| \n| 495 |[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_495.java) | |Medium| Array\n| 494 |[Target Sum](https://leetcode.com/problems/target-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_494.java) | |Medium| \n| 493 |[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_493.java) | |Hard| Recursion\n| 492 |[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_492.java) | |Easy| Array\n| 491 |[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_491.java) | |Medium| Backtracking, DFS\n| 490 |[The Maze](https://leetcode.com/problems/the-maze/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_490.java) | |Medium| BFS\n| 488 |[Zuma Game](https://leetcode.com/problems/zuma-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) | |Hard | DFS, Backtracking\n| 487 |[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_487.java) | [:tv:](https://youtu.be/nKhteIRZ2Ok) |Medium| Array, Sliding Window\n| 486 |[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) | | Medium | DP\n| 485 |[Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)| [Java](../master/src/main/java/com/fishercoder/solutions/_485.java) [Javascript](../master/javascript/_485.js) | [:tv:](https://youtu.be/nKhteIRZ2Ok) |Easy| Array\n| 484 |[Find Permutation](https://leetcode.com/problems/find-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_484.java) | |Medium | Array, String, Greedy\n| 483 |[Smallest Good Base](https://leetcode.com/problems/smallest-good-base/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_483.java) | |Hard | Binary Search, Math\n| 482 |[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_482.java) | |Medium| \n| 481 |[Magical String](https://leetcode.com/problems/magical-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_481.java) || Medium | \n| 480 |[Sliding Window Median](https://leetcode.com/problems/sliding-window-median/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_480.java) | |Hard| Heap\n| 479 |[Largest Palindrome Product](https://leetcode.com/problems/largest-palindrome-product/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_479.java) | |Easy| \n| 477 |[Total Hamming Distance](https://leetcode.com/problems/total-hamming-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_477.java) | |Medium| Bit Manipulation\n| 478 |[Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_478.java) | | Medium| Math, Random, Rejection Sampling\n| 476 |[Number Complement](https://leetcode.com/problems/number-complement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_476.java) | | Easy| Bit Manipulation\n| 475 |[Heaters](https://leetcode.com/problems/heaters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_475.java) | |Easy | Array Binary Search\n| 474 |[Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_474.java) | |Medium| DP\n| 473 |[Matchsticks to Square](https://leetcode.com/problems/matchsticks-to-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_473.java) | |Medium| Backtracking, DFS\n| 472 |[Concatenated Words](https://leetcode.com/problems/concatenated-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_472.java) | |Hard| Trie, DP, DFS\n| 471 |[Encode String with Shortest Length](https://leetcode.com/problems/encode-string-with-shortest-length/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_471.java) | |Hard| DP\n| 469 |[Convex Polygon](https://leetcode.com/problems/convex-polygon/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_469.java) | |Medium| Math\n| 468 |[Validate IP Address](https://leetcode.com/problems/validate-ip-address/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_468.java) | |Medium | String\n| 467 |[Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_467.java) || Medium | DP\n| 466 |[Count The Repetitions](https://leetcode.com/problems/count-the-repetitions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_466.java) | |Hard| DP\n| 465 |[Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_465.java) | |Hard| DP\n| 464 |[Can I Win](https://leetcode.com/problems/can-i-win/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_464.java) | |Medium| DP\n| 463 |[Island Perimeter](https://leetcode.com/problems/island-perimeter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_463.java) | |Easy| \n| 462 |[Minimum Moves to Equal Array Elements II](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_462.java) || Medium |\n| 461 |[Hamming Distance](https://leetcode.com/problems/hamming-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_461.java), [C++](../master/cpp/_461.cpp) | |Easy|\n| 460 |[LFU Cache](https://leetcode.com/problems/lfu-cache/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_460.java) | | Hard| Design, LinkedHashMap, HashMap\n| 459 |[Repeated Substring Pattern](https://leetcode.com/problems/repeated-substring-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_459.java) | |Easy| String, KMP\n| 458 |[Poor Pigs](https://leetcode.com/problems/poor-pigs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_458.java) | |Easy| Math\n| 457 |[Circular Array Loop](https://leetcode.com/problems/circular-array-loop/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_457.java) | |Medium |\n| 456 |[132 Pattern](https://leetcode.com/problems/132-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_456.java) | |Medium| Stack\n| 455 |[Assign Cookies](https://leetcode.com/problems/assign-cookies/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_455.java) | |Easy|\n| 454 |[4Sum II](https://leetcode.com/problems/4sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_454.java) | |Medium| HashMap\n| 453 |[Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_453.java) | |Easy|\n| 452 |[Minimum Number of Arrows to Burst Balloons](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_452.java) | |Medium| Array, Greedy\n| 451 |[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_451.java) | |Medium| HashMap\n| 450 |[Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_450.java) | |Medium| Tree, Recursion\n| 449 |[Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_449.java) | |Medium| BFS\n| 448 |[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_448.java) | |Easy| Array, HashMap\n| 447 |[Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_447.java) | |Easy| HashMap\n| 446 |[Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_446.java) | |Hard| DP\n| 445 |[Add Two Numbers II](https://leetcode.com/problems/add-two-numbers-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_445.java) | |Medium| Stack, LinkedList\n| 444 |[Sequence Reconstruction](https://leetcode.com/problems/sequence-reconstruction/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_444.java) | |Medium| Topological Sort, Graph\n| 443 |[String Compression](https://leetcode.com/problems/string-compression/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_443.java) | |Easy | \n| 442 |[Find All Duplicates in an Array](https://leetcode.com/problems/find-all-duplicates-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_442.java) | |Medium| Array\n| 441 |[Arranging Coins](https://leetcode.com/problems/arrange-coins/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_441.java) | |Easy|\n| 440 |[K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_440.java) | |Hard|\n| 439 |[Ternary Expression Parser](https://leetcode.com/problems/ternary-expression-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_439.java) | |Medium| Stack\n| 438 |[Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_438.java) | |Easy| Sliding Window\n| 437 |[Path Sum III](https://leetcode.com/problems/path-sum-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_437.java) | |Easy| DFS, recursion\n| 436 |[Find Right Interval](https://leetcode.com/problems/find-right-interval/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_436.java) | |Medium| Binary Search\n| 435 |[Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_435.java) | |Medium| Greedy\n| 434 |[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_434.java) | |Easy|\n| 432 |[All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_432.java) | |Hard| Design\n| 430 |[Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_430.java) | |Medium|LinkedList, DFS, Doubly-Linked List \n| 429 |[N-ary Tree Level Order Traversal](https://leetcode.com/problems/n-ary-tree-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_429.java) | |Easy| BFS, Tree\n| 425 |[Word Squares](https://leetcode.com/problems/word-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_425.java) | |Hard| Trie, Backtracking, Recursion\n| 424 |[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_424.java) | | Medium| Sliding Window\n| 423 |[Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_423.java) | | Medium| Math\n| 422 |[Valid Word Square](https://leetcode.com/problems/valid-word-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_422.java) | |Easy|\n| 421 |[Maximum XOR of Two Numbers in an Array](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_421.java) | |Medium | Bit Manipulation, Trie\n| 420 |[Strong Password Checker](https://leetcode.com/problems/strong-password-checker/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_420.java) | | Hard| \n| 419 |[Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_419.java) | |Medium| DFS\n| 418 |[Sentence Screen Fitting](https://leetcode.com/problems/sentence-screen-fitting/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_418.java) | |Medium| \n| 417 |[Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_417.java) | |Medium| DFS\n| 416 |[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_416.java), [C++](../master/cpp/_416.cpp) | |Medium | DP\n| 415 |[Add Strings](https://leetcode.com/problems/add-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_415.java) | |Easy|\n| 414 |[Third Maximum Number](https://leetcode.com/problems/third-maximum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_414.java) | |Easy|\n| 413 |[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_413.java) | |Medium| DP\n| 412 |[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_412.java) | |Easy|\n| 411 |[Minimum Unique Word Abbreviation](https://leetcode.com/problems/minimum-unique-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_411.java) | |Hard| NP-Hard, Backtracking, Trie, Recursion\n| 410 |[Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_410.java) | |Hard| Binary Search, DP\n| 409 |[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_409.java) | |Easy| \n| 408 |[Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_408.java) | |Easy|\n| 407 |[Trapping Rain Water II](https://leetcode.com/problems/trapping-rain-water-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_407.java) | |Hard| Heap\n| 406 |[Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_406.java) | |Medium| LinkedList, PriorityQueue\n| 405 |[Convert a Number to Hexadecimal](https://leetcode.com/problems/convert-a-number-to-hexadecimal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_405.java) | |Easy|\n| 404 |[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_404.java) | |Easy|\n| 403 |[Frog Jump](https://leetcode.com/problems/frog-jump/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_403.java) | |Hard| DP\n| 402 |[Remove K Digits](https://leetcode.com/problems/remove-k-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_402.java) | |Medium| Greedy, Stack\n| 401 |[Binary Watch](https://leetcode.com/problems/binary-watch/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_401.java) | |Easy|\n| 400 |[Nth Digit](https://leetcode.com/problems/nth-digit/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_400.java) | |Easy|\n| 399 |[Evaluate Division](https://leetcode.com/problems/evaluate-division/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_399.java) | |Medium| Graph, DFS, Backtracking\n| 398 |[Random Pick Index](https://leetcode.com/problems/random-pick-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_398.java) | |Medium| Reservoir Sampling\n| 397 |[Integer Replacement](https://leetcode.com/problems/integer-replacement/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_397.java) | |Easy| BFS\n| 396 |[Rotate Function](https://leetcode.com/problems/rotate-function/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_396.java) | |Easy|\n| 395 |[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_395.java) | |Medium| Recursion\n| 394 |[Decode String](https://leetcode.com/problems/decode-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_394.java) | |Medium| Stack Depth-first-search\n| 393 |[UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_393.java) | |Medium| Bit Manipulation\n| 392 |[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_392.java) | |Medium| Array, String\n| 391 |[Perfect Rectangle](https://leetcode.com/problems/perfect-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_391.java) | |Hard| \n| 390 |[Elimination Game](https://leetcode.com/problems/elimination-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_390.java) | |Medium|\n| 389 |[Find the Difference](https://leetcode.com/problems/find-the-difference/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_389.java) | || Easy|\n| 388 |[Longest Absolute File Path](https://leetcode.com/problems/longest-absolute-file-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_388.java) | |Medium| Stack\n| 387 |[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_387.java) | |Easy| HashMap\n| 386 |[Lexicographical Numbers](https://leetcode.com/problems/lexicographical-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_386.java) | |Medium| \n| 385 |[Mini Parser](https://leetcode.com/problems/mini-parser/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_385.java) | |Medium| Stack\n| 384 |[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_384.java) | |Medium| \n| 383 |[Ransom Note](https://leetcode.com/problems/ransom-note/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_383.java) | |Easy | String\n| 382 |[Linked List Random Node](https://leetcode.com/problems/linked-list-random-node/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_382.java) | |Medium| Reservoir Sampling\n| 381 |[Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_381.java) || Hard | \n| 380 |[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_380.java) | |Medium| Design, HashMap\n| 379 |[Design Phone Directory](https://leetcode.com/problems/design-phone-directory/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_379.java) | |Medium| \n| 378 |[Kth Smallest Element in a Sorted Matrix](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_378.java) | |Medium| Binary Search\n| 377 |[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_377.java) | |Medium| DP\n| 376 |[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_376.java) | |Medium| DP, Greedy\n| 375 |[Guess Number Higher or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_375.java) | |Medium| DP\n| 374 |[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_374.java) | |Easy| Binary Search\n| 373 |[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_373.java) | |Medium| Heap\n| 372 |[Super Pow](https://leetcode.com/problems/super-pow/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_372.java) | |Medium| Math\n| 371 |[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_371.java) | |Easy| \n| 370 |[Range Addition](https://leetcode.com/problems/range-addition/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_370.java) | |Medium|Array \n| 369 |[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_369.java) | |Medium| Linked List\n| 368 |[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_368.java) | | Medium| DP\n| 367 |[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_367.java) | |Medium| \n| 366 |[Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_366.java) | |Medium| DFS\n| 365 |[Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_365.java) | |Medium| Math\n| 364 |[Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_364.java) | |Medium| DFS\n| 363 |[Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_363.java) | |Hard| DP \n| 362 |[Design Hit Counter](https://leetcode.com/problems/design-hit-counter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_362.java) | |Medium| Design\n| 361 |[Bomb Enemy](https://leetcode.com/problems/bomb-enemy/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_361.java) | |Medium| \n| 360 |[Sort Transformed Array](https://leetcode.com/problems/sort-transformed-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_360.java) | |Medium| Two Pointers, Math\n| 359 |[Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_359.java) | |Easy| HashMap\n| 358 |[Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_358.java) | |Hard| HashMap, Heap, Greedy\n| 357 |[Count Numbers with Unique Digits](https://leetcode.com/problems/count-numbers-with-unique-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_357.java) | |Medium| DP, Math\n| 356 |[Line Reflection](https://leetcode.com/problems/line-reflection/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_356.java) | |Medium| HashSet\n| 355 |[Design Twitter](https://leetcode.com/problems/design-twitter/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_355.java) | |Medium| Design, HashMap, Heap\n| 354 |[Russian Doll Envelopes](https://leetcode.com/problems/russian-doll-envelopes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_354.java) | |Hard| DP, Binary Search\n| 353 |[Design Snake Game](https://leetcode.com/problems/design-snake-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_353.java) | |Medium|\n| 352 |[Data Stream as Disjoint Intervals](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_352.java) | |Hard| TreeMap\n| 351 |[Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_351.java) | |Medium|\n| 350 |[Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_350.java) | [:tv:](https://youtu.be/lKuK69-hMcc) |Easy| HashMap, Binary Search\n| 349 |[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_349.java) | [:tv:](https://youtu.be/XxStWmfXJRs) |Easy| Two Pointers, Binary Search\n| 348 |[Design Tic-Tac-Toe](https://leetcode.com/problems/design-tic-tac-toe/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_348.java) | |Medium| Design \n| 347 |[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_347.java) | |Medium| HashTable, Heap, Bucket Sort\n| 346 |[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_346.java) | |Easy| Queue\n| 345 |[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_345.java) | |Easy | String\n| 344 |[Reverse String](https://leetcode.com/problems/reverse-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) | [:tv:](https://youtu.be/P68JPXtFyYg) |Easy | String\n| 343 |[Integer Break](https://leetcode.com/problems/integer-break/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_343.java) | |Medium| Math\n| 342 |[Power of Four](https://leetcode.com/problems/power-of-four/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_342.java) | |Easy| Math\n| 341 |[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_341.java) | |Medium| Stack\n| 340 |[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_340.java) | |Hard| Sliding Window\n| 339 |[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_339.java) | |Easy| DFS\n| 338 |[Counting Bits](https://leetcode.com/problems/counting-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_338.java) | |Medium| \n| 337 |[House Robber III](https://leetcode.com/problems/house-robber-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_337.java) | |Medium | DP\n| 336 |[Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_336.java) | |Hard|\n| 335 |[Self Crossing](https://leetcode.com/problems/self-crossing/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_335.java) | |Hard| Math\n| 334 |[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_334.java) | |Medium|\n| 333 |[Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_333.java) | |Medium| Tree \n| 332 |[Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_332.java) | |Medium| Graph, DFS\n| 331 |[Verify Preorder Serialization of a Binary Tree](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_331.java) | |Medium| Stack\n| 330 |[Patching Array](https://leetcode.com/problems/patching-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_330.java) | |Hard| Greedy\n| 329 |[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_329.java) | |Hard| DFS, DP\n| 328 |[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_328.java) | |Medium| Linked List\n| 327 |[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_327.java) | |Hard| BST, Divide and Conquer\n| 326 |[Power of Three](https://leetcode.com/problems/power-of-three/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_326.java) | |Easy| Math\n| 325 |[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_325.java) | |Medium| HashTable\n| 324 |[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_324.java) | |Medium| Sort\n| 323 |[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_323.java) | | Medium|\n| 322 |[Coin Change](https://leetcode.com/problems/coin-change/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_322.java) | |Medium| DP\n| 321 |[Create Maximum Number](https://leetcode.com/problems/create-maximum-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_321.java) | |Hard\n| 320 |[Generalized Abbreviation](https://leetcode.com/problems/generalized-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_320.java) | |Medium| Backtracking, Bit Manipulation\n| 319 |[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_319.java) | |Medium| Brainteaser\n| 318 |[Maximum Product of Word Lengths](https://leetcode.com/problems/maximum-product-of-word-lengths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_318.java) | |Medium| \n| 317 |[Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_317.java) | |Hard| \n| 316 |[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_316.java) | |Hard| Stack, Recursion, Greedy\n| 315 |[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_315.java) | |Hard| Tree\n| 314 |[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_314.java) | |Medium| HashMap, BFS\n| 313 |[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_313.java) | |Medium| \n| 312 |[Burst Balloons](https://leetcode.com/problems/burst-balloons/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_312.java) | |Hard| DP\n| 311 |[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_311.java) | |Medium|\n| 310 |[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_310.java) | |Medium|\n| 309 |[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-cooldown/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_309.java) | |Medium| DP\n| 308 |[Range Sum Query 2D - Mutable](https://leetcode.com/problems/range-sum-query-2d-mutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_308.java) | |Hard| Tree\n| 307 |[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_307.java) | |Medium| Tree\n| 306 |[Additive Number](https://leetcode.com/problems/additive-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_306.java) | |Medium|\n| 305 |[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_305.java) | | Hard| Union Find\n| 304 |[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_304.java) | |Medium| \n| 303 |[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_303.java) | |Easy|\n| 302 |[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_302.java) | |Hard| DFS, BFS\n| 301 |[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_301.java) | |Hard| BFS\n| 300 |[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_300.java) | |Medium| DP\n| 299 |[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_299.java) | |Easy| \n| 298 |[Binary Tree Longest Consecutive Sequence](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_298.java) | |Medium | Tree\n| 297 |[Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_297.java) | |Hard| BFS\n| 296 |[Best Meeting Point](https://leetcode.com/problems/best-meeting-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_296.java) | |Hard|\n| 295 |[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_295.java) | |Hard| Heap\n| 294 |[Flip Game II](https://leetcode.com/problems/flip-game-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_294.java) | |Medium| Backtracking\n| 293 |[Flip Game](https://leetcode.com/problems/flip-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_293.java) | |Easy| \n| 292 |[Nim Game](https://leetcode.com/problems/nim-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_292.java) | | Easy| \n| 291 |[Word Pattern II](https://leetcode.com/problems/word-pattern-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_291.java) | |Hard| Recursion, Backtracking\n| 290 |[Word Pattern](https://leetcode.com/problems/word-pattern/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_290.java) | |Easy| HashMap \n| 289 |[Game of Life](https://leetcode.com/problems/game-of-life/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_289.java) | [:tv:](https://youtu.be/YZ-W5DrKPQ0) |Medium|\n| 288 |[Unique Word Abbreviation](https://leetcode.com/problems/unique-word-abbreviation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_288.java) | |Easy| \n| 287 |[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_287.java) | |Medium| \n| 286 |[Walls and Gates](https://leetcode.com/problems/walls-and-gates/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_286.java) | |Medium| BFS\n| 285 |[Inorder Successor In BST](https://leetcode.com/problems/inorder-successor-in-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_285.java) | |Medium| Tree\n| 284 |[Peeking Iterator](https://leetcode.com/problems/peeking-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_284.java) | |Medium| Design\n| 283 |[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_283.java) | [:tv:](https://youtu.be/39VJV4KVyi8) |Easy| \n| 282 |[Expression Add Operators](https://leetcode.com/problems/expression-add-operators/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_282.java) | |Hard|\n| 281 |[Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_281.java) | |Medium|\n| 280 |[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_280.java) | |Medium|\n| 279 |[Perfect Squares](https://leetcode.com/problems/perfect-squares/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_279.java) | |Medium| \n| 278 |[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_278.java) | [:tv:](https://youtu.be/E15djRphPj0) |Easy| Binary Search\n| 277 |[Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_277.java) | |Medium| \n| 276 |[Paint Fence](https://leetcode.com/problems/paint-fence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_276.java) | |Easy| DP\n| 275 |[H-Index II](https://leetcode.com/problems/h-index-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_275.java) | |Medium| Binary Search\n| 274 |[H-Index](https://leetcode.com/problems/h-index/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_274.java) | |Medium| \n| 273 |[Integer to English Words](https://leetcode.com/problems/integer-to-english-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_273.java) | |Hard| Math, String \n| 272 |[Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_272.java) | |Hard| Stack\n| 271 |[Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_271.java) | | |Medium| \n| 270 |[Closest Binary Search Tree Value](https://leetcode.com/problems/closest-binary-search-tree-value/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_270.java) | | |Easy| DFS\n| 269 |[Alien Dictionary](https://leetcode.com/problems/alien-dictionary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_269.java) | | |Hard| Topological Sort\n| 268 |[Missing Number](https://leetcode.com/problems/missing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_268.java) | | |Easy| Bit Manipulation\n| 267 |[Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_267.java) | |Medium|\n| 266 |[Palindrome Permutation](https://leetcode.com/problems/palindrome-permutation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_266.java) | |Easy|\n| 265 |[Paint House II](https://leetcode.com/problems/paint-house-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_265.java) | |Hard| DP \n| 264 |[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_264.java) | |Medium| DP\n| 263 |[Ugly Number](https://leetcode.com/problems/ugly-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_263.java) | |Easy|\n| 261 |[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_261.java) | |Medium|\n| 260 |[Single Number III](https://leetcode.com/problems/single-number-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_260.java) | |Medium|\n| 259 |[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_259.java) | |Medium|\n| 258 |[Add Digits](https://leetcode.com/problems/add-digits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_258.java) | |Easy|\n| 257 |[Binary Tree Paths](https://leetcode.com/problems/binary-tree-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_257.java) | ||DFS/Recursion\n| 256 |[Paint House](https://leetcode.com/problems/paint-house/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_256.java) | |Medium| DP\n| 255 |[Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_255.java) | |Medium| Tree\n| 254 |[Factor Combinations](https://leetcode.com/problems/factor-combinations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_254.java) | |Medium| Backtracking\n| 253 |[Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_253.java) | |Medium| Heap\n| 252 |[Meeting Rooms](https://leetcode.com/problems/meeting-rooms/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_252.java) | | Easy\n| 251 |[Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_251.java) | |Medium| \n| 250 |[Count Univalue Subtrees](https://leetcode.com/problems/count-univalue-subtrees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_250.java) | |Medium| DFS\n| 249 |[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_249.java) | || \n| 248 |[Strobogrammatic Number III](https://leetcode.com/problems/strobogrammatic-number-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_248.java) | |Hard | Recursion, DFS \n| 247 |[Strobogrammatic Number II](https://leetcode.com/problems/strobogrammatic-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_247.java) | |Medium | Recursion\n| 246 |[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_246.java) | |Easy \n| 245 |[Shortest Word Distance III](https://leetcode.com/problems/shortest-word-distance-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_245.java) | |Medium | \n| 244 |[Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_244.java) | |Medium | HashMap\n| 243 |[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_243.java) | |Easy\n| 242 |[Valid Anagram](https://leetcode.com/problems/valid-anagram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_242.java) | |Easy\n| 241 |[Different Ways to Add Parentheses](https://leetcode.com/problems/different-ways-to-add-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_241.java) | |Medium | Divide and Conquer\n| 240 |[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_240.java) | |Medium| Binary Search\n| 239 |[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_239.java) | |Hard| Heap\n| 238 |[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_238.java) | |Medium| Array\n| 237 |[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_237.java) | [:tv:](https://youtu.be/sW8ZaOTtvgI) |Easy| LinkedList\n| 236 |[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_236.java) | |Medium| DFS\n| 235 |[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_235.java) | |Easy| DFS\n| 234 |[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_234.java) | [:tv:](https://youtu.be/bOGh_3MTrdE) |Easy| Linked List \n| 233 |[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_233.java) | |Hard| Math\n| 232 |[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_232.java) | |Medium| Stack, Design\n| 231 |[Power of Two](https://leetcode.com/problems/power-of-two/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_231.java) | |Easy| \n| 230 |[Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_230.java) | |Medium| Tree\n| 229 |[Majority Element II](https://leetcode.com/problems/majority-element-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_229.java) | |Medium|\n| 228 |[Summary Ranges](https://leetcode.com/problems/summary-ranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_228.java) | |Medium| Array\n| 227 |[Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_227.java) | |Medium| String\n| 226 |[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_226.java) | |Easy| DFS, recursion\n| 225 |[Implement Stack using Queues](https://leetcode.com/problems/implement-stack-using-queues/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_225.java) | |Easy| Stack, Queue\n| 224 |[Basic Calculator](https://leetcode.com/problems/basic-calculator/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_224.java) | |Hard| \n| 223 |[Rectangle Area](https://leetcode.com/problems/rectangle-area/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_223.java) | | Easy| \n| 222 |[Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_222.java) | |Medium| Recursion\n| 221 |[Maximal Square](https://leetcode.com/problems/maximal-square/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_221.java) | |Medium| Recursion\n| 220 |[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_220.java) | [:tv:](https://youtu.be/Cu7g9ovYHNI) |Medium| TreeSet\n| 219 |[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_219.java) | [:tv:](https://youtu.be/SFMCxqSeM94) |Easy| HashMap\n| 218 |[The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_218.java) | |Hard| TreeMap, Design\n| 217 |[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_217.java) | [:tv:](https://youtu.be/SFMCxqSeM94) |Easy| HashSet\n| 216 |[Combination Sum III](https://leetcode.com/problems/combination-sum-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_216.java) | |Medium| Backtracking\n| 215 |[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_215.java) | |Medium| Heap\n| 214 |[Shortest Palindrome](https://leetcode.com/problems/shortest-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_214.java) | |Hard | KMP\n| 213 |[House Robber II](https://leetcode.com/problems/house-robber-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_213.java) | |Medium | DP\n| 212 |[Word Search II](https://leetcode.com/problems/word-search-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/WordSearchII.java) | |Hard | Trie\n| 211 |[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_211.java) | |Medium| Trie\n| 210 |[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_210.java) | |Medium|\n| 209 |[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_209.java) | |Medium|\n| 208 |[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_208.java) | [:tv:](https://youtu.be/Br7Wt4V5o1c) |Medium| Trie\n| 207 |[Course Schedule](https://leetcode.com/problems/course-schedule/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_207.java) | |Medium|\n| 206 |[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_206.java) | [:tv:](https://youtu.be/N_Y12-5oa-w) |Easy | Linked List\n| 205 |[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_205.java) | |Easy\n| 204 |[Count Primes](https://leetcode.com/problems/count-primes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_204.java) | |Easy | The Sieve of Eratosthenes\n| 203 |[Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_203.java) | |Easy\n| 202 |[Happy Number](https://leetcode.com/problems/happy-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_202.java) | |Easy\n| 201 |[Bitwise AND of Numbers Range](https://leetcode.com/problems/bitwise-and-of-numbers-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_201.java) | |Medium | Bit Manipulation\n| 200 |[Number of Islands](https://leetcode.com/problems/number-of-islands/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_200.java) | |Medium| Union Find, DFS\n| 199 |[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_199.java) | |Medium | BFS \n| 198 |[House Robber](https://leetcode.com/problems/house-robber/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_198.java) | |Easy | DP\n| 191 |[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_191.java) | |Easy | Bit Manipulation\n| 190 |[Reverse Bits](https://leetcode.com/problems/reverse-bits/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_190.java) | |Easy | Bit Manipulation\n| 189 |[Rotate Array](https://leetcode.com/problems/rotate-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_189.java) | [:tv:](https://youtu.be/lTHTR_jsqAQ) | Easy\n| 188 |[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_188.java) | |Hard | DP\n| 187 |[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_187.java) | | Medium\n| 186 |[Reverse Words in a String II](https://leetcode.com/problems/reverse-words-in-a-string-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_186.java) | |Medium\n| 179 |[Largest Number](https://leetcode.com/problems/largest-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_179.java) | |Medium|\n| 174 |[Dungeon Game](https://leetcode.com/problems/dungeon-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_174.java) | |Hard| DP\n| 173 |[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)| [Solution](../../blmaster/MEDIUM/src/medium/_173.java) | |Medium| Stack, Design\n| 172 |[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_172.java) | |Easy\n| 171 |[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_171.java) | |Easy\n| 170 |[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_170.java) | |Easy\n| 169 |[Majority Element](https://leetcode.com/problems/majority-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_169.java) | [:tv:](https://youtu.be/M1IL4hz0QrE) |Easy|\n| 168 |[Excel Sheet Column Title](https://leetcode.com/problems/excel-sheet-column-title/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_168.java) | |Easy|\n| 167 |[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)| [Java](../master/src/main/java/com/fishercoder/solutions/_167.java), [Javascript](../master/javascript/_167.js) | |Easy| Binary Search\n| 166 |[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_166.java) | |Medium| HashMap\n| 165 |[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_165.java) | |Easy|\n| 164 |[Maximum Gap](https://leetcode.com/problems/maximum-gap/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_164.java) | |Hard|\n| 163 |[Missing Ranges](https://leetcode.com/problems/missing-ranges/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_163.java) | ||\n| 162 |[Find Peak Element](https://leetcode.com/problems/find-peak-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_162.java) | |Binary Search|\n| 161 |[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_161.java) | ||\n| 160 |[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_160.java) | |Easy| Linked List\n| 159 |[Longest Substring with At Most Two Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_159.java) | | Hard| String, Sliding Window\n| 158 |[Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_158.java) | |Hard|\n| 157 |[Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_157.java) | |Easy| \n| 156 |[Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_156.java) | |Medium| Tree, Recursion\n| 155 |[Min Stack](https://leetcode.com/problems/min-stack/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_155.java) | |Easy| Stack\n| 154 |[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_154.java) | |Hard| Array, Binary Search\n| 153 |[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_153.java) | |Medium| Array, Binary Search\n| 152 |[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_152.java) | |Medium| Array\n| 151 |[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_151.java) | | Medium| String\n| 150 |[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_150.java) | |Medium\n| 149 |[Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_149.java) | |Hard|\n| 148 |[Sort List](https://leetcode.com/problems/sort-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_148.java) || Medium | Linked List, Sorting\n| 147 |[Insertion Sort List](https://leetcode.com/problems/insertion-sort-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_147.java) || Medium | Linked List\n| 146 |[LRU Cache](https://leetcode.com/problems/lru-cache/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_146.java) | |Hard| Doubly Linked List, LinkedHashMap\n| 145 |[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_145.java) | [:tv:](https://youtu.be/B6XTLPpsW7k) |Easy| Binary Tree\n| 144 |[Binary Tree Preorder Traversal](https://leetcode.com/problems/binary-tree-preorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_144.java) | [:tv:](https://youtu.be/367McfIeBDM) and [:tv:](https://youtu.be/vMHaqhiTn7Y) |Medium| Binary Tree\n| 143 |[Reorder List](https://leetcode.com/problems/reorder-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_143.java) | |Medium|\n| 142 |[Linked List Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_142.java) | |Medium| Linked List\n| 141 |[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_141.java) | [:tv:](https://youtu.be/agkyC-rbgKM) |Easy| Linked List\n| 140 |[Word Break II](https://leetcode.com/problems/word-break-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_140.java) | |Hard| Backtracking/DFS\n| 139 |[Word Break](https://leetcode.com/problems/word-break/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_139.java) | [:tv:](https://youtu.be/iWenZCZEBIA) |Medium| DP, Pruning\n| 138 |[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_138.java) | |Medium| LinkedList, HashMap \n| 137 |[Single Number II](https://leetcode.com/problems/single-number-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_137.java) | |Medium| Bit Manipulation\n| 136 |[Single Number](https://leetcode.com/problems/single-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_136.java) | [:tv:](https://youtu.be/gJ8VcJ8f_Vk) |Easy | Bit Manipulation\n| 135 |[Candy](https://leetcode.com/problems/candy/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_135.java) | |Hard| Greedy\n| 134 |[Gas Station](https://leetcode.com/problems/gas-station/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_134.java) | |Medium| Greedy\n| 133 |[Clone Graph](https://leetcode.com/problems/clone-graph/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_133.java) | |Medium| HashMap, BFS, Graph \n| 132 |[Palindrome Partitioning II](https://leetcode.com/problems/palindrome-partitioning-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_132.java) | |Hard| \n| 131 |[Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_131.java) | |Medium|\n| 130 |[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_130.java) | |Medium|\n| 129 |[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_129.java) | |Medium| DFS\n| 128 |[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_128.java) | |Hard| Union Find \n| 127 |[Word Ladder](https://leetcode.com/problems/word-ladder/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_127.java) | |Hard| BFS\n| 126 |[Word Ladder II](https://leetcode.com/problems/word-ladder-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_126.java) | |Hard| BFS\n| 125 |[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_125.java) | |Easy| Two Pointers\n| 124 |[Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_124.java) | |Hard | Tree, DFS\n| 123 |[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_123.java) | |Hard | DP\n| 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_122.java) | |Easy | Greedy\n| 121 |[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_121.java) | |Easy|\n| 120 |[Triangle](https://leetcode.com/problems/triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_120.java) | |Medium| DP\n| 119 |[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_119.java) | [:tv:](https://www.youtube.com/watch?v=iVhmR1bzKoo) |Easy| \n| 118 |[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_118.java) | [:tv:](https://www.youtube.com/watch?v=TXd5lfP3Gac) |Easy| \n| 117 |[Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_117.java) | |Medium| BFS\n| 116 |[Populating Next Right Pointers in Each Node](https://leetcode.com/problems/populating-parents-right-pointers-in-each-node/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_116.java) | |Medium| BFS\n| 115 |[Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_115.java) | |Hard| DP\n| 114 |[Flatten Binary Tree to Linked List](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_114.java) | |Medium| Tree\n| 113 |[Path Sum II](https://leetcode.com/problems/path-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_113.java) | |Medium| DFS, Backtracking\n| 112 |[Path Sum](https://leetcode.com/problems/path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_112.java) | |Easy| DFS\n| 111 |[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_111.java) | |Easy| BFS, DFS\n| 110 |[Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_110.java) | |Easy| DFS\n| 109 |[Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_109.java) | |Medium | DFS, Recursion\n| 108 |[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_108.java) | [:tv:](https://youtu.be/VVSnM5DGvjg) |Easy | Tree\n| 107 |[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_107.java) | |Easy| BFS\n| 106 |[Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_106.java) | |Medium| Recursion, Tree\n| 105 |[Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_105.java) | |Medium| Recursion, Tree \n| 104 |[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_104.java) | [:tv:](https://youtu.be/dvmoHr5cN80) |Easy| DFS\n| 103 |[Binary Tree Zigzag Level Order Traversal](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_103.java) | |Medium| BFS,DFS\n| 102 |[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_102.java) | [:tv:](https://youtu.be/sFDNL6r5aDM) |Medium| BFS\n| 101 |[Symmetric Tree](https://leetcode.com/problems/symmetric-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_101.java) | [:tv:](https://www.youtube.com/watch?v=F85boSPtfKg) |Easy| DFS\n| 100 |[Same Tree](https://leetcode.com/problems/same-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_100.java) | [:tv:](https://www.youtube.com/watch?v=2Pe6e0KbgFI) |Easy| DFS\n| 99 |[Recover Binary Search Tree](https://leetcode.com/problems/recover-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_99.java) | |Hard |\n| 98 |[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_98.java) | [:tv:](https://youtu.be/kR5AxWHa9nc) |Medium | DFS/Recursion\n| 97 |[Interleaving String](https://leetcode.com/problems/interleaving-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_97.java) | |Hard| DP\n| 96 |[Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_96.java) | |Medium | Recursion, DP\n| 95 |[Unique Binary Search Trees II](https://leetcode.com/problems/unique-binary-search-trees-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_95.java) | |Medium | Recursion\n| 94 |[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_94.java) | [:tv:](https://youtu.be/o_T8MswDI_Y) [:tv:](https://youtu.be/QxFOR8sQuB4) |Medium| Binary Tree\n| 93 |[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_93.java) | |Medium | Backtracking\n| 92 |[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_92.java) | |Medium\n| 91 |[Decode Ways](https://leetcode.com/problems/decode-ways/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_91.java) | |Medium| DP\n| 90 |[Subsets II](https://leetcode.com/problems/subsets-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_90.java) || Medium |Backtracking\n| 89 |[Gray Code](https://leetcode.com/problems/gray-code/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_89.java) || Medium |Bit Manipulation\n| 88 |[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_88.java) || Easy |\n| 87 |[Scramble String](https://leetcode.com/problems/scramble-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_87.java) || Hard | Recursion\n| 86 |[Partition List](https://leetcode.com/problems/partition-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_86.java) || Medium | Linked List\n| 85 |[Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_85.java) || Hard |DP\n| 84 |[Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_84.java) || Hard |Array, Stack\n| 83 |[Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_83.java) || Easy | Linked List\n| 82 |[Remove Duplicates from Sorted List II](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_82.java) || Medium | Linked List\n| 81 |[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_81.java) || Medium |Binary Search\n| 80 |[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_80.java) || Medium |\n| 79 |[Word Search](https://leetcode.com/problems/word-search/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_79.java) | |Medium | Backtracking, DFS\n| 78 |[Subsets](https://leetcode.com/problems/subsets/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_78.java) || Medium |Backtracking\n| 77 |[Combinations](https://leetcode.com/problems/combinations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_77.java) || Medium |Backtracking\n| 76 |[Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_76.java) || Hard |Two Pointers\n| 75 |[Sort Colors](https://leetcode.com/problems/sort-colors/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_75.java) || Medium | Two Pointers\n| 74 |[Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_74.java) || Medium | Binary Search\n| 73 |[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_73.java) || Medium |\n| 72 |[Edit Distance](https://leetcode.com/problems/edit-distance/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_72.java) || Hard | \n| 71 |[Simplify Path](https://leetcode.com/problems/simplify-path/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_71.java) || Medium | Stack\n| 70 |[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_70.java) | [:tv:](https://youtu.be/ZMNRb9TYiQM) |Easy| DP\n| 69 |[Sqrt(x)](https://leetcode.com/problems/sqrtx/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_69.java) || Easy |\n| 68 |[Text Justification](https://leetcode.com/problems/text-justification/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_68.java) || Hard |\n| 67 |[Add Binary](https://leetcode.com/problems/add-binary/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_67.java) || Easy |\n| 66 |[Plus One](https://leetcode.com/problems/plus-one/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_66.java) | [:tv:](https://youtu.be/HKjt0f1N0GA) |Easy|\n| 65 |[Valid Number](https://leetcode.com/problems/valid-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_65.java) || Hard |\n| 64 |[Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_64.java) || Medium | DP\n| 63 |[Unique Paths II](https://leetcode.com/problems/unique-paths-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_63.java) || Medium | DP\n| 62 |[Unique Paths](https://leetcode.com/problems/unique-paths/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_62.java) || Medium | DP\n| 61 |[Rotate List](https://leetcode.com/problems/rotate-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_61.java) || Medium | Linked List\n| 60 |[Permutation Sequence](https://leetcode.com/problems/permutation-sequence/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_60.java) || Medium | Math, Backtracking\n| 59 |[Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_59.java) | [:tv:](https://www.youtube.com/watch?v=Sv9DK2C4rtc) |Medium|\n| 58 |[Length of Last Word](https://leetcode.com/problems/length-of-last-word/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_58.java) || Easy |\n| 57 |[Insert Intervals](https://leetcode.com/problems/insert-interval/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_57.java) || Hard | Array, Sort\n| 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_56.java) || Medium | Array, Sort\n| 55 |[Jump Game](https://leetcode.com/problems/jump-game/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_55.java) || Medium | Greedy\n| 54 |[Spiral Matrix](https://leetcode.com/problems/spiral-matrix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_54.java) | [:tv:](https://www.youtube.com/watch?v=uYgoo8BdUAA) |Medium| Array\n| 53 |[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_53.java) || Easy | Array\n| 52 |[N-Queens II](https://leetcode.com/problems/n-queens-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_52.java) || Hard | Backtracking\n| 51 |[N-Queens](https://leetcode.com/problems/n-queens/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_51.java) || Hard |\n| 50 |[Pow(x, n)](https://leetcode.com/problems/powx-n/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_50.java) || Medium |\n| 49 |[Group Anagrams](https://leetcode.com/problems/group-anagrams/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_49.java) || Medium | HashMap\n| 48 |[Rotate Image](https://leetcode.com/problems/rotate-image/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_48.java) | [:tv:](https://youtu.be/gCciKhaK2v8) |Medium | Array\n| 47 |[Permutations II](https://leetcode.com/problems/permutations-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_47.java) || Medium |Backtracking\n| 46 |[Permutations](https://leetcode.com/problems/permutations/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_46.java) | |Medium | Backtracking\n| 45 |[Jump Game II](https://leetcode.com/problems/jump-game-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_45.java) || Hard | Array, Greedy\n| 44 |[Wildcard Matching](https://leetcode.com/problems/wildcard-matching/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_44.java) || Hard | Backtracking, DP, Greedy, String\n| 43 |[Multiply Strings](https://leetcode.com/problems/multiply-strings/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_43.java) || Medium | Array, String\n| 42 |[Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_42.java) || Hard |\n| 41 |[First Missing Positive](https://leetcode.com/problems/first-missing-positive/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_41.java) || Hard | Array\n| 40 |[Combination Sum II](https://leetcode.com/problems/combination-sum-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_40.java) || Medium |Backtracking\n| 39 |[Combination Sum](https://leetcode.com/problems/combination-sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_39.java) || Medium |Backtracking\n| 38 |[Count and Say](https://leetcode.com/problems/count-and-say/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_38.java) || Easy | Recursion, LinkedList\n| 37 |[Sudoku Solver](https://leetcode.com/problems/sudoku-solver/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_37.java) || Hard |\n| 36 |[Valid Sudoku](https://leetcode.com/problems/valid-sudoku/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) || Medium | \n| 35 |[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_35.java) || Easy |Array\n| 34 |[Search for a Range](https://leetcode.com/problems/search-for-a-range/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_34.java) || Medium |Array, Binary Search\n| 33 |[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_33.java) || Medium |Binary Search\n| 32 |[Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_32.java) || Hard |Stack, DP\n| 31 |[Next Permutation](https://leetcode.com/problems/parents-permutation)| [Java](../master/src/main/java/com/fishercoder/solutions/_31.java), [C++](../master/cpp/_31.cpp) || Medium |Array\n| 30 |[Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_30.java) || Hard | HashMap\n| 29 |[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_29.java) || Medium |\n| 28 |[Implement strStr()](https://leetcode.com/problems/implement-strstr/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_28.java) || Easy | String\n| 27 |[Remove Element](https://leetcode.com/problems/remove-element/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_27.java) | |Easy |\n| 26 |[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_26.java) | [:tv:](https://youtu.be/nRKZC2JF7LU) |Easy| Array \n| 25 |[Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_25.java) | |Hard | Recursion, LinkedList\n| 24 |[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_24.java) || Medium | Recursion, LinkedList\n| 23 |[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_23.java) | [:tv:](https://www.youtube.com/watch?v=Llse1tImXQA) |Hard|Heap\n| 22 |[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_22.java) || Medium |Backtracking\n| 21 |[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_21.java) | [:tv:](https://youtu.be/N8WTaSSivEI) |Easy| Recursion\n| 20 |[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_20.java) | [:tv:](https://www.youtube.com/watch?v=eBbg5pnq5Zg) |Easy|Stack\n| 19 |[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_19.java) | [:tv:](https://youtu.be/Kka8VgyFZfc) |Medium| Linked List\n| 18 |[4 Sum](https://leetcode.com/problems/4sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_18.java) || Medium |Two Pointers\n| 17 |[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_17.java) || Medium |Backtracking\n| 16 |[3Sum Closest](https://leetcode.com/problems/3sum-closest/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_16.java) || Medium |Two Pointers\n| 15 |[3Sum](https://leetcode.com/problems/3sum/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_15.java), [C++](../master/cpp/_15.cpp) | [:tv:](https://www.youtube.com/watch?v=jeim_j8VdiM) |Medium|Two Pointers, Binary Search\n| 14 |[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_14.java) | [:tv:](https://www.youtube.com/watch?v=K1ps6d7YCy4) | Easy\n| 13 |[Roman to Integer](https://leetcode.com/problems/roman-to-integer)| [Solution](../master/src/main/java/com/fishercoder/solutions/_13.java) | |Easy | Math, String\n| 12 |[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_12.java) || Medium | Math, String\n| 11 |[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_11.java) || Medium |\n| 10 |[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)| [Java](../master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](../master/javascript/_10.js) || Hard |DP\n| 9 |[Palindrome Number](https://leetcode.com/problems/palindrome-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_9.java), [C++](../master/cpp/_9.cpp) | | Easy\n| 8 |[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_8.java) | |Medium\n| 7 |[Reverse Integer](https://leetcode.com/problems/reverse-integer/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_7.java), [C++](../master/cpp/_7.cpp) | [:tv:](https://youtu.be/tm1Yrb_SfBM) |Easy | \n| 6 |[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_6.java) | |Easy | \n| 5 |[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_5.java) | |Medium|\n| 4 |[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_4.java), [C++](../master/cpp/_4.cpp) | |Hard | Divide and Conquer\n| 3 |[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_3.java), [C++](../master/cpp/_3.cpp) | |Medium | HashMap, Sliding Window\n| 2 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_2.java) | |Medium | LinkedList\n| 1 |[Two Sum](https://leetcode.com/problems/two-sum/)| [Java](../master/src/main/java/com/fishercoder/solutions/_1.java), [C++](../master/cpp/_1.cpp), [Javascript](../master/javascript/_1.js) | [:tv:](https://www.youtube.com/watch?v=kPXOr6pW8KM&t=) |Easy| HashMap \n\n" }, { "path": "data-gen/leetcode_scraper.ipynb", "content": "{\n \"cells\": [\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"abeb0073\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"from selenium import webdriver\\n\",\n \"from selenium.webdriver.chrome.options import Options\\n\",\n \"from selenium.common.exceptions import NoSuchElementException\\n\",\n \"from tqdm import tqdm\\n\",\n \"import time\\n\",\n \"import pandas as pd\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"c2b6ff54\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"options = Options()\\n\",\n \"options.headless = True\\n\",\n \"driver = webdriver.Chrome(options=options)\\n\",\n \"driver.set_window_size(1920, 1080)\\n\",\n \"driver.maximize_window()\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"a9bacba8\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"# click helper, wait until page source changed\\n\",\n \"def click(button, timeout=3):\\n\",\n \" prev_src = driver.page_source\\n\",\n \" elapsed = 0\\n\",\n \" unit_time = timeout / 10\\n\",\n \" button.click()\\n\",\n \" while prev_src == driver.page_source and elapsed <= timeout:\\n\",\n \" time.sleep(unit_time)\\n\",\n \" timeout -= unit_time\\n\",\n \" elapsed += unit_time\\n\",\n \" \\n\",\n \"# login to leetcode\\n\",\n \"def login(username, password):\\n\",\n \" login_url = 'https://leetcode.com/accounts/login/'\\n\",\n \" driver.get(login_url)\\n\",\n \" time.sleep(2)\\n\",\n \" username_field = driver.find_element_by_xpath('//input[@id=\\\"id_login\\\"]')\\n\",\n \" password_field = driver.find_element_by_xpath('//input[@id=\\\"id_password\\\"]')\\n\",\n \" signin_button = driver.find_element_by_xpath('//button[@id=\\\"signin_btn\\\"]')\\n\",\n \" username_field.send_keys(username)\\n\",\n \" password_field.send_keys(password)\\n\",\n \" click(signin_button)\\n\",\n \" print('successfully logged in!') \\n\",\n \"\\n\",\n \"# get company info from a problem URL\\n\",\n \"def get_problem_companies_info(problem_url, debug=False):\\n\",\n \" companies_info = dict() # key: company name, value: number of occurances\\n\",\n \" driver.get(problem_url)\\n\",\n \" time.sleep(2)\\n\",\n \" # locate and click on the 'Companies'
\\n\",\n \" try:\\n\",\n \" companies_div = driver.find_element_by_xpath(\\\"//div[text()='Companies']\\\")\\n\",\n \" click(companies_div)\\n\",\n \" except NoSuchElementException as e:\\n\",\n \" print('company not found')\\n\",\n \" return companies_info\\n\",\n \" # if there exists a 'More' , click on it to show all companies\\n\",\n \" try:\\n\",\n \" show_more_span = driver.find_element_by_xpath(\\\"//span[text()='More']\\\")\\n\",\n \" click(show_more_span)\\n\",\n \" except NoSuchElementException as e:\\n\",\n \" pass\\n\",\n \" # locate the
that leetcode places all its little \\\"company tags\\\"\\n\",\n \" company_tag_wrapper = driver.find_element_by_xpath(\\\"//div[starts-with(@class, 'company-tag-wrapper')]\\\")\\n\",\n \" companies_info_raw = company_tag_wrapper.text.replace('\\\\n|\\\\n', '|').split('\\\\n')\\n\",\n \" if debug: print(companies_info_raw)\\n\",\n \" for company in companies_info_raw:\\n\",\n \" if company == '|': continue\\n\",\n \" company_info = company.split('|')\\n\",\n \" if len(company_info) == 1:\\n\",\n \" company_name = company_info[0]\\n\",\n \" companies_info[company_name] = 1\\n\",\n \" else:\\n\",\n \" company_name = company_info[0]\\n\",\n \" num_occur = company_info[1]\\n\",\n \" companies_info[company_name] = num_occur\\n\",\n \" return companies_info\\n\",\n \"\\n\",\n \"# iterate through leetcode_problems to collect their company info\\n\",\n \"def get_problems_companies_info(leetcode_problems, debug=False):\\n\",\n \" problems_companies_info = [] # list of tuples\\n\",\n \" for _, problem in leetcode_problems.iterrows():\\n\",\n \" problem_link = problem['link']\\n\",\n \" problem_name = problem['name']\\n\",\n \" print('handling', problem_link)\\n\",\n \" try:\\n\",\n \" companies_info = get_problem_companies_info(problem_link, debug)\\n\",\n \" # pivot longer\\n\",\n \" for company_name, num_occur in companies_info.items():\\n\",\n \" new_row = (problem_link, problem_name, company_name, num_occur,)\\n\",\n \" problems_companies_info.append(new_row)\\n\",\n \" if debug: print(new_row)\\n\",\n \" except Exception as e:\\n\",\n \" # log the error\\n\",\n \" print('error:', e)\\n\",\n \" return pd.DataFrame(problems_companies_info, \\n\",\n \" columns = ['problem_link', 'problem_name', 'company_name', 'num_occur'])\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"8eedcca9\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"# note: this cell takes around 1 hour to finish\\n\",\n \"# go through questions in the leetcode question list\\n\",\n \"leetcode_problems = pd.read_csv('../data/leetcode_problems.csv')\\n\",\n \"problems_companies_info = get_problems_companies_info(leetcode_problems)\\n\",\n \"problems_companies_info.to_csv('../data/leetcode_problems_and_companies.csv', index=False)\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"30c80380\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": []\n }\n ],\n \"metadata\": {\n \"kernelspec\": {\n \"display_name\": \"Python [conda env:cs320]\",\n \"language\": \"python\",\n \"name\": \"conda-env-cs320-py\"\n },\n \"language_info\": {\n \"codemirror_mode\": {\n \"name\": \"ipython\",\n \"version\": 3\n },\n \"file_extension\": \".py\",\n \"mimetype\": \"text/x-python\",\n \"name\": \"python\",\n \"nbconvert_exporter\": \"python\",\n \"pygments_lexer\": \"ipython3\",\n \"version\": \"3.9.7\"\n }\n },\n \"nbformat\": 4,\n \"nbformat_minor\": 5\n}\n" }, { "path": "data-gen/markdown2csv.py", "content": "import pandas as pd\nimport argparse\n\ndef md_to_df(md_path):\n df = pd.read_table(md_path, sep=\"|\", header=0, index_col=1, skipinitialspace=True).dropna(axis=1, how='all').iloc[1:]\n df.columns = df.columns.str.strip()\n return df\n\ndef md_to_csv(md_path, csv_path):\n df = md_to_df(md_path)\n df.to_csv(csv_path, index=False)\n\nif __name__ == '__main__':\n parser = argparse.ArgumentParser(description='Convert Markdown table to CSV')\n parser.add_argument('--md', type=str, help='path to the source markdown file')\n parser.add_argument('--csv', type=str, help='path to the destination csv file')\n args = parser.parse_args()\n md_to_csv(args.md, args.csv)\n\n" }, { "path": "data-gen/parse_readme.py", "content": "from markdown2csv import md_to_df\nimport re\nimport pandas as pd\n\nparsed_list = []\ndf = md_to_df('../data/leetcode_repo_readme.md')\nfor _, row in df.iterrows():\n name_and_link = row['Title']\n difficulty = row['Difficulty']\n solution = row['Solutions'].replace('..', 'https://github.com/fishercoder1534/Leetcode/blob')\n m = re.search(r'\\[(.*)\\]\\((.*)\\)', name_and_link)\n name = m[1]\n link = m[2]\n parsed_list.append((name, link, difficulty, solution, ))\n\nparsed_df = pd.DataFrame(parsed_list, columns=['name', 'link', 'difficulty', 'solution'])\nparsed_df.to_csv('../data/leetcode_problems.csv', index=False)\n\n\n" }, { "path": "data-gen/transform_data.ipynb", "content": "{\n \"cells\": [\n {\n \"cell_type\": \"markdown\",\n \"id\": \"75f28a50\",\n \"metadata\": {},\n \"source\": [\n \"## Generate pivot wider CSV\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 2,\n \"id\": \"5332f87a\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"import pandas as pd\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 53,\n \"id\": \"b4ae5a29\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"df = pd.read_csv('../data/leetcode_problems_and_companies.csv')\\n\",\n \"df = df.drop(['problem_link'], axis = 1)\\n\",\n \"df = df.pivot_table(columns=['problem_name'], values='num_occur', index='company_name', aggfunc='sum').fillna(0)\\n\",\n \"df.to_csv('../data/companies_and_leetcode_problems.csv', index=False)\"\n ]\n },\n {\n \"cell_type\": \"markdown\",\n \"id\": \"72e54b4c\",\n \"metadata\": {},\n \"source\": [\n \"## Generate CSV for each company\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 62,\n \"id\": \"daed41c6\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"df = pd.read_csv('../data/leetcode_problems_and_companies.csv')\\n\",\n \"companies = list(set(df['company_name']))\\n\",\n \"for company in companies:\\n\",\n \" sub_df = df.query(f'company_name == \\\"{company}\\\"')\\n\",\n \" sub_df = sub_df.drop(['company_name'], axis = 1)\\n\",\n \" sub_df.to_csv(f'../companies/{company}.csv', index=False)\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"9649af13\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": []\n }\n ],\n \"metadata\": {\n \"kernelspec\": {\n \"display_name\": \"Python [conda env:cs320]\",\n \"language\": \"python\",\n \"name\": \"conda-env-cs320-py\"\n },\n \"language_info\": {\n \"codemirror_mode\": {\n \"name\": \"ipython\",\n \"version\": 3\n },\n \"file_extension\": \".py\",\n \"mimetype\": \"text/x-python\",\n \"name\": \"python\",\n \"nbconvert_exporter\": \"python\",\n \"pygments_lexer\": \"ipython3\",\n \"version\": \"3.9.7\"\n }\n },\n \"nbformat\": 4,\n \"nbformat_minor\": 5\n}\n" }, { "path": "todo.md", "content": "## TODO\n- [x] viz: add 'back to top' link next to each company\n- [ ] data collection: extend scraper to collect both problem **type** and **company**\n- [ ] viz: add a new 'type' column for the problem frequency table\n- [ ] viz: add the 'major problem type' info for each company\n- [ ] data analysis: run UMAP to on company-indexed pivot wider dataset to find clusters for company interview profiles\n- [ ] refactor: convert jupyter notebook to .py file for ETL\n" }, { "path": "viz/README.md", "content": "![leetcode-company-wise-problems-2022](https://socialify.git.ci/hxu296/leetcode-company-wise-problems-2022/image?font=Inter&forks=1&issues=1&language=1&owner=1&pulls=1&stargazers=1&theme=Light)\n## Leetcode Company-wise Problem Lists\n\nCurated lists of Leetcode questions group by companies, updated as of May, 2022.\n\nShout out to fishercoder1534 for the awesome [Leetcode](https://github.com/fishercoder1534/Leetcode) repo for solutions.\n\n## Company Index\n1. [APT Portfolio](#apt-portfolio)\n2. [Accenture](#accenture)\n3. [Activision](#activision)\n4. [Adobe](#adobe)\n5. [Affirm](#affirm)\n6. [Airbnb](#airbnb)\n7. [Akamai](#akamai)\n8. [Akuna Capital](#akuna-capital)\n9. [Alation](#alation)\n10. [Alibaba](#alibaba)\n11. [AllinCall](#allincall)\n12. [Amazon](#amazon)\n13. [American Express](#american-express)\n14. [Apple](#apple)\n15. [Arcesium](#arcesium)\n16. [Arista Networks](#arista-networks)\n17. [Asana](#asana)\n18. [Athenahealth](#athenahealth)\n19. [Atlassian](#atlassian)\n20. [Baidu](#baidu)\n21. [Barclays](#barclays)\n22. [BlackRock](#blackrock)\n23. [Bloomberg](#bloomberg)\n24. [Bolt](#bolt)\n25. [Booking](#booking)\n26. [Box](#box)\n27. [ByteDance](#bytedance)\n28. [C3 IoT](#c3-iot)\n29. [Canonical](#canonical)\n30. [Capital One](#capital-one)\n31. [Cashfree](#cashfree)\n32. [Cisco](#cisco)\n33. [Citadel](#citadel)\n34. [Citrix](#citrix)\n35. [Cohesity](#cohesity)\n36. [Commvault](#commvault)\n37. [Coursera](#coursera)\n38. [Cruise Automation](#cruise-automation)\n39. [DE Shaw](#de-shaw)\n40. [DJI](#dji)\n41. [DRW](#drw)\n42. [Databricks](#databricks)\n43. [Dataminr](#dataminr)\n44. [Dell](#dell)\n45. [Deutsche Bank](#deutsche-bank)\n46. [Directi](#directi)\n47. [Docusign](#docusign)\n48. [DoorDash](#doordash)\n49. [Drawbridge](#drawbridge)\n50. [Dropbox](#dropbox)\n51. [Druva](#druva)\n52. [Dunzo](#dunzo)\n53. [Duolingo](#duolingo)\n54. [Epic Systems](#epic-systems)\n55. [Expedia](#expedia)\n56. [FPT](#fpt)\n57. [Facebook](#facebook)\n58. [FactSet](#factset)\n59. [Flipkart](#flipkart)\n60. [Gilt Groupe](#gilt-groupe)\n61. [GoDaddy](#godaddy)\n62. [Goldman Sachs](#goldman-sachs)\n63. [Google](#google)\n64. [Grab](#grab)\n65. [HBO](#hbo)\n66. [HRT](#hrt)\n67. [Honeywell](#honeywell)\n68. [Hotstar](#hotstar)\n69. [Huawei](#huawei)\n70. [Hulu](#hulu)\n71. [IBM](#ibm)\n72. [IIT Bombay](#iit-bombay)\n73. [IMC](#imc)\n74. [IXL](#ixl)\n75. [Indeed](#indeed)\n76. [Info Edge](#info-edge)\n77. [Infosys](#infosys)\n78. [Intel](#intel)\n79. [Intuit](#intuit)\n80. [JPMorgan](#jpmorgan)\n81. [Jane Street](#jane-street)\n82. [Jeavio](#jeavio)\n83. [Karat](#karat)\n84. [Leap Motion](#leap-motion)\n85. [LinkedIn](#linkedin)\n86. [LiveRamp](#liveramp)\n87. [Lyft](#lyft)\n88. [MAQ Software](#maq-software)\n89. [MakeMyTrip](#makemytrip)\n90. [Mathworks](#mathworks)\n91. [Mercari](#mercari)\n92. [Microsoft](#microsoft)\n93. [MindTickle](#mindtickle)\n94. [MindTree](#mindtree)\n95. [Moengage](#moengage)\n96. [Morgan Stanley](#morgan-stanley)\n97. [National Instruments](#national-instruments)\n98. [Netflix](#netflix)\n99. [Netsuite](#netsuite)\n100. [Nuro](#nuro)\n101. [Nutanix](#nutanix)\n102. [Nvidia](#nvidia)\n103. [OT](#ot)\n104. [Opendoor](#opendoor)\n105. [Optum](#optum)\n106. [Oracle](#oracle)\n107. [Palantir Technologies](#palantir-technologies)\n108. [PayTM](#paytm)\n109. [Paypal](#paypal)\n110. [PhonePe](#phonepe)\n111. [Pinterest](#pinterest)\n112. [Pocket Gems](#pocket-gems)\n113. [Postmates](#postmates)\n114. [Pure Storage](#pure-storage)\n115. [Qualcomm](#qualcomm)\n116. [Qualtrics](#qualtrics)\n117. [Quora](#quora)\n118. [Rakuten](#rakuten)\n119. [Reddit](#reddit)\n120. [Redfin](#redfin)\n121. [Riot Games](#riot-games)\n122. [Robinhood](#robinhood)\n123. [Roblox](#roblox)\n124. [Rubrik](#rubrik)\n125. [Rupeek](#rupeek)\n126. [SAP](#sap)\n127. [Salesforce](#salesforce)\n128. [Samsung](#samsung)\n129. [Sapient](#sapient)\n130. [ServiceNow](#servicenow)\n131. [Shopee](#shopee)\n132. [Snapchat](#snapchat)\n133. [Softwire](#softwire)\n134. [Sony](#sony)\n135. [Splunk](#splunk)\n136. [Spotify](#spotify)\n137. [Sprinklr](#sprinklr)\n138. [Square](#square)\n139. [Sumologic](#sumologic)\n140. [Swiggy](#swiggy)\n141. [T System](#t-system)\n142. [TIAA](#tiaa)\n143. [Tencent](#tencent)\n144. [Tesla](#tesla)\n145. [Thumbtack](#thumbtack)\n146. [Tiger Analytics](#tiger-analytics)\n147. [Toptal](#toptal)\n148. [TripleByte](#triplebyte)\n149. [TuSimple](#tusimple)\n150. [Twilio](#twilio)\n151. [Twitch](#twitch)\n152. [Twitter](#twitter)\n153. [Two Sigma](#two-sigma)\n154. [Uber](#uber)\n155. [United Health Group](#united-health-group)\n156. [VMware](#vmware)\n157. [Valve](#valve)\n158. [Virtu Financial](#virtu-financial)\n159. [Visa](#visa)\n160. [Walmart Global Tech](#walmart-global-tech)\n161. [Wayfair](#wayfair)\n162. [Wealthfront](#wealthfront)\n163. [Wish](#wish)\n164. [Works Applications](#works-applications)\n165. [Yahoo](#yahoo)\n166. [Yandex](#yandex)\n167. [Yelp](#yelp)\n168. [ZScaler](#zscaler)\n169. [Zenefits](#zenefits)\n170. [Zillow](#zillow)\n171. [Zoho](#zoho)\n172. [Zomato](#zomato)\n173. [Zoom](#zoom)\n174. [Zopsmart](#zopsmart)\n175. [eBay](#ebay)\n176. [edabit](#edabit)\n177. [instacart](#instacart)\n178. [payu](#payu)\n179. [peak6](#peak6)\n180. [persistent systems](#persistent-systems)\n181. [razorpay](#razorpay)\n182. [tcs](#tcs)\n183. [tiktok](#tiktok)\n184. [zeta suite](#zeta-suite)\n\n\n## APT Portfolio\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Stone Game VI](https://leetcode.com/problems/stone-game-vi/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1686.java) |\n\n## Accenture\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1523.java) |\n| 2 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 2 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_9.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_9.cpp) |\n| 1 | [Find Subsequence of Length K With the Largest Sum](https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2099.java) |\n\n## Activision\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_712.java) |\n\n## Adobe\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 52 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 19 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 16 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 13 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) |\n| 12 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 12 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_217.java) |\n| 12 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 11 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 11 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 10 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 9 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_11.java) |\n| 9 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 8 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 8 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 8 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n| 8 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 7 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_35.java) |\n| 7 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 7 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 7 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n\n## Affirm\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 10 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 6 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) |\n| 4 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Insert Delete GetRandom O(1) - Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_381.java) |\n| 3 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_242.java) |\n| 2 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_465.java) |\n\n## Airbnb\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 14 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_336.java) |\n| 14 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_269.java) |\n| 9 | [Flatten 2D Vector](https://leetcode.com/problems/flatten-2d-vector/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_251.java) |\n| 7 | [Smallest Common Region](https://leetcode.com/problems/smallest-common-region/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1257.java) |\n| 6 | [Pour Water](https://leetcode.com/problems/pour-water/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_755.java) |\n| 6 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_76.java) |\n| 5 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_39.java) |\n| 4 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_341.java) |\n| 3 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_622.java) |\n| 3 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_166.java) |\n| 2 | [Find the Smallest Divisor Given a Threshold](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1283.java) |\n| 2 | [Tag Validator](https://leetcode.com/problems/tag-validator/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_591.java) |\n| 2 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_160.java) |\n| 1 | [Pyramid Transition Matrix](https://leetcode.com/problems/pyramid-transition-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_756.java) |\n| 1 | [Mini Parser](https://leetcode.com/problems/mini-parser/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_385.java) |\n\n## Akamai\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [N-Repeated Element in Size 2N Array](https://leetcode.com/problems/n-repeated-element-in-size-2n-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_961.java) |\n\n## Akuna Capital\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 8 | [Increasing Decreasing String](https://leetcode.com/problems/increasing-decreasing-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1370.java) |\n\n## Alation\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [H-Index](https://leetcode.com/problems/h-index/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_274.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n\n## Alibaba\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Path Sum IV](https://leetcode.com/problems/path-sum-iv/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_666.java) |\n| 1 | [Split Concatenated Strings](https://leetcode.com/problems/split-concatenated-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_555.java) |\n\n## AllinCall\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Number Of Rectangles That Can Form The Largest Square](https://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1725.java) |\n\n## Amazon\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 117 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 117 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 103 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 87 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 68 | [Search Suggestions System](https://leetcode.com/problems/search-suggestions-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1268.java) |\n| 56 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 51 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 50 | [Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1152.java) |\n| 49 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 49 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n| 48 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 47 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 45 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 44 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 43 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 41 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 40 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 36 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 36 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 35 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n\n## American Express\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) |\n| 3 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |\n| 2 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## Apple\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 40 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 20 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 19 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 18 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 17 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 16 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 15 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 14 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 13 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 11 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 11 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 11 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 10 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_139.java) |\n| 10 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 10 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 9 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 8 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) |\n| 8 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 8 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 8 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Arcesium\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Maximum Length of Subarray With Positive Product](https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1567.java) |\n| 2 | [Broken Calculator](https://leetcode.com/problems/broken-calculator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_991.java) |\n| 2 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_209.java) |\n\n## Arista Networks\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 2 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_165.java) |\n| 2 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_93.java) |\n| 1 | [Construct String With Repeat Limit](https://leetcode.com/problems/construct-string-with-repeat-limit/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2182.java) |\n\n## Asana\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 13 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 5 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n\n## Athenahealth\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n\n## Atlassian\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 18 | [Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) |\n| 10 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) |\n| 4 | [Lemonade Change](https://leetcode.com/problems/lemonade-change/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_860.java) |\n| 3 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) |\n| 2 | [Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1071.java) |\n| 2 | [Single Number](https://leetcode.com/problems/single-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_136.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## Baidu\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Out of Boundary Paths](https://leetcode.com/problems/out-of-boundary-paths/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_576.java) |\n| 1 | [Zuma Game](https://leetcode.com/problems/zuma-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_488.java) |\n| 1 | [Arithmetic Slices II - Subsequence](https://leetcode.com/problems/arithmetic-slices-ii-subsequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_446.java) |\n\n## Barclays\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## BlackRock\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 6 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n\n## Bloomberg\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 64 | [Design Underground System](https://leetcode.com/problems/design-underground-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1396.java) |\n| 33 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 33 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 28 | [Flatten a Multilevel Doubly Linked List](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_430.java) |\n| 26 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) |\n| 23 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 23 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 20 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 20 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 20 | [Design an Ordered Stream](https://leetcode.com/problems/design-an-ordered-stream/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1656.java) |\n| 19 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 16 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 16 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 15 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 14 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) |\n| 14 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1029.java) |\n| 14 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 14 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 13 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 12 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## Bolt\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Check if All Characters Have Equal Number of Occurrences](https://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrences/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1941.java) |\n| 3 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) |\n| 3 | [Word Pattern](https://leetcode.com/problems/word-pattern/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_290.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 2 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_291.java) |\n\n## Booking\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1481.java) |\n| 3 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) |\n| 3 | [Additive Number](https://leetcode.com/problems/additive-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_306.java) |\n| 2 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 2 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 1 | [Two Out of Three](https://leetcode.com/problems/two-out-of-three/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2032.java) |\n\n## Box\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 12 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_191.java) |\n| 4 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_126.java) |\n\n## ByteDance\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 6 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 6 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 6 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 5 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 4 | [The Maze](https://leetcode.com/problems/the-maze/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) |\n| 4 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 4 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 4 | [The Number of Weak Characters in the Game](https://leetcode.com/problems/the-number-of-weak-characters-in-the-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1996.java) |\n| 3 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_122.java) |\n| 3 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) |\n| 3 | [Combination Sum](https://leetcode.com/problems/combination-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_39.java) |\n| 3 | [N-Queens](https://leetcode.com/problems/n-queens/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_51.java) |\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 3 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Sort List](https://leetcode.com/problems/sort-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_148.java) |\n| 3 | [Closest Dessert Cost](https://leetcode.com/problems/closest-dessert-cost/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1774.java) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 3 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_224.java) |\n\n## C3 IoT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) |\n| 3 | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_739.java) |\n| 3 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 2 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1636.java) |\n\n## Canonical\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Divide a String Into Groups of Size k](https://leetcode.com/problems/divide-a-string-into-groups-of-size-k/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2138.java) |\n\n## Capital One\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 18 | [License Key Formatting](https://leetcode.com/problems/license-key-formatting/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_482.java) |\n| 14 | [Count Primes](https://leetcode.com/problems/count-primes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_204.java) |\n| 13 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_25.java) |\n| 4 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Candy Crush](https://leetcode.com/problems/candy-crush/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_723.java) |\n| 3 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_12.java) |\n| 2 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) |\n| 2 | [Restore the Array From Adjacent Pairs](https://leetcode.com/problems/restore-the-array-from-adjacent-pairs/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1743.java) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 1 | [Four Divisors](https://leetcode.com/problems/four-divisors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1390.java) |\n\n## Cashfree\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Maximum Erasure Value](https://leetcode.com/problems/maximum-erasure-value/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1695.java) |\n\n## Cisco\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------|\n| 16 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 16 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) |\n| 11 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 11 | [Expressive Words](https://leetcode.com/problems/expressive-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_809.java) |\n| 9 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_91.java) |\n| 8 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_468.java) |\n| 8 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 6 | [House Robber](https://leetcode.com/problems/house-robber/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_198.java) |\n| 6 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2016.java) |\n| 5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 4 | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_191.java) |\n| 3 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) |\n| 3 | [Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_526.java) |\n| 3 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) |\n| 2 | [Coin Change 2](https://leetcode.com/problems/coin-change-2/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_518.java) |\n| 2 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_278.java) |\n| 2 | [Maximum Population Year](https://leetcode.com/problems/maximum-population-year/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1854.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n\n## Citadel\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 8 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) |\n| 5 | [Range Addition](https://leetcode.com/problems/range-addition/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_370.java) |\n| 4 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 2 | [Transpose Matrix](https://leetcode.com/problems/transpose-matrix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_867.java) |\n| 2 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_188.java) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n\n## Citrix\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find All Groups of Farmland](https://leetcode.com/problems/find-all-groups-of-farmland/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1992.java) |\n\n## Cohesity\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Largest BST Subtree](https://leetcode.com/problems/largest-bst-subtree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_333.java) |\n\n## Commvault\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2062.java) |\n\n## Coursera\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) |\n| 2 | [Wildcard Matching](https://leetcode.com/problems/wildcard-matching/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_44.java) |\n\n## Cruise Automation\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 9 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) |\n| 5 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 3 | [Synonymous Sentences](https://leetcode.com/problems/synonymous-sentences/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1258.java) |\n| 3 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_218.java) |\n| 2 | [Product of the Last K Numbers](https://leetcode.com/problems/product-of-the-last-k-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1352.java) |\n| 2 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) |\n| 2 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 2 | [Palindrome Permutation II](https://leetcode.com/problems/palindrome-permutation-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_267.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n\n## DE Shaw\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Freedom Trail](https://leetcode.com/problems/freedom-trail/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_514.java) |\n| 2 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 1 | [Number of Substrings Containing All Three Characters](https://leetcode.com/problems/number-of-substrings-containing-all-three-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1358.java) |\n\n## DJI\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Three Consecutive Odds](https://leetcode.com/problems/three-consecutive-odds/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1550.java) |\n\n## DRW\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) |\n| 1 | [Counting Elements](https://leetcode.com/problems/counting-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1426.java) |\n\n## Databricks\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 9 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) |\n| 2 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_311.java) |\n| 2 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n\n## Dataminr\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## Dell\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Deutsche Bank\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [The Time When the Network Becomes Idle](https://leetcode.com/problems/the-time-when-the-network-becomes-idle/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2039.java) |\n| 1 | [Minimum Operations to Make the Array Increasing](https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1827.java) |\n\n## Directi\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find the Winner of an Array Game](https://leetcode.com/problems/find-the-winner-of-an-array-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1535.java) |\n\n## Docusign\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Implement Trie II (Prefix Tree)](https://leetcode.com/problems/implement-trie-ii-prefix-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1804.java) |\n| 2 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_836.java) |\n| 2 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## DoorDash\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 18 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 13 | [Buddy Strings](https://leetcode.com/problems/buddy-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_859.java) |\n| 11 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_286.java) |\n| 7 | [Minimum Number of Steps to Make Two Strings Anagram](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1347.java) |\n| 7 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 7 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 6 | [Basic Calculator](https://leetcode.com/problems/basic-calculator/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_224.java) |\n| 5 | [Shortest Distance from All Buildings](https://leetcode.com/problems/shortest-distance-from-all-buildings/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_317.java) |\n| 5 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1143.java) |\n| 5 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 4 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 4 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) |\n| 4 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_588.java) |\n| 4 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) |\n| 3 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_437.java) |\n| 3 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) |\n| 3 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) |\n| 3 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1779.java) |\n| 2 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_532.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n\n## Drawbridge\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Set Intersection Size At Least Two](https://leetcode.com/problems/set-intersection-size-at-least-two/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_757.java) |\n\n## Dropbox\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 6 | [Find Duplicate File in System](https://leetcode.com/problems/find-duplicate-file-in-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_609.java) |\n| 5 | [Game of Life](https://leetcode.com/problems/game-of-life/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_289.java) |\n| 2 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_695.java) |\n| 2 | [Design Phone Directory](https://leetcode.com/problems/design-phone-directory/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_379.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 1 | [Seat Reservation Manager](https://leetcode.com/problems/seat-reservation-manager/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1845.java) |\n\n## Druva\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Maximize Sum Of Array After K Negations](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1005.java) |\n\n## Dunzo\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1561.java) |\n| 2 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_363.java) |\n| 1 | [Stone Game VII](https://leetcode.com/problems/stone-game-vii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1690.java) |\n| 1 | [Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/) | Medium | [Javascript](./javascript/_1664.js) |\n\n## Duolingo\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Minimum Number of People to Teach](https://leetcode.com/problems/minimum-number-of-people-to-teach/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1733.java) |\n\n## Epic Systems\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 2 | [Additive Number](https://leetcode.com/problems/additive-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_306.java) |\n| 1 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_728.java) |\n\n## Expedia\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 14 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) |\n| 14 | [Making File Names Unique](https://leetcode.com/problems/making-file-names-unique/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1487.java) |\n| 8 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 7 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 7 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_70.java) |\n| 6 | [The kth Factor of n](https://leetcode.com/problems/the-kth-factor-of-n/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1492.java) |\n| 6 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 5 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 5 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 4 | [Best Meeting Point](https://leetcode.com/problems/best-meeting-point/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_296.java) |\n| 4 | [Least Number of Unique Integers after K Removals](https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1481.java) |\n| 3 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 3 | [Maximum Difference Between Increasing Elements](https://leetcode.com/problems/maximum-difference-between-increasing-elements/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2016.java) |\n| 2 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 2 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1805.java) |\n| 2 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_647.java) |\n| 2 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 1 | [Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1451.java) |\n\n## FPT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Three Consecutive Integers That Sum to a Given Number](https://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-number/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2177.java) |\n\n## Facebook\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 282 | [Minimum Remove to Make Valid Parentheses](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1249.java) |\n| 252 | [Valid Palindrome II](https://leetcode.com/problems/valid-palindrome-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_680.java) |\n| 188 | [Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_314.java) |\n| 180 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) |\n| 162 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_50.java) |\n| 156 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) |\n| 149 | [Range Sum of BST](https://leetcode.com/problems/range-sum-of-bst/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_938.java) |\n| 141 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 140 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 140 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_215.java) |\n| 127 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n| 121 | [Dot Product of Two Sparse Vectors](https://leetcode.com/problems/dot-product-of-two-sparse-vectors/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1570.java) |\n| 118 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 114 | [Valid Word Abbreviation](https://leetcode.com/problems/valid-word-abbreviation/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_408.java) |\n| 112 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_71.java) |\n| 110 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 108 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_199.java) |\n| 100 | [Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_921.java) |\n| 100 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_339.java) |\n| 97 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) |\n\n## FactSet\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n\n## Flipkart\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 7 | [Number of Students Unable to Eat Lunch](https://leetcode.com/problems/number-of-students-unable-to-eat-lunch/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1700.java) |\n| 4 | [Car Pooling](https://leetcode.com/problems/car-pooling/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1094.java) |\n| 3 | [Maximum Number of Coins You Can Get](https://leetcode.com/problems/maximum-number-of-coins-you-can-get/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1561.java) |\n| 3 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) |\n| 2 | [Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1574.java) |\n| 2 | [Maximum Length of Pair Chain](https://leetcode.com/problems/maximum-length-of-pair-chain/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_646.java) |\n\n## Gilt Groupe\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_623.java) |\n\n## GoDaddy\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_419.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n\n## Goldman Sachs\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 38 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 20 | [Height Checker](https://leetcode.com/problems/height-checker/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1051.java) |\n| 18 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 12 | [High Five](https://leetcode.com/problems/high-five/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1086.java) |\n| 11 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 11 | [Delete and Earn](https://leetcode.com/problems/delete-and-earn/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_740.java) |\n| 9 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_724.java) |\n| 7 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 7 | [Count Number of Teams](https://leetcode.com/problems/count-number-of-teams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1395.java) |\n| 6 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 6 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 5 | [Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_592.java) |\n| 4 | [Elimination Game](https://leetcode.com/problems/elimination-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_390.java) |\n| 4 | [Find the Winner of the Circular Game](https://leetcode.com/problems/find-the-winner-of-the-circular-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1823.java) |\n| 4 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 4 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 4 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 4 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 3 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_64.java) |\n\n## Google\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 75 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_366.java) |\n| 73 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_150.java) |\n| 44 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 36 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | Easy | [Javascript](./javascript/_1146.js) |\n| 30 | [Stock Price Fluctuation](https://leetcode.com/problems/stock-price-fluctuation/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2034.java) |\n| 30 | [Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_539.java) |\n| 28 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 27 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 24 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 22 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 22 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_202.java) |\n| 22 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) |\n| 21 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 19 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_278.java) |\n| 19 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 17 | [Maximum Points You Can Obtain from Cards](https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1423.java) |\n| 15 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_62.java) |\n| 15 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_792.java) |\n| 15 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 14 | [Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_552.java) |\n\n## Grab\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Bulb Switcher III](https://leetcode.com/problems/bulb-switcher-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1375.java) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 2 | [Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1466.java) |\n| 2 | [Number of Steps to Reduce a Number to Zero](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1342.java) |\n| 2 | [Brick Wall](https://leetcode.com/problems/brick-wall/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_554.java) |\n| 2 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n| 1 | [Minimum Number of Buckets Required to Collect Rainwater from Houses](https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2086.java) |\n\n## HBO\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Short Encoding of Words](https://leetcode.com/problems/short-encoding-of-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_820.java) |\n| 2 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_480.java) |\n\n## HRT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:--------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 7 | [Equal Sum Arrays With Minimum Number of Operations](https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1775.java) |\n| 3 | [24 Game](https://leetcode.com/problems/24-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_679.java) |\n| 3 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Binary Search | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) |\n| 1 | [Detect Pattern of Length M Repeated K or More Times](https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1566.java) |\n| 1 | [Maximum 69 Number](https://leetcode.com/problems/maximum-69-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1323.java) |\n| 1 | [Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1317.java) |\n\n## Honeywell\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Distance to the Target Element](https://leetcode.com/problems/minimum-distance-to-the-target-element/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1848.java) |\n\n## Hotstar\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 2 | [Keys and Rooms](https://leetcode.com/problems/keys-and-rooms/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_841.java) |\n| 2 | [Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_373.java) |\n\n## Huawei\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:--------------------------------------------------------------------------------------------------------------------|\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n\n## Hulu\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [K-th Smallest in Lexicographical Order](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_440.java) |\n\n## IBM\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) |\n| 8 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 6 | [Most Visited Sector in a Circular Track](https://leetcode.com/problems/most-visited-sector-in-a-circular-track/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1560.java) |\n| 6 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) |\n| 4 | [Water Bottles](https://leetcode.com/problems/water-bottles/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1518.java) |\n| 3 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 3 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n\n## IIT Bombay\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Score After Flipping Matrix](https://leetcode.com/problems/score-after-flipping-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_861.java) |\n\n## IMC\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Artifacts That Can Be Extracted](https://leetcode.com/problems/count-artifacts-that-can-be-extracted/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2201.java) |\n\n## IXL\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) |\n| 1 | [Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_634.java) |\n\n## Indeed\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 25 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 9 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 8 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) |\n| 6 | [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1160.java) |\n| 4 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 3 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 2 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_88.java) |\n| 1 | [Sum of Even Numbers After Queries](https://leetcode.com/problems/sum-of-even-numbers-after-queries/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_985.java) |\n| 1 | [Binary Tree Tilt](https://leetcode.com/problems/binary-tree-tilt/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_563.java) |\n\n## Info Edge\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2058.java) |\n\n## Infosys\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_152.java) |\n| 2 | [Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1356.java) |\n| 2 | [Score of Parentheses](https://leetcode.com/problems/score-of-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_856.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [4 Sum](https://leetcode.com/problems/4sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_18.java) |\n| 2 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## Intel\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 3 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_344.java) |\n| 2 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n\n## Intuit\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 6 | [Unique Email Addresses](https://leetcode.com/problems/unique-email-addresses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_929.java) |\n| 4 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) |\n| 3 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_881.java) |\n| 2 | [Delete Nodes And Return Forest](https://leetcode.com/problems/delete-nodes-and-return-forest/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1110.java) |\n| 2 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 2 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 2 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_234.java) |\n| 2 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_206.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## JPMorgan\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 69 | [Reconstruct Original Digits from English](https://leetcode.com/problems/reconstruct-original-digits-from-english/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_423.java) |\n| 8 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 5 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 3 | [Even Odd Tree](https://leetcode.com/problems/even-odd-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1609.java) |\n| 3 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1710.java) |\n| 2 | [Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1413.java) |\n| 2 | [Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1353.java) |\n| 2 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1200.java) |\n| 2 | [Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_349.java) |\n| 2 | [Counting Bits](https://leetcode.com/problems/counting-bits/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_338.java) |\n| 2 | [Paint Fence](https://leetcode.com/problems/paint-fence/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_276.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 1 | [Determine Color of a Chessboard Square](https://leetcode.com/problems/determine-color-of-a-chessboard-square/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1812.java) |\n\n## Jane Street\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Common Words With One Occurrence](https://leetcode.com/problems/count-common-words-with-one-occurrence/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2085.java) |\n\n## Jeavio\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2027.java) |\n\n## Karat\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 40 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 17 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 16 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 16 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) |\n| 12 | [Find Words That Can Be Formed by Characters](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1160.java) |\n| 10 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 4 | [Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2133.java) |\n| 4 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 4 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) |\n| 3 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 2 | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1143.java) |\n\n## Leap Motion\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Generate Random Point in a Circle](https://leetcode.com/problems/generate-random-point-in-a-circle/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_478.java) |\n\n## LinkedIn\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 71 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_244.java) |\n| 48 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_364.java) |\n| 43 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 34 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_339.java) |\n| 33 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 33 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 29 | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_152.java) |\n| 26 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_272.java) |\n| 21 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_605.java) |\n| 18 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 18 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 18 | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_235.java) |\n| 17 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 17 | [All O`one Data Structure](https://leetcode.com/problems/all-oone-data-structure/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_432.java) |\n| 16 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 15 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 14 | [Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_215.java) |\n| 13 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_366.java) |\n| 11 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_243.java) |\n| 11 | [Second Minimum Node In a Binary Tree](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_671.java) |\n\n## LiveRamp\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |\n| 3 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 1 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_594.java) |\n| 1 | [Distribute Candies](https://leetcode.com/problems/distribute-candies/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_575.java) |\n\n## Lyft\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 9 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_76.java) |\n| 8 | [Read N Characters Given Read4 II - Call multiple times](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_158.java) |\n| 7 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_981.java) |\n| 7 | [Decode Ways](https://leetcode.com/problems/decode-ways/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_91.java) |\n| 4 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 4 | [Water and Jug Problem](https://leetcode.com/problems/water-and-jug-problem/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_365.java) |\n| 4 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_304.java) |\n| 4 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 2 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 2 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_157.java) |\n\n## MAQ Software\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Unique Substrings in Wraparound String](https://leetcode.com/problems/unique-substrings-in-wraparound-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_467.java) |\n\n## MakeMyTrip\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Remove All Occurrences of a Substring](https://leetcode.com/problems/remove-all-occurrences-of-a-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1904.java) |\n| 2 | [Remove K Digits](https://leetcode.com/problems/remove-k-digits/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_402.java) |\n\n## Mathworks\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Coin Change](https://leetcode.com/problems/coin-change/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_322.java) |\n| 5 | [Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_166.java) |\n| 3 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 3 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 3 | [Distinct Subsequences](https://leetcode.com/problems/distinct-subsequences/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_115.java) |\n| 2 | [Keyboard Row](https://leetcode.com/problems/keyboard-row/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_500.java) |\n\n## Mercari\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1598.java) |\n| 1 | [Max Difference You Can Get From Changing an Integer](https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1432.java) |\n| 1 | [Minimum Subsequence in Non-Increasing Order](https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1403.java) |\n| 1 | [Count Largest Group](https://leetcode.com/problems/count-largest-group/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1399.java) |\n\n## Microsoft\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 52 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 45 | [Sign of the Product of an Array](https://leetcode.com/problems/sign-of-the-product-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1822.java) |\n| 42 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 39 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 34 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_151.java) |\n| 29 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 29 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 26 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 24 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 22 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 22 | [Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1304.java) |\n| 20 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 20 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 20 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 18 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 17 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 17 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 17 | [Cinema Seat Allocation](https://leetcode.com/problems/cinema-seat-allocation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1386.java) |\n| 16 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_41.java) |\n| 16 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_8.java) |\n\n## MindTickle\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_895.java) |\n\n## MindTree\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Integers With Even Digit Sum](https://leetcode.com/problems/count-integers-with-even-digit-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2180.java) |\n\n## Moengage\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Redistribute Characters to Make All Strings Equal](https://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1897.java) |\n\n## Morgan Stanley\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 1 | [Best Team With No Conflicts](https://leetcode.com/problems/best-team-with-no-conflicts/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1626.java) |\n\n## National Instruments\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n\n## Netflix\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) |\n| 3 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_359.java) |\n| 2 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## Netsuite\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Average Salary Excluding the Minimum and Maximum Salary](https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1491.java) |\n\n## Nuro\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1476.java) |\n\n## Nutanix\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_165.java) |\n| 2 | [Sudoku Solver](https://leetcode.com/problems/sudoku-solver/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_37.java) |\n| 1 | [Check If Word Is Valid After Substitutions](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1003.java) |\n\n## Nvidia\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1046.java) |\n| 4 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_297.java) |\n| 4 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | Hard | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_10.java), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_10.js) |\n| 3 | [Design Circular Queue](https://leetcode.com/problems/design-circular-queue/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_622.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 3 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_160.java) |\n| 3 | [Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_188.java) |\n| 3 | [Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_531.java) |\n| 2 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 2 | [Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_211.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 2 | [Missing Number](https://leetcode.com/problems/missing-number/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_268.java) |\n| 2 | [K Empty Slots](https://leetcode.com/problems/k-empty-slots/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_683.java) |\n| 2 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_74.java) |\n| 2 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 2 | [Single Element in a Sorted Array](https://leetcode.com/problems/single-element-in-a-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_540.java) |\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n\n## OT\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------|\n| 1 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |\n\n## Opendoor\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 10 | [Game of Life](https://leetcode.com/problems/game-of-life/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_289.java) |\n| 3 | [Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_631.java) |\n\n## Optum\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Reverse Prefix of Word](https://leetcode.com/problems/reverse-prefix-of-word/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2000.java) |\n\n## Oracle\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 13 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 13 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 9 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 7 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 7 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_5.java) |\n| 7 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_347.java) |\n| 6 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 6 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 6 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 5 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 5 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 4 | [Delete Node in a BST](https://leetcode.com/problems/delete-node-in-a-bst/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_450.java) |\n| 4 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_102.java) |\n| 4 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 4 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 4 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 4 | [Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_415.java) |\n| 4 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 4 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 4 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n\n## Palantir Technologies\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [UTF-8 Validation](https://leetcode.com/problems/utf-8-validation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_393.java) |\n| 1 | [Check If It Is a Straight Line](https://leetcode.com/problems/check-if-it-is-a-straight-line/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1232.java) |\n\n## PayTM\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1103.java) |\n| 2 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n\n## Paypal\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Happy Number](https://leetcode.com/problems/happy-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_202.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 3 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [Reverse Substrings Between Each Pair of Parentheses](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1190.java) |\n| 2 | [Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_977.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_6.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n\n## PhonePe\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Distribute Coins in Binary Tree](https://leetcode.com/problems/distribute-coins-in-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_979.java) |\n| 1 | [Simple Bank System](https://leetcode.com/problems/simple-bank-system/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2043.java) |\n\n## Pinterest\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/) | Hard | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2050.java) |\n| 3 | [Find the Celebrity](https://leetcode.com/problems/find-the-celebrity/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_277.java) |\n| 2 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_721.java) |\n| 2 | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_323.java) |\n| 2 | [Word Pattern II](https://leetcode.com/problems/word-pattern-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_291.java) |\n| 2 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_269.java) |\n| 2 | [Clone Graph](https://leetcode.com/problems/clone-graph/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_133.java) |\n\n## Pocket Gems\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_600.java) |\n\n## Postmates\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Print Words Vertically](https://leetcode.com/problems/print-words-vertically/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1324.java) |\n| 1 | [Determine if Two Strings Are Close](https://leetcode.com/problems/determine-if-two-strings-are-close/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1657.java) |\n\n## Pure Storage\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Maximum Repeating Substring](https://leetcode.com/problems/maximum-repeating-substring/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1668.java) |\n| 2 | [Valid Square](https://leetcode.com/problems/valid-square/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_593.java), [Javascript](./javascript/_593.js) |\n\n## Qualcomm\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_190.java) |\n| 2 | [Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_876.java) |\n| 2 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_287.java) |\n\n## Qualtrics\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 7 | [Word Break](https://leetcode.com/problems/word-break/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_139.java) |\n| 6 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 5 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 4 | [Max Area of Island](https://leetcode.com/problems/max-area-of-island/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_695.java) |\n| 4 | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_199.java) |\n| 4 | [Unique Paths II](https://leetcode.com/problems/unique-paths-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_63.java) |\n| 4 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 3 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 2 | [Sort Integers by The Power Value](https://leetcode.com/problems/sort-integers-by-the-power-value/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1387.java) |\n| 2 | [Fixed Point](https://leetcode.com/problems/fixed-point/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1055.java) |\n| 2 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_228.java) |\n| 2 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) |\n| 2 | [Jump Game](https://leetcode.com/problems/jump-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_55.java) |\n\n## Quora\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Construct Target Array With Multiple Sums](https://leetcode.com/problems/construct-target-array-with-multiple-sums/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1354.java) |\n| 3 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 3 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 2 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 1 | [Range Frequency Queries](https://leetcode.com/problems/range-frequency-queries/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2080.java) |\n| 1 | [Maximum Number of Words You Can Type](https://leetcode.com/problems/maximum-number-of-words-you-can-type/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1935.java) |\n| 1 | [Substrings of Size Three with Distinct Characters](https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1876.java) |\n\n## Rakuten\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1862.java) |\n\n## Reddit\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 3 | [Subsets](https://leetcode.com/problems/subsets/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_78.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 3 | [Combination Sum II](https://leetcode.com/problems/combination-sum-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_40.java) |\n\n## Redfin\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 3 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 3 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_8.java) |\n\n## Riot Games\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_495.java) |\n\n## Robinhood\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 8 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 7 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Insert Intervals](https://leetcode.com/problems/insert-interval/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_57.java) |\n| 1 | [Count Good Meals](https://leetcode.com/problems/count-good-meals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1711.java) |\n\n## Roblox\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:--------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Design Browser History](https://leetcode.com/problems/design-browser-history/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1472.java) |\n| 5 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 4 | [Minimum Falling Path Sum II](https://leetcode.com/problems/minimum-falling-path-sum-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1289.java) |\n| 2 | [Number of Matching Subsequences](https://leetcode.com/problems/number-of-matching-subsequences/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_792.java) |\n| 2 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Binary Search | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) |\n\n## Rubrik\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | Easy | [Javascript](./javascript/_1146.js) |\n| 4 | [Kth Smallest Number in Multiplication Table](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_668.java) |\n| 4 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Task Scheduler](https://leetcode.com/problems/task-scheduler/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_621.java) |\n| 2 | [Majority Element](https://leetcode.com/problems/majority-element/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_169.java) |\n| 2 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_157.java) |\n| 2 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_72.java) |\n| 2 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_48.java) |\n\n## Rupeek\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Kth Bit in Nth Binary String](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1545.java) |\n\n## SAP\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 9 | [Monotone Increasing Digits](https://leetcode.com/problems/monotone-increasing-digits/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_738.java) |\n| 4 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_14.java) |\n| 2 | [Prison Cells After N Days](https://leetcode.com/problems/prison-cells-after-n-days/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_957.java) |\n| 2 | [Count Primes](https://leetcode.com/problems/count-primes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_204.java) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 1 | [Maximum Students Taking Exam](https://leetcode.com/problems/maximum-students-taking-exam/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1349.java) |\n\n## Salesforce\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 19 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 10 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 7 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_628.java) |\n| 6 | [Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_179.java) |\n| 6 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 6 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 6 | [Zuma Game](https://leetcode.com/problems/zuma-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_488.java) |\n| 5 | [Boats to Save People](https://leetcode.com/problems/boats-to-save-people/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_881.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 3 | [Min Stack](https://leetcode.com/problems/min-stack/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_155.java) |\n| 3 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n| 3 | [Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1718.java) |\n| 3 | [Integer to English Words](https://leetcode.com/problems/integer-to-english-words/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_273.java) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 3 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_588.java) |\n| 3 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_706.java) |\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1200.java) |\n\n## Samsung\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_304.java) |\n| 2 | [Reorder List](https://leetcode.com/problems/reorder-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_143.java) |\n| 2 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 1 | [Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1464.java) |\n\n## Sapient\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n\n## ServiceNow\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_102.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 2 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1010.java) |\n| 2 | [Rectangle Overlap](https://leetcode.com/problems/rectangle-overlap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_836.java) |\n| 2 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 2 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_234.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n\n## Shopee\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 4 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_88.java) |\n| 4 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 3 | [Palindrome Pairs](https://leetcode.com/problems/palindrome-pairs/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_336.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Construct Binary Tree from Inorder and Postorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_106.java) |\n| 3 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_21.java) |\n| 2 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Snapchat\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:--------------|:------------------------------------------------------------------------------------------------------------------------------|\n| 7 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 5 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 5 | [Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_311.java) |\n| 5 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 5 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 4 | [Find Peak Element](https://leetcode.com/problems/find-peak-element/) | Binary Search | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_162.java) |\n| 4 | [Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_208.java) |\n| 4 | [Word Ladder](https://leetcode.com/problems/word-ladder/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_127.java) |\n| 3 | [Add Binary](https://leetcode.com/problems/add-binary/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_67.java) |\n| 3 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 3 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 3 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Word Break II](https://leetcode.com/problems/word-break-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_140.java) |\n| 3 | [Word Ladder II](https://leetcode.com/problems/word-ladder-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_126.java) |\n| 3 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1091.java) |\n| 3 | [Android Unlock Patterns](https://leetcode.com/problems/android-unlock-patterns/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_351.java) |\n| 3 | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_974.java) |\n| 3 | [LFU Cache](https://leetcode.com/problems/lfu-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_460.java) |\n| 3 | [The Maze](https://leetcode.com/problems/the-maze/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) |\n\n## Softwire\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1796.java) |\n\n## Sony\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------|\n| 2 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |\n\n## Splunk\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n\n## Spotify\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 16 | [Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_346.java) |\n| 13 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 10 | [Ransom Note](https://leetcode.com/problems/ransom-note/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_383.java) |\n| 10 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 8 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_242.java) |\n| 8 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 6 | [Analyze User Website Visit Pattern](https://leetcode.com/problems/analyze-user-website-visit-pattern/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1152.java) |\n| 4 | [Sliding Window Median](https://leetcode.com/problems/sliding-window-median/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_480.java) |\n| 4 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_141.java) |\n| 4 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_110.java) |\n| 4 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_104.java) |\n| 3 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) |\n| 2 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) |\n\n## Sprinklr\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_149.java) |\n| 2 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 1 | [Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2048.java) |\n| 1 | [Maximum Subarray Sum After One Operation](https://leetcode.com/problems/maximum-subarray-sum-after-one-operation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1746.java) |\n\n## Square\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Design Snake Game](https://leetcode.com/problems/design-snake-game/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_353.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 2 | [Rank Teams by Votes](https://leetcode.com/problems/rank-teams-by-votes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1366.java) |\n| 2 | [Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_999.java) |\n| 2 | [Unique Morse Code Words](https://leetcode.com/problems/unique-morse-code-words/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_804.java) |\n| 2 | [The Maze](https://leetcode.com/problems/the-maze/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_490.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 2 | [Minimum Path Sum](https://leetcode.com/problems/minimum-path-sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_64.java) |\n| 1 | [Squirrel Simulation](https://leetcode.com/problems/squirrel-simulation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_573.java) |\n\n## Sumologic\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_236.java) |\n| 2 | [Lowest Common Ancestor of a Binary Tree III](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1650.java) |\n| 2 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_973.java) |\n| 2 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n\n## Swiggy\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_11.java) |\n| 3 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 2 | [Rabbits in Forest](https://leetcode.com/problems/rabbits-in-forest/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_781.java) |\n\n## T System\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Grid Game](https://leetcode.com/problems/grid-game/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2017.java) |\n\n## TIAA\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Greatest Common Divisor of Array](https://leetcode.com/problems/find-greatest-common-divisor-of-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1979.java) |\n\n## Tencent\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Factorization](https://leetcode.com/problems/minimum-factorization/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_625.java) |\n\n## Tesla\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 3 | [Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_976.java) |\n| 3 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Minimum Changes To Make Alternating Binary String](https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1758.java) |\n| 2 | [Find Winner on a Tic Tac Toe Game](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1275.java) |\n| 2 | [Spiral Matrix III](https://leetcode.com/problems/spiral-matrix-iii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_885.java) |\n| 2 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_227.java) |\n| 2 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) |\n| 2 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 2 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## Thumbtack\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_966.java) |\n\n## Tiger Analytics\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Find Closest Number to Zero](https://leetcode.com/problems/find-closest-number-to-zero/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2239.java) |\n\n## Toptal\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 3 | [Reformat Phone Number](https://leetcode.com/problems/reformat-phone-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1694.java) |\n\n## TripleByte\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Minimum ASCII Delete Sum for Two Strings](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_712.java) |\n\n## TuSimple\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_145.java) |\n| 2 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Twilio\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 7 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 5 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Subarray Sums Divisible by K](https://leetcode.com/problems/subarray-sums-divisible-by-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_974.java) |\n| 3 | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_239.java) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_68.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [Sort Array by Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1636.java) |\n| 2 | [Knight Dialer](https://leetcode.com/problems/knight-dialer/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_935.java) |\n| 2 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n\n## Twitch\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 7 | [Battleships in a Board](https://leetcode.com/problems/battleships-in-a-board/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_419.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n\n## Twitter\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------|\n| 23 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 10 | [Finding the Users Active Minutes](https://leetcode.com/problems/finding-the-users-active-minutes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1817.java) |\n| 7 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_362.java) |\n| 6 | [Tweet Counts Per Frequency](https://leetcode.com/problems/tweet-counts-per-frequency/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1348.java) |\n| 6 | [Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_208.java) |\n| 5 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 5 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_635.java) |\n| 4 | [Paint House](https://leetcode.com/problems/paint-house/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_256.java) |\n| 4 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) |\n| 3 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 3 | [Subsets](https://leetcode.com/problems/subsets/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_78.java) |\n| 3 | [Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_341.java) |\n| 3 | [Rearrange String k Distance Apart](https://leetcode.com/problems/rearrange-string-k-distance-apart/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_358.java) |\n| 3 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 3 | [Accounts Merge](https://leetcode.com/problems/accounts-merge/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_721.java) |\n| 2 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 2 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_642.java) |\n| 2 | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_647.java) |\n| 2 | [Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_895.java) |\n\n## Two Sigma\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Maximum Product of Splitted Binary Tree](https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1339.java) |\n| 4 | [Multiply Strings](https://leetcode.com/problems/multiply-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_43.java) |\n| 2 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) |\n\n## Uber\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 36 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/WordSearchII.java) |\n| 17 | [Word Search](https://leetcode.com/problems/word-search/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_79.java) |\n| 17 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) |\n| 14 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n| 14 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 14 | [Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1438.java) |\n| 13 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_528.java) |\n| 12 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_174.java) |\n| 11 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 11 | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_230.java) |\n| 10 | [Leftmost Column with at Least a One](https://leetcode.com/problems/leftmost-column-with-at-least-a-one/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1428.java) |\n| 10 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_332.java) |\n| 9 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_17.java) |\n| 8 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_238.java) |\n| 8 | [Optimal Account Balancing](https://leetcode.com/problems/optimal-account-balancing/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_465.java) |\n| 7 | [Construct K Palindrome Strings](https://leetcode.com/problems/construct-k-palindrome-strings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1400.java) |\n| 7 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 7 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 7 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_380.java) |\n| 7 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |\n\n## United Health Group\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:---------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Check If All 1's Are at Least Length K Places Away](https://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1437.java) |\n| 1 | [Day of the Week](https://leetcode.com/problems/day-of-the-week/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1185.java) |\n\n## VMware\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 5 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 5 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 4 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 4 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 4 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 4 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_255.java) |\n| 4 | [Rotting Oranges](https://leetcode.com/problems/rotting-oranges/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_994.java) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 3 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 3 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 3 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 3 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_75.java) |\n| 2 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_26.java) |\n| 2 | [Longest Valid Parentheses](https://leetcode.com/problems/longest-valid-parentheses/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_32.java) |\n| 2 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_35.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 2 | [Rearrange Words in a Sentence](https://leetcode.com/problems/rearrange-words-in-a-sentence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1451.java) |\n| 2 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_98.java) |\n\n## Valve\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Dota2 Senate](https://leetcode.com/problems/dota2-senate/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_649.java) |\n\n## Virtu Financial\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Hexspeak](https://leetcode.com/problems/hexspeak/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1271.java) |\n| 2 | [Array Transformation](https://leetcode.com/problems/array-transformation/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1243.java) |\n| 2 | [How Many Apples Can You Put into the Basket](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1196.java) |\n| 2 | [Count Substrings with Only One Distinct Letter](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1180.java) |\n| 1 | [Count Number of Homogenous Substrings](https://leetcode.com/problems/count-number-of-homogenous-substrings/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1758.java) |\n\n## Visa\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 11 | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1046.java) |\n| 6 | [Maximal Square](https://leetcode.com/problems/maximal-square/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_221.java) |\n| 4 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 4 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 4 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 3 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_844.java) |\n| 3 | [Minimum Moves to Equal Array Elements](https://leetcode.com/problems/minimum-moves-to-equal-array-elements/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_453.java) |\n| 3 | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_253.java) |\n| 3 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_141.java) |\n| 3 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 2 | [Reverse Integer](https://leetcode.com/problems/reverse-integer/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_7.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_7.cpp) |\n| 2 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_42.java) |\n| 2 | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_151.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Remove All Adjacent Duplicates in String II](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1207.java) |\n| 2 | [Largest Number](https://leetcode.com/problems/largest-number/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_179.java) |\n| 1 | [Create Target Array in the Given Order](https://leetcode.com/problems/create-target-array-in-the-given-order/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1389.java) |\n\n## Walmart Global Tech\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 9 | [Remove Colored Pieces if Both Neighbors are the Same Color](https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2038.java) |\n| 7 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 5 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 5 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 5 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 4 | [Strange Printer](https://leetcode.com/problems/strange-printer/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_664.java) |\n| 4 | [Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_122.java) |\n| 4 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 3 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_19.java) |\n| 3 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_22.java) |\n| 3 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) |\n| 3 | [Design HashMap](https://leetcode.com/problems/design-hashmap/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_706.java) |\n| 3 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 3 | [Degree of an Array](https://leetcode.com/problems/degree-of-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_697.java) |\n| 2 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_53.java) |\n| 2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n| 2 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) |\n| 2 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n\n## Wayfair\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 20 | [Add Strings](https://leetcode.com/problems/add-strings/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_415.java) |\n| 9 | [Subdomain Visit Count](https://leetcode.com/problems/subdomain-visit-count/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_811.java) |\n| 7 | [Maximum Length of Repeated Subarray](https://leetcode.com/problems/maximum-length-of-repeated-subarray/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_718.java) |\n| 5 | [Alert Using Same Key-Card Three or More Times in a One Hour Period](https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1604.java) |\n| 4 | [The Number of Full Rounds You Have Played](https://leetcode.com/problems/the-number-of-full-rounds-you-have-played/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1904.java) |\n| 4 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_210.java) |\n| 3 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_36.java), [Javascript](./src/javascript/_36.js) |\n| 2 | [Max Chunks To Make Sorted](https://leetcode.com/problems/max-chunks-to-make-sorted/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_769.java) |\n| 2 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) |\n| 1 | [Minimum Moves to Reach Target Score](https://leetcode.com/problems/minimum-moves-to-reach-target-score/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2139.java) |\n| 1 | [Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1957.java) |\n\n## Wealthfront\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Number of Steps to Make Two Strings Anagram II](https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2186.java) |\n\n## Wish\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 2 | [Find Right Interval](https://leetcode.com/problems/find-right-interval/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_436.java) |\n\n## Works Applications\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_629.java) |\n\n## Yahoo\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 6 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2.java) |\n| 5 | [Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_93.java) |\n| 5 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n| 4 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 4 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 4 | [Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_692.java) |\n| 4 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 4 | [Intersection of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_350.java) |\n| 3 | [Find All Anagrams in a String](https://leetcode.com/problems/find-all-anagrams-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_438.java) |\n| 3 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_70.java) |\n| 3 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_50.java) |\n| 3 | [First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_387.java) |\n| 3 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 3 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_617.java) |\n| 3 | [Valid Parenthesis String](https://leetcode.com/problems/valid-parenthesis-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_678.java) |\n| 2 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_29.java) |\n| 2 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 2 | [One Edit Distance](https://leetcode.com/problems/one-edit-distance/) | nan | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_161.java) |\n| 2 | [4 Sum](https://leetcode.com/problems/4sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_18.java) |\n| 2 | [Palindrome Number](https://leetcode.com/problems/palindrome-number/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_9.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_9.cpp) |\n\n## Yandex\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:---------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 8 | [Maximize Distance to Closest Person](https://leetcode.com/problems/maximize-distance-to-closest-person/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_849.java) |\n| 6 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 6 | [Zigzag Iterator](https://leetcode.com/problems/zigzag-iterator/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_281.java) |\n| 6 | [Summary Ranges](https://leetcode.com/problems/summary-ranges/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_228.java) |\n| 4 | [Permutation in String](https://leetcode.com/problems/permutation-in-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_567.java) |\n| 4 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_56.java) |\n| 3 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 3 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_23.java) |\n| 3 | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_206.java) |\n| 3 | [Longest Subarray of 1's After Deleting One Element](https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1493.java) |\n| 3 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_392.java) |\n| 3 | [String Compression](https://leetcode.com/problems/string-compression/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_443.java) |\n| 3 | [Max Stack](https://leetcode.com/problems/max-stack/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_716.java) |\n| 3 | [Number of Recent Calls](https://leetcode.com/problems/number-of-recent-calls/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_933.java) |\n| 2 | [Number of Students Doing Homework at a Given Time](https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1450.java) |\n| 2 | [Line Reflection](https://leetcode.com/problems/line-reflection/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_356.java) |\n| 2 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_150.java) |\n| 2 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_125.java) |\n| 2 | [Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_557.java) |\n| 2 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_4.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_4.cpp) |\n\n## Yelp\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:---------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 5 | [Destination City](https://leetcode.com/problems/destination-city/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1436.java) |\n| 4 | [Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1333.java) |\n| 1 | [Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_599.java) |\n\n## ZScaler\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Day of the Year](https://leetcode.com/problems/day-of-the-year/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1154.java) |\n\n## Zenefits\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Verify Preorder Sequence in Binary Search Tree](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_255.java) |\n| 1 | [N-Queens II](https://leetcode.com/problems/n-queens-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_52.java) |\n\n## Zillow\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 2 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_54.java) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Zoho\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n| 2 | [K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_532.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_3.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_3.cpp) |\n| 1 | [Sort Even and Odd Indices Independently](https://leetcode.com/problems/sort-even-and-odd-indices-independently/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2164.java) |\n\n## Zomato\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Zoom\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 4 | [Rotate String](https://leetcode.com/problems/rotate-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_796.java) |\n| 3 | [Fibonacci Number](https://leetcode.com/problems/fibonacci-number/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_509.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_25.java) |\n| 2 | [Two Sum](https://leetcode.com/problems/two-sum/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1.cpp), [Javascript](https://github.com/fishercoder1534/Leetcode/blob/master/javascript/_1.js) |\n\n## Zopsmart\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Reverse Nodes in Even Length Groups](https://leetcode.com/problems/reverse-nodes-in-even-length-groups/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2074.java) |\n\n## eBay\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_49.java) |\n| 3 | [Reorganize String](https://leetcode.com/problems/reorganize-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_767.java) |\n| 2 | [Rotating the Box](https://leetcode.com/problems/rotating-the-box/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1861.java) |\n| 2 | [Candy Crush](https://leetcode.com/problems/candy-crush/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_723.java) |\n| 2 | [Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_328.java) |\n| 2 | [Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_232.java) |\n| 2 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 2 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_128.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n\n## edabit\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1716.java) |\n\n## instacart\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 2 | [Check if Every Row and Column Contains All Numbers](https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2133.java) |\n\n## payu\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|\n| 2 | [Jump Game II](https://leetcode.com/problems/jump-game-ii/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_45.java) |\n| 1 | [Count Operations to Obtain Zero](https://leetcode.com/problems/count-operations-to-obtain-zero/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2169.java) |\n\n## peak6\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 1 | [Coordinate With Maximum Network Quality](https://leetcode.com/problems/coordinate-with-maximum-network-quality/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1620.java) |\n\n## persistent systems\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Minimum Bit Flips to Convert Number](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2220.java) |\n\n## razorpay\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events/) | Medium | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2054.java) |\n\n## tcs\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|\n| 4 | [Move Zeroes](https://leetcode.com/problems/move-zeroes/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_283.java) |\n| 3 | [Reverse String](https://leetcode.com/problems/reverse-string/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_344.java) |\n| 2 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_217.java) |\n| 2 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_189.java) |\n| 2 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_121.java) |\n| 2 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_20.java) |\n| 1 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1800.java) |\n| 1 | [Palindrome Partitioning IV](https://leetcode.com/problems/palindrome-partitioning-iv/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1745.java) |\n\n## tiktok\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 13 | [Design a Stack With Increment Operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1381.java) |\n| 10 | [Reformat Date](https://leetcode.com/problems/reformat-date/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_1507.java) |\n| 8 | [Maximum Swap](https://leetcode.com/problems/maximum-swap/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_670.java) |\n| 7 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_207.java) |\n| 6 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_146.java) |\n| 6 | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_410.java) |\n| 6 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_200.java) |\n| 6 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_59.java) |\n| 6 | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_124.java) |\n| 5 | [Gas Station](https://leetcode.com/problems/gas-station/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_134.java) |\n| 5 | [Decode String](https://leetcode.com/problems/decode-string/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_394.java) |\n| 5 | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_560.java) |\n| 5 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_735.java) |\n| 5 | [Walls and Gates](https://leetcode.com/problems/walls-and-gates/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_286.java) |\n| 5 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_13.java) |\n| 4 | [Path Sum III](https://leetcode.com/problems/path-sum-iii/) | Easy | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_437.java) |\n| 4 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_33.java) |\n| 4 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_222.java) |\n| 4 | [Evaluate Division](https://leetcode.com/problems/evaluate-division/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_399.java) |\n| 4 | [3Sum](https://leetcode.com/problems/3sum/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_15.java), [C++](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_15.cpp) |\n\n## zeta suite\n\n[[back to top]](#company-index)\n| Occurence | Problem | Difficulty | Solution |\n|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|\n| 1 | [Count Equal and Divisible Pairs in an Array](https://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/) | Easy | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_2176.java) |" }, { "path": "viz/csv2markdown.ipynb", "content": "{\n \"cells\": [\n {\n \"cell_type\": \"code\",\n \"execution_count\": 1,\n \"id\": \"415073d3\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"import pandas as pd\\n\",\n \"import os\\n\",\n \"import os.path as osp\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": 16,\n \"id\": \"d1410d74\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": [\n \"badge = '![leetcode-company-wise-problems-2022](https://socialify.git.ci/hxu296/leetcode-company-wise-problems-2022/image?font=Inter&forks=1&issues=1&language=1&owner=1&pulls=1&stargazers=1&theme=Light)\\\\n'\\n\",\n \"prompt = '## Leetcode Company-wise Problem Lists\\\\\\n\",\n \"\\\\n\\\\nCurated lists of Leetcode questions group by companies, updated as of May, 2022.\\\\\\n\",\n \"\\\\n\\\\nShout out to fishercoder1534 for the awesome [Leetcode](https://github.com/fishercoder1534/Leetcode) repo for solutions.'\\n\",\n \"index = '\\\\n\\\\n## Company Index\\\\n'\\n\",\n \"body = ''\\n\",\n \"\\n\",\n \"leetcode_problems = pd.read_csv('../data/leetcode_problems.csv') # provides solutions and difficulty levels\\n\",\n \"\\n\",\n \"companies_dir = '../companies'\\n\",\n \"company_index = 1\\n\",\n \"for fname in sorted(os.listdir(companies_dir)):\\n\",\n \" fpath = osp.join(companies_dir, fname)\\n\",\n \" company_name = fname.split('.')[0]\\n\",\n \" df = pd.read_csv(fpath)\\n\",\n \" # merge problem_link and problem_name as a markdown link\\n\",\n \" problems = []\\n\",\n \" for _, row in df.iterrows():\\n\",\n \" problem = f\\\"[{row['problem_name']}]({row['problem_link']})\\\"\\n\",\n \" problems.append(problem)\\n\",\n \" df['problem'] = problems\\n\",\n \" # add difficulty and solutions\\n\",\n \" df = pd.merge(df, leetcode_problems, left_on='problem_link', right_on='link')\\n\",\n \" # drop unnecessary columns\\n\",\n \" df = df.drop(['problem_link', 'problem_name', 'name', 'link'], axis = 1)\\n\",\n \" # filter numeric rows\\n\",\n \" df = df[pd.to_numeric(df.num_occur, errors='coerce').notnull()]\\n\",\n \" df['num_occur'] = df['num_occur'].apply(pd.to_numeric, errors='coerce')\\n\",\n \" # sort by occurances\\n\",\n \" df = df.sort_values(by ='num_occur', ascending=False).reset_index(drop=True)\\n\",\n \" # filter rows to have >= 1 occurances and are in the most frequent 20 questions\\n\",\n \" df = df.query('(num_occur >= 1) and (index < 20)')\\n\",\n \" # change column name\\n\",\n \" df.columns = ['Occurence', 'Problem', 'Difficulty', 'Solution']\\n\",\n \" if len(df.index) >= 1:\\n\",\n \" # add to markdown body and index\\n\",\n \" body += f'\\\\n\\\\n## {company_name}\\\\n'\\n\",\n \" body += '\\\\n[[back to top]](#company-index)\\\\n'\\n\",\n \" body += df.to_markdown(index=False)\\n\",\n \" index += f'{company_index}. [{company_name}](#{company_name.replace(\\\" \\\", \\\"-\\\").lower()})\\\\n'\\n\",\n \" company_index += 1\\n\",\n \"\\n\",\n \"markdown = badge + prompt + index + body\\n\",\n \"\\n\",\n \"with open('README.md', 'w') as f:\\n\",\n \" f.write(markdown)\"\n ]\n },\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"f49b1f91\",\n \"metadata\": {},\n \"outputs\": [],\n \"source\": []\n }\n ],\n \"metadata\": {\n \"interpreter\": {\n \"hash\": \"de874ab3c1e2d3a16f14367c5e475a4bd6a9ea04150e3961bd56ba9d3ed6a477\"\n },\n \"kernelspec\": {\n \"display_name\": \"Python [conda env:cs320]\",\n \"language\": \"python\",\n \"name\": \"python3\"\n },\n \"language_info\": {\n \"codemirror_mode\": {\n \"name\": \"ipython\",\n \"version\": 3\n },\n \"file_extension\": \".py\",\n \"mimetype\": \"text/x-python\",\n \"name\": \"python\",\n \"nbconvert_exporter\": \"python\",\n \"pygments_lexer\": \"ipython3\",\n \"version\": \"3.9.7\"\n }\n },\n \"nbformat\": 4,\n \"nbformat_minor\": 5\n}\n" } ]