SDE - Intern

You have been given a permutation of ‘N’ integers. A sequence of ‘N’ integers is called a permutation if it contains all integers from 1 to ‘N’ exactly once. Your task is to rearrange the numbers and generate the lexicographically next greater permutation.

To determine which of the two permutations is lexicographically smaller, we compare their first elements of both permutations. If they are equal — compare the second, and so on. If we have two permutations X and Y, then X is lexicographically smaller if X[i] < Y[i], where ‘i’ is the first index in which the permutations X and Y differ.

For example, [2, 1, 3, 4] is lexicographically smaller than [2, 1, 4, 3].

Ninja has started a new business of selling bricks. There are ‘N’ types of bricks of distinct types present in his shop, and each brick’s cost is the number of bricks of that type currently present in his shop. The total number of each type of brick in the shop is given in an array 'ARR'. Ninja has received an order of ‘L’ bricks in his shop. Your task is to find the maximum profit Ninja can attain by this order.

You are given a non-empty string S containing no spaces’ and a dictionary of non-empty strings (say the list of words). You are supposed to construct and return all possible sentences after adding spaces in the originally given string ‘S’, such that each word in a sentence exists in the given dictionary.

Note :

The same word in the dictionary can be used multiple times to make sentences.
Assume that the dictionary does not contain duplicate words.

You are given a stream of 'N' integers. For every 'i-th' integer added to the running list of integers, print the resulting median.

Print only the integer part of the median.

1. final vs finalize vs finally
2. Types of Memory in Java
3. For which cases and why does OutOfMemoryException occur in Java.
4. For which Java Memory, does this exception occur.
5. Exception Handling (asked many cases like)
eg : Does code in the finally block run or not ?
int fun() {
try {
return 5;
}
finally {
System.out.println("abc");
}
}

6. Garbage Collection (asked in deep, when and how does garbage collector work) 
7. If we have a HashMap, and we want to share it among different web servers, how can we do that?

1. Process vs Thread
2. When and why do we need Synchronization? 
3 .Different ways to achieve Synchronization.
4. What is Multithreading and its example. 
5. Mutex vs Semaphore
6. Different types of Semaphores
7. What are Monitors

1. Different types of locks in Java
2. Like we use synchronized keyword in Java, which lock does it use internally.
3. wait vs notify in Java.
4, Different ways to create a thread in Java.
5. Coding Problem on Threads in Java -
Write a program in which one thread is printing odd values 1,3,5…
and another thread is printing even values 2,4,6…
But we should get the output 1,2,3,4,5,...