Every file in this project is code I wrote and submitted while completing the NeetCode ML course. The problems progressively build from gradient descent fundamentals all the way to a working GPT.

Abstract: Addressing the issue of traditional minimum spanning tree-based stereo matching algorithms having low matching accuracy in areas with weak texture, repetitive texture, and depth ...

The hills of Tanzania where Ecosia operates – credit, Ecosia, released Reaching a stellar milestone just before Earth Day, Ecosia, the nonprofit search engine, is celebrating 250 million trees planted ...

Abstract: We study augmenting a connected graph with a limited number of edges to maximize its spanning-tree connectivity, quantified by the log-determinant of the reduced Laplacian. The problem is NP ...