Title: Common-Words
Url: binarysearch.com
Level: Easy

! version2: use max(new_s, new_s2, key=len)can be used to identify the longest set. if so, the case when both sets are equal should be checked too.
! version 3: use builtins for set data type:
e.g
return len(set(new_s).intersection(new_s2))

Title: Pair and Triples
Url: binarysearch.com

Title: 20. Valid Parentheses
Url: leetcode
Time complexity: O(n^2) 😐😐

Title: 191. Number of 1 Bits
Url: leetcode

Title: Largest Anagram Group
Url: binarysearch
Time complexity: O(n log n)

Title: Length-of-a-Linked-List
Url: binarysearch
Level: Easy

Title: 21. Merge Two Sorted Lists
Url: leetcode
Level: Easy
Time complexity: n log n

Title: 125. Valid Palindrome
Url: leetcode
Level: Easy

Title: Repeated Addition
URL: https://binarysearch.com/problems/Repeated-Addition
Level: Easy

Title: Wolf of Wall Street
URL: binarysearch.com
Level: Easy

#linkedlist
Title: Linked List to Integer
URL: binarysearch.com
Level: Easy

#linkedlist
Title: Insert Into Linked List
URL: binarysearch.com
Level: Easy

#linkedlist
Title: 206. Reverse Linked List
URL: leetcode
Level: Easy

#linkedlist
Title: 83. Remove Duplicates from Sorted List
URL: leetcode
Level: Easy

#slow_fast
Title: 26. Remove Duplicates from Sorted Array
URL: leetcode
Level: Easy

#slow_fast #linkedlist
Title: Central Linked List
URL: binarysearch
Level: Medium

Title: Subsequence Strings
URL: binarysearch
Level: Medium

Title: Happy Numbers
URL: binarysearch
Level: Easy

#linked_list
Title: Remove Duplicates in Linked List
URL: binarysearch
Level: Medium
! the code can be more simplified here

Title: Transpose of a Matrix
URL: binarysearch
Level: Easy