From f7c45b2baacf2c87dc92d1541be831bb87bb8afe Mon Sep 17 00:00:00 2001 From: Francesco Date: Sun, 21 Nov 2021 18:42:21 +0100 Subject: [PATCH 1/2] solution palindrome easy in python & typescript --- .../palindrome-number/palindromeNumber.py | 0 .../palindrome-number/palindromeNumber.ts | 21 +++++++++++++++++++ 2 files changed, 21 insertions(+) create mode 100644 challenges/easy/palindrome-number/palindromeNumber.py create mode 100644 challenges/easy/palindrome-number/palindromeNumber.ts diff --git a/challenges/easy/palindrome-number/palindromeNumber.py b/challenges/easy/palindrome-number/palindromeNumber.py new file mode 100644 index 0000000..e69de29 diff --git a/challenges/easy/palindrome-number/palindromeNumber.ts b/challenges/easy/palindrome-number/palindromeNumber.ts new file mode 100644 index 0000000..71974a9 --- /dev/null +++ b/challenges/easy/palindrome-number/palindromeNumber.ts @@ -0,0 +1,21 @@ +function is_palindrome_int (int: number) { + + let i: number = 0; + let j: number = int.toString().length - 1; + + while (j >= 0) { + if (int.toString()[i] !== int.toString()[j]) { + return false + } + i += 1; + j -= 1; + } + + return true +} + +console.log(is_palindrome_int(1010101)); // True +console.log(is_palindrome_int(101)); // True +console.log(is_palindrome_int(1101)); // False +console.log(is_palindrome_int(122)); // False +console.log(is_palindrome_int(-1101)); // False \ No newline at end of file From 83836bfacd4877afcd4a4590d483bafae3e77d77 Mon Sep 17 00:00:00 2001 From: Francesco Date: Sun, 21 Nov 2021 18:45:42 +0100 Subject: [PATCH 2/2] update python version --- .../easy/palindrome-number/palindromeNumber.py | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/challenges/easy/palindrome-number/palindromeNumber.py b/challenges/easy/palindrome-number/palindromeNumber.py index e69de29..84bbf85 100644 --- a/challenges/easy/palindrome-number/palindromeNumber.py +++ b/challenges/easy/palindrome-number/palindromeNumber.py @@ -0,0 +1,14 @@ +def is_palindrome_int(int1: int) -> bool: + int1 = str(int1) + int2 = int1 + + i = 0 + j = len(int2) - 1 + + while j >= 0: + if int1[i] != int2[j]: + return False + i = i + 1 + j = j - 1 + + return True