· software
Tetris for Logistics: solving the 3D Bin Packing Problem with Rust 🦀
Introduction You know what’s frustrating? Opening a huge delivery box just to find a tiny item rattling around inside, surrounded by a mountain of bubble wrap....
-
- · software
Coding Challenge Practice - Question 71
Problem Statement Find the elements that exist in both arrays, given two sorted arrays. Approach Because the arrays are sorted, we can walk through them simult...
- · ai
The Machine Learning “Advent Calendar” Day 4: k-Means in Excel
How to implement a training algorithm that finally looks like “real” machine learning The post The Machine Learning “Advent Calendar” Day 4: k-Means in Excel ap...
- · software
Understanding ECDSA
This article is basically an exercise in understanding ECDSA Elliptic Curve Digital Signature Algorithm from scratch. All I assume is some basic math and a will...
- · software
PWC 350 Good Substring / Shuffle Pairs
The movie version of Wicked is in theaters right now, so I’m reminded of the song For Goodhttps://www.youtube.com/watch?v=Y8YMfgu92hQ Broadway version. It’s rel...
- · software
Coding Challenge Practice - Question 69
Problem Description Create a function that returns the n-th term of the “look‑and‑say” sequence as a string. The sequence starts with '1' for n = 1. Each sub...
- · software
Coding Challenge Practice - Question 68
Problem Statement Implement a function isPrimenum that returns true if the given number is a prime number and false otherwise. Approach 1. Handle edge cases...
- · ai
The Greedy Boruta Algorithm: Faster Feature Selection Without Sacrificing Recall
A modification to the Boruta algorithm that dramatically reduces computation while maintaining high sensitivity The post The Greedy Boruta Algorithm: Faster Fea...
- · software
📚 Post 3: A Santa Graal da Busca: O(log N)
Acelerando a Busca: Por que o O(log N) (Busca Binária) é mais rápido que a Luz? ✨ Vimos nos posts anteriores como migrar de O(N^2) para O(N). Mas e se pudéssemo...
- · software
A Migração de O(N^2) para O(N): O Poder do O(1)
Domando o Crescimento: Como Transformar O(N^2) em O(N) com Estruturas de Dados Elixir No Post 1 - O que é Big O? e o Vilão O(N^2), vimos que a complexidade O(N^...