Here's a simple step by step to create an alerter plugin on Azkaban, unfortunately the documentation doesn't cover that very well. I was able to put one together by going over the source code, hopefully it helps someone out there
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Camel Case problem. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Binary Search: Ice Cream Parlor problem. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void work
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Sorting: Bubble Sort problem. import java.io.*; import java.util.*; public class Solution { private static void work(int[] a) { int swaps = 0; int n = a.length; if (n == 0
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Time Complexity: Primality problem. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { private static boolean isPrime(int n
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Bit Manipulation: Lonely Integer problem. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static int lonelyInteger(int
Read More

Here's my Java solution for [HackerRank and Cracking the Code Interview's Trees: Is This a Binary Search Tree problem] (https://www.hackerrank.com/challenges/ctci-is-binary-search-tree). public class Solution { boolean checkBST(Node root) { return checkBST(root, Integer.MIN_VALUE, Integer.MAX
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Queues: A Tale of Two Stacks problem. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { private static class
Read More

Here's my Java solution for HackerRank and Cracking the Code Interview's Sorting: Comparator problem . I have no idea why this marked as a medium difficulty exercise, must be a mistake because it's so simple. I just finished this during a
Read More

Here's my Java solution for HackerRank - Cracking the Code Interview - Stacks: Balanced Brackets. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { private static List<Character>
Read More