@@ -6,29 +6,29 @@ Welcome to Day 18 of our coding adventure! Today, we're diving deep into algorit
66
77### Activity 1: Sorting Algorithms
88
9- - [] ** Task 1:** Implement the ** bubble sort** algorithm to sort an array of numbers in ascending order. Log the sorted array.
10- - [] ** Task 2:** Implement the ** selection sort** algorithm to sort an array of numbers in ascending order. Log the sorted array.
11- - [] ** Task 3:** Implement the ** quicksort** algorithm to sort an array of numbers in ascending order. Log the sorted array.
9+ - [X ] ** Task 1:** Implement the ** bubble sort** algorithm to sort an array of numbers in ascending order. Log the sorted array.
10+ - [X ] ** Task 2:** Implement the ** selection sort** algorithm to sort an array of numbers in ascending order. Log the sorted array.
11+ - [X ] ** Task 3:** Implement the ** quicksort** algorithm to sort an array of numbers in ascending order. Log the sorted array.
1212
1313### Activity 2: Searching Algorithms
1414
15- - [] ** Task 4:** Implement the ** linear search** algorithm to find a target value in an array. Log the index of the target value.
16- - [] ** Task 5:** Implement the ** binary search** algorithm to find a target value in a sorted array. Log the index of the target value.
15+ - [X ] ** Task 4:** Implement the ** linear search** algorithm to find a target value in an array. Log the index of the target value.
16+ - [X ] ** Task 5:** Implement the ** binary search** algorithm to find a target value in a sorted array. Log the index of the target value.
1717
1818### Activity 3: String Algorithms
1919
20- - [] ** Task 6:** Write a function to ** count the occurrences** of each character in a string. Log the character counts.
21- - [] ** Task 7:** Write a function to find the ** longest substring without repeating characters** in a string. Log the length of the substring.
20+ - [X ] ** Task 6:** Write a function to ** count the occurrences** of each character in a string. Log the character counts.
21+ - [X ] ** Task 7:** Write a function to find the ** longest substring without repeating characters** in a string. Log the length of the substring.
2222
2323### Activity 4: Array Algorithms
2424
25- - [] ** Task 8:** Write a function to ** rotate an array** by k positions. Log the rotated array.
26- - [] ** Task 9:** Write a function to ** merge two sorted arrays** into one sorted array. Log the merged array.
25+ - [X ] ** Task 8:** Write a function to ** rotate an array** by k positions. Log the rotated array.
26+ - [X ] ** Task 9:** Write a function to ** merge two sorted arrays** into one sorted array. Log the merged array.
2727
2828### Activity 5: Dynamic Programming (Optional)
2929
30- - [] ** Task 10:** Write a function to solve the ** Fibonacci sequence** using dynamic programming. Log the Fibonacci numbers.
31- - [] ** Task 11:** Write a function to solve the ** knapsack problem** using dynamic programming. Log the maximum value that can be obtained.
30+ - [X ] ** Task 10:** Write a function to solve the ** Fibonacci sequence** using dynamic programming. Log the Fibonacci numbers.
31+ - [X ] ** Task 11:** Write a function to solve the ** knapsack problem** using dynamic programming. Log the maximum value that can be obtained.
3232
3333## Feature Request 🎯
3434
0 commit comments