|
1 | 1 | { |
| 2 | + "https://leetcode.com/problems/maximum-number-of-potholes-that-can-be-fixed/":[ |
| 3 | + "Maximum Number of Potholes That Can Be Fixed", "GEICO" |
| 4 | + ], |
2 | 5 | "https://leetcode.com/problems/find-trending-hashtags-ii/": [ |
3 | 6 | "Find Trending Hashtags II" |
4 | 7 | ], |
|
2214 | 2217 | "Check Distances Between Same Letters" |
2215 | 2218 | ], |
2216 | 2219 | "https://leetcode.com/problems/largest-palindromic-number/": [ |
2217 | | - "Largest Palindromic Number", "Microsoft", "Smartnews", "Adobe" |
| 2220 | + "Largest Palindromic Number", "Microsoft", "Smartnews", "Adobe", "GEICO" |
2218 | 2221 | ], |
2219 | 2222 | "https://leetcode.com/problems/minimum-adjacent-swaps-to-make-a-valid-array/": [ |
2220 | 2223 | "Minimum Adjacent Swaps to Make a Valid Array", "Amazon" |
|
3549 | 3552 | "Number of Ways to Paint N x 3 Grid", "Hackerrank" |
3550 | 3553 | ], |
3551 | 3554 | "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/": [ |
3552 | | - "Number of Steps to Reduce a Number in Binary Representation to One", "Microsoft", "Amazon" |
| 3555 | + "Number of Steps to Reduce a Number in Binary Representation to One", "Microsoft", "Amazon", "GEICO" |
3553 | 3556 | ], |
3554 | 3557 | "https://leetcode.com/problems/find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k/": [ |
3555 | 3558 | "Find the Minimum Number of Fibonacci Numbers Whose Sum Is K", "Amazon", "Google" |
|
3996 | 3999 | "Connecting Cities With Minimum Cost", "Amazon" |
3997 | 4000 | ], |
3998 | 4001 | "https://leetcode.com/problems/path-with-maximum-minimum-value/": [ |
3999 | | - "Path With Maximum Minimum Value", "Google", "Amazon", "DoorDash" |
| 4002 | + "Path With Maximum Minimum Value", "Google", "Amazon", "DoorDash", "GEICO" |
4000 | 4003 | ], |
4001 | 4004 | "https://leetcode.com/problems/stream-of-characters/": [ |
4002 | 4005 | "Stream of Characters", "Google", "Salesforce", "Amazon", "Microsoft" |
|
10375 | 10378 | "Apple", |
10376 | 10379 | "Salesforce", |
10377 | 10380 | "VMware", |
10378 | | - "Nvidia" |
| 10381 | + "Nvidia", |
| 10382 | + "GEICO" |
10379 | 10383 | ], |
10380 | 10384 | "https://leetcode.com/problems/palindrome-permutation-ii/": [ |
10381 | 10385 | "Palindrome Permutation II", |
|
11495 | 11499 | "tiktok", |
11496 | 11500 | "Zoho", |
11497 | 11501 | "Netflix", |
11498 | | - "Zoom" |
| 11502 | + "Zoom", |
| 11503 | + "GEICO" |
11499 | 11504 | ], |
11500 | 11505 | "https://leetcode.com/problems/triangle/": [ |
11501 | 11506 | "Triangle", |
|
11950 | 11955 | "Oracle", |
11951 | 11956 | "Apple", |
11952 | 11957 | "Uber", |
11953 | | - "Square" |
| 11958 | + "Square", |
| 11959 | + "GEICO" |
11954 | 11960 | ], |
11955 | 11961 | "https://leetcode.com/problems/unique-paths-ii/": [ |
11956 | 11962 | "Unique Paths II", |
|
12021 | 12027 | "Nvidia", |
12022 | 12028 | "Morgan Stanley", |
12023 | 12029 | "ByteDance", |
12024 | | - "tiktok" |
| 12030 | + "tiktok", |
| 12031 | + "GEICO" |
12025 | 12032 | ], |
12026 | 12033 | "https://leetcode.com/problems/jump-game/": [ |
12027 | 12034 | "Jump Game", |
|
12280 | 12287 | "Facebook", |
12281 | 12288 | "Karat", |
12282 | 12289 | "Wayfair", |
12283 | | - "Nvidia" |
| 12290 | + "Nvidia", |
| 12291 | + "GEICO" |
12284 | 12292 | ], |
12285 | 12293 | "https://leetcode.com/problems/search-insert-position/": [ |
12286 | 12294 | "Search Insert Position", |
|
12579 | 12587 | "Capital One", |
12580 | 12588 | "Adobe", |
12581 | 12589 | "Google", |
12582 | | - "tiktok" |
| 12590 | + "tiktok", |
| 12591 | + "GEICO" |
12583 | 12592 | ], |
12584 | 12593 | "https://leetcode.com/problems/container-with-most-water/": [ |
12585 | 12594 | "Container With Most Water", |
|
0 commit comments