Post History
Challenge A catalogue type challenge that simply asks: Given an integer n (where n>=0) as input return a truthy value if n is a perfect square or a falsey value if not. Rules You may take...
#3: Post edited
by
Shaggy
·
2021-08-12T13:03:20Z (over 3 years ago)
- # Challenge
- A catalogue type challenge that simply asks: Given an integer `n` (where `n>=0`) as input return a truthy value if `n` is a perfect square or a falsey value if not.
- ---
- ## Rules
- - You may take input by any reasonable, convenient means.
- - You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
- - Output should be one of two consistent truthy/falsey values (e.g., `true` or `false`, `1` or `0`) - truthy if the input is a perfect square, falsey if it's not.
- This is <a class="badge is-tag">code-golf</a> so lowest byte count wins.- ---
- ## Test Cases
- Input: 0
- Output: true
- Input: 1
- Output: true
- Input: 64
- Output: true
- Input: 88
- Output: false
- Input: 2147483647
- Output: false
- # Challenge
- A catalogue type challenge that simply asks: Given an integer `n` (where `n>=0`) as input return a truthy value if `n` is a perfect square or a falsey value if not.
- ---
- ## Rules
- - You may take input by any reasonable, convenient means.
- - You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
- - Output should be one of two consistent truthy/falsey values (e.g., `true` or `false`, `1` or `0`) - truthy if the input is a perfect square, falsey if it's not.
- - This is <span class="badge is-tag">code-golf</span> so lowest byte count wins.
- ---
- ## Test Cases
- Input: 0
- Output: true
- Input: 1
- Output: true
- Input: 64
- Output: true
- Input: 88
- Output: false
- Input: 2147483647
- Output: false
#2: Post edited
by
General Sebast1an
·
2021-08-12T13:02:48Z (over 3 years ago)
It's Hip to be Square
- # Challenge
- A catalogue type challenge that simply asks: Given an integer `n` (where `n>=0`) as input return a truthy value if `n` is a perfect square or a falsey value if not.
- ---
- ## Rules
- - You may take input by any reasonable, convenient means.
- - You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
- - Output should be one of two consistent truthy/falsey values (e.g., `true` or `false`, `1` or `0`) - truthy if the input is a perfect square, falsey if it's not.
- This is code-golf so lowest byte count wins.- ---
- ## Test Cases
- Input: 0
- Output: true
- Input: 1
- Output: true
- Input: 64
- Output: true
- Input: 88
- Output: false
- Input: 2147483647
- Output: false
- # Challenge
- A catalogue type challenge that simply asks: Given an integer `n` (where `n>=0`) as input return a truthy value if `n` is a perfect square or a falsey value if not.
- ---
- ## Rules
- - You may take input by any reasonable, convenient means.
- - You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
- - Output should be one of two consistent truthy/falsey values (e.g., `true` or `false`, `1` or `0`) - truthy if the input is a perfect square, falsey if it's not.
- - This is <a class="badge is-tag">code-golf</a> so lowest byte count wins.
- ---
- ## Test Cases
- Input: 0
- Output: true
- Input: 1
- Output: true
- Input: 64
- Output: true
- Input: 88
- Output: false
- Input: 2147483647
- Output: false
#1: Initial revision
by
Shaggy
·
2021-08-05T11:34:00Z (over 3 years ago)
It's Hip to be Square
# Challenge
A catalogue type challenge that simply asks: Given an integer `n` (where `n>=0`) as input return a truthy value if `n` is a perfect square or a falsey value if not.
---
## Rules
- You may take input by any reasonable, convenient means.
- You need not handle inputs greater than what your chosen language can natively handle nor which would lead to floating point inaccuracies.
- Output should be one of two consistent truthy/falsey values (e.g., `true` or `false`, `1` or `0`) - truthy if the input is a perfect square, falsey if it's not.
- This is code-golf so lowest byte count wins.
---
## Test Cases
Input: 0
Output: true
Input: 1
Output: true
Input: 64
Output: true
Input: 88
Output: false
Input: 2147483647
Output: false