Categorygithub.com/xxxVitoxxx/leetcode
repository
0.0.0-20241020153809-77720808be6c
Repository: https://github.com/xxxvitoxxx/leetcode.git
Documentation: pkg.go.dev

# Packages

No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author
No description provided by the author

# README

LeetCode

Question List

#TitleDifficultySolution
1Two Sum$\color{green}{\textsf{Easy}}$Go
2Add Two Numbers$\color{orange}{\textsf{Medium}}$Go
3Longest Substring Without Repeating Characters$\color{orange}{\textsf{Medium}}$Go
9Palindrome Number$\color{green}{\textsf{Easy}}$Go
11Container With Most Water$\color{orange}{\textsf{Medium}}$Go
13Roman to Integer$\color{green}{\textsf{Easy}}$
14Longest Common Prefix$\color{green}{\textsf{Easy}}$
153Sum$\color{orange}{\textsf{Medium}}$Go
163Sum Closest$\color{orange}{\textsf{Medium}}$Go
17Letter Combinations of a Phone Number$\color{orange}{\textsf{Medium}}$Go
184Sum$\color{orange}{\textsf{Medium}}$Go
20Valid Parentheses$\color{green}{\textsf{Easy}}$Go
21Merge Two Sorted Lists$\color{green}{\textsf{Easy}}$
26Remove Duplicates from Sorted Array$\color{green}{\textsf{Easy}}$Go
27Remove Element$\color{green}{\textsf{Easy}}$Go
28Find the Index of the First Occurrence in a String$\color{green}{\textsf{Easy}}$Go
31Next Permutation$\color{orange}{\textsf{Medium}}$Go
35Search Insert Position$\color{green}{\textsf{Easy}}$Go
46Permutations$\color{orange}{\textsf{Medium}}$Go
48Rotate Image$\color{orange}{\textsf{Medium}}$Go
52N-Queens II$\color{red}{\textsf{Hard}}$Go
53Maximum Subarray$\color{orange}{\textsf{Medium}}$
54Spiral Matrix$\color{orange}{\textsf{Medium}}$Go
58Length of Last Word$\color{green}{\textsf{Easy}}$
61Rotate List$\color{orange}{\textsf{Medium}}$Go
66Plus One$\color{green}{\textsf{Easy}}$
67Add Binary$\color{green}{\textsf{Easy}}$
69Sqrt(x)$\color{green}{\textsf{Easy}}$
70Climbing Stairs$\color{green}{\textsf{Easy}}$
73Set Matrix Zeroes$\color{orange}{\textsf{Medium}}$Go
75Sort Colors$\color{orange}{\textsf{Medium}}$Go
83Remove Duplicates from Sorted List$\color{green}{\textsf{Easy}}$
88Merge Sorted Array$\color{green}{\textsf{Easy}}$Go
94Binary Tree Inorder Traversal$\color{green}{\textsf{Easy}}$
98Validate Binary Search Tree$\color{orange}{\textsf{Medium}}$Go
100Same Tree$\color{green}{\textsf{Easy}}$GO
101Symmetric Tree$\color{green}{\textsf{Easy}}$
102Binary Tree Level Order Traversal$\color{orange}{\textsf{Medium}}$Go
104Maximum Depth of Binary Tree$\color{green}{\textsf{Easy}}$Go
105Construct Binary Tree from Preorder and Inorder Traversal$\color{orange}{\textsf{Medium}}$Go
110Balanced Binary Tree$\color{green}{\textsf{Easy}}$
121Best Time to Buy and Sell Stock$\color{green}{\textsf{Easy}}$
125Valid Palindrome$\color{green}{\textsf{Easy}}$Go
133133.clone_graph$\color{orange}{\textsf{Medium}}$Go
136Single Number$\color{green}{\textsf{Easy}}$Go
141Linked List Cycle$\color{green}{\textsf{Easy}}$Go
142Linked List Cycle II$\color{orange}{\textsf{Medium}}$Go
143Reorder List$\color{orange}{\textsf{Medium}}$Go
144Binary Tree Preorder Traversal$\color{green}{\textsf{Easy}}$
145Binary Tree Postorder Traversal$\color{green}{\textsf{Easy}}$
151Reverse Words in a String$\color{orange}{\textsf{Medium}}$Go
159Longest Substring with At Most Two Distinct Characters :lock:$\color{orange}{\textsf{Medium}}$Go
160Intersection of Two Linked Lists$\color{green}{\textsf{Easy}}$Go
162Find Peak Element$\color{orange}{\textsf{Medium}}$Go
167Two Sum II - Input Array Is Sorted$\color{orange}{\textsf{Medium}}$Go
170Two Sum III - Data structure design :lock:$\color{green}{\textsf{Easy}}$Go
171Excel Sheet Column Number$\color{green}{\textsf{Easy}}$Go
175Combine Two Tables$\color{green}{\textsf{Easy}}$
176Second Highest Salary$\color{orange}{\textsf{Medium}}$MySQL
180Consecutive Numbers$\color{orange}{\textsf{Medium}}$MySQL
185Department Top Three Salaries$\color{red}{\textsf{Hard}}$MySQL
186Reverse Words in a String II :lock:$\color{orange}{\textsf{Medium}}$Go
190Reverse Bits$\color{green}{\textsf{Easy}}$Go
191Number of 1 Bits$\color{green}{\textsf{Easy}}$Go
196Delete Duplicate Emails$\color{green}{\textsf{Easy}}$MySQL
197Rising Temperature$\color{green}{\textsf{Easy}}$MySQL
199Binary Tree Right Side View$\color{orange}{\textsf{Medium}}$Go
202Happy Number$\color{green}{\textsf{Easy}}$Go
206Reverse Linked List$\color{green}{\textsf{Easy}}$Go
208Implement Trie (Prefix Tree)$\color{orange}{\textsf{Medium}}$Go
215Kth Largest Element in an Array$\color{orange}{\textsf{Medium}}$Go
216Combination Sum III$\color{orange}{\textsf{Medium}}$Go
217Contains Duplicate$\color{green}{\textsf{Easy}}$Go
219Contains Duplicate II$\color{green}{\textsf{Easy}}$Go
222Count Complete Tree Nodes$\color{green}{\textsf{Easy}}$Go
225Implement Stack using Queues$\color{green}{\textsf{Easy}}$
226Invert Binary Tree$\color{green}{\textsf{Easy}}$Go
230Kth Smallest Element in a BST$\color{orange}{\textsf{Medium}}$Go
234Palindrome Linked List$\color{green}{\textsf{Easy}}$Go
236Lowest Common Ancestor of a Binary tree$\color{orange}{\textsf{Medium}}$Go
238Product of Array Except Self$\color{orange}{\textsf{Medium}}$Go
242Valid Anagram$\color{green}{\textsf{Easy}}$Go
246Strobogrammatic Number :lock:$\color{green}{\textsf{Easy}}$Go
253Meeting Rooms II :lock:$\color{orange}{\textsf{Medium}}$Go
278First Bad Version$\color{green}{\textsf{Easy}}$
283Move Zeroes$\color{green}{\textsf{Easy}}$Go
328Odd Even Linked List$\color{orange}{\textsf{Medium}}$Go
334Increasing Triplet Subsequence$\color{orange}{\textsf{Medium}}$Go
338Counting Bits$\color{green}{\textsf{Easy}}$Go
340Longest Substring with At Most K Distinct Characters :lock:$\color{orange}{\textsf{Medium}}$Go
344Reverse String$\color{green}{\textsf{Easy}}$Go
345Reverse Vowels of a String$\color{green}{\textsf{Easy}}$Go
347Top K Frequent Elements$\color{orange}{\textsf{Medium}}$Go
349Intersection of Two Arrays$\color{green}{\textsf{Easy}}$Go
350Intersection of Two Arrays II$\color{green}{\textsf{Easy}}$Go
371Sum of Two Integers$\color{orange}{\textsf{Medium}}$Go
374Guess Number Higher or Lower$\color{green}{\textsf{Easy}}$Go
392Is Subsequence$\color{green}{\textsf{Easy}}$Go
394Decode String$\color{orange}{\textsf{Medium}}$Go
395Longest Substring with At Least K Repeatin$\color{orange}{\textsf{Medium}}$Go
399Evaluate Division$\color{orange}{\textsf{Medium}}$Go
408Valid Word Abbreviation :lock:$\color{green}{\textsf{Easy}}$Go
412Fizz Buzz$\color{green}{\textsf{Easy}}$Go
415Add Strings$\color{green}{\textsf{Easy}}$Go
437Path Sum III$\color{orange}{\textsf{Medium}}$Go
443String Compression$\color{orange}{\textsf{Medium}}$Go
450Delete Node in a BST$\color{orange}{\textsf{Medium}}$go
455Assign Cookies$\color{green}{\textsf{Easy}}$Go
457Circular Array Loop$\color{orange}{\textsf{Medium}}$Go
489Robot Room Cleaner :lock:$\color{red}{\textsf{Hard}}$Go
490The Maze :lock:$\color{orange}{\textsf{Medium}}$Go
496Next Greater Element I$\color{green}{\textsf{Easy}}$Go
541Reverse String II$\color{green}{\textsf{Easy}}$Go
547Number of Provinces$\color{orange}{\textsf{Medium}}$Go
550Game Play Analysis IV$\color{orange}{\textsf{Medium}}$MySQL
557Reverse Words in a String III$\color{green}{\textsf{Easy}}$Go
570Managers with at Least 5 Direct Reports$\color{orange}{\textsf{Medium}}$MySQL
577Employee Bonus$\color{green}{\textsf{Easy}}$MySQL
584Find Customer Referee$\color{green}{\textsf{Easy}}$MySQL
585Investments in 2016$\color{orange}{\textsf{Medium}}$MySQL
595Big Countries$\color{green}{\textsf{Easy}}$Python3 MySQL
596Classes More Than 5 Students$\color{green}{\textsf{Easy}}$MySQL
602Friend Requests II: Who Has the Most Friends$\color{orange}{\textsf{Medium}}$MySQL
605Can Place Flowers$\color{green}{\textsf{Easy}}$Go
610Triangle Judgement$\color{green}{\textsf{Easy}}$MySQL
619Biggest Single Number$\color{green}{\textsf{Easy}}$MySQL
620Not Boring Movies$\color{green}{\textsf{Easy}}$MySQL
624Maximum Distance in Arrays :lock:$\color{orange}{\textsf{Medium}}$Go
626Exchange Seats$\color{orange}{\textsf{Medium}}$MySQL
643Maximum Average Subarray I$\color{green}{\textsf{Easy}}$Go
649Dota2 Senate$\color{orange}{\textsf{Medium}}$Go
653Two Sum IV - Input is a BST$\color{green}{\textsf{Easy}}$Go
680Valid Palindrome II$\color{green}{\textsf{Easy}}$Go
682Baseball Game$\color{green}{\textsf{Easy}}$Go
696Count Binary Substrings$\color{green}{\textsf{Easy}}$Go
700Search in a Binary Search Tree$\color{green}{\textsf{Easy}}$Go
713Subarray Product Less Than K$\color{orange}{\textsf{Medium}}$Go
724Find Pivot Index$\color{green}{\textsf{Easy}}$Go
735Asteroid Collision$\color{orange}{\textsf{Medium}}$Go
821Shortest Distance to a Character$\color{green}{\textsf{Easy}}$Go
832Flipping an Image$\color{green}{\textsf{Easy}}$Go
841Keys and Rooms$\color{orange}{\textsf{Medium}}$Go
844Backspace String Compare$\color{green}{\textsf{Easy}}$Go
872Leaf-Similar Trees$\color{green}{\textsf{Easy}}$Go
875Koko Eating Bananas$\color{orange}{\textsf{Medium}}$Go
876Middle of the Linked List$\color{green}{\textsf{Easy}}$Go
897Increasing Order Search Tree$\color{green}{\textsf{Easy}}$
905Sort Array By Parity$\color{green}{\textsf{Easy}}$Go
917Reverse Only Letters$\color{green}{\textsf{Easy}}$Go
922Sort Array By Parity II$\color{green}{\textsf{Easy}}$Go
925Long Pressed Name$\color{green}{\textsf{Easy}}$Go
933Number of Recent Calls$\color{green}{\textsf{Easy}}$
942DI String Match$\color{green}{\textsf{Easy}}$Go
977Squares of a Sorted Array$\color{green}{\textsf{Easy}}$Go
994Rotting Oranges$\color{orange}{\textsf{Medium}}$Go
1002Find Common Characters$\color{green}{\textsf{Easy}}$Go
1004Max Consecutive Ones III$\color{orange}{\textsf{Medium}}$Go
1021Remove Outermost Parentheses$\color{green}{\textsf{Easy}}$
1045Customers Who Bought All Products$\color{orange}{\textsf{Medium}}$MySQL
1047Remove All Adjacent Duplicates In String$\color{green}{\textsf{Easy}}$Go
1056Confusing Number :lock:$\color{green}{\textsf{Easy}}$Go
1068Product Sales Analysis I$\color{green}{\textsf{Easy}}$MySQL
1070Product Sales Analysis III$\color{orange}{\textsf{Medium}}$MySQL
1071Greatest Common Divisor of Strings$\color{green}{\textsf{Easy}}$Go
1075Project Employees I$\color{green}{\textsf{Easy}}$MySQL
1088Confusing Number II :lock:$\color{red}{\textsf{Hard}}$Go
1089Duplicate Zeros$\color{green}{\textsf{Easy}}$Go
1099Two Sum Less Than K :lock:$\color{green}{\textsf{Easy}}$Go
1120Maximum Average Subtree :lock:$\color{orange}{\textsf{Medium}}$Go
1137N-th Tribonacci Number$\color{green}{\textsf{Easy}}$Go
1141User Activity for the Past 30 Days I$\color{green}{\textsf{Easy}}$MySQL
1148Article Views I$\color{green}{\textsf{Easy}}$MySQL
1160Find Words That Can Be Formed by Characters$\color{green}{\textsf{Easy}}$Go
1161Maximum Level Sum of a Binary Tree$\color{orange}{\textsf{Medium}}$Go
1164Product Price at a Given Date$\color{orange}{\textsf{Medium}}$MySQL
1174Immediate Food Delivery II$\color{orange}{\textsf{Medium}}$MySQL
1176Diet Plan Performance :lock:$\color{green}{\textsf{Easy}}$Go
1193Monthly Transactions I$\color{orange}{\textsf{Medium}}$MySQL
1204Last Person to Fit in the Bus$\color{orange}{\textsf{Medium}}$MySQL
1207Unique Number of Occurrences$\color{green}{\textsf{Easy}}$Go
1211Queries Quality and Percentage$\color{green}{\textsf{Easy}}$MySQL
1251Average Selling Price$\color{green}{\textsf{Easy}}$MySQL
1268Search Suggestions System$\color{orange}{\textsf{Medium}}$Go
1280Students and Examinations$\color{green}{\textsf{Easy}}$MySQL
1321Restaurant Growth$\color{orange}{\textsf{Medium}}$MySQL
1327List the Products Ordered in a Period$\color{green}{\textsf{Easy}}$MySQL
1341Movie Rating$\color{orange}{\textsf{Medium}}$MySQL
1372Longest ZigZag Path in a Binary Tree$\color{orange}{\textsf{Medium}}$Go
1378Replace Employee ID With The Unique Identifier$\color{green}{\textsf{Easy}}$MySQL
1385Find the Distance Value Between Two Arrays$\color{green}{\textsf{Easy}}$Go
1403Minimum Subsequence in Non-Increasing$\color{green}{\textsf{Easy}}$
1431Kids With the Greatest Number of Candies$\color{green}{\textsf{Easy}}$Go
1448Count Good Nodes in Binary Tree$\color{orange}{\textsf{Medium}}$Go
1456Maximum Number of Vowels in a Substring$\color{orange}{\textsf{Medium}}$Go
1466Reorder Routes to Make All Paths Lead to the City Zero$\color{orange}{\textsf{Medium}}$Go
1484Group Sold Products By The Date$\color{green}{\textsf{Easy}}$MySQL
1493Longest Subarray of 1's After Deleting One Element$\color{orange}{\textsf{Medium}}$Go
1527Patients With a Condition$\color{green}{\textsf{Easy}}$MySQL
1544Make The String Great$\color{green}{\textsf{Easy}}$Go
1561Maximum Number of Coins You Can Get$\color{orange}{\textsf{Medium}}$Go
1581Customer Who Visited but Did Not Make Any Transactions$\color{green}{\textsf{Easy}}$MySQL
1633Percentage of Users Attended a Contest$\color{green}{\textsf{Easy}}$MySQL
1661Average Time of Process per Machine$\color{green}{\textsf{Easy}}$MySQL
1657Determine if Two Strings Are Close$\color{orange}{\textsf{Medium}}$Go
1662Check If Two String Arrays are Equivalent$\color{green}{\textsf{Easy}}$Go
1667Fix Names in a Table$\color{green}{\textsf{Easy}}$MySQL
1679Max Number of K-Sum Pairs$\color{orange}{\textsf{Medium}}$Go
1683Invalid Tweets$\color{green}{\textsf{Easy}}$MySQL
1685Sum of Absolute Differences in a Sorted $\color{orange}{\textsf{Medium}}$Go
1688Count of Matches in Tournament$\color{green}{\textsf{Easy}}$Go
1729Find Followers Count$\color{green}{\textsf{Easy}}$MySQL
1731The Number of Employees Which Report to Each Employee$\color{green}{\textsf{Easy}}$MySQL
1732Find the Highest Altitude$\color{green}{\textsf{Easy}}$Go
1757Recyclable and Low Fat Products$\color{green}{\textsf{Easy}}$Python3 MySQL
1768Merge Strings Alternately$\color{green}{\textsf{Easy}}$Go
1789Primary Department for Each Employee$\color{green}{\textsf{Easy}}$MySQL
1791Find Center of Star Graph$\color{green}{\textsf{Easy}}$Go
1826Faulty Sensor :lock:$\color{green}{\textsf{Easy}}$Go
1907Count Salary Categories$\color{orange}{\textsf{Medium}}$MySQL
1926Nearest Exit from Entrance in Maze$\color{orange}{\textsf{Medium}}$Go
1934Confirmation Rate$\color{orange}{\textsf{Medium}}$MySQL
1971Find if Path Exists in Graph$\color{green}{\textsf{Easy}}$Go
1978Employees Whose Manager Left the Company$\color{green}{\textsf{Easy}}$MySQL
2000Reverse Prefix of Word$\color{green}{\textsf{Easy}}$Go
2095Delete the Middle Node of a Linked List$\color{orange}{\textsf{Medium}}$Go
2121Intervals Between Identical Elements$\color{orange}{\textsf{Medium}}$Go
2130Maximum Twin Sum of a Linked List$\color{orange}{\textsf{Medium}}$Go
2164Sort Even and Odd Indices Independently$\color{green}{\textsf{Easy}}$Go
2215Find the Difference of Two Arrays$\color{green}{\textsf{Easy}}$Go
2300Successful Pairs of Spells and Potions$\color{orange}{\textsf{Medium}}$Go
2336Smallest Number in Infinite Set$\color{orange}{\textsf{Medium}}$Go
2352Equal Row and Column Pairs$\color{orange}{\textsf{Medium}}$Go
2356Number of Unique Subjects Taught by Each Teacher$\color{green}{\textsf{Easy}}$MySQL
2367Number of Arithmetic Triplets$\color{green}{\textsf{Easy}}$Go
2390Removing Stars From a String$\color{orange}{\textsf{Medium}}$Go
2441Largest Positive Integer That Exists With Its Negative$\color{green}{\textsf{Easy}}$Go
2462Total Cost to Hire K Workers$\color{orange}{\textsf{Medium}}$Go
2542Maximum Subsequence Score$\color{orange}{\textsf{Medium}}$Go
2562Find the Array Concatenation Value$\color{green}{\textsf{Easy}}$Go
2570Merge Two 2D Arrays by Summing Values$\color{green}{\textsf{Easy}}$Go
2706Buy Two Chocolates$\color{green}{\textsf{Easy}}$Go
2824Count Pairs Whose Sum is Less than Target$\color{green}{\textsf{Easy}}$Go