# README
Enhancing Go fluency with 50 Leetcode Problems.
Improving proficiency in Go through LeetCode can be an effective strategy since it provides a range of problems to practice different aspects of coding and algorithm design. Here's a list of 50 LeetCode problems, categorized by topic, that can help you enhance your skills in Go:
Arrays and Strings
- Two Sum
- Best Time to Buy and Sell Stock
- Contains Duplicate
- Product of Array Except Self
- Maximum Subarray
- Merge Intervals
- 3Sum
- Longest Substring Without Repeating Characters
- Valid Anagram
- Group Anagrams
Linked Lists
- Reverse Linked List
- Merge Two Sorted Lists
- Linked List Cycle
- Remove Nth Node From End of List
- Add Two Numbers
- Intersection of Two Linked Lists
- Palindrome Linked List
- Swap Nodes in Pairs
- Reverse Nodes in k-Group
- Remove Duplicates from Sorted List
- Sort List
Trees and Graphs
- Binary Tree Inorder Traversal
- Maximum Depth of Binary Tree
- Validate Binary Search Tree
- Same Tree
- Symmetric Tree
- Binary Tree Level Order Traversal
- Convert Sorted Array to Binary Search Tree
- Construct Binary Tree from Preorder and Inorder Traversal
- Binary Tree Maximum Path Sum
- Lowest Common Ancestor of a Binary Search Tree
Dynamic Programming
- Climbing Stairs
- Coin Change
- Longest Increasing Subsequence
- Maximum Subarray
- House Robber
- House Robber II
- Decode Ways
- Unique Paths
- Jump Game
- Edit Distance
Sorting and Searching
- Implement Merge Sort
- Merge Intervals
- Kth Largest Element in an Array
- Search in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array
- Search a 2D Matrix
- Median of Two Sorted Arrays
- Sort Colors
- Top K Frequent Elements
- Find Peak Element
- Longest Consecutive Sequence
# Functions
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
Time complexity: O(N) Space Complexity: O(N).
Floyd-Warshal algorithm Time complexity: O(N) Space complexity: O(1).
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
Time complexity: O(N) Space complexity: O(N).
Time complexity: O(N) Space Complexity: O(1).
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