Software Developer

A palindrome string is one that reads the same backward as well as forward.

You are given a string 'str'.

Find the minimum number of characters needed to insert in 'str' to make it a palindromic string.

Example :

Input: 'str' = "abca"

Output: 1

Explanation:
If we insert the character ‘b’ after ‘c’, we get the string "abcba", which is a palindromic string. Please note that there are also other ways possible.

You are given a set of ‘n’ types of rectangular 3-D boxes. The height, width, and length of each type of box are given by arrays, ‘height’, ‘width’, and ‘length’ respectively, each consisting of ‘n’ positive integers. The height, width, length of the i^th type box is given by ‘height[i]’, ‘width[i]’ and ‘length[i]’ respectively.

You need to create a stack of boxes that is as tall as possible using the given set of boxes.

Below are a few allowances:

You can only stack a box on top of another box if the dimensions of the 2-D base of the lower box ( both length and width ) are strictly larger than those of the 2-D base of the higher box. 

You can rotate a box so that any side functions as its base. It is also allowed to use multiple instances of the same type of box. This means, a single type of box when rotated, will generate multiple boxes with different dimensions, which may also be included in stack building.

Return the height of the highest possible stack so formed.

Note:

The height, Width, Length of the type of box will interchange after rotation.

No two boxes will have all three dimensions the same.

Don’t print anything, just return the height of the highest possible stack that can be formed.

What is VPN 
What is different types of network.

What is deadlock
Whst is cache memory

You are given three stacks A, B and C of positive integers with lengths 'lenA', 'lenB' and 'lenC' respectively.

Stacks are represented as an array in the input, and the first index of the array represents the topmost element of the stack.

You can remove any number of elements(possibly zero) from the top of each of the three stacks. Your task is to find the maximum possible equal sum of the elements of the stack.

For example-

Let the stacks be-
A = [2 , 2, 1, 1]
B = [1, 4]
C = [4]

We can remove the topmost element from stack A and the topmost element from stack B.

The final stacks after removal of the elements are-
A = [2, 1, 1]
B = [4]
C = [4]
Sum of elements of stack A = 4.
Sum of elements of stack B = 4.
Sum of elements of stack C = 4.

The maximum possible equal sum is equal to 4.

Just a verification details

Introduce yourself

Why cisco