Jun 15Announcing Omnichain LabsDecentralized Finance is a defining force in todays world. 31% of the world is unbanked, and the majority of investors in the first world are blocked from investing in high growth assets like private equity & early stage venture capital. DeFi is set to change this as one of the…2 min read

Mar 26Solana’s Savings Account ProtocolLending platforms are currently exploding on Solana with Solend hitting $1.1 Billion in total value locked (defillama.com). Solend excels as an underlying lending protocol which other DApps can build on top of. However, it is not designed for everyday users to interact with directly. Users who borrow on Solend must…5 min read

Feb 1, 2021Backpropagation in Neural Networks ExplainedBelow is an example of a feedforward neural network. Basically it takes the input image (picture of a handwritten 3) then represents the 3 as a vector in the input layer. Once it does this it performs a series of nonlinear transformations on that vector by using a neural networks…2 min read

Jan 25, 2019Cracking The Coding Interview Chapter 1 Solutions1. int product(int a, int b){ int sum = 0; for (int i = 0; i < b; i++){ sum += a; } return sum; } Runtime is O(b) since code is executed b times in a for loop 2. int power(int a, int b){ if (b <…Programming2 min read

Jan 3, 2019857. Minimum Cost to Hire K WorkersProblem Link:https://leetcode.com/problems/minimum-cost-to-hire-k-workers/description/ TRIVIAL SOLUTION: class Solution(object): def mincostToHireWorkers(self, quality, wage, K): N = len(wage) min_cost = float('inf') for i in range(N)…Minimum Wage2 min read

Dec 21, 2018Intro to Algorithms Chapter 6 SolutionsCormen’s Algorithms 2nd Edition Binary Heap — an array object that can be viewed as nearly complete binary tree. The heap starts at index 1. The following functions help retrieve elements in a heap PARENT(i): return Math.floor(i/2) LEFT(i): return 2*i RIGHT(i): return 2*i+1 A[PARENT(i)] ≥ A[i], the value of the…Programming2 min read

Dec 21, 2018Intro To Algorithms Chapter 5 SolutionsCLRS 2nd Edition The Hiring Problem HIRE-ASSISTANT(n): best=0 for i in range(1, n): interview(i) if i > best: best = i hire(i) c_h == cost to hire c_i = = cost to interview In the worst case, you hire every single candidate and the runtime is O(n*c_h) Probabilistic Analysis The…Mathematics4 min read

Dec 21, 2018Into to Algorithms Chapter 3 SolutionsCormen 2nd Edition Transitivity: f(n) = Theta(g(n)) and g(n) = Theta(h(n)) then f(n) = Theta(h(n)) f(n) = O(g(n)) and g(n) = O(h(n)) then f(n) = O(h(n)) f(n) = omega(g(n)) and g(n) = omega(h(n)) then f(n) = omega(h(n)) f(n) = lowercase_omega(g(n)) and g(n) = lowercase_omega(h(n)) then f(n) = lowercase_omega(h(n)) Reflexitivity: f(n)…3 min read

Dec 20, 2018Intro To Algorithms Chapter 2 SolutionsCormen 2nd Edition Solutions — This is a simple easily digestible solution manual to chapter 2 of Cormen’s algorithms second edition. CHAPTER 2.1: The focus of this chapter is insertion sort. Illustration of insertion sort: https://www.youtube.com/watch?v=OGzPmgsI-pQ. The time complexity of insertion sort is O(N²). This is because of the worst case array in reverse order…Algorithms6 min read