Skip to content

Instantly share code, notes, and snippets.

View girishkvs's full-sized avatar

Venkata Sai Girish Konda girishkvs

View GitHub Profile
04f6b145eacc69a769a91f9f8a4f20a3eb065048e6ca944b31d5cba7c720406b289c00e2893f2ff6ff5d9cbce1159a00e1ddaa36b4b96cc43270327a5641311b1a
@girishkvs
girishkvs / Splay Tree
Created February 24, 2013 17:13
This is a c++ program for data structure splay tree
#include<iostream>
using namespace std;
class splay
{
private:
int val;
splay *left;
splay *right;
@girishkvs
girishkvs / part01.rb
Created August 5, 2012 14:25 — forked from dmalikov/part01.rb
SAAS homework 1
def palindrome? (string)
filtered = string.downcase.gsub(/\W/,'')
filtered.reverse == filtered
end
def count_words (sentence)
words = sentence.downcase.split(/\W/)
result = {}
words.uniq.select{ |w| !w.empty? }.each do |e|
result.store(e, words.count(e))
@girishkvs
girishkvs / cartesian.rb
Created August 5, 2012 13:22 — forked from andrewdavidcostello/cartesian.rb
SaaS-Class: Homework 2
class CartesianProduct
include Enumerable
def initialize(a,b)
@values = []
@values = a.product(b) unless b.empty?
end
def each(&block)
@values.each {|v| yield v}