Senior Software Developer

You are given ‘N’ distinct integers in the form of an array ‘ARR’. You need to find whether it is possible to sort the given array by choosing a continuous subarray and reversing that subarray. You have to return “true” if it is possible to sort the array after reversing the subarray. Otherwise, return “false”.

For example:

Let ‘ARR’ be: [3, 2, 1]
We can pick the whole array as a subarray and reverse it to get the sorted array [1, 2, 3].

Image Editors: Cloning ShapeS

Most image editors can retain the properties of a drawn shape, which makes the copy-paste operations easier. In, this challenge, implement the Shape class per the following constructor and methods:
• The constructor Shape(String type, String color).
• The method String getType to return the shape type.
• The method void setType(String type) to update the Shape type.
• The method String getColor( to return the shape color.
• The method void setColor(String color) to update the Shape color.
• The method Shape cloneShape() to return the clone of the shape.
The locked stub code in the editor validates the correctness of the Shape class implementation by performing the following operations on the shapes initially drawn on the image editor.
• CS shapeld. This operation creates the clone of the Shape.
• UT shapeld shapeNewType: This operation updates the shape type.
• UC shapeld shapeNewColor. This operation updates the shape color.
After performing all the operations, the locked stub code prints the type and color of each shape.
Constraints
• 1 ≤ numberOfShapes = 50
• 1 ≤ numberOfOperations ≤ 500

Input Format For Custom Testing

The first line contains the value of
numberOfShapes, the total number of shapes initially drawn in the image editor.
Each of the next numberOfShapes lines contains two space-separated strings, the shape's type and color.
The next line contains the value of numberOfOperations, the total number of operations performed on the drawn shapes.
Each of the next numberOfOperations lines contains one of the three operations listed above.

STDIN
Function
3
number0fShapes =
3
Circle Red
>
color = 'Red'
type = 'circle',
Square Blue
color = 'Blue'
type = "Square',
Circle Yellow
color = 'Yellow'
type = 'Circle',
6
number0fOperations
= 6
CS 1
)
operation = clone
shape ID 1
UT 1 Square
operation = update
shape ID 1 to 'Square'

Sample Output 0
Square Yellow
Square Blue
Circle Green
Circle Red
Circle Red
Circle Red

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.

Consider following Java program:

class func {
public static void main(String args[])
{
System.out.println("Hello World");
}
}
Hello World
Explanation:
1)public: It is an access specifier which allows the JVM(Java Virtual Machine) to access the main method from anywhere.
2)static: static keyword allows the JVM to access the main method without any instance(object).
3)void: It specifies that the main method doesn’t return anything.
4)main: name of the method(function) configured in JVM.
5)String args[]: Command line arguments.

Now, if we replace ‘public’ with ‘private’ in “public static void main”, the above code becomes:

class func {
private static void main(String args[])
{
System.out.println("Hello World");
}
}
Explanation:
The above code will be compiled successfully, but will throw a runtime error as follows:

Error: Main method not found in class func, please define the main method as:
public static void main(String[] args)
or a JavaFX application class must be defined.

Given an array/list of integer numbers 'CHOCOLATES' of size 'N', where each value of the array/list represents the number of chocolates in the packet. There are ‘M’ number of students and the task is to distribute the chocolate to their students. Distribute chocolate in such a way that:

1. Each student gets at least one packet of chocolate.

2. The difference between the maximum number of chocolate in a packet and the minimum number of chocolate in a packet given to the students is minimum.

Example :

Given 'N' : 5 (number of packets) and 'M' : 3 (number of students)

And chocolates in each packet is : {8, 11, 7, 15, 2}

All possible way to distribute 5 packets of chocolates among 3 students are -

( 8,15, 7 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 8, 15, 2 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’ 
( 8, 15, 11 ) difference of maximum-minimum is ‘15 - 8’ = ‘7’
( 8, 7, 2 ) difference of maximum-minimum is ‘8 - 2’ = ‘6’
( 8, 7, 11 ) difference of maximum-minimum is ‘11 - 7’ = ‘4’
( 8, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’
( 15, 7, 2 ) difference of maximum-minimum is ‘15 - 2’ = 13’
( 15, 7, 11 ) difference of maximum-minimum is ‘15 - 7’ = ‘8’
( 15, 2, 11 ) difference of maximum-minimum is ‘15 - 2’ = ‘13’
( 7, 2, 11 ) difference of maximum-minimum is ‘11 - 2’ = ‘9’

Hence there are 10 possible ways to distribute ‘5’ packets of chocolate among the ‘3’ students and difference of combination (8, 7, 11) is ‘maximum - minimum’ = ‘11 - 7’ = ‘4’ is minimum in all of the above.