README.md

! If you want to contribute then please fork the repo make new Branch by the name of
! "Level_ProblemName_{Intra Name}" and provide the PR of your solution with a detail explanation.

- ! ALERT
+ Success will be considered if below points is taken into account.
@@ All test cases got passed. @@ 
@@ Solution should be in C language only. @@
@@ 42 school header included. @@
@@ Code should have valid comments. @@
@@ PR (Pull Request) should be explained correctly. @@

    For Donation please use below address
    0xF164A4DE04D55f268AdB795434BcE932Ea8Db731

- => If you found helpful then please do follow and give a star 

✌️ 🙌

42-School--C- Basic Exam Pisicne Questions and Solution's

Repository is used for the prepration of C - beginner exam in 42 School Silicon Valley. It contains all of the Beginner Questions and solutions to it.

Solution provided are fully tested and written by me, for some problem's there are more then one solution.

For better understanding pull the work and use debugger(LLDB or GBD) to see how each step works. Any suggestion's will be highly appreciated. -_-

42 Intra Name -> maparmar

Email -> 📧

INTRA SNIPPET

LLDB Basic Working Steps:imp:

1. gcc -Wall -Wextra -Werror filename.c -g
2. lldb ./a.out -- > Used to go into LLDB mode.
3. b main --> to set breakpoint
4. r --> run
5. gui ---> Graphic User Interface.
6. use 's' key to go to each next step.

Steps to clone the work

1. cd ~
2. git clone https://github.com/Manmeet2018/C--Basic--Examshell--42---Piscine.git
3. cd C--Basic--Examshell--42---Piscine.git
4. Search Questions as per level.
5. Located at various directory distinguished by there difficulty levels and see the subject.en.txt to undertsand the question and for solutions see the *.c files and there working.

---

^-^ Status Report 💀

char *:star2: = "Good_Question's";
char *:smiling_imp: = "Very_Good_question's";

Subject Status level 0 ✔️

1. ft_countdown ✅
2. ft_print_numbers ✅
3. hello ✅
4. aff_a ✅
5. aff_first_param ✅
6. aff_last_param ✅
7. aff_z ✅
8. maff_alpha ✅
9. maff_revalpha ✅
10. only_z ✅
11. only_a ✅

Subject Status level 1 ✔️

1. first_word ✅
2. ft_putstr ✅
3. ft_strcpy ✅
4. ft_strlen ✅
5. ft_swap ✅
6. repeat_alpha ✅
7. rev_print ✅
8. rot_13 ✅
9. rotone ✅
10. search_and_replace ✅
11. ulstr ✅

Subject Status level 2 ✔️

1. alpha_mirror ✅
2. do_op ✅
3. ft_atoi ✅
4. ft_strcmp ✅
5. ft_strdup ✅
6. ft_strrev ✅
7. inter ✅ 🌟 🌟 -> used Memorization method to get it done in a O(N) time complexity
8. is_power_of_2 ✅
9. last_word ✅
10. max ✅
11. print_bits ✅
12. reverse_bits ✅
13. swap_bits ✅
14. union ✅
15. wdmatch ✅

Subject Status level 3 ✔️

1. add_prime_sum ✅
2. epur_str ✅
3. expand_str ✅
4. ft_atoi_base ✅
5. ft_list_size ✅
6. ft_range ✅
7. hidenp ✅
8. lcm ✅ -> Various method with iteration and Recursion (Euclidean Algorithm)
9. paramsum ✅
10. pgcd ✅
11. print_hex ✅
12. rstr_capitalizer ✅
13. str_capitalizer ✅
14. tab_mult ✅

Subject Status level 4 ✔️

1. fprime ✅ -> Improved time complexity by figuring out with Odd and Even number.
2. ft_itoa ✅
3. ft_list_foreach ✅
4. ft_list_remove_if ✅ 🌟
5. ft_split ✅ 🌟
6. rev_wstr ✅
7. rostring ✅
8. sort_int_tab ✅ -> 🌟 Merge Sort o(NlogN).
9. sort_list ✅
10. flood_fill ✅ 😈 😈

Subject Status level 5 🌟 🌟 ✔️

1. brackets ✅
2. brainfuck ✅ 😈
3. ft_itoa_base ✅ -> Shortest Solution
4. options ✅
5. print_memory ✅ 😈
6. rpn_calc ✅