LeetCode

https://leetcode.com/tsw303005/

These are some solution of Leetcode problems.
If you have any suggestion, please feel free to contact me with email.

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

LeetCode

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 272 Commits
.vscode		.vscode
1. Two Sum		1. Two Sum
1047. Remove All Adjacent Duplicates In String		1047. Remove All Adjacent Duplicates In String
11. Container With Most Water		11. Container With Most Water
1110. Delete Nodes And Return Forest		1110. Delete Nodes And Return Forest
112. Path Sum		112. Path Sum
113. Path Sum II		113. Path Sum II
1155. Number of Dice Rolls With Target Sum		1155. Number of Dice Rolls With Target Sum
1160. Find Words That Can Be Formed by Characters		1160. Find Words That Can Be Formed by Characters
12. Integer to Roman		12. Integer to Roman
120. Triangle		120. Triangle
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
1220. Count Vowels Permutation		1220. Count Vowels Permutation
1239. Maximum Length of a Concatenated String with Unique Characters		1239. Maximum Length of a Concatenated String with Unique Characters
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
1266. Minimum Time Visiting All Points		1266. Minimum Time Visiting All Points
127. Word Ladder		127. Word Ladder
130. Surrounded Regions		130. Surrounded Regions
131. Palindrome Partitioning		131. Palindrome Partitioning
1318. Minimum Flips to Make a OR b Equal to c		1318. Minimum Flips to Make a OR b Equal to c
132. Palindrome Partitioning II		132. Palindrome Partitioning II
1328. Break a Palindrome		1328. Break a Palindrome
1335. Minimum Difficulty of a Job Schedule		1335. Minimum Difficulty of a Job Schedule
1356. Sort Integers by The Number of 1 Bits		1356. Sort Integers by The Number of 1 Bits
1396. Design Underground System		1396. Design Underground System
141. Linked List Cycle		141. Linked List Cycle
1424. Diagonal Traverse II		1424. Diagonal Traverse II
1441. Build an Array With Stack Operations		1441. Build an Array With Stack Operations
1448. Count Good Nodes in Binary Tree		1448. Count Good Nodes in Binary Tree
1457. Pseudo-Palindromic Paths in a Binary Tree		1457. Pseudo-Palindromic Paths in a Binary Tree
15. 3Sum		15. 3Sum
1503. Last Moment Before All Ants Fall Out of a Plank		1503. Last Moment Before All Ants Fall Out of a Plank
152. Maximum Product Subarray		152. Maximum Product Subarray
1523. Count Odd Numbers in an Interval Range		1523. Count Odd Numbers in an Interval Range
1535. Find the Winner of an Array Game		1535. Find the Winner of an Array Game
154. Find Minimum in Rotated Sorted Array II		154. Find Minimum in Rotated Sorted Array II
1561. Maximum Number of Coins You Can Get		1561. Maximum Number of Coins You Can Get
1578. Minimum Time to Make Rope Colorful		1578. Minimum Time to Make Rope Colorful
1584. Min Cost to Connect All Points		1584. Min Cost to Connect All Points
16. 3Sum Closest		16. 3Sum Closest
160. Intersection of Two Linked Lists		160. Intersection of Two Linked Lists
1611. Minimum One Bit Operations to Make Integers Zero		1611. Minimum One Bit Operations to Make Integers Zero
1630. Arithmetic Subarrays		1630. Arithmetic Subarrays
1642. Furthest Building You Can Reach		1642. Furthest Building You Can Reach
1647. Minimum Deletions to Make Character Frequencies Unique		1647. Minimum Deletions to Make Character Frequencies Unique
1662. Check If Two String Arrays are Equivalent		1662. Check If Two String Arrays are Equivalent
1680. Concatenation of Consecutive Binary Numbers		1680. Concatenation of Consecutive Binary Numbers
1685. Sum of Absolute Differences in a Sorted Array		1685. Sum of Absolute Differences in a Sorted Array
17. Letter Combinations of a Phone Number		17. Letter Combinations of a Phone Number
1727. Largest Submatrix With Rearrangements		1727. Largest Submatrix With Rearrangements
173. Binary Search Tree Iterator		173. Binary Search Tree Iterator
1743. Restore the Array From Adjacent Pairs		1743. Restore the Array From Adjacent Pairs
1759. Count Number of Homogenous Substrings		1759. Count Number of Homogenous Substrings
1770. Maximum Score from Performing Multiplication Operations		1770. Maximum Score from Performing Multiplication Operations
1793. Maximum Score of a Good Subarray		1793. Maximum Score of a Good Subarray
18. 4Sum		18. 4Sum
1814. Count Nice Pairs in an Array		1814. Count Nice Pairs in an Array
1832. Check if the Sentence Is Pangram		1832. Check if the Sentence Is Pangram
1838. Frequency of the Most Frequent Element		1838. Frequency of the Most Frequent Element
1845. Seat Reservation Manager		1845. Seat Reservation Manager
1877. Minimize Maximum Pair Sum in Array		1877. Minimize Maximum Pair Sum in Array
19. Remove Nth Node From End of List		19. Remove Nth Node From End of List
191. Number of 1 Bits		191. Number of 1 Bits
1921. Eliminate Maximum Number of Monsters		1921. Eliminate Maximum Number of Monsters
1930. Unique Length-3 Palindromic Subsequences		1930. Unique Length-3 Palindromic Subsequences
198. House Robber		198. House Robber
1980. Find Unique Binary String		1980. Find Unique Binary String
1996. The Number of Weak Characters in the Game		1996. The Number of Weak Characters in the Game
20. Valid Parentheses		20. Valid Parentheses
200. Number of Islands		200. Number of Islands
2007. Find Original Array From Doubled Array		2007. Find Original Array From Doubled Array
2095. Delete the Middle Node of a Linked List		2095. Delete the Middle Node of a Linked List
21. Merge Two Sorted Lists		21. Merge Two Sorted Lists
210. Course Schedule II		210. Course Schedule II
213. House Robber II		213. House Robber II
2144. Minimum Cost of Buying Candies With Discount		2144. Minimum Cost of Buying Candies With Discount
2147. Number of Ways to Divide a Long Corridor		2147. Number of Ways to Divide a Long Corridor
219. Contains Duplicate II		219. Contains Duplicate II
22. Generate Parentheses		22. Generate Parentheses
221. Maximal Square		221. Maximal Square
2248. Intersection of Multiple Arrays		2248. Intersection of Multiple Arrays
226. Invert Binary Tree		226. Invert Binary Tree
2265. Count Nodes Equal to Average of Subtree		2265. Count Nodes Equal to Average of Subtree
23. Merge k Sorted Lists		23. Merge k Sorted Lists
230. Kth Smallest Element in a BST		230. Kth Smallest Element in a BST
237. Delete Node in a Linked List		237. Delete Node in a Linked List
2390. Removing Stars From a String		2390. Removing Stars From a String
2391. Minimum Amount of Time to Collect Garbage		2391. Minimum Amount of Time to Collect Garbage
25. Reverse Nodes in k-Group		25. Reverse Nodes in k-Group
26. Remove Duplicates from Sorted Array		26. Remove Duplicates from Sorted Array
2642. Design Graph With Shortest Path Calculator		2642. Design Graph With Shortest Path Calculator
2785. Sort Vowels in a String		2785. Sort Vowels in a String
28. Find the Index of the First Occurrence in a String		28. Find the Index of the First Occurrence in a String
284. Peeking Iterator		284. Peeking Iterator
2849. Determine if a Cell Is Reachable at a Given Time		2849. Determine if a Cell Is Reachable at a Given Time
2923. Find Champion I		2923. Find Champion I
2924. Find Champion II		2924. Find Champion II
2925. Maximum Score After Applying Operations on a Tree		2925. Maximum Score After Applying Operations on a Tree
2932. Maximum Strong Pair XOR I		2932. Maximum Strong Pair XOR I

tsw303005/LeetCode

Folders and files

Latest commit

History

Repository files navigation

LeetCode

About

Resources

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages