In this post, the authors analyzed data from the ClickHouse Git repository using window and array functions to solve a sequence problem. They created a query that used two powerful features of ClickHouse: window and array functions. The query first grouped commits by author and day, then created a window per author to determine if each commit was consecutive with the previous one. Finally, they used an array function to count the length of sequences of consecutive days for each author, identifying the longest sequence of uninterrupted work. The authors demonstrated how these techniques can be applied to other datasets to find sequential patterns, and concluded that similar techniques can be used to solve sequence problems in ClickHouse.