Added 3 solutions

varunu28 · varunu28 · commit 003ae4fbc3d5 · 2018-11-29T16:32:52.000-08:00
diff --git a/GeeksForGeeks/Interview Questions/Microsoft/ImplementStackUsingLinkedList.java b/GeeksForGeeks/Interview Questions/Microsoft/ImplementStackUsingLinkedList.java
@@ -0,0 +1,39 @@
+class StackNode {
+	int data;
+	StackNode next;
+}
+
+class Stack_using_LinkedList {
+	 StackNode top;
+}
+
+class GfG {
+	/* The method push to push element into the stack */
+    void push(int a,Stack_using_LinkedList ob) {
+        StackNode curr = new StackNode();
+        curr.data = a;
+        curr.next = null;
+        
+        if (ob.top == null) {
+            ob.top = curr;
+        }
+        else {
+            curr.next = ob.top;
+            ob.top = curr;
+        }
+	}
+    /*The method pop which return the element poped out of the stack*/
+	int pop(Stack_using_LinkedList ob) {
+		//Your code here
+		StackNode curr = ob.top;
+		if (curr == null) {
+		    return -1;
+		}
+		
+		int data = ob.top.data;
+		ob.top = ob.top.next;
+		
+		return data;
+	}
+	
+}
diff --git a/GeeksForGeeks/Interview Questions/Microsoft/PrintAdjacencyList.java b/GeeksForGeeks/Interview Questions/Microsoft/PrintAdjacencyList.java
@@ -0,0 +1,49 @@
+import java.util.*;
+import java.lang.*;
+import java.io.*;
+
+import static java.lang.System.out;
+
+class GFG {
+	public static void main (String[] args) throws Exception {
+	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	    int t = Integer.parseInt(br.readLine().trim());
+	    
+	    while (t-- > 0) {
+	        String[] strs = br.readLine().split("\\s+");
+	        int v = Integer.parseInt(strs[0]);
+	        int e = Integer.parseInt(strs[1]);
+	        
+	        Map<Integer, LinkedHashSet<Integer>> map = new HashMap<>();
+	        
+	        while (e-- > 0) {
+	            strs = br.readLine().split("\\s+");
+	            int source = Integer.parseInt(strs[0]);
+	            int destination = Integer.parseInt(strs[1]);
+	            
+	            map.computeIfAbsent(source, k -> new LinkedHashSet<Integer>());
+	            map.computeIfAbsent(destination, k -> new LinkedHashSet<Integer>());
+	            
+	            map.get(source).add(destination);
+	            map.get(destination).add(source);
+	        }
+	        
+	        for (int i=0; i<v; i++) {
+	            StringBuilder sb = new StringBuilder();
+	            sb.append(i);
+	            
+	            if (!map.containsKey(i)) {
+	                System.out.println(sb.toString());
+	                continue;
+	            }
+	            
+	            Iterator<Integer> iterator = map.get(i).iterator();
+	            while (iterator.hasNext()) {
+	                sb.append("-> ").append(iterator.next());
+	            }
+	            
+	            System.out.println(sb.toString());
+	        }
+	    }
+	}
+}
diff --git a/GeeksForGeeks/Interview Questions/Microsoft/RunLengthEncoding.java b/GeeksForGeeks/Interview Questions/Microsoft/RunLengthEncoding.java
@@ -0,0 +1,21 @@
+class GfG {
+	String encode(String str) {
+        StringBuilder sb = new StringBuilder();
+        int idx = 0;
+        while (idx < str.length()) {
+            sb.append(str.charAt(idx));
+            idx++;
+            
+            int count = 1;
+            
+            while (idx < str.length() && str.charAt(idx) == str.charAt(idx - 1)) {
+                idx++;
+                count++;
+            }
+            
+            sb.append(count);
+        }
+        
+        return sb.toString();
+	}
+}
