Skip to content

Instantly share code, notes, and snippets.

View Shekharrajak's full-sized avatar
📚
Being Geek!

Shekhar Prasad Rajak Shekharrajak

📚
Being Geek!
150 followers · 92 following
View GitHub Profile
@vladshablinsky
vladshablinsky / results.md
Last active December 27, 2016 11:20
GSoC 2016 Homebrew results
@karpathy
karpathy / pg-pong.py
Created May 30, 2016 22:50
Training a Neural Network ATARI Pong agent with Policy Gradients from raw pixels
""" Trains an agent with (stochastic) Policy Gradients on Pong. Uses OpenAI Gym. """
import numpy as np
import cPickle as pickle
import gym
# hyperparameters
H = 200 # number of hidden layer neurons
batch_size = 10 # every how many episodes to do a param update?
learning_rate = 1e-4
gamma = 0.99 # discount factor for reward
@steinwaywhw
steinwaywhw / One Liner to Download the Latest Release from Github Repo.md
Last active December 7, 2025 18:20
One Liner to Download the Latest Release from Github Repo
  • Use curl to get the JSON response for the latest release
  • Use grep to find the line containing file URL
  • Use cut and tr to extract the URL
  • Use wget to download it
curl -s https://api.github.com/repos/jgm/pandoc/releases/latest \
| grep "browser_download_url.*deb" \
| cut -d : -f 2,3 \
| tr -d \" \
@dufferzafar
dufferzafar / gsoc-2016-projects.csv
Last active October 5, 2020 06:12
All GSoC 2016 Projects! Generated using the script here: https://gist.github.com/dufferzafar/4018277a08d3f6de9e74f11a3f913e78
Project Title Student Display Name Organization Name Mentors
Key mapping GUI Tomasito665 Mixxx DJ Software RJ Ryan, Ferran Pujol Camins
YAPDNS system64 The Honeynet Project Pietro Delsante, Fedele Mantuano, Andrea De Pasquale
FFv1 P frame support sdolganov FFmpeg Reynaldo Verdejo, michaelni
coala: Integrating coala with the Eclipse IDE Sheikh Araf Python Software Foundation Harsh Dattani, Lasse Schuirmann (sils1297), AbdealiJKothari
User interfaces for Tracker Dilushi Sustainable Computing Research Group ( SCoRe ) Dinith Minura, Namal Jayasuriya, Rumesh
File Support izgzhen Mozilla Manishearth
KolibriOS. Development of TLS/SSL library DenisKarpenko KolibriOS Jeffrey A., Pathoswithin
IPFS friendly & distributed version of Amber skbly7 Berkman Center for Internet and Society Genève
Cache layer for jpf-nhandler Jayton Java Pathfinder Team franck, Nastaran, Cyrille Artho
@rupl
rupl / sw-font-load.js
Created December 7, 2015 11:54
Use Service Worker to load fonts async/direct via client-side logic.
// Load fonts async by default
// Load sync from SW cache when available.
//
// Snippet assumes your Service Worker caches fonts as part of installation, so that
// an 'activated' Service Worker means the fonts are cached with 100% confidence.
if (
'serviceWorker' in navigator &&
navigator.serviceWorker.controller !== null &&
navigator.serviceWorker.controller.state === 'activated'
) {
@Shekharrajak
Shekharrajak / hermite.py
Created October 24, 2015 07:24 — forked from cheery/first_fundamental_form.py
Sympy funnies & Cubic hermite
from sympy import *
# https://www.rose-hulman.edu/~finn/CCLI/Notes/day09.pdf
a0, a1, a2, a3, t = symbols('a0 a1 a2 a3 t')
polynomial = a0 + a1*t + a2*t**2 + a3*t**3
polynomial_d = diff(polynomial, t)
p0, v0, p1, v1 = symbols('p0 v0 p1 v1')
@Shekharrajak
Shekharrajak / SVG-circular-progress:-CSS-animated-&-Angle-gradient-.markdown
Created November 12, 2014 13:50 — forked from anonymous/SVG-circular-progress:-CSS-animated-&-Angle-gradient-.markdown
@ivycheung1208
ivycheung1208 / graph.h.cpp
Created July 12, 2014 05:36
DFS and BFS in directed graph
/* Implement a directed graph using adjacency list representation
* Depth First Traversal for a Graph: http://www.geeksforgeeks.org/depth-first-traversal-for-a-graph/
* Breadth First Traversal for a Graph http://www.geeksforgeeks.org/breadth-first-traversal-for-a-graph/
* Connectivity in a directed graph: http://www.geeksforgeeks.org/connectivity-in-a-directed-graph/
*/
#ifndef GRAPH_H
#define GRAPH_H
#include <iostream>
@mycodeschool
mycodeschool / FindMergePointOfLinkedList.cpp
Last active February 22, 2025 13:38
#include<iostream>
#include<cstdlib>
#include<set>
using namespace std;
struct Node {
int data;
struct Node *next;
};
int length(struct Node *head) {
@mycodeschool
mycodeschool / BSTDeletion_CPP.cpp
Last active September 25, 2025 20:04
/* Deleting a node from Binary search tree */
#include<iostream>
using namespace std;
struct Node {
int data;
struct Node *left;
struct Node *right;
};
//Function to find minimum in a tree.
Node* FindMin(Node* root)