Title: Find First and Last Position of Element in Sorted Array
Url: Leetcode

Title: Longest Common Prefix (version 1)
! This way is very hard code, not best way and not recommended however succeeded in all test cases
Url: LeetCode

Title:Longest Common Prefix (version 2)
Url: LeetCode
by @awsay

Title: Remove Element (level: easy)
Url: LeetCode

Title: Sqrt(x) (level:Easy)
Url: Leetcode
Note: trunc() truncates the value of its argument to a whole number

Title: Search insert position
Url: Leetcode

Title: Single Number
Url: Leetcode (level: Easy)
Note: XOR, also known as "exclusive or", compares two binary numbers bitwise. If both bits are the same, XOR outputs 0. If the bits are different, XOR outputs 1.

Title 2Sum (level Medium)
Url: LeetCode

Title: Happy number (Level: Easy, Version #1)
Problem:Leetcode

Title: Ugly number (Level: Easy)
Url: LeetCode

Title: Contains Duplicate (level:Easy)
url: LeetCode

Title: Maximum Ice Cream Bars
Link: Leetcode

Title: Move Zeroes
Link: Leetcode

Title: Fizz Buzz
Url: Leetcode

Title: Plus one
Url: Leetcode

Title: 771. Jewels and Stones
Url: https://leetcode.com/problems/jewels-and-stones/

Title:1486. XOR Operation in an Array
Url:https://leetcode.com/problems/xor-operation-in-an-array/