Algorithm

Programmers gain valuable real-world skills from algorithm competitions that can boost their job prospects—and contest ratings make it easier for hiring managers to find top talent. Explore competitive C++ with a programmer whose scores got them recruited by Google.

Markov Chain Monte Carlo (MCMC) methods let us compute samples from a distribution even though we can’t do this relying on traditional methods. In this article, Toptal Data Scientist Divyanshu Kalra will introduce you to Bayesian methods and Metropolis-Hastings, demonstrating their potential in the field of probabilistic programming.

HorusLP is a new Python tool designed to help with the architecture of algorithm development workflows. It provides an architectural framework for the development of optimization algorithms. In this article, Toptal Freelance Software Engineer Shanglun Wang explains how HorusLP came to be and demonstrates its capabilities with a few example algorithms.

Mixed-integer programming is one of the many ways you can automate and enhance your decision-making processes. In this article, Toptal Freelance Software Engineer Shanglun Wang explores the power of operations research by walking through a hypothetical problem and shows how mixed-integer programming can be used to solve it.

While machine learning sounds highly technical, an introduction to the statistical methods involved quickly brings it within reach. In this article, Toptal Freelance Software Engineer Vladyslav Millier explores basic supervised machine learning algorithms and scikit-learn, using them to predict survival rates for Titanic passengers.

What is a computer? What are the limitations of a computer? Are there problems that a computer cannot solve? In this article, Toptal Freelance Software Engineer Mehmet Bajin explores the fundamentals of computation and the impact they have on computability and complexity.

The Aho-Corasick algorithm can be used to efficiently search for multiple patterns in a large blob of text, making it a really useful algorithm in data science and many other areas. In this article, Toptal Freelance Software Engineer Roman Vashchegin shows how the Aho-Corasick algorithm uses a trie data structure to efficiently match a dictionary of words against any text.

The Hungarian graph algorithm solves the linear assignment problem in polynomial time. By modeling resources (e.g., contractors and available contracts) as a graph, the Hungarian algorithm can be used to efficiently determine an optimum way of allocating resources.

This article will give you an introduction to the principles behind public-key cryptosystems and introduce you to the Santana Rocha-Villas Boas (SRVB) cryptosystem, developed by the author of the article and prof. Daniel Santana Rocha. The algorithm authors are making a campaign that includes a financial reward to anyone who manages to crack the code.