Clone graph

CONTRIBUTING.md

@@ -3,3 +3,6 @@
   - When writing solution for a given problem add the problem statement above the class as comment
   - Write test case for each of the problem statement and make sure it builds with Travis CI
   - Add the code link in the readme.md file with problem description and the link to the problem solution
+
+
+  - Give a star to the repo 

README.md

@@ -13,14 +13,30 @@ Stop thinking start contributing to leetcode solution
 - [FindAllAnagramsInString](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/FindAllAnagramsInString.java)
 - [TransposeMatrix](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/TransposeMatrix.java)
 - [LowerCase](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/LowerCase.java)
-
-
+- [HammingDistance](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/HammingDistance.java)
+- [MiddleElementInLinkedList](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/MiddleElement.java)
+- [JudgeCircle](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/JudgeCircle.java)
+- [Parentheses](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/Parentheses.java)
+- [PlusOne](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/PlusOne.java)
+- [MinStack](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/MinStack.java)
 
 ### Medium
 
+
 - [ValidSudoku](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/ValidSudoku.java)
 - [GroupAnagrams](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/GroupAnagrams.java)
+- [NumberOfIslands](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/NumberOfIslands.java)
+- [SearchA2DMatrixII](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/SearchA2DMatrixII.java)
+- [ValidSudoku](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/ValidSudoku.java)
+- [GroupAnagrams](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/GroupAnagrams.java)
+- [NumberOfIslands](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/NumberOfIslands.java)
+- [SuperUglyNumber](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/SuperUglyNumber.java)
+- [MaximumProductOfWordLengths](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/MaximumProductOfWordLengths.java)
+- [SummaryRanges](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/SummaryRanges.java)
+- [MinimumHeightTree](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/MinimumHeightTree.java)
+- [CloneGraph](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/CloneGraph.java)
+
 
 ### Hard
 
-- [SudokuSolver](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/hard/SudokuSolver.java)
+- [SudokuSolver](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/hard/SudokuSolver.java)

bin/README.md

@@ -0,0 +1,31 @@
+[![Build Status](https://travis-ci.org/pratikpalashikar/leetcode-solutions.svg?branch=master)](https://travis-ci.org/pratikpalashikar/leetcode-solutions)
+
+# leetcode-solutions
+Stop thinking start contributing to leetcode solution
+
+
+## Solution Lists
+
+### Easy 
+
+- [JewelsNStones](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/JewelsNStones.java)
+- [ValidAnagram](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/ValidAnagram.java)
+- [FindAllAnagramsInString](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/FindAllAnagramsInString.java)
+- [TransposeMatrix](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/TransposeMatrix.java)
+- [LowerCase](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/LowerCase.java)
+- [HammingDistance](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/HammingDistance.java)
+- [MiddleElementInLinkedList](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/MiddleElement.java)
+- [JudgeCircle](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/JudgeCircle.java)
+- [Parentheses](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/Parentheses.java)
+- [PlusOne](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/PlusOne.java)
+- [MinStack](https://github.com/pratikpalashikar/leetcode-solutions/blob/master/src/main/java/com/techmisal/easy/MinStack.java)
+
+### Medium
+
+- [ValidSudoku](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/ValidSudoku.java)
+- [GroupAnagrams](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/GroupAnagrams.java)
+- [NumberOfIslands](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/medium/NumberOfIslands.java)
+
+### Hard
+
+- [SudokuSolver](https://github.com/harmishlakhani/leetcode-solutions/blob/master/src/main/java/com/techmisal/hard/SudokuSolver.java)

pom.xml

@@ -15,6 +15,12 @@
             <artifactId>junit</artifactId>
             <version>4.12</version>
         </dependency>
+        <dependency>
+            <groupId>org.junit.jupiter</groupId>
+            <artifactId>junit-jupiter-api</artifactId>
+            <version>RELEASE</version>
+            <scope>test</scope>
+        </dependency>
     </dependencies>
 
 
@@ -41,4 +47,4 @@
     </build>
 
 
-</project>
+</project>

src/main/java/com/techmisal/easy/HammingDistance.java

@@ -0,0 +1,45 @@
+package com.techmisal.easy;
+
+
+/*
+
+The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
+
+Given two integers x and y, calculate the Hamming distance.
+
+Note:
+0 ≤ x, y < 231.
+
+Example:
+
+Input: x = 1, y = 4
+
+Output: 2
+
+Explanation:
+1   (0 0 0 1)
+4   (0 1 0 0)
+       ↑   ↑
+
+The above arrows point to positions where the corresponding bits are different.
+
+*/
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class HammingDistance {
+
+    public int hammingDistance(int x, int y) {
+
+
+
+            return Integer.bitCount(x^y);
+
+
+    }
+
+
+
+
+}

src/main/java/com/techmisal/easy/JudgeCircle.java

@@ -0,0 +1,55 @@
+package com.techmisal.easy;
+
+/*
+
+    Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.
+
+The move sequence is represented by a string. And each move is represent by a character. The valid robot moves are R (Right), L (Left), U (Up) and D (down). The output should be true or false representing whether the robot makes a circle.
+
+Example 1:
+Input: "UD"
+Output: true
+Example 2:
+Input: "LL"
+Output: false
+
+
+ */
+
+
+
+public class JudgeCircle {
+
+
+    public boolean judgeCircleMethod(String moves) {
+
+
+
+        int X=0;
+        int Y=0;
+
+
+        for(int i=0;i<moves.length();i++){
+
+           if(moves.charAt(i)=='U')
+                X++;
+            if(moves.charAt(i)=='D')
+                X--;
+            if(moves.charAt(i)=='L')
+                Y--;
+            if(moves.charAt(i)=='R')
+                Y++;
+
+        }
+
+        if(X==0 && Y==0){
+            return true;
+        }
+
+
+        return false;
+
+    }
+
+
+}

src/main/java/com/techmisal/easy/MiddleElement.java

@@ -0,0 +1,66 @@
+package com.techmisal.easy;
+
+/*
+
+Given a non-empty, singly linked list with head node head, return a middle node of linked list.
+
+If there are two middle nodes, return the second middle node.
+
+
+
+Example 1:
+
+Input: [1,2,3,4,5]
+Output: Node 3 from this list (Serialization: [3,4,5])
+The returned node has value 3.  (The judge's serialization of this node is [3,4,5]).
+Note that we returned a ListNode object ans, such that:
+ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.
+Example 2:
+
+Input: [1,2,3,4,5,6]
+Output: Node 4 from this list (Serialization: [4,5,6])
+Since the list has two middle nodes with values 3 and 4, we return the second one.
+
+
+Note:
+
+The number of nodes in the given list will be between 1 and 100.
+
+
+ */
+
+
+class ListNode {
+      int val;
+      ListNode next;
+      ListNode(int x) { val = x; }
+
+}
+
+public class MiddleElement {
+
+    public ListNode middleNode(ListNode head) {
+
+        if(head==null){
+            return head;
+        }
+
+        if(head.next == null){
+            return head;
+        }
+
+
+
+        ListNode slow = head;
+        ListNode fast = head;
+
+        while(fast!=null && fast.next!=null){
+            slow = slow.next;
+            fast = fast.next.next;
+        }
+
+
+        return slow;
+
+    }
+}

src/main/java/com/techmisal/easy/MinStack.java

@@ -0,0 +1,69 @@
+package com.techmisal.easy;
+
+import java.util.Stack;
+
+
+/*
+
+
+Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
+
+push(x) -- Push element x onto stack.
+pop() -- Removes the element on top of the stack.
+top() -- Get the top element.
+getMin() -- Retrieve the minimum element in the stack.
+Example:
+MinStack minStack = new MinStack();
+minStack.push(-2);
+minStack.push(0);
+minStack.push(-3);
+minStack.getMin();   --> Returns -3.
+minStack.pop();
+minStack.top();      --> Returns 0.
+minStack.getMin();   --> Returns -2.
+
+
+*/
+
+public class MinStack {
+
+    int min = Integer.MAX_VALUE;
+
+    public Stack<Integer> stack = new Stack<Integer>();
+
+
+    public void pop() {
+
+
+        if (stack.pop() == min) {
+
+            min = stack.pop();
+
+        }
+
+    }
+
+
+    public void push(int x) {
+
+        if (x <= min) {
+            stack.push(min);
+            min = x;
+        }
+
+        stack.push(x);
+
+    }
+
+
+    public int getMin() {
+
+        return min;
+    }
+
+
+    public int top() {
+
+        return stack.peek();
+    }
+}