
Decoding Dynamic Programming
In this post, we will solve a problem involving dynamic programming without being aware of it.Problem : Given an array of size N , find the contiguous subarray of size K ( K<=N ) with the largest sum.What does it mean? 🤔Contiguous subarray : Let's assume we have an array A = [ 7 , 4 , 1 , 2 , 5 ] .What are the p...
More like this (2)

Memory Bandwidth Napkin Math
Memory Bandwidth Napkin Math Imagine you have a contiguous array of one billion 32bit integers in...

Data Structures Part 3: Arrays of arrays · Our Machinery
Data Structures Part 3: Arrays of arrays When we created our bulk data arrays, we assumed...