Sunny Gonnabathula sunny-g

Studying for a Tech Interview Sucks, so Here's a Cheat Sheet to Help

This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.

Data Structure Basics

###Array ####Definition:

Stores data elements based on an sequential, most commonly 0 based, index.
Based on tuples from set theory.

System Design Cheatsheet

Step One: Framing The Problem a.k.a get the MVP

Identify the use cases that are in scope
Determine constraints based on scoped use cases

use case : the things your system needs to be do.

constraints : the things your system will have to consider to be able to do stuff

How to Cross Compile LLVM: https://llvm.org/docs/HowToCrossCompileLLVM.html
Building LLVM with CMake: https://llvm.org/docs/CMake.html
Hints from wasi-sdk Makefile: https://github.com/CraneStation/wasi-sdk/blob/master/Makefile
Try compiling natively (needed for llvm-tblgen and clang-tblgen)
- cmake -G Ninja -DCMAKE_BUILD_TYPE=Release -DLLVM_TARGETS_TO_BUILD="X86;WebAssembly" -DLLVM_ENABLE_PROJECTS="lld;clang" ../llvm
Try building LLVM with WASI:
cmake -G Ninja -DCMAKE_AR=”/usr/local/google/home/binji/dev/llvm-project/build/bin/llvm-ar” -DCMAKE_RANLIB=”/usr/local/google/home/binji/dev/llvm-project/build/bin/llvm-ranlib” -DCMAKE_C_COMPILER="/usr/local/google/home/binji/dev/wasi-sdk-5.0/opt/wasi-sdk/bin/clang" -DCMAKE_CXX_COMPILER="/usr/local/google/home/binji/dev/wasi-sdk-5.0/opt/wasi-sdk/bin/clang++" -DCMAKE_CROSSCOMPILING=True -DCMAKE_INSTALL_PREFIX=/usr/local/google/home/binji/dev/wasi-clang -DLLVM_TABLEGEN=/usr/local/google/home/binji/dev/llvm-project/build/bin/llvm-tblgen -DCLANG_TABLEGEN=/

This Gist provides a solution to periodically capture screenshots of your Mac, and create therefrom a searchable PDF archive so that you can always get an answer to the “what, when, and where” questions about your usages.

To use these scripts:

Download the shell script rewind, then:
1. put it under ~/bin (or other fixed path you prefer);
2. execute

HOC's Fast Discrete Program Search (DPS)

HOC will soon (EOY?) launch an API for our DPS solution. The interface will be simple:

You give us a set of examples (input/output pairs)
We'll give you a (Python?) function that models it

And that's it. It will be an universal function finder.

Accelerating Discrete Program Search

I am investigating how to use Bend (a parallel language) to accelerate Symbolic AI; in special, Discrete Program Search. Basically, think of it as an alternative to LLMs, GPTs, NNs, that is also capable of generating code, but by entirely different means. This kind of approach was never scaled with mass compute before - it wasn't possible! - but Bend changes this. So, my idea was to do it, and see where it goes.

Now, while I was implementing some candidate algorithms on Bend, I realized that, rather than mass parallelism, I could use an entirely different mechanism to speed things up: SUP Nodes. Basically, it is a feature that Bend inherited from its underlying model ("Interaction Combinators") that, in simple terms, allows us to combine multiple functions into a single superposed one, and apply them all to an argument "at the same time". In short, it allows us to call N functions at a fraction of the expected cost. Or, in simple terms: why parallelize when we can sha

	/**
	* Base contract that all upgradeable contracts should use.
	*
	* Contracts implementing this interface are all called using delegatecall from
	* a dispatcher. As a result, the _sizes and _dest variables are shared with the
	* dispatcher contract, which allows the called contract to update these at will.
	*
	* _sizes is a map of function signatures to return value sizes. Due to EVM
	* limitations, these need to be populated by the target contract, so the
	* dispatcher knows how many bytes of data to return from called functions.

	#![allow(clippy::identity_op)]
	#![allow(dead_code)]
	#![allow(non_snake_case)]

	use std::collections::{hash_map, HashMap};
	use std::collections::hash_map::DefaultHasher;
	use std::hash::{Hash, Hasher};

	use rand::prelude::*;
	use std::time::Instant;

	// Copy-paste into your console (or minify and save as a bookmarklet) to see any DOM in an almost-sorta-working 3D stack of DOM elements.
	// The front faces are colored for debugging, if this gist can be fixed, they can return to their normal styling.
	(function () {
	const MAX_ROTATION = 180;
	const DEPTH_INCREMENT = 25;
	const PERSPECTIVE = 1000;
	const SIDE_FACE_CLASS = 'side-face';
	const MAX_DOM_DEPTH = getMaxDepth(document.body);

	// Calculate color based on depth, ensuring lighter colors for deeper elements