If you are not aware a website called Project Euler has hundreds of algorithmic problems. Despite that most of them are related to math it’s a good resource to warm up/train your brain in coding. You can use any programming language that you want and track progress.

Here’s a list of interesting Euler’s problems in terms of diversity from my point of view with the aim to improve not only math but also programming skils (No/ Problem Titile):

11 – Largest product in a grid

12 – Highly divisible triangular number

15 – Lattice paths

24 – Lexicographic permutations

54 – Poker hands

59 – XOR decryption

62 – Cubic permutations

67 – Maximum path sum II

68 – Magic 5-gon ring

78 – Coin partitions

79 – Passcode derivation

81 – Path sum: two ways

86 – Cuboid route

94 – Almost equilateral triangles

96 – Sudoku

100 – Arranged probability

107 – Minimal network

109 – Darts

114 – Counting block combinations I

115 – Counting block combinations II

116 – Red, green or blue tiles

117 – Red, green, and blue tiles

145 – How many reversible numbers are there below one-billion?

148 – Exploring Pascal’s triangle

150 – Searching a triangular array for a sub-triangle having minimum-sum

154 – Exploring Pascal’s pyramid

165 – Intersections

166 – Criss Cross

181 – Investigating in how many ways objects of two different colours can be grouped

182 – RSA encryption

186 – Connectedness of a network

194 – Coloured Configurations

208 – Robot Walks

209 – Circular Logic

232 – The Race

267 – Billionaire

275 – Balanced Sculptures

280 – Ant and seeds

Note that it is highly recommended to solve all Euler’s problems one by one because solving a previous problem has a clue to the next ones.