---
###### tags: `Leetcode`
---

# Leetcode Study Group

## Week 1 Easy Array
[961](https://hackmd.io/@ken1009us/SyDHpAgas): N-Repeated Element in Size 2N Array
[977](https://hackmd.io/@ken1009us/HkeaTR-ao): Squares of a Sorted Array
[1394](https://hackmd.io/@ken1009us/ByzPexfTs): Find Lucky Integer in an Array
[1460](https://hackmd.io/@ken1009us/HkDvHMGpj): Make Two Arrays Equal by Reversing Subarrays
[1464](https://hackmd.io/@ken1009us/ByFQzBETs): Maximum Product of Two Elements in an Array
[1470](https://hackmd.io/@ken1009us/SkxbRrV6i): Shuffle the Array
[1480](https://hackmd.io/@ken1009us/ryj5-LE6s): Running Sum of 1d Array
[1920](https://hackmd.io/@ken1009us/ryE7jINTi): Build Array from Permutation
[1929](https://hackmd.io/@ken1009us/H1hfV_E6s): Concatenation of Array
[2089](https://hackmd.io/@ken1009us/ByRj8u4po): Find Target Indices After Sorting Array

---

## Week 2 String
[844](https://hackmd.io/@ken1009us/ByMNYzjpo): Backspace String Compare
[1119](https://hackmd.io/@ken1009us/S1XrGVl0i): Remove Vowels from a String
[1221](https://hackmd.io/@ken1009us/S1dCaUaps): Split a String in Balanced Strings
[1408](https://hackmd.io/@ken1009us/rJQV0v66j): String Matching in an Array
[1662](https://hackmd.io/@ken1009us/r1yc8leRo): Check If Two String Arrays are Equivalent
[1704](https://hackmd.io/@ken1009us/Sygbpeg0j): Determine if String Halves Are Alike
[1784](https://hackmd.io/@ken1009us/S1qmYbxRi): Check if Binary String Has at Most One Segment of Ones
[1967](https://hackmd.io/@ken1009us/r1JZXmxAo): Number of Strings That Appear as Substrings in Word
[2108](https://hackmd.io/@ken1009us/S1au47x0s): Find First Palindromic String in the Array
[2414](https://hackmd.io/@ken1009us/rkKCumx0i): Length of the Longest Alphabetical Continuous Substring

---

## Week 3 Linked List
[817](https://hackmd.io/@ken1009us/BkD-OliCs): Linked List Components
[876](https://hackmd.io/@ken1009us/B11AS4oRs): Middle of the Linked List
:boom:[1019](https://hackmd.io/@ken1009us/BJCoBXky2): Next Greater Node In Linked List
:boom:[1290](https://hackmd.io/@ken1009us/Sy14LdZJn): Convert Binary Number in a Linked List to Integer
:boom:[1367](https://hackmd.io/@ken1009us/Sk0Zt_WJh): Linked List in Binary Tree
:boom:[1669](https://hackmd.io/@ken1009us/BJF7s_fkh): Merge In Between Linked Lists
:boom:[1721](https://hackmd.io/@ken1009us/S16CWtGkh): Swapping Nodes in a Linked List
[2095](https://hackmd.io/@ken1009us/r1Fx3fKJ3): Delete the Middle Node of a Linked List
[2130](https://hackmd.io/@ken1009us/H1nRTMtJn): Maximum Twin Sum of a Linked List
:boom:[2487](https://hackmd.io/@ken1009us/r1z2CVF13): Remove Nodes From Linked List

---

## Week 4 tree
[814](https://hackmd.io/@ken1009us/Bkj_ZcHen): Binary Tree Pruning
[872](https://hackmd.io/@ken1009us/rypRvzyyh): Leaf-Similar Trees
[993](https://hackmd.io/@ken1009us/rk-N3MOl2): Cousins in Binary Tree
:boom:[1038](https://hackmd.io/@ken1009us/Sk6jIX3gh): Binary Search Tree to Greater Sum Tree
:boom:[1161](https://hackmd.io/@ken1009us/SJWEorAe2): Maximum Level Sum of a Binary Tree
[1305](https://hackmd.io/@ken1009us/ByFLYWNbn): All Elements in Two Binary Search Trees
[1448]():
[1457]():
[2331]():

---

## Week 5, 6 Sort

[791]():
[944]():
[1213]():
[1508]():
[1636]():
[1685]():
[1752]():
[1859]():
[2191]():
[2545]():

---

## Week 7 Heap

[1753]():
[1845]():
[2099]():
[2231]():
[2335]():
[2336]():