- Download the (base) ISO image and create a bootable flash drive
- Figure out the disk's name on your system; be careful to get this correct
otherwise you can very easily destory your current system
- on Linux, use
lsblk
to figure out which disk to use - on MacOS, use
diskutil list
to figure out which disk to use
- on Linux, use
- Figure out the disk's name on your system; be careful to get this correct
otherwise you can very easily destory your current system
- make sure you use the disk name, not a partition
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
" Do not use Vi compatibility settings | |
set nocompatible | |
" Use utf-8 if Vim was compliled with multi-byte support | |
if has("multi_byte") | |
if &termencoding == "" | |
let &termencoding = &encoding | |
endif | |
set encoding=utf-8 | |
setglobal fileencoding=utf-8 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# `dream_time` returns the amount of dream time elapsed in a dream at `level_depth` | |
# under a sedative factor of `sedative_factor` while sleeping for `base_time` amount | |
# of time. The units of `base_time` are seconds, and the returned dream time is also | |
# in seconds, which can be converted as desired. | |
# | |
# Tested with the dream time calculations in Inception (the movie). | |
# e.g. the sedative made by Yusuf apparently has a factor of 20. | |
def dream_time(base_time, level_depth, sedative_factor): | |
factor = 0 | |
for i in range(1, level_depth+1): |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
* Dynamic programming practice question - Longest Increasing Subsequence (LIS) | |
*/ | |
#include <map> | |
#include <vector> | |
#include <utility> | |
#include "utils.h" |
I hereby claim:
- I am navaz-alani on github.
- I am navaz (https://keybase.io/navaz) on keybase.
- I have a public key ASCCXEKWn8gwQF6maSsfrzNWNmuQLnbZNxsZsXpo_UjwzAo
To claim this, I am signing this object: