Week3

leetcode-study.iml

@@ -0,0 +1,82 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/3sum" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/best-time-to-buy-and-sell-stock" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/binary-tree-level-order-traversal" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/binary-tree-maximum-path-sum" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/climbing-stairs" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/clone-graph" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/coin-change" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/combination-sum" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/construct-binary-tree-from-preorder-and-inorder-traversal" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/container-with-most-water" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/contains-duplicate" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/counting-bits" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/course-schedule" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/decode-ways" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/design-add-and-search-words-data-structure" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/encode-and-decode-strings" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/find-minimum-in-rotated-sorted-array" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/graph-valid-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/group-anagrams" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/house-robber" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/house-robber-ii" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/implement-trie-prefix-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/insert-interval" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/invert-binary-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/jump-game" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/kth-smallest-element-in-a-bst" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/linked-list-cycle" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/longest-common-subsequence" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/longest-consecutive-sequence" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/longest-increasing-subsequence" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/longest-palindromic-substring" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/longest-repeating-character-replacement" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/longest-substring-without-repeating-characters" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/lowest-common-ancestor-of-a-binary-search-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/maximum-depth-of-binary-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/maximum-product-subarray" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/maximum-subarray" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/meeting-rooms" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/meeting-rooms-ii" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/merge-intervals" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/merge-k-sorted-lists" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/merge-two-sorted-lists" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/minimum-window-substring" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/missing-number" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/non-overlapping-intervals" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/number-of-1-bits" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/number-of-connected-components-in-an-undirected-graph" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/number-of-islands" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/pacific-atlantic-water-flow" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/palindromic-substrings" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/product-of-array-except-self" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/remove-nth-node-from-end-of-list" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/reorder-list" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/reverse-bits" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/reverse-linked-list" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/rotate-image" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/same-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/search-in-rotated-sorted-array" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/serialize-and-deserialize-binary-tree" isTestSource="false" packagePrefix="leetcode_study" />
+      <sourceFolder url="file://$MODULE_DIR$/set-matrix-zeroes" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/spiral-matrix" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/subtree-of-another-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/sum-of-two-integers" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/top-k-frequent-elements" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/two-sum" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/unique-paths" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/valid-anagram" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/valid-palindrome" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/valid-parentheses" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/validate-binary-search-tree" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/word-break" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/word-search" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

two-sum/paragon0107.java

@@ -0,0 +1,21 @@
+
+import java.util.HashMap;
+import java.util.Map;
+
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for(int i =0;i<nums.length;i++){
+            map.put(nums[i], i);
+        }
+
+        for(int i = 0;i<nums.length;i++){
+            int b = target - nums[i];
+            if(map.containsKey(b) && map.get(b) != i){
+                int j = map.get(b);
+                return new int[]{i,j};
+            }
+        }
+        return null;
+    }
+}