Welcome Java Community!
-
Updated
Oct 23, 2025 - Java
Welcome Java Community!
Is binary search's O(log N) worst case actually optimal? Only under specific assumptions. This repo tests where they break: interpolation search, entropy-optimal search, Knuth's DP-optimal BST, and search under an unreliable oracle -- checked against information-theoretic bounds with Monte Carlo simulation and sanitized tests. Nine real bugs found
This repository will serve as the solution of competitive programming questions
This repository contains solutions to problems listed by the Codeforces user “Queue,” starting from page 80 and working backwards. All solutions are authored by “rashedjamanraju,” my Codeforces handle.
Predicting APS vs non-APS truck failures with cost-sensitive XGBoost — Datadive GDGoC '26
To associate your repository with the compettiveprogramming topic, visit your repo's landing page and select "manage topics."