Showing preview only (3,398K chars total). Download the full file or copy to clipboard to get everything.
Repository: hxu296/leetcode-company-wise-problems-2022
Branch: main
Commit: 33f44cb62594
Files: 202
Total size: 3.2 MB
Directory structure:
gitextract_3ksinm22/
├── .gitignore
├── LICENSE
├── README.md
├── companies/
│ ├── APT Portfolio.csv
│ ├── Accenture.csv
│ ├── Activision.csv
│ ├── Adobe.csv
│ ├── Affirm.csv
│ ├── Airbnb.csv
│ ├── Akamai.csv
│ ├── Akuna Capital.csv
│ ├── Alation.csv
│ ├── Alibaba.csv
│ ├── AllinCall.csv
│ ├── Amazon.csv
│ ├── American Express.csv
│ ├── AppDynamics.csv
│ ├── Apple.csv
│ ├── Arcesium.csv
│ ├── Arista Networks.csv
│ ├── Asana.csv
│ ├── Athenahealth.csv
│ ├── Atlassian.csv
│ ├── Baidu.csv
│ ├── Barclays.csv
│ ├── BlackRock.csv
│ ├── Bloomberg.csv
│ ├── Bolt.csv
│ ├── Booking.com.csv
│ ├── Box.csv
│ ├── ByteDance.csv
│ ├── C3 IoT.csv
│ ├── Canonical.csv
│ ├── Capital One.csv
│ ├── Cashfree.csv
│ ├── Cisco.csv
│ ├── Citadel.csv
│ ├── Citrix.csv
│ ├── Cognizant.csv
│ ├── Cohesity.csv
│ ├── Commvault.csv
│ ├── Coursera.csv
│ ├── Cruise Automation.csv
│ ├── DE Shaw.csv
│ ├── DJI.csv
│ ├── DRW.csv
│ ├── Databricks.csv
│ ├── Dataminr.csv
│ ├── Dell.csv
│ ├── Deutsche Bank.csv
│ ├── Directi.csv
│ ├── Docusign.csv
│ ├── DoorDash.csv
│ ├── Drawbridge.csv
│ ├── Dropbox.csv
│ ├── Druva.csv
│ ├── Dunzo.csv
│ ├── Duolingo.csv
│ ├── Epic Systems.csv
│ ├── Expedia.csv
│ ├── FPT.csv
│ ├── Facebook.csv
│ ├── FactSet.csv
│ ├── Flipkart.csv
│ ├── Gilt Groupe.csv
│ ├── GoDaddy.csv
│ ├── Goldman Sachs.csv
│ ├── Google.csv
│ ├── Grab.csv
│ ├── HBO.csv
│ ├── HRT.csv
│ ├── Honeywell.csv
│ ├── Hotstar.csv
│ ├── Huawei.csv
│ ├── Hulu.csv
│ ├── IBM.csv
│ ├── IIT Bombay.csv
│ ├── IMC.csv
│ ├── IXL.csv
│ ├── Indeed.csv
│ ├── Info Edge.csv
│ ├── Infosys.csv
│ ├── Intel.csv
│ ├── Intuit.csv
│ ├── JP Morgan.csv
│ ├── JPMorgan.csv
│ ├── Jane Street.csv
│ ├── Jeavio.csv
│ ├── Karat.csv
│ ├── Leap Motion.csv
│ ├── LinkedIn.csv
│ ├── LiveRamp.csv
│ ├── Lyft.csv
│ ├── MAQ Software.csv
│ ├── MakeMyTrip.csv
│ ├── Mathworks.csv
│ ├── Mercari.csv
│ ├── Microsoft.csv
│ ├── MindTickle.csv
│ ├── MindTree.csv
│ ├── Moengage.csv
│ ├── Morgan Stanley.csv
│ ├── National Instruments.csv
│ ├── Netflix.csv
│ ├── Netsuite.csv
│ ├── Nuro.csv
│ ├── Nutanix.csv
│ ├── Nvidia.csv
│ ├── OT.csv
│ ├── Opendoor.csv
│ ├── Optum.csv
│ ├── Oracle.csv
│ ├── Palantir Technologies.csv
│ ├── PayTM.csv
│ ├── Paypal.csv
│ ├── PhonePe.csv
│ ├── Pinterest.csv
│ ├── Pocket Gems.csv
│ ├── Postmates.csv
│ ├── Pure Storage.csv
│ ├── Qualcomm.csv
│ ├── Qualtrics.csv
│ ├── Quora.csv
│ ├── Rakuten.csv
│ ├── Reddit.csv
│ ├── Redfin.csv
│ ├── Riot Games.csv
│ ├── Robinhood.csv
│ ├── Roblox.csv
│ ├── Rubrik.csv
│ ├── Rupeek.csv
│ ├── SAP.csv
│ ├── Salesforce.csv
│ ├── Samsung.csv
│ ├── Sapient.csv
│ ├── ServiceNow.csv
│ ├── Shopee.csv
│ ├── Snapchat.csv
│ ├── Softwire.csv
│ ├── Sony.csv
│ ├── Splunk.csv
│ ├── Spotify.csv
│ ├── Sprinklr.csv
│ ├── Square.csv
│ ├── Sumologic.csv
│ ├── Swiggy.csv
│ ├── T System.csv
│ ├── TIAA.csv
│ ├── Tencent.csv
│ ├── Tesla.csv
│ ├── Thumbtack.csv
│ ├── Tiger Analytics.csv
│ ├── Toptal.csv
│ ├── TripleByte.csv
│ ├── TuSimple.csv
│ ├── Twilio.csv
│ ├── Twitch.csv
│ ├── Twitter.csv
│ ├── Two Sigma.csv
│ ├── Uber.csv
│ ├── United Health Group.csv
│ ├── VMware.csv
│ ├── Valve.csv
│ ├── Virtu Financial.csv
│ ├── Visa.csv
│ ├── Walmart Global Tech.csv
│ ├── Wayfair.csv
│ ├── Wealthfront.csv
│ ├── Wish.csv
│ ├── Works Applications.csv
│ ├── Yahoo.csv
│ ├── Yandex.csv
│ ├── Yelp.csv
│ ├── ZScaler.csv
│ ├── Zenefits.csv
│ ├── Zillow.csv
│ ├── Zoho.csv
│ ├── Zomato.csv
│ ├── Zoom.csv
│ ├── Zopsmart.csv
│ ├── eBay.csv
│ ├── edabit.csv
│ ├── instacart.csv
│ ├── payu.csv
│ ├── peak6.csv
│ ├── persistent systems.csv
│ ├── razorpay.csv
│ ├── tcs.csv
│ ├── tiktok.csv
│ └── zeta suite.csv
├── data/
│ ├── companies_and_leetcode_problems.csv
│ ├── leetcode_problems.csv
│ ├── leetcode_problems_and_companies.csv
│ ├── leetcode_repo_readme.csv
│ └── leetcode_repo_readme.md
├── data-gen/
│ ├── leetcode_scraper.ipynb
│ ├── markdown2csv.py
│ ├── parse_readme.py
│ └── transform_data.ipynb
├── todo.md
└── viz/
├── README.md
└── csv2markdown.ipynb
================================================
FILE CONTENTS
================================================
================================================
FILE: .gitignore
================================================
**/.ipynb_checkpoints
**/__pycache__
================================================
FILE: LICENSE
================================================
MIT License
Copyright (c) 2022 Huan Xu
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
================================================
FILE: README.md
================================================
## Leetcode Company-wise Problem Lists
Curated lists of Leetcode questions group by companies, updated as of May, 2022.
Shout out to fishercoder1534 for the awesome [Leetcode](https://github.com/fishercoder1534/Leetcode) repo for solutions.
## Company Index
1. [APT Portfolio](#apt-portfolio)
2. [Accenture](#accenture)
3. [Activision](#activision)
4. [Adobe](#adobe)
5. [Affirm](#affirm)
6. [Airbnb](#airbnb)
7. [Akamai](#akamai)
8. [Akuna Capital](#akuna-capital)
9. [Alation](#alation)
10. [Alibaba](#alibaba)
11. [AllinCall](#allincall)
12. [Amazon](#amazon)
13. [American Express](#american-express)
14. [Apple](#apple)
15. [Arcesium](#arcesium)
16. [Arista Networks](#arista-networks)
17. [Asana](#asana)
18. [Athenahealth](#athenahealth)
19. [Atlassian](#atlassian)
20. [Baidu](#baidu)
21. [Barclays](#barclays)
22. [BlackRock](#blackrock)
23. [Bloomberg](#bloomberg)
24. [Bolt](#bolt)
25. [Booking](#booking)
26. [Box](#box)
27. [ByteDance](#bytedance)
28. [C3 IoT](#c3-iot)
29. [Canonical](#canonical)
30. [Capital One](#capital-one)
31. [Cashfree](#cashfree)
32. [Cisco](#cisco)
33. [Citadel](#citadel)
34. [Citrix](#citrix)
35. [Cohesity](#cohesity)
36. [Commvault](#commvault)
37. [Coursera](#coursera)
38. [Cruise Automation](#cruise-automation)
39. [DE Shaw](#de-shaw)
40. [DJI](#dji)
41. [DRW](#drw)
42. [Databricks](#databricks)
43. [Dataminr](#dataminr)
44. [Dell](#dell)
45. [Deutsche Bank](#deutsche-bank)
46. [Directi](#directi)
47. [Docusign](#docusign)
48. [DoorDash](#doordash)
49. [Drawbridge](#drawbridge)
50. [Dropbox](#dropbox)
51. [Druva](#druva)
52. [Dunzo](#dunzo)
53. [Duolingo](#duolingo)
54. [Epic Systems](#epic-systems)
55. [Expedia](#expedia)
56. [FPT](#fpt)
57. [Facebook](#facebook)
58. [FactSet](#factset)
59. [Flipkart](#flipkart)
60. [Gilt Groupe](#gilt-groupe)
61. [GoDaddy](#godaddy)
62. [Goldman Sachs](#goldman-sachs)
63. [Google](#google)
64. [Grab](#grab)
65. [HBO](#hbo)
66. [HRT](#hrt)
67. [Honeywell](#honeywell)
68. [Hotstar](#hotstar)
69. [Huawei](#huawei)
70. [Hulu](#hulu)
71. [IBM](#ibm)
72. [IIT Bombay](#iit-bombay)
73. [IMC](#imc)
74. [IXL](#ixl)
75. [Indeed](#indeed)
76. [Info Edge](#info-edge)
77. [Infosys](#infosys)
78. [Intel](#intel)
79. [Intuit](#intuit)
80. [JPMorgan](#jpmorgan)
81. [Jane Street](#jane-street)
82. [Jeavio](#jeavio)
83. [Karat](#karat)
84. [Leap Motion](#leap-motion)
85. [LinkedIn](#linkedin)
86. [LiveRamp](#liveramp)
87. [Lyft](#lyft)
88. [MAQ Software](#maq-software)
89. [MakeMyTrip](#makemytrip)
90. [Mathworks](#mathworks)
91. [Mercari](#mercari)
92. [Microsoft](#microsoft)
93. [MindTickle](#mindtickle)
94. [MindTree](#mindtree)
95. [Moengage](#moengage)
96. [Morgan Stanley](#morgan-stanley)
97. [National Instruments](#national-instruments)
98. [Netflix](#netflix)
99. [Netsuite](#netsuite)
100. [Nuro](#nuro)
101. [Nutanix](#nutanix)
102. [Nvidia](#nvidia)
103. [OT](#ot)
104. [Opendoor](#opendoor)
105. [Optum](#optum)
106. [Oracle](#oracle)
107. [Palantir Technologies](#palantir-technologies)
108. [PayTM](#paytm)
109. [Paypal](#paypal)
110. [PhonePe](#phonepe)
111. [Pinterest](#pinterest)
112. [Pocket Gems](#pocket-gems)
113. [Postmates](#postmates)
114. [Pure Storage](#pure-storage)
115. [Qualcomm](#qualcomm)
116. [Qualtrics](#qualtrics)
117. [Quora](#quora)
118. [Rakuten](#rakuten)
119. [Reddit](#reddit)
120. [Redfin](#redfin)
121. [Riot Games](#riot-games)
122. [Robinhood](#robinhood)
123. [Roblox](#roblox)
124. [Rubrik](#rubrik)
125. [Rupeek](#rupeek)
126. [SAP](#sap)
127. [Salesforce](#salesforce)
128. [Samsung](#samsung)
129. [Sapient](#sapient)
130. [ServiceNow](#servicenow)
131. [Shopee](#shopee)
132. [Snapchat](#snapchat)
133. [Softwire](#softwire)
134. [Sony](#sony)
135. [Splunk](#splunk)
136. [Spotify](#spotify)
137. [Sprinklr](#sprinklr)
138. [Square](#square)
139. [Sumologic](#sumologic)
140. [Swiggy](#swiggy)
141. [T System](#t-system)
142. [TIAA](#tiaa)
143. [Tencent](#tencent)
144. [Tesla](#tesla)
145. [Thumbtack](#thumbtack)
146. [Tiger Analytics](#tiger-analytics)
147. [Toptal](#toptal)
148. [TripleByte](#triplebyte)
149. [TuSimple](#tusimple)
150. [Twilio](#twilio)
151. [Twitch](#twitch)
152. [Twitter](#twitter)
153. [Two Sigma](#two-sigma)
154. [Uber](#uber)
155. [United Health Group](#united-health-group)
156. [VMware](#vmware)
157. [Valve](#valve)
158. [Virtu Financial](#virtu-financial)
159. [Visa](#visa)
160. [Walmart Global Tech](#walmart-global-tech)
161. [Wayfair](#wayfair)
162. [Wealthfront](#wealthfront)
163. [Wish](#wish)
164. [Works Applications](#works-applications)
165. [Yahoo](#yahoo)
166. [Yandex](#yandex)
167. [Yelp](#yelp)
168. [ZScaler](#zscaler)
169. [Zenefits](#zenefits)
170. [Zillow](#zillow)
171. [Zoho](#zoho)
172. [Zomato](#zomato)
173. [Zoom](#zoom)
174. [Zopsmart](#zopsmart)
175. [eBay](#ebay)
176. [edabit](#edabit)
177. [instacart](#instacart)
178. [payu](#payu)
179. [peak6](#peak6)
180. [persistent systems](#persistent-systems)
181. [razorpay](#razorpay)
182. [tcs](#tcs)
183. [tiktok](#tiktok)
184. [zeta suite](#zeta-suite)
## APT Portfolio
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Accenture
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Activision
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Adobe
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Affirm
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Airbnb
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Akamai
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Akuna Capital
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Alation
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## Alibaba
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## AllinCall
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Amazon
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## American Express
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 2 | [Reducing Dishes](https://leetcode.com/problems/reducing-dishes/) | Hard | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/cpp/_1402.cpp) |
| 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) |
## Apple
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Arcesium
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## Arista Networks
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
## Asana
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Athenahealth
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Atlassian
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Baidu
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## Barclays
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|
| 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) |
## BlackRock
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Bloomberg
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Bolt
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Booking
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Box
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## ByteDance
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## C3 IoT
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
## Canonical
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|
| 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) |
## Capital One
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Cashfree
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Cisco
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Citadel
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Citrix
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Cohesity
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Commvault
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|
| 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) |
## Coursera
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Cruise Automation
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------|:-------------|:------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## DE Shaw
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## DJI
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## DRW
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Databricks
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## Dataminr
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------|:-------------|:---------------------------------------------------------------------------------------------------------------------|
| 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) |
## Dell
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
## Deutsche Bank
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Directi
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Docusign
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 2 | [Minesweeper](https://leetcode.com/problems/minesweeper/) | Medium | [Solution](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/_529.java) |
| 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) |
| 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) |
## DoorDash
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Drawbridge
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Dropbox
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Druva
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Dunzo
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 1 | [Ways to Make a Fair Array](https://leetcode.com/problems/ways-to-make-a-fair-array/) | Medium | [Javascript](./javascript/_1664.js) |
## Duolingo
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Epic Systems
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## Expedia
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## FPT
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|
| 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) |
## Facebook
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## FactSet
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Flipkart
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Gilt Groupe
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## GoDaddy
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Goldman Sachs
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Google
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 36 | [Snapshot Array](https://leetcode.com/problems/snapshot-array/) | Easy | [Javascript](./javascript/_1146.js) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Grab
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## HBO
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## HRT
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------|:--------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Honeywell
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
## Hotstar
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
## Huawei
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------|:-------------|:--------------------------------------------------------------------------------------------------------------------|
| 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) |
## Hulu
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## IBM
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## IIT Bombay
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
## IMC
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|
| 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) |
## IXL
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------|:-------------|:----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
## Indeed
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-----------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
| 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) |
## Info Edge
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:----------------------------------------------------------------------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------|
| 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) |
## Infosys
[[back to top]](#company-index)
| Occurence | Problem | Difficulty | Solution |
|------------:|:--------------------------------------------------------------------------------------------------------------|:-------------|:-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
| 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) |
| 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) |
| 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)
gitextract_3ksinm22/
├── .gitignore
├── LICENSE
├── README.md
├── companies/
│ ├── APT Portfolio.csv
│ ├── Accenture.csv
│ ├── Activision.csv
│ ├── Adobe.csv
│ ├── Affirm.csv
│ ├── Airbnb.csv
│ ├── Akamai.csv
│ ├── Akuna Capital.csv
│ ├── Alation.csv
│ ├── Alibaba.csv
│ ├── AllinCall.csv
│ ├── Amazon.csv
│ ├── American Express.csv
│ ├── AppDynamics.csv
│ ├── Apple.csv
│ ├── Arcesium.csv
│ ├── Arista Networks.csv
│ ├── Asana.csv
│ ├── Athenahealth.csv
│ ├── Atlassian.csv
│ ├── Baidu.csv
│ ├── Barclays.csv
│ ├── BlackRock.csv
│ ├── Bloomberg.csv
│ ├── Bolt.csv
│ ├── Booking.com.csv
│ ├── Box.csv
│ ├── ByteDance.csv
│ ├── C3 IoT.csv
│ ├── Canonical.csv
│ ├── Capital One.csv
│ ├── Cashfree.csv
│ ├── Cisco.csv
│ ├── Citadel.csv
│ ├── Citrix.csv
│ ├── Cognizant.csv
│ ├── Cohesity.csv
│ ├── Commvault.csv
│ ├── Coursera.csv
│ ├── Cruise Automation.csv
│ ├── DE Shaw.csv
│ ├── DJI.csv
│ ├── DRW.csv
│ ├── Databricks.csv
│ ├── Dataminr.csv
│ ├── Dell.csv
│ ├── Deutsche Bank.csv
│ ├── Directi.csv
│ ├── Docusign.csv
│ ├── DoorDash.csv
│ ├── Drawbridge.csv
│ ├── Dropbox.csv
│ ├── Druva.csv
│ ├── Dunzo.csv
│ ├── Duolingo.csv
│ ├── Epic Systems.csv
│ ├── Expedia.csv
│ ├── FPT.csv
│ ├── Facebook.csv
│ ├── FactSet.csv
│ ├── Flipkart.csv
│ ├── Gilt Groupe.csv
│ ├── GoDaddy.csv
│ ├── Goldman Sachs.csv
│ ├── Google.csv
│ ├── Grab.csv
│ ├── HBO.csv
│ ├── HRT.csv
│ ├── Honeywell.csv
│ ├── Hotstar.csv
│ ├── Huawei.csv
│ ├── Hulu.csv
│ ├── IBM.csv
│ ├── IIT Bombay.csv
│ ├── IMC.csv
│ ├── IXL.csv
│ ├── Indeed.csv
│ ├── Info Edge.csv
│ ├── Infosys.csv
│ ├── Intel.csv
│ ├── Intuit.csv
│ ├── JP Morgan.csv
│ ├── JPMorgan.csv
│ ├── Jane Street.csv
│ ├── Jeavio.csv
│ ├── Karat.csv
│ ├── Leap Motion.csv
│ ├── LinkedIn.csv
│ ├── LiveRamp.csv
│ ├── Lyft.csv
│ ├── MAQ Software.csv
│ ├── MakeMyTrip.csv
│ ├── Mathworks.csv
│ ├── Mercari.csv
│ ├── Microsoft.csv
│ ├── MindTickle.csv
│ ├── MindTree.csv
│ ├── Moengage.csv
│ ├── Morgan Stanley.csv
│ ├── National Instruments.csv
│ ├── Netflix.csv
│ ├── Netsuite.csv
│ ├── Nuro.csv
│ ├── Nutanix.csv
│ ├── Nvidia.csv
│ ├── OT.csv
│ ├── Opendoor.csv
│ ├── Optum.csv
│ ├── Oracle.csv
│ ├── Palantir Technologies.csv
│ ├── PayTM.csv
│ ├── Paypal.csv
│ ├── PhonePe.csv
│ ├── Pinterest.csv
│ ├── Pocket Gems.csv
│ ├── Postmates.csv
│ ├── Pure Storage.csv
│ ├── Qualcomm.csv
│ ├── Qualtrics.csv
│ ├── Quora.csv
│ ├── Rakuten.csv
│ ├── Reddit.csv
│ ├── Redfin.csv
│ ├── Riot Games.csv
│ ├── Robinhood.csv
│ ├── Roblox.csv
│ ├── Rubrik.csv
│ ├── Rupeek.csv
│ ├── SAP.csv
│ ├── Salesforce.csv
│ ├── Samsung.csv
│ ├── Sapient.csv
│ ├── ServiceNow.csv
│ ├── Shopee.csv
│ ├── Snapchat.csv
│ ├── Softwire.csv
│ ├── Sony.csv
│ ├── Splunk.csv
│ ├── Spotify.csv
│ ├── Sprinklr.csv
│ ├── Square.csv
│ ├── Sumologic.csv
│ ├── Swiggy.csv
│ ├── T System.csv
│ ├── TIAA.csv
│ ├── Tencent.csv
│ ├── Tesla.csv
│ ├── Thumbtack.csv
│ ├── Tiger Analytics.csv
│ ├── Toptal.csv
│ ├── TripleByte.csv
│ ├── TuSimple.csv
│ ├── Twilio.csv
│ ├── Twitch.csv
│ ├── Twitter.csv
│ ├── Two Sigma.csv
│ ├── Uber.csv
│ ├── United Health Group.csv
│ ├── VMware.csv
│ ├── Valve.csv
│ ├── Virtu Financial.csv
│ ├── Visa.csv
│ ├── Walmart Global Tech.csv
│ ├── Wayfair.csv
│ ├── Wealthfront.csv
│ ├── Wish.csv
│ ├── Works Applications.csv
│ ├── Yahoo.csv
│ ├── Yandex.csv
│ ├── Yelp.csv
│ ├── ZScaler.csv
│ ├── Zenefits.csv
│ ├── Zillow.csv
│ ├── Zoho.csv
│ ├── Zomato.csv
│ ├── Zoom.csv
│ ├── Zopsmart.csv
│ ├── eBay.csv
│ ├── edabit.csv
│ ├── instacart.csv
│ ├── payu.csv
│ ├── peak6.csv
│ ├── persistent systems.csv
│ ├── razorpay.csv
│ ├── tcs.csv
│ ├── tiktok.csv
│ └── zeta suite.csv
├── data/
│ ├── companies_and_leetcode_problems.csv
│ ├── leetcode_problems.csv
│ ├── leetcode_problems_and_companies.csv
│ ├── leetcode_repo_readme.csv
│ └── leetcode_repo_readme.md
├── data-gen/
│ ├── leetcode_scraper.ipynb
│ ├── markdown2csv.py
│ ├── parse_readme.py
│ └── transform_data.ipynb
├── todo.md
└── viz/
├── README.md
└── csv2markdown.ipynb
SYMBOL INDEX (2 symbols across 1 files) FILE: data-gen/markdown2csv.py function md_to_df (line 4) | def md_to_df(md_path): function md_to_csv (line 9) | def md_to_csv(md_path, csv_path):
Condensed preview — 202 files, each showing path, character count, and a content snippet. Download the .json file or copy for the full structured content (3,397K chars).
[
{
"path": ".gitignore",
"chars": 37,
"preview": "**/.ipynb_checkpoints\n**/__pycache__\n"
},
{
"path": "LICENSE",
"chars": 1064,
"preview": "MIT License\n\nCopyright (c) 2022 Huan Xu\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof"
},
{
"path": "README.md",
"chars": 488763,
"preview": "![leetcode-company-wise-problems-2022](https://socialify.git.ci/hxu296/leetcode-company-wise-problems-2022/image?font=In"
},
{
"path": "companies/APT Portfolio.csv",
"chars": 97,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/stone-game-vi/,Stone Game VI,1\n"
},
{
"path": "companies/Accenture.csv",
"chars": 477,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum/,Fin"
},
{
"path": "companies/Activision.csv",
"chars": 151,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Minimum ASCI"
},
{
"path": "companies/Adobe.csv",
"chars": 14659,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/concatenation-of-array/,Concatenation of Array,2\nhttps"
},
{
"path": "companies/Affirm.csv",
"chars": 535,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/optimal-account-balancing/,Optimal Account Balancing,2"
},
{
"path": "companies/Airbnb.csv",
"chars": 1207,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold/,Find the "
},
{
"path": "companies/Akamai.csv",
"chars": 141,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/n-repeated-element-in-size-2n-array/,N-Repeated Elemen"
},
{
"path": "companies/Akuna Capital.csv",
"chars": 127,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/increasing-decreasing-string/,Increasing Decreasing St"
},
{
"path": "companies/Alation.csv",
"chars": 245,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/h-index/,H-Index,3\nhttps://leetcode.com/problems/best-"
},
{
"path": "companies/Alibaba.csv",
"chars": 180,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/path-sum-iv/,Path Sum IV,1\nhttps://leetcode.com/proble"
},
{
"path": "companies/AllinCall.csv",
"chars": 177,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-rectangles-that-can-form-the-largest-square/"
},
{
"path": "companies/Amazon.csv",
"chars": 49743,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-average-difference/,Minimum Average Difference"
},
{
"path": "companies/American Express.csv",
"chars": 403,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero"
},
{
"path": "companies/AppDynamics.csv",
"chars": 139,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-number-of-balls-in-a-box/,Maximum Number of Ba"
},
{
"path": "companies/Apple.csv",
"chars": 18831,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence/,Check if"
},
{
"path": "companies/Arcesium.csv",
"chars": 321,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-length-of-subarray-with-positive-product/,Maxi"
},
{
"path": "companies/Arista Networks.csv",
"chars": 364,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/construct-string-with-repeat-limit/,Construct String W"
},
{
"path": "companies/Asana.csv",
"chars": 215,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/k-closest-points-to-origin/,K Closest Points to Origin"
},
{
"path": "companies/Athenahealth.csv",
"chars": 107,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,4\n"
},
{
"path": "companies/Atlassian.csv",
"chars": 579,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,18\nhttps://le"
},
{
"path": "companies/Baidu.csv",
"chars": 267,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/out-of-boundary-paths/,Out of Boundary Paths,1\nhttps:/"
},
{
"path": "companies/Barclays.csv",
"chars": 105,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n"
},
{
"path": "companies/BlackRock.csv",
"chars": 168,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/evaluate-division/,Evaluate Division,2\nhttps://leetcod"
},
{
"path": "companies/Bloomberg.csv",
"chars": 17810,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-bitset/,Design Bitset,2\nhttps://leetcode.com/pr"
},
{
"path": "companies/Bolt.csv",
"chars": 477,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-all-characters-have-equal-number-of-occurrenc"
},
{
"path": "companies/Booking.com.csv",
"chars": 613,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-out-of-three/,Two Out of Three,1\nhttps://leetcode."
},
{
"path": "companies/Box.csv",
"chars": 167,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-1-bits/,Number of 1 Bits,12\nhttps://leetcode"
},
{
"path": "companies/ByteDance.csv",
"chars": 3276,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/the-number-of-weak-characters-in-the-game/,The Number "
},
{
"path": "companies/C3 IoT.csv",
"chars": 422,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Incr"
},
{
"path": "companies/Canonical.csv",
"chars": 145,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/divide-a-string-into-groups-of-size-k/,Divide a String"
},
{
"path": "companies/Capital One.csv",
"chars": 783,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,2\nhttps://leetcode."
},
{
"path": "companies/Cashfree.csv",
"chars": 113,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-erasure-value/,Maximum Erasure Value,1\n"
},
{
"path": "companies/Cisco.csv",
"chars": 1858,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-difference-between-increasing-elements/,Maximu"
},
{
"path": "companies/Citadel.csv",
"chars": 558,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,P"
},
{
"path": "companies/Citrix.csv",
"chars": 125,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-all-groups-of-farmland/,Find All Groups of Farmla"
},
{
"path": "companies/Cognizant.csv",
"chars": 156,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/smallest-value-of-the-rearranged-number/,Smallest Valu"
},
{
"path": "companies/Cohesity.csv",
"chars": 109,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/largest-bst-subtree/,Largest BST Subtree,2\n"
},
{
"path": "companies/Commvault.csv",
"chars": 139,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-vowel-substrings-of-a-string/,Count Vowel Substr"
},
{
"path": "companies/Coursera.csv",
"chars": 178,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,2\nhttps://lee"
},
{
"path": "companies/Cruise Automation.csv",
"chars": 673,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/product-of-the-last-k-numbers/,Product of the Last K N"
},
{
"path": "companies/DE Shaw.csv",
"chars": 315,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-substrings-containing-all-three-characters/,"
},
{
"path": "companies/DJI.csv",
"chars": 115,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/three-consecutive-odds/,Three Consecutive Odds,1\n"
},
{
"path": "companies/DRW.csv",
"chars": 248,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero"
},
{
"path": "companies/Databricks.csv",
"chars": 277,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-hit-counter/,Design Hit Counter,9\nhttps://leetc"
},
{
"path": "companies/Dataminr.csv",
"chars": 105,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/valid-parentheses/,Valid Parentheses,2\n"
},
{
"path": "companies/Dell.csv",
"chars": 85,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-sum/,Two Sum,3\n"
},
{
"path": "companies/Deutsche Bank.csv",
"chars": 276,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/the-time-when-the-network-becomes-idle/,The Time When "
},
{
"path": "companies/Directi.csv",
"chars": 135,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-winner-of-an-array-game/,Find the Winner of a"
},
{
"path": "companies/Docusign.csv",
"chars": 543,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/implement-trie-ii-prefix-tree/,Implement Trie II (Pref"
},
{
"path": "companies/DoorDash.csv",
"chars": 2108,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate"
},
{
"path": "companies/Drawbridge.csv",
"chars": 139,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/set-intersection-size-at-least-two/,Set Intersection S"
},
{
"path": "companies/Dropbox.csv",
"chars": 490,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/seat-reservation-manager/,Seat Reservation Manager,1\nh"
},
{
"path": "companies/Druva.csv",
"chars": 149,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximize-sum-of-array-after-k-negations/,Maximize Sum "
},
{
"path": "companies/Dunzo.csv",
"chars": 398,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/stone-game-vii/,Stone Game VII,1\nhttps://leetcode.com/"
},
{
"path": "companies/Duolingo.csv",
"chars": 137,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-number-of-people-to-teach/,Minimum Number of P"
},
{
"path": "companies/Epic Systems.csv",
"chars": 287,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/self-dividing-numbers/,Self Dividing Numbers,1\nhttps:/"
},
{
"path": "companies/Expedia.csv",
"chars": 1672,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-difference-between-increasing-elements/,Maximu"
},
{
"path": "companies/FPT.csv",
"chars": 187,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-three-consecutive-integers-that-sum-to-a-given-nu"
},
{
"path": "companies/Facebook.csv",
"chars": 30746,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-hills-and-valleys-in-an-array/,Count Hills and V"
},
{
"path": "companies/FactSet.csv",
"chars": 99,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximal-square/,Maximal Square,2\n"
},
{
"path": "companies/Flipkart.csv",
"chars": 592,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/number-of-students-unable-to-eat-lunch/,Number of Stud"
},
{
"path": "companies/Gilt Groupe.csv",
"chars": 109,
"preview": "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",
"chars": 168,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,2\nhttps"
},
{
"path": "companies/Goldman Sachs.csv",
"chars": 5100,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/keep-multiplying-found-values-by-two/,Keep Multiplying"
},
{
"path": "companies/Google.csv",
"chars": 40470,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/,Minimum Consecut"
},
{
"path": "companies/Grab.csv",
"chars": 727,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwate"
},
{
"path": "companies/HBO.csv",
"chars": 194,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/short-encoding-of-words/,Short Encoding of Words,2\nhtt"
},
{
"path": "companies/HRT.csv",
"chars": 630,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations/,Eq"
},
{
"path": "companies/Honeywell.csv",
"chars": 147,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-distance-to-the-target-element/,Minimum Distan"
},
{
"path": "companies/Hotstar.csv",
"chars": 267,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/keys-and-rooms/,Keys and Rooms,2\nhttps://leetcode.com/"
},
{
"path": "companies/Huawei.csv",
"chars": 101,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/add-two-numbers/,Add Two Numbers,2\n"
},
{
"path": "companies/Hulu.csv",
"chars": 147,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/k-th-smallest-in-lexicographical-order/,K-th Smallest "
},
{
"path": "companies/IBM.csv",
"chars": 718,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/most-visited-sector-in-a-circular-track/,Most Visited "
},
{
"path": "companies/IIT Bombay.csv",
"chars": 125,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/score-after-flipping-matrix/,Score After Flipping Matr"
},
{
"path": "companies/IMC.csv",
"chars": 145,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-artifacts-that-can-be-extracted/,Count Artifacts"
},
{
"path": "companies/IXL.csv",
"chars": 204,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-derangement-of-an-array/,Find the Derangement"
},
{
"path": "companies/Indeed.csv",
"chars": 949,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one"
},
{
"path": "companies/Info Edge.csv",
"chars": 207,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-c"
},
{
"path": "companies/Infosys.csv",
"chars": 457,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/,Sort Integers b"
},
{
"path": "companies/Intel.csv",
"chars": 347,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-string/,Reverse String,2\nhttps://leetcode.com/"
},
{
"path": "companies/Intuit.csv",
"chars": 1003,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/delete-nodes-and-return-forest/,Delete Nodes And Retur"
},
{
"path": "companies/JP Morgan.csv",
"chars": 326,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/lexicographically-smallest-string-after-applying-opera"
},
{
"path": "companies/JPMorgan.csv",
"chars": 1421,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/determine-color-of-a-chessboard-square/,Determine Colo"
},
{
"path": "companies/Jane Street.csv",
"chars": 147,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-common-words-with-one-occurrence/,Count Common W"
},
{
"path": "companies/Jeavio.csv",
"chars": 133,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-moves-to-convert-string/,Minimum Moves to Conv"
},
{
"path": "companies/Karat.csv",
"chars": 1237,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Ch"
},
{
"path": "companies/Leap Motion.csv",
"chars": 137,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/generate-random-point-in-a-circle/,Generate Random Poi"
},
{
"path": "companies/LinkedIn.csv",
"chars": 7677,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-units-on-a-truck/,Maximum Units on a Truck,2\nh"
},
{
"path": "companies/LiveRamp.csv",
"chars": 320,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/longest-harmonious-subsequence/,Longest Harmonious Sub"
},
{
"path": "companies/Lyft.csv",
"chars": 848,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/time-based-key-value-store/,Time Based Key-Value Store"
},
{
"path": "companies/MAQ Software.csv",
"chars": 147,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/unique-substrings-in-wraparound-string/,Unique Substri"
},
{
"path": "companies/MakeMyTrip.csv",
"chars": 210,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/remove-all-occurrences-of-a-substring/,Remove All Occu"
},
{
"path": "companies/Mathworks.csv",
"chars": 502,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/degree-of-an-array/,Degree of an Array,3\nhttps://leetc"
},
{
"path": "companies/Mercari.csv",
"chars": 438,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/crawler-log-folder/,Crawler Log Folder,1\nhttps://leetc"
},
{
"path": "companies/Microsoft.csv",
"chars": 29879,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/remove-digit-from-number-to-maximize-result/,Remove Di"
},
{
"path": "companies/MindTickle.csv",
"chars": 117,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-frequency-stack/,Maximum Frequency Stack,2\n"
},
{
"path": "companies/MindTree.csv",
"chars": 139,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-integers-with-even-digit-sum/,Count Integers Wit"
},
{
"path": "companies/Moengage.csv",
"chars": 169,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/redistribute-characters-to-make-all-strings-equal/,Red"
},
{
"path": "companies/Morgan Stanley.csv",
"chars": 515,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/best-team-with-no-conflicts/,Best Team With No Conflic"
},
{
"path": "companies/National Instruments.csv",
"chars": 109,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\n"
},
{
"path": "companies/Netflix.csv",
"chars": 419,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,4\nhttps://leetcode."
},
{
"path": "companies/Netsuite.csv",
"chars": 181,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salar"
},
{
"path": "companies/Nuro.csv",
"chars": 111,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/subrectangle-queries/,Subrectangle Queries,1\n"
},
{
"path": "companies/Nutanix.csv",
"chars": 297,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-word-is-valid-after-substitutions/,Check If W"
},
{
"path": "companies/Nvidia.csv",
"chars": 1677,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/last-stone-weight/,Last Stone Weight,8\nhttps://leetcod"
},
{
"path": "companies/OT.csv",
"chars": 101,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,1\n"
},
{
"path": "companies/Opendoor.csv",
"chars": 179,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-excel-sum-formula/,Design Excel Sum Formula,3\nh"
},
{
"path": "companies/Optum.csv",
"chars": 115,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-prefix-of-word/,Reverse Prefix of Word,1\n"
},
{
"path": "companies/Oracle.csv",
"chars": 6840,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Incr"
},
{
"path": "companies/Palantir Technologies.csv",
"chars": 198,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-it-is-a-straight-line/,Check If It Is a Strai"
},
{
"path": "companies/PayTM.csv",
"chars": 287,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/distribute-candies-to-people/,Distribute Candies to Pe"
},
{
"path": "companies/Paypal.csv",
"chars": 943,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses/,R"
},
{
"path": "companies/PhonePe.csv",
"chars": 204,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/simple-bank-system/,Simple Bank System,1\nhttps://leetc"
},
{
"path": "companies/Pinterest.csv",
"chars": 575,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/parallel-courses-iii/,Parallel Courses III,4\nhttps://l"
},
{
"path": "companies/Pocket Gems.csv",
"chars": 163,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/non-negative-integers-without-consecutive-ones/,Non-ne"
},
{
"path": "companies/Postmates.csv",
"chars": 328,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/most-beautiful-item-for-each-query/,Most Beautiful Ite"
},
{
"path": "companies/Pure Storage.csv",
"chars": 184,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-repeating-substring/,Maximum Repeating Substri"
},
{
"path": "companies/Qualcomm.csv",
"chars": 265,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/middle-of-the-linked-list/,Middle of the Linked List,2"
},
{
"path": "companies/Qualtrics.csv",
"chars": 1113,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-integers-by-the-power-value/,Sort Integers by The"
},
{
"path": "companies/Quora.csv",
"chars": 707,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/range-frequency-queries/,Range Frequency Queries,1\nhtt"
},
{
"path": "companies/Rakuten.csv",
"chars": 111,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sum-of-floored-pairs/,Sum of Floored Pairs,1\n"
},
{
"path": "companies/Reddit.csv",
"chars": 227,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/subsets/,Subsets,3\nhttps://leetcode.com/problems/text-"
},
{
"path": "companies/Redfin.csv",
"chars": 188,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/string-compression/,String Compression,3\nhttps://leetc"
},
{
"path": "companies/Riot Games.csv",
"chars": 101,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/teemo-attacking/,Teemo Attacking,1\n"
},
{
"path": "companies/Robinhood.csv",
"chars": 407,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-good-meals/,Count Good Meals,1\nhttps://leetcode."
},
{
"path": "companies/Roblox.csv",
"chars": 441,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/design-browser-history/,Design Browser History,5\nhttps"
},
{
"path": "companies/Rubrik.csv",
"chars": 636,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/snapshot-array/,Snapshot Array,5\nhttps://leetcode.com/"
},
{
"path": "companies/Rupeek.csv",
"chars": 137,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-kth-bit-in-nth-binary-string/,Find Kth Bit in Nth"
},
{
"path": "companies/SAP.csv",
"chars": 569,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-students-taking-exam/,Maximum Students Taking "
},
{
"path": "companies/Salesforce.csv",
"chars": 3861,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/,Check"
},
{
"path": "companies/Samsung.csv",
"chars": 617,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum P"
},
{
"path": "companies/Sapient.csv",
"chars": 109,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/trapping-rain-water/,Trapping Rain Water,2\n"
},
{
"path": "companies/ServiceNow.csv",
"chars": 1121,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/,P"
},
{
"path": "companies/Shopee.csv",
"chars": 733,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/palindrome-pairs/,Palindrome Pairs,3\nhttps://leetcode."
},
{
"path": "companies/Snapchat.csv",
"chars": 2791,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/largest-merge-of-two-strings/,Largest Merge Of Two Str"
},
{
"path": "companies/Softwire.csv",
"chars": 135,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/second-largest-digit-in-a-string/,Second Largest Digit"
},
{
"path": "companies/Sony.csv",
"chars": 101,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reducing-dishes/,Reducing Dishes,2\n"
},
{
"path": "companies/Splunk.csv",
"chars": 131,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/search-in-rotated-sorted-array/,Search in Rotated Sort"
},
{
"path": "companies/Spotify.csv",
"chars": 1248,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Co"
},
{
"path": "companies/Sprinklr.csv",
"chars": 507,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/next-greater-numerically-balanced-number/,Next Greater"
},
{
"path": "companies/Square.csv",
"chars": 679,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rank-teams-by-votes/,Rank Teams by Votes,2\nhttps://lee"
},
{
"path": "companies/Sumologic.csv",
"chars": 418,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii/,Lowest Co"
},
{
"path": "companies/Swiggy.csv",
"chars": 299,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rabbits-in-forest/,Rabbits in Forest,2\nhttps://leetcod"
},
{
"path": "companies/T System.csv",
"chars": 89,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/grid-game/,Grid Game,1\n"
},
{
"path": "companies/TIAA.csv",
"chars": 145,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-greatest-common-divisor-of-array/,Find Greatest C"
},
{
"path": "companies/Tencent.csv",
"chars": 113,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-factorization/,Minimum Factorization,1\n"
},
{
"path": "companies/Tesla.csv",
"chars": 749,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string/,Min"
},
{
"path": "companies/Thumbtack.csv",
"chars": 107,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/vowel-spellchecker/,Vowel Spellchecker,1\n"
},
{
"path": "companies/Tiger Analytics.csv",
"chars": 125,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-closest-number-to-zero/,Find Closest Number to Ze"
},
{
"path": "companies/Toptal.csv",
"chars": 113,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reformat-phone-number/,Reformat Phone Number,3\n"
},
{
"path": "companies/TripleByte.csv",
"chars": 151,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/,Minimum ASCI"
},
{
"path": "companies/TuSimple.csv",
"chars": 299,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/binary-tree-postorder-traversal/,Binary Tree Postorder"
},
{
"path": "companies/Twilio.csv",
"chars": 719,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-array-by-increasing-frequency/,Sort Array by Incr"
},
{
"path": "companies/Twitch.csv",
"chars": 184,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/battleships-in-a-board/,Battleships in a Board,7\nhttps"
},
{
"path": "companies/Twitter.csv",
"chars": 2314,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/time-needed-to-buy-tickets/,Time Needed to Buy Tickets"
},
{
"path": "companies/Two Sigma.csv",
"chars": 354,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-product-of-splitted-binary-tree/,Maximum Produ"
},
{
"path": "companies/Uber.csv",
"chars": 10240,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/intersection-of-multiple-arrays/,Intersection of Multi"
},
{
"path": "companies/United Health Group.csv",
"chars": 235,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-all-1s-are-at-least-length-k-places-away/,Che"
},
{
"path": "companies/VMware.csv",
"chars": 2433,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rearrange-words-in-a-sentence/,Rearrange Words in a Se"
},
{
"path": "companies/Valve.csv",
"chars": 95,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/dota2-senate/,Dota2 Senate,1\n"
},
{
"path": "companies/Virtu Financial.csv",
"chars": 519,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-number-of-homogenous-substrings/,Count Number of"
},
{
"path": "companies/Visa.csv",
"chars": 1623,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/create-target-array-in-the-given-order/,Create Target "
},
{
"path": "companies/Walmart Global Tech.csv",
"chars": 2784,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-c"
},
{
"path": "companies/Wayfair.csv",
"chars": 1058,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-moves-to-reach-target-score/,Minimum Moves to "
},
{
"path": "companies/Wealthfront.csv",
"chars": 179,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii"
},
{
"path": "companies/Wish.csv",
"chars": 109,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/find-right-interval/,Find Right Interval,2\n"
},
{
"path": "companies/Works Applications.csv",
"chars": 113,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/k-inverse-pairs-array/,K Inverse Pairs Array,1\n"
},
{
"path": "companies/Yahoo.csv",
"chars": 3318,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/,Maximum P"
},
{
"path": "companies/Yandex.csv",
"chars": 1758,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/,Lon"
},
{
"path": "companies/Yelp.csv",
"chars": 346,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/destination-city/,Destination City,5\nhttps://leetcode."
},
{
"path": "companies/ZScaler.csv",
"chars": 101,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/day-of-the-year/,Day of the Year,1\n"
},
{
"path": "companies/Zenefits.csv",
"chars": 220,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree/,Verify"
},
{
"path": "companies/Zillow.csv",
"chars": 146,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/spiral-matrix/,Spiral Matrix,2\nhttps://leetcode.com/pr"
},
{
"path": "companies/Zoho.csv",
"chars": 505,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/sort-even-and-odd-indices-independently/,Sort Even and"
},
{
"path": "companies/Zomato.csv",
"chars": 85,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-sum/,Two Sum,2\n"
},
{
"path": "companies/Zoom.csv",
"chars": 393,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotate-string/,Rotate String,4\nhttps://leetcode.com/pr"
},
{
"path": "companies/Zopsmart.csv",
"chars": 141,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/reverse-nodes-in-even-length-groups/,Reverse Nodes in "
},
{
"path": "companies/eBay.csv",
"chars": 715,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/rotating-the-box/,Rotating the Box,2\nhttps://leetcode."
},
{
"path": "companies/edabit.csv",
"chars": 135,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/calculate-money-in-leetcode-bank/,Calculate Money in L"
},
{
"path": "companies/instacart.csv",
"chars": 171,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers/,Ch"
},
{
"path": "companies/payu.csv",
"chars": 192,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-operations-to-obtain-zero/,Count Operations to O"
},
{
"path": "companies/peak6.csv",
"chars": 149,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/coordinate-with-maximum-network-quality/,Coordinate Wi"
},
{
"path": "companies/persistent systems.csv",
"chars": 141,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/minimum-bit-flips-to-convert-number/,Minimum Bit Flips"
},
{
"path": "companies/razorpay.csv",
"chars": 133,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/two-best-non-overlapping-events/,Two Best Non-Overlapp"
},
{
"path": "companies/tcs.csv",
"chars": 634,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/maximum-ascending-subarray-sum/,Maximum Ascending Suba"
},
{
"path": "companies/tiktok.csv",
"chars": 4787,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/plates-between-candles/,Plates Between Candles,3\nhttps"
},
{
"path": "companies/zeta suite.csv",
"chars": 157,
"preview": "problem_link,problem_name,num_occur\nhttps://leetcode.com/problems/count-equal-and-divisible-pairs-in-an-array/,Count Equ"
},
{
"path": "data/companies_and_leetcode_problems.csv",
"chars": 507590,
"preview": "01 Matrix,1-bit and 2-bit Characters,132 Pattern,2 Keys Keyboard,24 Game,3Sum,3Sum Closest,3Sum With Multiplicity,4 Keys"
},
{
"path": "data/leetcode_problems.csv",
"chars": 396505,
"preview": "name,link,difficulty,solution\nLargest 3-Same-Digit Number in String,https://leetcode.com/problems/largest-3-same-digit-n"
},
{
"path": "data/leetcode_problems_and_companies.csv",
"chars": 346614,
"preview": "problem_link,problem_name,company_name,num_occur\nhttps://leetcode.com/problems/minimum-consecutive-cards-to-pick-up/,Min"
},
{
"path": "data/leetcode_repo_readme.csv",
"chars": 361091,
"preview": "Title,Solutions,Video,Difficulty,Tag,Company\n[Largest 3-Same-Digit Number in String](https://leetcode.com/problems/large"
},
{
"path": "data/leetcode_repo_readme.md",
"chars": 441748,
"preview": "| ID | Title | Solutions "
},
{
"path": "data-gen/leetcode_scraper.ipynb",
"chars": 5991,
"preview": "{\n \"cells\": [\n {\n \"cell_type\": \"code\",\n \"execution_count\": null,\n \"id\": \"abeb0073\",\n \"metadata\": {},\n \"output"
},
{
"path": "data-gen/markdown2csv.py",
"chars": 677,
"preview": "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"
},
{
"path": "data-gen/parse_readme.py",
"chars": 629,
"preview": "from markdown2csv import md_to_df\nimport re\nimport pandas as pd\n\nparsed_list = []\ndf = md_to_df('../data/leetcode_repo_r"
},
{
"path": "data-gen/transform_data.ipynb",
"chars": 1981,
"preview": "{\n \"cells\": [\n {\n \"cell_type\": \"markdown\",\n \"id\": \"75f28a50\",\n \"metadata\": {},\n \"source\": [\n \"## Generate pi"
},
{
"path": "todo.md",
"chars": 460,
"preview": "## TODO\n- [x] viz: add 'back to top' link next to each company\n- [ ] data collection: extend scraper to collect both pro"
}
]
// ... and 2 more files (download for full content)
About this extraction
This page contains the full source code of the hxu296/leetcode-company-wise-problems-2022 GitHub repository, extracted and formatted as plain text for AI agents and large language models (LLMs). The extraction includes 202 files (3.2 MB), approximately 850.3k tokens, and a symbol index with 2 extracted functions, classes, methods, constants, and types. Use this with OpenClaw, Claude, ChatGPT, Cursor, Windsurf, or any other AI tool that accepts text input. You can copy the full output to your clipboard or download it as a .txt file.
Extracted by GitExtract — free GitHub repo to text converter for AI. Built by Nikandr Surkov.