42 Exam Rank 03 May 2026

> 2 Available exercises: ex00: ft_list_size (2 pts) ex01: ft_btree_insert_data (4 pts) ex02: ft_itoa_base (4 pts)

Do not use recursion here — unnecessary and slower. 2. ft_list_remove_if (Medium) void ft_list_remove_if(t_list **begin_list, void *data_ref, int (*cmp)()) 42 Exam Rank 03

t_list *current = *begin_list; t_list *previous = NULL; while (current) > 2 Available exercises: ex00: ft_list_size (2 pts)