Coding solutions uploaded.

Author: sushant097

coding_solutions/Readme.md

@@ -0,0 +1,8 @@
+# Coding Python solutions
+## About
+This repository contains my answers to all Leetcode/HackerRank algorithm questions. This problems are largely made up of actual interview questions from huge companies such as Facebook, Amazon, Netflix, and Google. If you find my solutions difficult to understand, take some time to tackle simpler issues or visit the problem discussion section on LeetCode. Feel free to connect me if you have any suggestions for changes.
+
+## List of Problems
+| # | Problem | Solution |
+| :----: | :-----------------------------: | :----: |
+| 1 | [Two Sum](https://leetcode.com/problems/two-sum/)| [python3]() |

coding_solutions/interview_related/TwoSum.py

@@ -0,0 +1,12 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        record = {}
+        for i in range(len(nums)):
+            curnum = nums[i]
+            diff = target - curnum
+            if diff not in record:
+                record[curnum] = i
+            elif diff in record:
+                return [record[diff], i]
+
+        return []