Skip to content

Instantly share code, notes, and snippets.

View colleowino's full-sized avatar
🤹
Jest all the things

Cliff Owino colleowino

🤹
Jest all the things
View GitHub Profile
@jexchan
jexchan / multiple_ssh_setting.md
Created April 10, 2012 15:00
Multiple SSH keys for different github accounts

Multiple SSH Keys settings for different github account

create different public key

create different ssh key according the article Mac Set-Up Git

$ ssh-keygen -t rsa -C "[email protected]"

tmux cheatsheet

As configured in my dotfiles.

start new:

tmux

start new with session name:

@tsabat
tsabat / zsh.md
Last active October 16, 2024 14:43
Getting oh-my-zsh to work in Ubuntu
@pksunkara
pksunkara / config
Last active April 15, 2025 17:32
Sample of git config file (Example .gitconfig) (Place them in $XDG_CONFIG_HOME/git)
[user]
name = Pavan Kumar Sunkara
email = [email protected]
username = pksunkara
[init]
defaultBranch = master
[core]
editor = nvim
whitespace = fix,-indent-with-non-tab,trailing-space,cr-at-eol
pager = delta
@jwickett
jwickett / LCS.py
Created January 2, 2010 10:12
Dynamic programming algorithm using memoization to solve for the Longest Common Subsequence (LCS) written in Python
def computeLCS(master, subseq):
"""
Wrapper method to compute the Longest Common Subsequence in an inputed master string given an inputed proposed subsequence string.
Note that the length of the 'subseq' string parameter must be less than or equal to the length of the 'master' string parameter.
This dynamic programming algorithm runs in O(n^2) time where n is the length of the 'master' string parameter.
The total space required is O(n^2) due to the memoization step.
"""
memoized = LCSLength(master, subseq)