awesmubarak

Keybase proof

I hereby claim:

• I am awesmubarak on github.
• I am awesmubarak (https://keybase.io/awesmubarak) on keybase.
• I have a public key whose fingerprint is 534F 38B8 0D40 78D7 4B81 1DB2 9CD5 FE08 B479 D538

To claim this, I am signing this object:

awesmubarak

Pre-release files

This file contains all provided documentation for the exams. I'd recommend [downloading everything][download link] and saving it locally. Unzip the file using [7-zip][] or similar.

Table of contents:

1. [EAD][ead]
2. [Raw data][raw data]

awesmubarak

Notes for 2017 AS-Level Computer Science Skeleton program (VB)

Table of contents

1. Flowchart
2. Prerelease commentary
3. Key components
4. Important snippets

awesmubarak

#!/usr/bin/python3

import requests
import threading
from faker import Faker
from faker.providers import credit_card, phone_number, address, date_time, bank
from stem import Signal
from stem.control import Controller

awesmubarak

See https://github.com/joshdick/onedark.vim

  blue   = '#61AFEF',
  cyan   = '#56B6C2',
  black  = '#282C34',
  white  = '#ABB2BF',
  red    = '#E06C75',
  violet = '#C678DD',
 yellow = '#E5C07B',

awesmubarak

Soylent's removed this page from their website, but I used the notion web clipper on it a while back. The old link was:

https://soylent.com/blog/post/148000076992/proudly-made-with-gmos

---

As a society, we struggle to satisfy the global demand for food. One in nine people across the globe suffer from hunger, and in order to keep pace with the rate of population growth, we will need to be able to produce [70 percent more food by 2050](https://t.umblr.com/redirect?z=http%3A%2F%2Fwww.fao.org%2

awesmubarak

def find_missing(n_list):
    """Finds first missing number from list."""
    # At bottom of search
    if len(n_list) == 2:
        # If there were no missing numbers we're at the rightmost part. The
        # numbers will still in be in sequence, 1 apart. We find the max
        # between the lowest missing number and `1` to account for the lowest
        # missing number being below zero.
        if n_list[0] + 1 == n_list[1]:
            return max(n_list[1] + 1, 1)

awesmubarak

#include <stdio.h>

char* solution(int T) {
    int h, m, s;
    char *time_str;
   
    h = (T/3600);
    m = (T - (3600 * h)) / 60;
    s = (T - (3600 * h) - (60 * m));