master

BranchesTags

Go to file

Code

Open more actions menu

Folders and files

Name		Name	Last commit message	Last commit date
Latest commit   History 694 Commits 694 Commits
#0README.md		#0README.md
#BinarySearch		#BinarySearch
#Comparator		#Comparator
#LinkedHashMap		#LinkedHashMap
0001. Two Sum		0001. Two Sum
0002. Add Two Numbers		0002. Add Two Numbers
0003. Longest Substring Without Repeating Characters		0003. Longest Substring Without Repeating Characters
0006. ZigZag Conversion		0006. ZigZag Conversion
0008. String to Integer (atoi)		0008. String to Integer (atoi)
0011. Container With Most Water		0011. Container With Most Water
0012. Integer to Roman		0012. Integer to Roman
0015. 3Sum		0015. 3Sum
0017. Letter Combinations of a Phone Number		0017. Letter Combinations of a Phone Number
0018. 4Sum		0018. 4Sum
0019. Remove Nth Node From End of List		0019. Remove Nth Node From End of List
0020. Valid Parentheses		0020. Valid Parentheses
0021. Merge Two Sorted Lists		0021. Merge Two Sorted Lists
0022. Generate Parentheses		0022. Generate Parentheses
0027. Remove Element		0027. Remove Element
0031. Next Permutation		0031. Next Permutation
0032. Longest Valid Parentheses		0032. Longest Valid Parentheses
0033. Search in Rotated Sorted Array		0033. Search in Rotated Sorted Array
0034. Find First and Last Position of Element in Sorted Array		0034. Find First and Last Position of Element in Sorted Array
0036. Valid Sudoku		0036. Valid Sudoku
0039. Combination Sum		0039. Combination Sum
0040. Combination Sum II		0040. Combination Sum II
0041. First Missing Positive		0041. First Missing Positive
0045. Jump Game II		0045. Jump Game II
0046. Permutations		0046. Permutations
0047. Permutations II		0047. Permutations II
0049. Group Anagrams		0049. Group Anagrams
0053. Maximum Subarray		0053. Maximum Subarray
0054. Spiral Matrix		0054. Spiral Matrix
0055. Jump Game		0055. Jump Game
0056. Merge Intervals		0056. Merge Intervals
0057. Insert Interval		0057. Insert Interval
0059. Spiral Matrix II		0059. Spiral Matrix II
0061. Rotate List		0061. Rotate List
0062. Unique Paths		0062. Unique Paths
0063. Unique Paths II		0063. Unique Paths II
0064. Minimum Path Sum		0064. Minimum Path Sum
0066. Plus One		0066. Plus One
0067. Add Binary		0067. Add Binary
0068. Text Justification		0068. Text Justification
0069. Sqrt(x)		0069. Sqrt(x)
0070. Climbing Stairs		0070. Climbing Stairs
0072. Edit Distance		0072. Edit Distance
0073. Set Matrix Zeroes		0073. Set Matrix Zeroes
0074. Search a 2D Matrix		0074. Search a 2D Matrix
0077. Combinations		0077. Combinations
0078. Subsets		0078. Subsets
0079. Word Search		0079. Word Search
0080. Remove Duplicates from Sorted Array II		0080. Remove Duplicates from Sorted Array II
0086. Partition List		0086. Partition List
0088. Merge Sorted Array		0088. Merge Sorted Array
0090. Subsets II		0090. Subsets II
0091. Decode Ways		0091. Decode Ways
0094. Binary Tree Inorder Traversal		0094. Binary Tree Inorder Traversal
0094. Binary Tree Inorder Traversal Iterative		0094. Binary Tree Inorder Traversal Iterative
0097. Interleaving String		0097. Interleaving String
0098. Validate Binary Search Tree		0098. Validate Binary Search Tree
0100. Same Tree		0100. Same Tree
0101. Symmetric Tree		0101. Symmetric Tree
0102. Binary Tree Level Order Traversal		0102. Binary Tree Level Order Traversal
0103. Binary Tree Zigzag Level Order Traversal		0103. Binary Tree Zigzag Level Order Traversal
0104. Maximum Depth of Binary Tree		0104. Maximum Depth of Binary Tree
0105. Construct Binary Tree from Preorder and Inorder Traversal		0105. Construct Binary Tree from Preorder and Inorder Traversal
0106. Construct Binary Tree from Inorder and Postorder Traversal		0106. Construct Binary Tree from Inorder and Postorder Traversal
0107. Binary Tree Level Order Traversal II		0107. Binary Tree Level Order Traversal II
0110. Balanced Binary Tree		0110. Balanced Binary Tree
0112. Path Sum		0112. Path Sum
0113. Path Sum II		0113. Path Sum II
0115. Distinct Subsequences		0115. Distinct Subsequences
0116. Populating Next Right Pointers in Each Node		0116. Populating Next Right Pointers in Each Node
0117. Populating Next Right Pointers in Each Node II		0117. Populating Next Right Pointers in Each Node II
0118. Pascal's Triangle		0118. Pascal's Triangle
0120. Triangle		0120. Triangle
0121. Best Time to Buy and Sell Stock		0121. Best Time to Buy and Sell Stock
0122. Best Time to Buy and Sell Stock II		0122. Best Time to Buy and Sell Stock II
0124. Binary Tree Maximum Path Sum		0124. Binary Tree Maximum Path Sum
0125. Valid Palindrome		0125. Valid Palindrome
0128. Longest Consecutive Sequence		0128. Longest Consecutive Sequence
0128. Longest Consecutive Sequence UF		0128. Longest Consecutive Sequence UF
0129. Sum Root to Leaf Numbers		0129. Sum Root to Leaf Numbers
0131. Palindrome Partitioning		0131. Palindrome Partitioning
0133. Clone Graph		0133. Clone Graph
0134. Gas Station		0134. Gas Station
0135. Candy		0135. Candy
0136. Single Number		0136. Single Number
0137. Single Number II		0137. Single Number II
0139. Word Break		0139. Word Break
0140. Word Break II		0140. Word Break II
0141. Linked List Cycle		0141. Linked List Cycle
0142. Linked List Cycle II		0142. Linked List Cycle II
0144. Binary Tree Preorder Traversal		0144. Binary Tree Preorder Traversal
0146. LRU Cache		0146. LRU Cache
0150. Evaluate Reverse Polish Notation		0150. Evaluate Reverse Polish Notation
0153. Find Minimum in Rotated Sorted Array		0153. Find Minimum in Rotated Sorted Array
0159. Longest Substring with At Most Two Distinct Characters		0159. Longest Substring with At Most Two Distinct Characters
0160. Intersection of Two Linked Lists		0160. Intersection of Two Linked Lists
View all files

About

No description, website, or topics provided.

Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks

Report repository

Releases

Packages

Contributors