There are no reviews yet. Be the first to send feedback to the community and the maintainers!
AxiosRequestUpdatetemplate
ToDoListModified
SearchFilter
HTML_Game
AxiosRouterOnload
useRefExample
CallbackSimpleExample
controlledInput
TypicalKanban
AxiosTaskLoader
Banker-sPlan
"https://www.codewars.com/kata/56445c4755d0e45b8c00010a "paginationExample
Example of dynamic pagination hookTimePickerRedux
Closure
SimpleCounterVersion
MPGCalculatorfixed
JSPlayground
MPGcalculation
FindAllNonConsecutiveNumbers
TodoListWithRestore
FirebaseTodo
in processSwapTwoElements
" Return a new array that contains exactly the same elements as the input array, but with elements a and b swapped. If the array has multiple copies of a, swap only the first one that appears in the array. If the array has multiple copies of b, swap only the last one that appears in the array."BookingExample
FindTheMultiples
"you will build a program that takes a value, integer , and returns a list of its multiples up to another value, limit . If limit is a multiple of integer, it should be included as well. The limit will always be higher than the base. "HeadsAndLegs
"Everybody has probably heard of the animal heads and legs problem from the earlier years at school. It goes: “A farm contains chickens and cows. There are x heads and y legs. How many chickens and cows are there?” Where x <= 1000 and y <=1000 #Task Assuming there are no other types of animals, work out how many of each animal are there. "MengerSponge
" In this kata you will create a function that takes non negative integers (from 0 to n) and return the amount of cubes that the Menger Sponge would have in that specific iteration."HeadTailInitLast
"Haskell has some useful functions for dealing with list λ head [1,2,3,4,5] 1 λ tail [1,2,3,4,5] [2,3,4,5] λ init [1,2,3,4,5] [1,2,3,4] λ last [1,2,3,4,5] 5 Your job is to implement these functions in your given language. Make sure it doesn't edit the array; that would cause problems! "useEffectExample
Love Open Source and this site? Check out how you can help us