Task link: Hackerrank

Task 9

Hackerrank_link

Task 10

Kackerrank_link

Task 11

Link_Hackerrank
Task 12

Title: Reverse integer
# Leetcode
🔗Link

Title: Palindrome number
Link:LeetCode

Title: Regular expressions
Link: HackerRank

Title:Integer to Roman
Link: LeetCode

Title: Remove Duplicates from Sorted Array
Url: Leetcode #26

Title: Length of Last Word
Url: Leetcode

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.