Merge remote-tracking branch 'origin/master'

Author: gkcs

CNAME

@@ -0,0 +1 @@
+gkcs.tech

README.md

@@ -0,0 +1,9 @@
+# Competitive-Programming
+
+This project is contains data structures and algorithms relevant to competitive programming problems. Some of these data structures can be used with a copy/paste. Others may need tweaking or modification for custom use.
+
+The package src/videos contains all code relevant to the youtube videos on https://www.youtube.com/channel/UCRPMAqdtSgd0Ipeef7iFsKw
+
+Feel free to contribute, fork and discuss the code here on Github, the channel or Facebook (https://www.facebook.com/gkcs0).
+
+Cheers!

_config.yml

@@ -0,0 +1 @@
+theme: jekyll-theme-modernist

src/main/java/main/java/videos/GCD.java

@@ -28,6 +28,12 @@ private static int iterativeGcd(int a, int b) {
  }
 
  private static int binaryGcd(int a, int b) {
+if (a < b) {
+int tempSwap = a;
+a = b;
+b = tempSwap;
+}
+
  if (b == 0) {
  return a;
  }

src/main/java/main/java/videos/Tries.java

@@ -14,6 +14,7 @@ public static void main(String[] args) {
  final Trie trie = new Trie();
  setOfStrings.forEach(trie::insert);
  System.out.println(trie.query("psst"));
+ System.out.println(trie.query("psstq"));
  trie.update("qqrs", "psst");
  System.out.println(trie.query("qqrs"));
  System.out.println(trie.query("psst"));
@@ -30,10 +31,11 @@ public Trie() {
  public int query(final String s) {
  TrieNode current = root;
  for (int i = 0; i < s.length(); i++) {
- if (current == null) {
- return 0;
- }
- current = current.next(s.charAt(i));
+ if(current==null || current.next(s.charAt(i))==null) {
+return 0;
+}
+else
+current=current.next(s.charAt(i));
  }
  return current.terminating;
  }