Pablo Valdivia
Hi, I decided that I'm going to start making the codechef roadmap, to learn the basic algorithms and data structures of competitive programming. I leave you the link: www.codechef.com/roadmap/data-structures-and-algor…
1 year ago | [YT] | 1
View 2 replies
Day 4: i learn: islower(c), isupper(c) (return true or false )toupper(c), tolower(c) (return an int)(char)toupper(c) return a character
View 0 replies
Day 4: i learn: max(a , b, comp);codeforces.com/problemset/problem/479/A
1 year ago | [YT] | 0
Day 3 i learn: sort(nums.rbegin(), nums.rend()); // Sort in descending order Problem: codeforces.com/problemset/problem/160/A
Day 2 i learn: swap(s[i], s[i + 1]); // Swap 'B' and 'G' BG i++; // Skip the next index to prevent double swap
Pablo Valdivia
Hi, I decided that I'm going to start making the codechef roadmap, to learn the basic algorithms and data structures of competitive programming. I leave you the link: www.codechef.com/roadmap/data-structures-and-algor…
1 year ago | [YT] | 1
View 2 replies
Pablo Valdivia
Day 4: i learn: islower(c), isupper(c) (return true or false )
toupper(c), tolower(c) (return an int)
(char)toupper(c) return a character
1 year ago | [YT] | 1
View 0 replies
Pablo Valdivia
Day 4: i learn: max(a , b, comp);
codeforces.com/problemset/problem/479/A
1 year ago | [YT] | 0
View 0 replies
Pablo Valdivia
Day 3 i learn: sort(nums.rbegin(), nums.rend()); // Sort in descending order
Problem: codeforces.com/problemset/problem/160/A
1 year ago | [YT] | 0
View 0 replies
Pablo Valdivia
Day 2 i learn: swap(s[i], s[i + 1]); // Swap 'B' and 'G' BG
i++; // Skip the next index to prevent double swap
1 year ago | [YT] | 0
View 0 replies