99 questions/1 to 10 - HaskellWiki
wiki.haskell.org · 587 words · saved by 1 readers
This is part of Ninety-Nine Haskell Problems, based on Ninety-Nine Prolog Problems and Ninety-Nine Lisp Problems.
99 questions/1 to 10 - HaskellWiki Jump to content From HaskellWiki < 99 questions This is part of Ninety-Nine Haskell Problems , based on Ninety-Nine Prolog Problems and Ninety-Nine Lisp Problems . Problem 1 (*) Find the last element of a list. Solutions   (Note that the Lisp transcription of this problem is incorrect.) Example in Haskell: λ> myLast [1,2,3,4] 4 λ> myLast ['x','y','z'] 'z' Problem 2 (*) Find the last-but-one (or second-last) element of a list. Solutions   (Note that the Lisp transcription of this problem is incorrect.) Example in Haskell: λ> myButLast [1,2,3,4] 3 λ>
saved by
related reading
- Chris Allen - Functional Educationbitemyapp.com
- GitHub - bitemyapp/learnhaskell: Learn Haskell · GitHubgithub.com
- GitHub - system-f/fp-course: Functional Programming Course · GitHubgithub.com
- Starting Out - Learn You a Haskell for Great Good!learnyouahaskell.github.io
- A half-hour to learn Rustfasterthanli.me
- Squeezing a sokoban game into 10 lines of codecole-k.com
- CSC 151 - Recursion Over Listseikmeier.sites.grinnell.edu
- Leaving Haskell behind - Infinite Negative Utilityjournal.infinitenegativeutility.com
- Hacker Newsnews.ycombinator.com
- CSC 151 - Higher-order design, recursive and othereikmeier.sites.grinnell.edu
- LeetCode-Solutions/0001-1000.md at master · Holychung/LeetCode-Solutionsgithub.com
- Archived Problems - Project Eulerprojecteuler.net