Software Engineer

You are given a directed graph with ‘N’ nodes and ‘M’ edges. Each node has a lowercase letter assigned to it. For any path, the path’s value is defined as the maximum frequency of a letter on the path. You are supposed to find the maximum value of a path. If the maximum value can be infinitely large then return -1.

Example:

If some path has the letters “xyxxxyzz” then the value of this path will be 4 as the maximum frequency of any letter(‘x’) is 4.

1-The ability to query data, as well as insert, delete, and alter tuples, is offered by ..........................
i TCL (Transaction Control Language)
ii DCL (Data Control Language)
iii DDL (Data Definition Langauge)
iv DML (Data Manipulation Langauge)

2-Which command is used to remove a relation from an SQL?
i Drop table
ii Delete
iii Purge
iv Remove

1 -Banker's algorithm is used?

i-To prevent deadlock
ii-To deadlock recovery
iii-To solve the deadlock
iv-None of these

2- What type of scheduling is round-robin scheduling?

i-Linear data scheduling
ii-Non-linear data scheduling
iii-Preemptive scheduling
iv-Non-preemptive scheduling

Ninja is now bored with numbers and is now playing with characters but hates when he gets repeated characters. Ninja is provided a string, and he wants to return the first unique character in the string.The string will contain characters only from the English alphabet set, i.e., ('A' - 'Z') and ('a' - 'z'). If there is no non-repeating character, print the first character of the string. If there is no non-repeating character, return the first character of the string.

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.

You are given an array “A” of N integers. Your task is to find the maximum element in all K sized contiguous subarrays from left to right.

For Example:

If A = [3, 2, 3], and K = 2.
Then max of [3, 2] = 3 and max of [2, 3] = 3
So, the answer will be [3, 3]

If A = [3, 2, 3, 5, 1, 7] and K = 3.
Then max of [3, 2, 3] = 3 
Then max of [2, 3, 5] = 5 
Then max of [3, 5, 1] = 5 
Then max of [5, 1, 7] = 7 
So  the answer will be [3, 5, 5, 7]

Follow Up :

Can you solve the problem in O(N) time complexity and O(K) space complexity?

Implement your own java string inbuilt method "split()".

What is the use of the Static keyword? (Learn)
Can we create an object of static class? (Learn)

Q1. What is normalization, and why is it essential? (Learn)
Q2. Explain the purpose of indexing in a database. (Learn)
Q3. Explain the ACID properties. (Learn)

How do you delete a branch in Git? (Learn)

What is the purpose of the git clone command? (Learn)

Explain your project and tell me the technologies you have used in your projects.

Explain the functionality of project via source code.

Tell me about yourself.
What do you know about Accolite?
What are your strengths & weaknesses?
What will you do if your team is not able to perform well / below your expectations?