Palindromic Number in Haskell

Palindromic

Number in Haskell

Welcome to the Palindromic Number in Haskell page! Here, you'll find the source code for this program as well as a description of how the program works.

Current Solution

module Main where 

import Text.Read (readMaybe)
import Data.Maybe (listToMaybe)
import System.Environment

reverseInt :: Int -> Int
reverseInt n = go n 0
  where go 0 acc = acc
        go n acc = go (n `div` 10) (acc * 10 + n `mod` 10)

main :: IO ()
main = do  
    args <- getArgs
    case listToMaybe args >>= readMaybe of
      Just n  ->
        if n >= 0
        then putStrLn (if reverseInt n == n then "true" else "false") 
        else putStrLn "Usage: please input a non-negative integer"
      Nothing -> putStrLn "Usage: please input a non-negative integer"

Palindromic Number in Haskell was written by:

• Ricardo Mapurunga Junior

If you see anything you'd like to change or update, please consider contributing.

How to Implement the Solution

No 'How to Implement the Solution' section available. Please consider contributing.

How to Run the Solution

No 'How to Run the Solution' section available. Please consider contributing.