focks

Keybase proof

I hereby claim:

• I am focks on github.
• I am ichandan (https://keybase.io/ichandan) on keybase.
• I have a public key ASBunnD5ePkDSBC5qaJ9S73-7ZPm97H86_5j-2XNnwG8Wgo

focks

Go Cheatsheet

Read String from standard input

import (
  "bufio"
  "os"
)

reader := bufio.NewReader(os.Stdin)

focks

#include <stdlib.h>
#include <stdio.h>
#include <sys/ipc.h>
#include <sys/shm.h>


static int A[1001][1001], B[1001][1001];
int shmbuf;
key_t key;
int (*ans)[1001];

focks

#!/usr/bin/python
import requests
import uuid

url = "http://jenkins:8080/credentials/store/system/domain/_/createCredentials"
def create_credential(credentials):
  """:param: credentials: format should be 
  {
      "scope": "GLOBAL", 
      "username": "adaikal", 

focks

Graphs

• Graph Problem 1
• Graph Coloring

DP

• A Variation of Matrix Chain Multiplication
• Number of subsequences with GCD 1

focks

### Graph Algoritms (Implementations)

- Articulation Points
- Union Find (Disjoint Set DS) cycle detection
- kruskal minimum spanning tree

focks

void insertionSort(vector<int> &A){
    int n = A.size();
    int j, key;
    for(int i=1;i<n;i++){
        j = i-1;
        key = A[i]; 
        while(j>=0 and A[j] > key){
            A[j+1] = A[j];
            j--;
        }

focks

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
int Solution::lPalin(ListNode* A) {
    ListNode* ptr = A;

focks

ListNode* Solution::getIntersectionNode(ListNode* A, ListNode* B) {
    /*  find length of both the lists 
     *  Advance the pointer of longest list to a node such that the distance becomes equal to that of the smaller list
     *  update the pointers of both the lists by one and check for match
     */
    ListNode *list_one = A;
    ListNode *list_two = B;

    int len1=0;
    int len2=0;

focks

vector<int> Solution::spiralOrder(const vector<vector<int> > &A) {
    vector<int> ret;
    int m = A.size();
    int n = A[0].size();

    int i=0, j=0;
    while(i<=m and j<=n){
        /* --- left ---- */
        if(i<m){
            for(int left=j;left<n;left++)