Start Leetcode

- Single Number.

Author: abrar-mahedavi

LeetCode/Easy/Single Number/README.md

@@ -0,0 +1,34 @@
+`Easy`	`Codewriting` 	`300`
+
+Given an array of strings, return another array containing all of its longest strings.
+
+## Example
+
+For `inputArray = ["aba", "aa", "ad", "vcd", "aba"]`, the output should be
+`allLongestStrings(inputArray) = ["aba", "vcd", "aba"]`.
+
+## Input/Output
+
+- [execution time limit] 4 seconds (go)
+
+- [input] array.string inputArray
+
+    A non-empty array.
+
+    Guaranteed constraints: \
+`1 ≤ inputArray.length ≤ 10`, \
+`1 ≤ inputArray[i].length ≤ 10`.
+
+- [output] array.string \
+Array of the longest strings, stored in the same order as in the inputArray.
+
+## [Go] Syntax Tips
+
+``` go
+// Prints help message to the console
+// Returns a string
+func helloWorld(name string) string {
+    fmt.Printf("This prints to the console when you Run Tests");
+    return "Hello, " + name;
+}
+```

LeetCode/Easy/Single Number/Solution.java

@@ -0,0 +1,6 @@
+class Solution {
+    public int singleNumber(int[] nums) {
+        return 0;
+
+    }
+}