Purpose I recently came across an interview question that stumped me for a while Given a list of integers, write a function that returns the largest sum of non-adjacent numbers. I am looking for feedback around both my implementation and the correctness of my proposed solution (I have some test cases, but I could haveRead more
Blog
This is a specialisation of a more general, still unanswered question. Suppose $ G$ is a finite simple graph. Let $ h(G)$ denote the Hadwiger number, that is, the maximum $ n\in\mathbb{N}$ such that $ K_n$ is a minor of $ G$ . Is there a non-complete graph $ G_0$ with at least $ 3$Read more
Satisfaction guarantee
Best Proxy Packs
-
2,000 Private Proxies
$299.00 / month
-
1,000 Private Proxies
$179.00 / month
Like And Follow Us
