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

Title: 46. Permutations
URL: leetcode
Level: Medium

Title: 46. Permutations II
URL: leetcode
Level: Medium

#bit_manipulations
Title: Check Power of Two
URL: binarysearch
Level: Easy
! if n is power of 2, in binary numbers it will have only one '1' (e.g 64=> 100000),
if not power of 2, it will have more than one '1's. (e.g 33=>10001)

#bit_manipulations
Title: Number of Bits
URL: binarysearch
Level: Easy

#bit_manipulations
Title: Hamming Distance
URL: binarysearch
Level: Easy

#linked_list
Title: Linked List Jumps
URL: binarysearch
Level: Easy