aershov24

INCR id:users
HMSET users {id} '{"name":"Fred","age":25}'

aershov24

INCR id:users
HMSET user:{id} name "Fred" age 25
SADD users {id}

aershov24

INCR id:users
SET user:{id} '{"name":"Fred","age":25}'
SADD users {id}

aershov24

INCR id:users
SET user:{id}:name "Fred"
SET user:{id}:age 25
SADD users {id}

aershov24

long x = long.MinValue;
public long ID(){
   return Interlocked.Increment(ref x);
}

aershov24

 private static long fibonacci(int n) {
     double pha = pow(1 + sqrt(5), n);
     double phb = pow(1 - sqrt(5), n);
     double div = pow(2, n) * sqrt(5);

     return (long)((pha - phb) / div);
 }

aershov24

const sqrt = Math.sqrt;
const pow = Math.pow;

const fibCalc = n => Math.round(
  (1 / sqrt(5)) *
  (
    pow(((1 + sqrt(5)) / 2), n) -
    pow(((1 - sqrt(5)) / 2), n)
  )
);

aershov24

class Solution(object):
    def reverseList(self, head):  # Recursive
        """
        :type head: ListNode
        :rtype: ListNode
        """     
        if not head or not head.next:
            return head
        p = self.reverseList(head.next)
        head.next.next = head

aershov24

def BinaryTreeToDLL(self, node):    
    #Checks whether node is None    
    if(node == None):    
        return;    
            
    #Convert left subtree to doubly linked list    
    self.BinaryTreeToDLL(node.left);    
        
    #If list is empty, add node as head of the list    
    if(self.head == None):    

aershov24

function fibonacci(num, memo) {
  memo = memo || {};

  if (memo[num]) return memo[num];
  if (num <= 1) return 1;

  return memo[num] = fibonacci(num - 1, memo) + fibonacci(num - 2, memo);
}