ahora pienso lo bochazo que fue el que me ensenio que era el DSU, sus optimizaciones (union by rank/size y path compression) y el detalle de demostrarme que, con ambas, la complejidad amortizada de una secuencia de m operaciones es O(m * a(n))
( a(n) = funcion inversa de Ackermann )
bsearch se puede aplicar a cualquier problema donde haya una estructura que haga monotona la condicion que estas buscando
aprovecha la transicion en un punto de false -> true, donde una vez que cambia la condicion, no vuelve a cambiar
F F F F | T T T T
no necesariamente necesitas un array ordenado, pero si que la condición tenga una transicion montona
Binary search has no relation to the array being sorted or unsorted. It works on a monotonic function. So as long as you can have an ordered list of keys mapping to a monotonic set of values you can apply binary search. The key word is monotonicity.
NVIDIA now joins the bandwagon of moving away from LeetCode-style interviews.
The entire focus was on 3 key optimization concepts:
- Gradient Descent and Global Optima
- Full-Batch, Mini-Batch, and SGD
- Generalization Gap and Flat Minima
The best teams are looking for engineers with conceptual depth.
The foundations of physics are ultimately mathematical, the foundation of math are ultimately computational, and the foundations of computation are ultimately physical.
y ni hablar de la clase en Exactas post cursada de Teoria de Grafos donde me explicaron la FFT y NTT. Grandes recuerdos que me dejo el competitive programming
Proof of Sylvesters conjecture (every prime number that leaves a remainder of 4, 7, or 8 when divided by 9 is the sum of two cubes) by my brilliant colleague Ashay Burungale. Unsolved since the 1870s...
https://t.co/AyEjlc7X1C