Close menu
int count = 0; while (begin_list) count++; begin_list = begin_list->next; return (count);
> 3 ex00? y Submitted. Moulinette: OK (2/2)
Good luck, and may your pointers never be dangling!
if (cmp(current->data, data_ref) == 0) if (previous) previous->next = current->next; else *begin_list = current->next; free(current); current = previous ? previous->next : *begin_list; else previous = current; current = current->next; 42 Exam Rank 03
// add to end
// Handle special cases: INT_MIN, base 10, base 16, etc. // Recursive approach: // - Convert absolute value // - Build string from least significant digit // - Handle negative for base 10
You need a pointer to pointer begin_list because the head may change. 3. ft_itoa_base (Classic tricky one) char *ft_itoa_base(int value, int base) int count = 0; while (begin_list) count++; begin_list
if (!root) return (0); return (1 + max(ft_btree_level_count(root->left), ft_btree_level_count(root->right)));
if (!node) return (ft_btree_create_node(item)); if (cmp(item, node->item) < 0) node->left = insert(node->left, item, cmp); else node->right = insert(node->right, item, cmp); return (node);
Introduction: What is Exam Rank 03? Exam Rank 03 is the third of five progressively difficult exams in the 42 curriculum (following Rank 00 and Rank 01, preceding Rank 04 and Rank 05). Unlike a school exam where you memorize facts, the 42 exam is a practical coding test in a restricted environment. look at the solution
5 / \ 3 8 / \ \ 1 4 9 Trace ft_btree_apply_infix (left-root-right). Write the output before running code. Give yourself 20 minutes per exercise. If you exceed, look at the solution, understand it, then redo from scratch. 4. Understand the typedefs typedef struct s_list
| Exercise | Difficulty | Data Structure | Recursion Required? | |----------|------------|----------------|----------------------| | ft_list_size | Easy | Singly linked list | No (iterative) | | ft_list_push_back | Easy | Singly linked list | No | | ft_list_last | Easy | Singly linked list | No | | ft_list_foreach | Easy | Singly linked list | No | | ft_list_remove_if | Medium | Singly linked list | No | | ft_list_reverse | Medium | Singly linked list | No | | ft_list_sort | Medium-Hard | Singly linked list | Optional | | ft_list_merge | Medium | Singly linked list | No | | ft_itoa_base | Medium | String (no struct) | No (but tricky) | | ft_atoi_base | Medium | String (no struct) | No | | ft_split_whitespaces | Easy | String → array | No | | ft_range | Easy | Array | No | | ft_ultimate_range | Easy | Array | No | | ft_strjoin | Easy | String | No | | ft_btree_create_node | Easy | Binary tree | No | | ft_btree_apply_prefix | Medium | Binary tree | Yes | | ft_btree_apply_infix | Medium | Binary tree | Yes | | ft_btree_apply_suffix | Medium | Binary tree | Yes | | ft_btree_insert_data | Hard | Binary tree | Yes | | ft_btree_search_item | Medium | Binary tree | Yes | | ft_btree_level_count | Medium | Binary tree | Yes | | ft_btree_apply_by_level | Hard | Binary tree | Yes (with queue) | When you start Rank 03: