# Palindromic Integer - Amazon Top Interview Questions

### Problem Statement :

```Given a non-negative integer num, return whether it is a palindrome.

Bonus: Can you solve it without using strings?

Constraints

num < 2 ** 31

Example 1

Input
num = 121

Output
True

Example 2

Input
num = 20200202

Output
True

Example 3

Input
num = 43

Output
False```

### Solution :

```                        ```Solution in C++ :

bool solve(int num) {
int t = num;
int rev = 0;
while (t) {
rev = rev * 10 + t % 10;
t = t / 10;
}
if (rev == num) {
return true;
}
return false;
}```
```

```                        ```Solution in Java :

import java.util.*;

class Solution {
public boolean solve(int num) {
if (num < 0 || (num != 0 && num % 10 == 0))
return false;

int rev = 0;
while (num > rev) {
rev = rev * 10 + num % 10;
num = num / 10;
}
return (num == rev || num == rev / 10);
}
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, num):
a = 0
c = num
while num > 0:
r = num % 10
num = num // 10
a = (10 * a) + r
if a == c:
return True
else:
return False```
```

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio