Software Engineer

Matching DDL, DML, DCL, TCL commands with examples.
ColA:
A) DDL
B) DML,
C) DCL,
D) TCL

ColB: 
1) GRANT, REVOKE
2) UPDATE, DELETE, MERGE
3) COMMIT, ROLLBACK
4) TRUNCATE, COMMENT, RENAME, DROP

Given a tree, and below structure, choose the appropriate array representation.
A
/ \
B C
/ \ \ 
D E F 
/
H

struct node{
string data;
struct node* left, right;
} 



Options: 
1) DBGEAHFCA
2) ABCDE_F_ _G_ _ _H
3) ABCDEFGH
4) Given tree cannot be represented in an array.

Small Problems based on code-snippets and expected outputs, and debugging.

You are given a 2D board('N' rows and 'M' columns) of characters and a string 'word'.

Your task is to return true if the given word exists in the grid, else return false. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring.

Note:

The same letter cell should not be used more than once.

For Example:

For a given word “design” and the given 2D board 
[[q’, ‘v’, ‘m’, ‘h’],
 [‘d’, ‘e’, ‘s’, ‘i’],
 [‘d’, ‘g’, ‘f’, ‘g’],
 [‘e’, ‘c’, ‘p’, ‘n’]]

The word design can be formed by sequentially adjacent cells as shown by the highlighted color in the 2nd row and last column.

You have been given an array 'A' of N integers. You need to find the maximum value of j - i subjected to the constraint of A[i] <= A[j], where ‘i’ and ‘j’ are the indices of the array.

For example :

If 'A' = {3, 5, 4, 1}

then the output will be 2.
Maximum value occurs for the pair (3, 4)

For a given input string(str), write a function to print all the possible substrings.

Substring

A substring is a contiguous sequence of characters within a string. 
Example: "cod" is a substring of "coding". Whereas "cdng" is not as the characters taken are not contiguous

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

- Discussion about SQL, and MongoDB
- Discussion about the idea behind Binary Search technique, and where all it seems like it is applicable, but not actually applicable.

Alot of drilling on OOPs questions like:
- Briefly explain OOPs concepts (All 4)
- Difference between Runtime and compile-time polymorphism.
- What's an Interface? Where and why it's used?
- Difference between Interface and Abstract Class
- Can we define methods in Interface in Java? I said "yes" , he asked more details about it like which version and how to do it.

You are given with an array of integers and an integer K. You have to find and print the count of all such pairs which have difference K.

Note: Take absolute difference between the elements of the array.

3 questions related to queries.
One was about AGGREGATE functions(like MAX, AVG, FIRST, LAST) and the two other ones were about JOINS(Left, right, full outer and all)

Some questions on HR level, as "Where do you see yourself in 5 yrs?", "Would you be interested more in Managerial side or technical side after few years?", etc.

Asked me about different SDLC processes, Agile vs Waterfall.
Also asked questions related to flow of Git : Branches, Merge, Rebase
He then asked me some questions about real life implementation of Data structures 

Drilled for 20 mins with questions related to projects at a deeper level.
Also asked behavioral questions based on project experiences.