This week’s missions: The Most Frequent Weekdays, The Longest Palindromic and Days Diff
We believe that it’s highly important to be able to recognize the issues of current education and to know what you really need to learn to achieve your goals and how to do it more efficiently in the long run. So in this week’s article “Minimalistic Approach To Education” we’re talking about the problems that education is facing in terms of information overload and how minimalism can be applied to studying and make it more effective, useful and resultative.
Test yourself and have fun with the new missions we have for you:
The first mission is called “The Most Frequent Weekdays” and here you need to find the most frequent day(s) of the week in a given year.
most_frequent_days(1084) == ['Tuesday', 'Wednesday'] most_frequent_days(1167) == ['Sunday']
The second is the “The Longest Palindromic” where your task is to write a function that finds the longest palindromic substring of a given string.
longestPalindromic('abc') == 'a' longestPalindromic('abacada') == 'aba'
The third one is the “Days Diff” and here you have to calculate the difference in days between the two given dates.
daysDiff([1982, 4, 19], [1982, 4, 22]) == 3 daysDiff([2014, 1, 1], [2014, 8, 27]) == 238
- Babel 7.5.0 has been released! Check out the highlights with the improved F# pipeline operator, dynamic import, defaults browserlist query in @babel/preset-env and experimental TypeScript namespaces support.
Welcome to CheckiO - games for coders where you can improve your codings skills.
The main idea behind these games is to give you the opportunity to learn by exchanging experience with the rest of the community. Every day we are trying to find interesting solutions for you to help you become a better coder.Join the Game