mailpraveens

def calculateLevenSteninDistance(a,b):
    if not a: return len(b)
    if not b: return len(a)
    return min(calculateLevenSteninDistance(a[1:], b[1:])+(a[0] != b[0]), calculateLevenSteninDistance(a[1:], b)+1, calculateLevenSteninDistance(a, b[1:])+1)

mailpraveens

#include<iostream>
#include <list>
using namespace std;

class Graph {
    int V;
    list <int> * adj;
    void DFSUtil(int v, bool visited[]);  // A function used by DFS
    
    

mailpraveens

#include <iostream>
using namespace std;
#include <stdlib.h>     /* qsort */

int compare (const void * a, const void * b) {
  return ( *(int*)a - *(int*)b );
}

int main()
{

mailpraveens

#include <iostream>
using namespace std;
#include <stdlib.h>     /* qsort */

int compare (const void * a, const void * b) {
    return ( *(int*)a - *(int*)b );
}

int main4()
{

mailpraveens

static inline BOOL checkIfEmpty(id obj) {
	return thing == nil || 
	([obj respondsToSelector:@selector(length)] && [(NSData *)obj length] == 0) ||
	([obj respondsToSelector:@selector(count)] && [(NSArray *)obj count] == 0);
}

mailpraveens

// Use Gists to store code you would like to remember later on
console.log(window); // log the "window" object to the console