sukeesh

🌞 Morning    68 commits  ██████▍░░░░░░░░░░░░░░  30.9%
🌆 Daytime    49 commits  ████▋░░░░░░░░░░░░░░░░  22.3%
🌃 Evening    88 commits  ████████▍░░░░░░░░░░░░  40.0%
🌙 Night      15 commits  █▍░░░░░░░░░░░░░░░░░░░   6.8%

sukeesh

🏆 473 Contributions in year 2020
📦 Used 178 MB in GitHub's Storage
📜 53 Public Gists
🔑 1 Public Keys
🚫 Not opted to Hire

sukeesh

#include <bits/stdc++.h>
#include <sstream>

using namespace std;

void generate_sieve(int n){
	bool isPrime[n + 1];
	memset(isPrime, 1, sizeof(isPrime));

	isPrime[0] = 0;

sukeesh

package main

import(
	"strconv"
	"os"
)

func generate_sieve(n int) {
	isPrime := make([]bool, n + 1)
	for i, _ := range (isPrime) {isPrime[i] = true}

sukeesh

Keybase proof

I hereby claim:

• I am sukeesh on github.
• I am sukeesh (https://keybase.io/sukeesh) on keybase.
• I have a public key ASD9tOqDByQipmNSGDNHoiu1w6SvTXFOjKncOeDjItv4Swo

To claim this, I am signing this object:

sukeesh

#include <iostream>

using namespace std;

int *go(int x){
    int y = 0;
    if (x == 1){
        return &y;  // Address of stack memory associated with local variable 'y' is returned
    }
    int *val = go(x - 1);

sukeesh

#include <stdlib.h> 

int main ()
{
    int * buffer1, * buffer2, * buffer3;
    buffer1 = (int*) malloc (100*sizeof(int));
    buffer2 = (int*) calloc (100,sizeof(int));
    buffer3 = (int*) realloc (buffer2,500*sizeof(int));
    free (buffer1);
    free (buffer3);

sukeesh

#include <iostream>

using namespace std;

int add(int a, int b){
  int sum = a + b;
  return sum;
}

int main(){

sukeesh

#include <iostream>

using namespace std;

const int TABLE_SIZE = 5;

class LinkedHash
{
public:
    int key, val;

sukeesh

#include <iostream>

using namespace std;

const int TABLE_SIZE = 128;

class HashEntry
{
public:
    int key;