mustafa-qamaruddin

class Solution {
  
    private class Pair implements Comparable<Pair> {
      private int a;
      private int b;
      public Pair(int a, int b) {
        this.a = a;
        this.b = b;
      }
      public int a() { return a;}

mustafa-qamaruddin

class Solution {
  
  private int[] calcDiff(char[] chars) {
    int[] diffs = new int[chars.length-1];
    for(int i = 0; i < chars.length - 1; i++) {
      diffs[i] = chars[i+1] - chars[i];
    }
    return diffs;
  }
  

mustafa-qamaruddin

class Solution {

  public String reverseString(String input) {
    return new StringBuffer(input).reverse().toString();
  }

  public boolean isPalindrome(String str) {
    if (str.length() == 0) return false;
    if (str.length() == 1) return true;

mustafa-qamaruddin

 
public class Solution {
    private int popCount(int x) {
        int count;
        for (count = 0; x != 0; ++count) {
            x &= x - 1; // zeroing out the least significant nonzero bit
        }
        return count;
    }
 

mustafa-qamaruddin

class Trie {

    TrieNode root;

    public Trie() {
        root = new TrieNode();
    }

    public TrieNode getRoot() {
        return root;

mustafa-qamaruddin

# create account
mutation createAccount($value:AccountInput!) {
  createAccount(value:$value)
    {
        id
        instanceId
    }
}

mustafa-qamaruddin

# create account.1
mutation createAccount($value:AccountInput!) {
  createAccount(value:$value)
    {
        id
        instanceId
    }
}

{

mustafa-qamaruddin

# run a find on pair

# add a pair
mutation upsert($values:HypiUpsertInputUnion!) {
  upsert(values:$values){
    id
  }
}
{
  "values": {

mustafa-qamaruddin

mutation createAccount($value:AccountInput!) {
  createAccount(value:$value)
    {
        id
        instanceId
    }
}


{

mustafa-qamaruddin

# create some data

mutation upsert($values:HypiUpsertInputUnion!) {
  upsert(values:$values){
    id
  }
}
{
  "values": {
    "Pair": {