# Cut Palindrome - Amazon Top Interview Questions

### Problem Statement :

```Given two strings a and b of equal length, return whether it is possible to cut both strings at a common point such that the first part of a and the second part of b form a palindrome.

Constraints

n ≤ 100,000 where n is the length of a and b

Example 1

Input

a = "cat"
b = "pac"

Output

True

Explanation

If we cut the strings into "c" + "at" and "p" + "ac", then "c" + "ac" is a palindrome.

Example 2

Input

a = "iceboat"
b = "racecar"

Output

True

Explanation

If we cut the strings into "" + "iceboat" and "" + "racecar", then "" + "racecar" is a palindrome.```

### Solution :

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

bool chk(string s, int i, int j) {
while (i <= j) {
if (s[i] != s[j]) break;
i++;
j--;
}

if (i > j)
return 1;
else
return 0;
}

bool solve(string a, string b) {
int n = a.size();

if (n < 2) return 1;

int i = 0, j = n - 1;

while (i <= j) {
if (a[i] != b[j]) break;
i++;
j--;
}

if (i > j) return 1;

return chk(a, i, j) || chk(b, i, j);
}```
```

```                        ```Solution in Python :

class Solution:
def solve(self, a, b):
n, i = len(a), 0
while i < n // 2 and a[i] == b[~i]:
i += 1
if all(a[j] == a[~j] for j in range(i, n // 2)):
return True
if all(b[j] == b[~j] for j in range(i, n // 2)):
return True
return False```
```

## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your \$inOrder* func

## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

## Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

## Tree: Level Order Traversal

Given a pointer to the root of a binary tree, you need to print the level order traversal of this tree. In level-order traversal, nodes are visited level by level from left to right. Complete the function levelOrder and print the values in a single line separated by a space. For example: 1 \ 2 \ 5 / \ 3 6 \ 4 F