TryAlgo

This summer, I was in Palermo where the Educational Data Mining, Learning at Scale & AI in Education conferences were held.

Update : Merci à Marc de Falco qui a trouvé une erreur dans le code initial.

En musique, on change d’octave en doublant la fréquence.

If we want to find the longest (strictly) increasing subsequence of an array $a$ of size $n$, of course we can assume that $dp[i]$ is the answer for the first $i$ elements and then, as a LIS of size $n$ contains a LIS of size $n - 1$: \[dp[i] = \max_{\sub…

Étant donnée une liste de chaînes de caractères L, construire une structure de données qui permet en temps linéaire d’identifier toutes les occurrences des mots de L à l’intérieur d’un mot S donné.

Back in the good ol’ agrégation days, I remember I used as développement1 a nice 2-approx algorithm for the traveling salesman problem where the weights on the edges are given by the Euclidean distance between nodes.

Given a matrix with distinct values, a rectangle consists of 4 cells at the intersection of two distinct rows and two distinct columns.

Given a string s, sort all cyclic shifts of s.

A data structure representing all permutations satisfying constraints of the form: for a given set $S\subseteq\{0,1,\ldots,n-1\}$ the elements of the permutations on $\{0,1,\ldots,n-1\}$ have to be consecutive in circular manner.

You are given an histogram and want to identify the area of the largest rectangle that fits under the histogram.

In my new role as scientific advisor at the French Ministry of Education, I have recently been looking for meta-analyses and RCTs about impact of AI (and LLMs) in education.

Cover a tree with paths or caterpillars.

Le 9 mars 2023 avait lieu la compétition Meilleur Développeur de France 2023.

Abstract: Maintain two tables $t_0$, $t_1$.

Stable Baselines rely on TF 1.x but Stable Baselines v3 rely on PyTorch.

In December 2016 we presented it at ENS Paris-Saclay with Étienne Simon but apparently I never wrote a blog post in the end.

SPOJ You need to send them a mail to get access to contest creation.

-300 Algorithme d’Euclide (qui date peut-être de l’école de Pythagore 530 av.

Application: Given an ordered list of keys with frequencies, build a binary search tree on those keys which minimizes the average query cost.

Compute the pareto set of a given set of points in 2 or 3 dimensions.