added original leetcode task

analysis/01-When_Arithmetic_Cannot_Be_Trusted/readme.md

@@ -1,4 +1,4 @@
-# Analysis #01 — When Arithmetic Cannot Be Trusted
+# #01 — When Arithmetic Cannot Be Trusted
 
 ## 1. The Problem
 

analysis/02-Floating_Point_Equality_Is_a_Lie/readme.md

@@ -1,4 +1,4 @@
-# Analysis #02 — Floating Point Equality Is a Lie
+# #02 — Floating Point Equality Is a Lie
 
 ## Problem
 

analysis/03-Two_Sum_Is_Not_About_Numbers/origina-leetcode-task.txt

@@ -0,0 +1,32 @@
+Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+You can return the answer in any order.
+
+ 
+
+Example 1:
+
+Input: nums = [2,7,11,15], target = 9
+Output: [0,1]
+Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
+Example 2:
+
+Input: nums = [3,2,4], target = 6
+Output: [1,2]
+Example 3:
+
+Input: nums = [3,3], target = 6
+Output: [0,1]
+ 
+
+Constraints:
+
+2 <= nums.length <= 104
+-109 <= nums[i] <= 109
+-109 <= target <= 109
+Only one valid answer exists.
+ 
+
+Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

analysis/03-Two_Sum_Is_Not_About_Numbers/readme.md

@@ -1,4 +1,4 @@
-# Analysis #03 — Two Sum Is Not About Numbers
+# #03 — Two Sum Is Not About Numbers
 
 ---