leetCodeChallengesForNewUser/pallindormeNumber.html at main · Mohityadav-code/leetCodeChallengesForNewUser · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
<!DOCTYPE html>
<html lang="en">

<head>
    <meta charset="UTF-8">
    <meta http-equiv="X-UA-Compatible" content="IE=edge">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>PallindromeNumber</title>
</head>

<body>
    <h1>Given an integer x, return true if x is a
        palindrome
        , and false otherwise.

    </h1>
    <h2>
        Example 1:

        Input: x = 121
        Output: true
        Explanation: 121 reads as 121 from left to right and from right to left.
        </br>
        Example 2:

        Input: x = -121
        Output: false
        Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a
        palindrome.
        </br>
        Example 3:

        Input: x = 10
        Output: false
        Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
    </h2>
</body>
<script>
    console.log("hello world");
    flag = 1
    x = -10
    x = x.toString()
    var arr = Array.from(x)
    for (var i = 0; i < arr.length; i++) {
        console.log(arr[i], "hello", arr[arr.length - 1 - i]);
        if (arr[i] != arr[arr.length - 1 - i]) {
            flag = 0
        }
    }
    if (flag = 0) {
        console.log("No it is not pallindrome");
    }
    else console.log("Yes it is pallindorme");
</script>

</html>