mailpraveens’s gists

mailpraveens / 0_reuse_code.js

Last active August 29, 2015 14:08

Here are some things you can do with Gists in GistBox.

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

mailpraveens / checkEmptyObject

Created August 20, 2014 11:15

Small snipped to check if a NSString, NSArray or any collection is empty, works for nil objects too.

	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 / AugustChallenge1.cpp

Created August 10, 2014 13:01

	#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 / GameOfSurvival.cpp

Last active August 29, 2015 14:05

Hackerrank problem from url http://www.hackerearth.com/september-rush/algorithm/game-of-survival/

	#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 / BFSandDFS.cpp

Created August 3, 2014 15:47

BFS and DFS implementation in C++

	#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 / levenshteinDistance.py

Created March 21, 2014 08:02

Recursive program to find the levenshtein distance between two strings

	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 / FindMergePointLinkedLists.py

Created March 20, 2014 15:20

Find the merge point of two linked list

	def findDivergePointForOfTwoLinkedLists(list1, list2):
	# Assuming the list class has a method length to give the length of the list
	lengthList1 = list1.length()
	lengthList2 = list2.length()
	differnce = lengthList2 - lengthList1
	if(lengthList2>=lengthList1):
	while(differnce!=0):
	list2 = list2.next
	differnce -= 1

mailpraveens / findLCA.py

Created March 20, 2014 14:13

Find the Lowest Common Ancestor of Binary Search Tree

	def findLCA(node,value1,value2):
	if(node == None):
	return None
	#move to right if values are greater
	if(node.value < value1 and node.value < value2):
	return findLCA(node.right,value1, value2)
	#move to left if values are smaller
	if(node.value > value1 and node.value > value2):
	return findLCA(node.left,value1, value2)
	# Whereever it diverges, return the node as its the LCA

mailpraveens / printCounterClockwiseBinaryTree.py

Created March 20, 2014 12:07

Print a binary tree counter clock wise

mailpraveens / heapify.py

Created March 20, 2014 12:03

Heapify method which can be used in heap sort

	#max heap construction
	def heapify(items,idx):
	left = leftChild(idx)
	right = rightChild(idx)
	largest = -1
	if(left < len(items) and items[left] > items[idx]):
	largest = left
	else:
	largest = idx

Praveen mailpraveens