Basecamp is the selection process of 42 São Paulo, It is an immersive 20-day training, which takes place virtually through Discord. In this immersion, all people who participate will experience the learning method and culture of 42 in practice.
The exercises included in this repository were refactored and performed after my entry into 42, I decided to redo the lists that I did not perform during basecamp for training purposes, during basecamp I only performed up to list C04. Shell lists are not included in this repository.
The exercises included here have not been corrected by Moulliette
-
Exercice 00 : ft_putchar- Write a character that displays the character passed as a parameter. -
Exercice 01 : ft_print_alphabet- Create a function that displays the alphabet in lowercase, on a single line, by ascending order, starting from the letter 'a'. -
Exercice 02 : ft_print_alphabet- Create a function that displays the alphabet in lowercase, on a single line, by descending order, starting from the letter 'z'. -
Exercice 03 : ft_print_numbers- Create a function that displays all digits, on a single line, by ascending order. -
Exercice 04 : ft_is_negative- Create a function that displays 'N' or 'P' depending on the integer's sign entered as a parameter. If n is negative, display 'N'. If n is positive or null, display 'P'. -
Exercice 05 : ft_print_comb- Create a function that displays all different combinations of three different digits on ascending order, listed by ascending order - yes, repetition is voluntary. -
Exercice 06 : ft_print_comb2- Create a function that displays all different combination of two digits between 00 and 99, listed by ascending order. -
Exercice 07 : ft_putnbr- Create a function that displays the number entered as a parameter. The function has to be able to display all possible values within an int type variable. -
Exercice 08 : ft_print_combn- Create a function that displays all different combinations od n numbers by ascending.
-
Exercice 00 : ft_ft- Create a function that takes a pointer to int as a parameter, and sets the value "42" to that int. -
Exercice 01 : ft_ultimate_ft- Create a function that takes a pointer to pointer to pointer to pointer to pointer to pointer to pointer to pointer to pointer to int as a parameter and sets the value "42" to that int. -
Exercice 02 : ft_ultimate_ft- Create a function that swaps the value of two integers whose addresses are entered as parameters. -
Exercice 03 : ft_ultimate_ft- Create a function ft_div_mod prototyped like this :void ft_div_mod(int a, int b, int *div, int *mod);This function divides parameters a by b and stores the result in the int pointed by div. It also stores the remainder of the division of a by b in the int pointed by mod. -
Exercice 04 : ft_ultimate_div_mod- Create a function ft_ultimate_div_mod with the following prototype :void ft_ultimate_div_mod(int *a, int *b);This function divides parameters a by b. The result of this division is stored in the int pointed by a. The remainder of the division is stored in the int pointed by b. -
Exercice 05 : ft_putstr- Create a function that displays a string of characters on the standard output. -
Exercice 06 : ft_strlen- Create a function that counts and returns the number of characters in a string -
Exercice 07 : ft_rev_int_tab- Create a function which reverses a given array of integer (first goes last, etc). -
Exercice 08 : ft_sort_int_tab- Create a function which sorts an array of integers by ascending order.
-
Exercice 00 : ft_strcpy- Reproduce the behavior of the function strcpy (man strcpy). -
Exercice 01 : ft_strncpy- Reproduce the behavior of the function strncpy (man strncpy). -
Exercice 02 : ft_str_is_alpha- Create a function that returns 1 if the string given as a parameter contains only alphabetical characters, and 0 if it contains any other character. -
Exercice 03 : ft_str_is_numeric- Create a function that returns 1 if the string given as a parameter contains only digits, and 0 if it contains any other character. -
Exercice 04 : ft_str_is_lowercase- Create a function that returns 1 if the string given as a parameter contains only lowercase alphabetical characters, and 0 if it contains any other character. -
Exercice 05 : ft_str_is_uppercase- Create a function that returns 1 if the string given as a parameter contains only uppercase alphabetical characters, and 0 if it contains any other character. -
Exercice 06 : ft_str_is_printable- Create a function that returns 1 if the string given as a parameter contains only printable characters, and 0 if it contains any other character. -
Exercice 07 : ft_strupcase- Create a function that transforms every letter to uppercase. -
Exercice 08 : ft_strlowcase- Create a function that transforms every letter to lowercase -
Exercice 09 : ft_strcapitalize- Create a function that capitalizes the first letter of each word and transforms all other letters to lowercase. -
Exercice 10 : ft_strlcpy- Reproduce the behavior of the function strlcpy (man strlcpy). -
Exercice 11 : ft_putstr_non_printable- Create a function that displays a string of characters onscreen. If this string contains characters that aren’t printable, they’ll have to be displayed in the shape of hexadecimals (lowercase), preceeded by a "backslash". -
Exercice 12 : ft_print_memory- Create a function that displays the memory area onscreen -
The display of this memory area should be split into three "columns" separated by a space :
- The hexadecimal address of the first line’s first character followed by a ’:’.
- The content in hexadecimal with a space each 2 characters and should be padded with spaces if needed (see the example below).
- The content in printable characters.
-
If a character is non-printable, it’ll be replaced by a dot.
-
Each line should handle sixteen characters.
-
If size equals to 0, nothing should be displayed
-
Exercice 00 : ft_strcmp- Reproduce the behavior of the function strcmp (man strcmp). -
Exercice 01 : ft_strncmp- Reproduce the behavior of the function strncmp (man strncmp). -
Exercice 02 : ft_strcat- Reproduce the behavior of the function strcat (man strcat). -
Exercice 03 : ft_strncat- Reproduce the behavior of the function strncat (man strncat). -
Exercice 04 : ft_strstr- Reproduce the behavior of the function strstr (man strstr). -
Exercice 05 : ft_strlcat- Reproduce the behavior of the function strlcat (man strlcat).
-
Exercice 00 : ft_strlen- Create a function that counts and returns the number of characters in a string -
Exercice 01 : ft_putstr- Create a function that displays a string of characters on the standard output. -
Exercice 02 : ft_putnbr- Create a function that displays the number entered as a parameter. The function has to be able to display all possible values within an int type variable. -
Exercice 03 : ft_atoi- Write a function that converts the initial portion of the string pointed by str to its int representation -
Exercice 04 : ft_putnbr_base- Create a function that displays a number in a base system in the terminal. -
Exercice 05 : ft_atoi_base- Write a function that converts the initial portion of the string pointed by str to int representation.
-
Exercice 00 : ft_iterative_factorial- Create an iterated function that returns a number. This number is the result of a factorial operation based on the number given as a parameter -
Exercice 01 : ft_recursive_factoria- Create a recursive function that returns the factorial of the number given as a parameter. -
Exercice 02 : ft_iterative_power- Create an iterated function that returns the value of a power applied to a number. An power lower than 0 returns 0. Overflows must not be handled. -
Exercice 03 : ft_recursive_power- Create a recursive function that returns the value of a power applied to a number. -
Exercice 04 : ft_fibonacci- Create a function ft_fibonacci that returns the n-th element of the Fibonacci sequence, the first element being at the 0 index. We’ll consider that the Fibonacci sequence starts like this: 0, 1, 1, 2. -
Exercice 05 : ft_sqrt- Create a function that returns the square root of a number (if it exists), or 0 if the square root is an irrational number. -
Exercice 06 : ft_is_prime- Create a function that returns 1 if the number given as a parameter is a prime number, and 0 if it isn’t. -
Exercice 07 : ft_find_next_prime- Create a function that returns the next prime number greater or equal to the number given as argument. -
Exercice 08 : ft_ten_queens_puzzle- Create a function that displays all possible placements of the ten queens on a chessboard which would contain ten columns and ten lines, without them being able to reach each other in a single move, and returns the number of possibilities. Recursivity is required to solve this problem.
-
Exercice 00 : ft_print_program_name- Write a program that displays the name of the program. -
Exercice 01 : ft_print_params- Write a program that displays the arguments received on the command line. One per line in the same order as the command line -
Exercice 02 : ft_rev_params- Write a program that displays the arguments received on the command line. One per line in reverse command line order. -
Exercice 03 : ft_sort_params- Write a program that displays the arguments received on the command line sorted in ascii order.
-
Exercice 00 : ft_strdup- Reproduce the behavior of the function strdup (man strdup). -
Exercice 01 : ft_range- Create a function ft_range which returns an array ofints. This int array should contain all values between min and max. -
Exercice 02 : ft_ultimate_range- Create a function ft_ultimate_range which allocates and assigns an array of ints. This int array should contain all values between min and max. -
Exercice 03 : ft_strjoin- Write a function that will concatenate all the strings pointed by strs separated by sep -
Exercice 04 : ft_convert_base- Create a function that returns the result of the conversion of the string nbr from a base base_from to a base base_to -
Exercice 05 : ft_split- Create a function that splits a string of character depending on another string of characters.
-
Exercice 00 : ft.h- Create your ft.h file -
Exercice 01 : ft_boolean.h- Create a ft_boolean.h file. It’ll compile and run the following main appropriately:
#include "ft_boolean.h"
void ft_putstr(char *str)
{
while (*str)
write(1, str++, 1);
}
t_bool ft_is_even(int nbr)
{
return ((EVEN(nbr)) ? TRUE : FALSE);
}
int main(int argc, char **argv)
{
(void)argv;
if (ft_is_even(argc - 1) == TRUE)
ft_putstr(EVEN_MSG);
else
ft_putstr(ODD_MSG);
return (SUCCESS);
}
-
Exercice 02 : ft_abs.h- Create a macro ABS which replaces its argument by it absolute value:#define ABS(Value) -
Exercice 03 : ft_point.h- Create a file ft_point.h that’ll compile the following main:
#include "ft_point.h"
void set_point(t_point *point)
{
point->x = 42;
point->y = 21;
}
int main(void)
{
t_point point;
set_point(&point);
return (0);
}
-
Exercice 04 : ft_strs_to_tab- Create a function that takes an array of string as argument and the size of this array -
Exercice 05 : ft_show_tab- Create a function that displays the content of the array created by the previous function.
-
Exercice 00 : libft- Create your ft library. It will be called libft.a. A shell script called libft_creator.sh will properly compile the source files and build your library. -
Exercice 01 : Makefile- - Write the Makefile that compiles a libft.a library.
- Your makefile should clearly show every command you do without rambling.
- Your makefile must not perform useless commands.
- The Makefile will look for the source code files in the srcs folder.
- These source code files will be: ft_putchar.c, ft_swap.c, ft_putstr.c, ft_strlen.c, ft_strcmp.c
- The Makefile will look for the header files in the includes folder.
- These header files will be: ft.h
- It should compile its c files using gcc and the -Wall flag options -Wextra -Werror in that order.
- The lib will be at the origin of the exercise.
- The .o files must be next to their respective .c file.
- Makefile should also implement clean, fclean, re, all rule and of course libft.a.
- Running make only should be equivalent to make all.
-
Exercice 02 : ft_split-Write a function that splits a string of characters in terms of another string.
-
Exercice 00 : display_file- Create a program called ft_display_file that displays, on the standard output, only the content of the file given as argument -
Exercice 01 : cat- Create a program called ft_cat which does the same thing as the system’s cat command-line. -
Exercice 02 : tail- Create a program called ft_tail which does the same thing as the system command tail. -
Exercice 03 : hexdump- Create a program called ft_hexdump which does the same thing as the system’s hexdump command-line without redirection.
-
Exercice 00 : ft_foreach- Write a ft_foreach function that, for an array of integer data, applies a function over all the elements of this array. This function will be applied array order. -
Exercice 01 : ft_map- Write a ft_map function that, for a given array of integers, will apply a function over all elements of that array (in sequence) and will return an array of all return values. -
Exercice 02 : ft_any- Write a ft_any function that will return 1 if at least one element of the array return something other than 0 when passed to function f. Otherwise, should return 0. -
Exercice 03 : ft_count_if- Write a ft_count_if function that will return the number of array elements which, when passed to the function f, do not return 0 -
Exercice 04 : ft_is_sort- Write a ft_is_sort function that will return 1 if the array is sorted and 0 otherwise. -
Exercice 05 : do-op- Write a program called do-op. The program must be run with three arguments: do-op valeur1 operateur valeur2. You must use an array of function pointers in order to call the function corresponding to an operator. In case of unknown operator, your program should show 0. If the number of arguments is not correct, do-op does not show anything. Your program should accept and display the result with the following operators: ’+’ '-' '/' '*' and '%'. -
Exercice 06 : ft_sort_string_tab- Write the ft_sort_string_tab function that sorts the strings in ascii order of characters -
Exercice 07 : ft_advanced_sort_string_tab- Write the ft_advanced_sort_string_tab function that sorts according to the return of the function passed as a parameter
-
Exercice 00 : ft_create_elem- Create the function ft_create_elem which creates a new element of t_list type. -
Exercice 01 : ft_list_push_front- Create the function ft_list_push_front which adds a new element of type t_list to the beginning of the list. -
Exercice 02 : ft_list_size- Create the function ft_list_size which returns the number of elements in the list. -
Exercice 03 : ft_list_last- Create the function ft_list_last which returns the last element of the list -
Exercice 04 : ft_list_push_back- Create the function ft_list_push_back which adds a new element of t_list type at the end of the list. -
Exercice 05 : ft_list_push_strs- Create the function ft_list_push_strs which creates a new list that includes all the string pointed by the element in strs. -
Exercice 06 : ft_list_clear- Create the function ft_list_clear which removes and frees all links from the list -
Exercice 07 : ft_list_at- Create the function ft_list_at which returns the Nth element of the list, knowing that the first element of the list is when nbr equal 0. -
Exercice 08 : ft_list_reverse- Create the function ft_list_reverse which reverses the order of a list’s elements. The value of each element must remain the same. -
Exercice 09 : ft_list_foreach- Create the function ft_list_foreach which applies the function given as argument to each of the list’s elements -
Exercice 10 : ft_list_foreach_if- Create the function ft_list_foreach_if which applies the function given as argument to some of the list’s elements -
Exercice 11 : ft_list_find- Create the function ft_list_find which returns the address of the first element’s data compared to data_ref with cmp makes cmp to return 0 -
Exercice 12 : ft_list_remove_if- Create the function ft_list_remove_if which removes from the list, all elements whose data compared to data_ref using cmp, makes cmp return 0. -
Exercice 13 : ft_list_merge- Create the function ft_list_merge which places elements of a list begin2 at the end of an other list begin1 -
Exercice 14 : ft_list_sort- Create the function ft_list_sort which sorts the list’s elements by ascending order by comparing two elements by comparing their data with a function. -
Exercice 15 : ft_list_reverse_fun- Create the function ft_list_reverse_fun which reverses the order of the elements of the list -
Exercice 16 : ft_sorted_list_insert- Create the function ft_sorted_list_insert which creates a new element and inserts it into a list sorted so that it remains sorted in ascending order. -
Exercice 17 : ft_sorted_list_merge- Create the function ft_sorted_list_merge which integrates the elements of a sorted list begin2 in another sorted list begin1, so that begin1 remains sorted by ascending order.
-
Exercice 00 : Exercise 00 : btree_create_node- Create the function btree_create_node which allocates a new element. It should initialise its item to the argument’s value, and all other elements to 0. -
Exercice 01 : btree_apply_prefix- Create a function btree_apply_prefix which applies the function given as argument to the item of each node, using prefix traversal to search the tree. -
Exercice 02 : btree_apply_infix- Create a function btree_apply_infix which applies the function given as argument to the item of each node, using infix traversal to search the tree. -
Exercice 03 : btree_apply_suffix- Create a function btree_apply_suffix which applies the function given as argument to the item of each node, using suffix traversal to search the tree -
Exercice 04 : btree_insert_data- Create a function btree_insert_data which inserts the element item into a tree. The tree passed as argument will be sorted : for each node all lower elements are located on the left side and all higher or equal elements on the right. We’ll also pass a comparison function similar to strcmp as argument -
Exercice 05 : btree_search_item- Create a function btree_search_item which returns the first element related to the reference data given as argument. The tree should be browsed using infix traversal . If the element isn’t found, the function should return NULL. -
Exercice 06 : btree_level_count- Create a function btree_level_count which returns the size of the largest branch passed as argument. -
Exercice 07 : btree_apply_by_level- Create a function btree_apply_by_level which applies the function passed as argument to each node of the tree. The tree must be browsed level by level. - The function called will take three arguments : - The first argument, of type void *, will correspond to the node’s item ; - The second argument, of type int, corresponds to the level on which we find : 0 for root, 1 for children, 2 for grand-children, etc. ; - The third argument, of type int, is worth 1 if it’s the first node of the level, or worth 0 otherwise.
This Project was made with:
made with 💖 by m-carecho