Software Developer

Sorting can be used to solve this problem. Next, two-pointer technique can be applied on the sorted array.
Traverse the array and fix the first element of the triplet. Now use the Two Pointer technique to find if there is a pair whose sum is equal to x – array[i].
• Algorithm : 
1. Sort the given array.
2. Loop over the array and fix the first element of the possible triplet, arr[i].
3. Then fix two pointers, one at i + 1 and the other at n – 1. And look at the sum, 
3.1. If the sum < required sum, increment the first pointer.
3.2. Else, If the sum > required sum, Decrease the end pointer to reduce the sum.
3.3. Else, if the sum of elements at two-pointers == required sum, then print the triplet and break.

Time Complexity : O(n*log(n))

The idea is to use the sorted arrival and departure times of trains and count the total number of platforms needed at a time . Maintain a counter to count the total number of trains present at the station at any point. 
If the train is scheduled to arrive next, increase the counter by one and update the minimum platforms needed if the count is more than the minimum platforms needed so far.
If the train is scheduled to depart next, decrease the counter by 1.
Time Complexity : O(n*log(n))

1. In internal fragmentation fixed-sized memory, blocks square measure appointed to process. In external fragmentation, variable-sized memory blocks square measure appointed to the method.

2. Internal fragmentation happens when the method or process is larger than the memory. External fragmentation happens when the method or process is removed.
 

3. The solution of internal fragmentation is the best-fit block. The solution to external fragmentation is compaction and paging.
 

4. Internal fragmentation occurs when memory is divided into fixed-sized partitions. External fragmentation occurs when memory is divided into variable size partitions based on the size of processes.
 

5. The difference between memory allocated and required space or memory is called Internal fragmentation. The unused spaces formed between non-contiguous memory fragments are too small to serve a new process, which is called External fragmentation.

TOP keyword can be used to find the nth highest salary. By default ORDER BY clause print rows in ascending order, since we need the highest salary at the top, we have used ORDER BY DESC, which will display salaries in descending order. Again DISTINCT is used to remove duplicates. The outer query will then pick the topmost salary, which would be your Nth highest salary.

SQL query : 
 

SELECT TOP 1 salary
FROM ( 
SELECT DISTINCT TOP N salary
FROM #Employee 
ORDER BY salary DESC 
) AS temp
ORDER BY salary

In the case of Java, it is the magic of Bytecode that makes it platform independent.
This adds to an important feature in the JAVA language termed as portability. Every system has its own JVM which gets installed automatically when the jdk software is installed. For every operating system separate JVM is available which is capable to read the .class file or byte code.

1) Abstract class can have abstract and non-abstract methods. Interface can have only abstract methods. Since Java 8, it can have default and static methods also.

2) Abstract class doesn't support multiple inheritance. Interface supports multiple inheritance.
 

3) Abstract class can have final, non-final, static and non-static variables. Interface has only static and final variables.
 

4) Abstract class can provide the implementation of interface. Interface can't provide the implementation of abstract class.
 

5) The abstract keyword is used to declare abstract class. The interface keyword is used to declare interface.
 

6) An abstract class can extend another Java class and implement multiple Java interfaces. An interface can extend another Java interface only.
 

7) An abstract class can be extended using keyword "extends". An interface can be implemented using keyword "implements".