Junior Software Engineer

You’re given the predicate price of XYZ company’s share for every minute. Each minute, you’re allowed to either buy one share of XYZ or sell any number of shares of XYZ that you own or not make any transaction at all. Your task is to find out the max profit.

Constraints:

1 <= T <= 10

1 <= N <= 5*10^5

All share price are between 1 and 10^5

Input Format:

The first line contains the number of test cases T. T test cases following consisting of two lines.

The first line of each test case contains a number of N. The next line contains N integers, denoting the predicated price of shares for the next N minutes.

Output Format:

Output T lines, each contains the maximum profit which can be obtained for the corresponding test case.

Katrina has a string ‘s’ consisting of one or more of the following letters: a, e, i, o, u. We define a magical subsequence of letters derived from s that contains all five vowels in order. This means a magical subsequence will have one or more a’s followed by the one or more s followed by one or more i’s followed by one or more o’s followed by one or more u’s. For example, if s = “aeeiooua”, then “aeiou” and “aeeioou” are magical subsequences but “aeio” and “aeeioua” are not.

Input Format:

Your code should be read input from the given attached file as a string (no line breaks)

Constraints:5 length of string s M 5*105String s is composed of English vowels (a, e, i, o, u)

Output Format:

You must return an integer denoting the length of the longest magical subsequence in s

Given a string of length N of lowercase character contains 0 or more vowels, the task is to find the count of vowels that occurred in all the substring of the given string.Thomas is always curious about vowels so he decided to know how many vowels can be found from all possible substrings made from a particular string without jumbling the character.

Sample Input:

abc

Sample Output:

3

There are n couples sitting in 2n seats arranged in a row and want to hold hands.

The people and seats are represented by an integer array row where row[i] is the ID of the person sitting in the i^th seat. The couples are numbered in order, the first couple being (0, 1), the second couple being (2, 3), and so on with the last couple being (2n - 2, 2n - 1).

Return the minimum number of swaps so that every couple is sitting side by side. A swap consists of choosing any two people, then they stand up and switch seats.

Example 1:

Input: row = [0,2,1,3] Output: 1 Explanation: We only need to swap the second (row[1]) and third (row[2]) person.

Example 2:

Input: row = [3,2,0,1] Output: 0 Explanation: All couples are already seated side by side.

Constraints:

• 2n == row.length
• 2 <= n <= 30
• n is even.
• 0 <= row[i] < 2n
• All the elements of row are unique.

Total Questions : 10-15

JAVA :
Q1-Which of the following is not a Java features?
a-Dynamic
b-Architecture Neutral
c-Use of pointers
d-Object-oriented

Q2-_____ is used to find and fix bugs in the Java programs.
a-JVM
b-JRE
c-JDK
d-JDB

SQL :
Q1-Which of the following are TCL commands?
a-COMMIT and ROLLBACK
b-UPDATE and TRUNCATE
c-SELECT and INSERT
d-GRANT and REVOKE

Q2-Which of the following is not a valid aggregate function?
a-COUNT
b-COMPUTE
c-SUM
d-MAX

Object Oriented Programming:

Q1-Which of the following definition is incorrect for polymorphism?
a-Polymorphism helps in redefining the same functionality
b-Polymorphism concept is the feature of object-oriented programming (OOP)
c-It always increases the overhead of function definition
d-Ease in the readability of the program

Pseudocode :

Q1-Which of the following series will be printed by the given pseudocode? 
Integer a, b, c 
Set b = 4, c = 5 
for(each a from 2 to 4) 
print c 
b = b - 1 
c = c + b 
end for
a-5 8 10
b-1 3 6
c-8 9 10
d-3 6 9

This round was based on Java and DSA 
Q1-What are the differences between C++ and Java?(Link)
Q2-Why is Java a platform independent language?(Link)
Q3-What are the various access specifiers in Java?(Link)
Q4-How many types of constructors are used in Java?(Link)
Q6-Does constructor return any value?(Link)
Q7-What do you understand by an instance variable and a local variable.(Link)
Q8-Difference between equals() method and equality operator (==) in Java.(Link)
Q9-Explain method overloading and overriding.
Q10- Can the main method be Overloaded.(Link)
Q11-use of final keyword in variable, method and class.(Link)
Q12- Can the static methods be overloaded.(Link)
Q13-What is the main objective of garbage collection.(Link)
Q14-Explain 4 OOPS pillars.(Link)
Q15-What is Multithreading.(Link)
Q16-Explain Exception Handling in java.(Link)
Q17-Difference between throw and throws.(Link)

You are given an integer array 'A' of size 'N', sorted in non-decreasing order. You are also given an integer 'target'. Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. If 'target' is not present in the array 'A', return -1.

Note:

You must write an algorithm whose time complexity is O(LogN)

You are given ‘N’ integers in the form of an array ‘ARR’. Print the sorted array using the insertion sort.

Note :

No need to return anything. You should sort the array in-place.

For example :

Let ‘ARR’ be: [1, 4, 2]
The sorted array will be: [1, 2, 4].

Implement Inheritence in java.(Link)

In this round, they mainly asked questions about the projects I had mentioned on my resume and the following questions were asked :
1-Introduce yourself
2-What technologies you have worked on
3-Explain all your projects in brief
4-Explain in detail about the project you have worked in team
5- What challenges did you face as a team member/leader?
6- which programming langugages you have worked on
5-What are your strengths and weakness
7-Are you open to relocation?
8-What are your expectations regarding work at EPAM?