SWE Intern

You are given a number ‘N’ as a string in base ‘B’. Your task is to convert ‘N’ in base 10. If it’s impossible to convert ‘N’ into base 10, then you need to print -1.

Note :

1. ‘N’ contains only digits ‘0’ to ‘9’ and English letters ‘A’ to ‘F’.
2. Decimal equivalent of 0 is 0, 1 is 1, . . .9 is 9, A is 10, B is 11, . . . F is 15.

Given valid mathematical expressions in the form of a string. You are supposed to return true if the given expression contains a pair of redundant brackets, else return false. The given string only contains ‘(‘, ’)’, ‘+’, ‘-’, ‘*’, ‘/’ and lowercase English letters.

Note :

A pair of brackets is said to be redundant when a subexpression is surrounded by needless/ useless brackets.

For Example :

((a+b)) has a pair of redundant brackets. The pair of brackets on the first and last index is needless. 
While (a + (b*c)) does not have any pair of redundant brackets. 

Market Research firm is surveying popular brands. The person who has the best pulse of the survey the firm will reward the population. The survey comprised of N questions was taken by M participants, not simultaneously but one after the other. There is no correct answer since it is a survey of brands. Each question can have only four options (1,2,3,4). Most expected answers to different questions are used as a template to measure brand popularity. Think of this as a default answer sheet where the question paper is the Survey. '0' represents no answer to a question. Thus it means that the participant has skipped answering that question.

Right Answer: For a particular question, the highly chosen option till that point in time is treated as the correct answer. If multiple options have the exact count, then out of those options, the one which was chosen recently is treated as the correct answer.

Score of a Participant: One point will be awarded for each correct answer. No negative points for wrong answers.

Instant Result: This is shared with the Participant instantly after completing his/her exam. (this is equal to the number of correct answers)

Final Result: Only the final top scorer(TOPPER) is announced along with his score.

Note:

At the end of all M Participants completing the exam, the final correct answers get decided.
Based on these answers score of each candidate gets recalculated, and the one with the highest score is the TOPPER!!!
If more than one Participant gets the top score, then the one who attempted the exam first is treated as TOPPER.

You are given an undirected graph with N nodes in the form of an adjacency matrix. You are also given an integer M.

Your task is to find if you can color the vertices of the graph using at most M colors such that no two adjacent vertices are of the same color.

For example:

If the given adjacency matrix is:
[0 1 0]
[1 0 1]
[0 1 0] and M = 3.

The given adjacency matrix tells us that node 1 is connected to node 2 and node 2 is connected to node 3. 

So if we color vertex 1 with ‘red’, vertex 2 with ‘blue’, and vertex 3 with ‘red’, it is possible to color the given graph with two colors which is less than or equal to M.

This time Ninja is helping a lost passenger on a bus stop to reach his destiny with the minimum number of buses he needs to change, on the bus stop a chart is present which contains 'N' arrays. An array 'A' denotes the route that a bus will take, such that A[i] denotes the bus stop 'i'th bus will travel to.

For Example

If the bus route is [3, 6, 7], then it will travel  in sequence 
3 > 6 > 7 > 3 > 6 > 7….

You can travel between the bus stations through buses only. You are given the source bus station and destination bus station. You need to determine the minimum number of buses you need to reach the destination. If it is not possible to reach destination return -1.

Note:

Values of A[i] are distinct.

Initially discussed my last internship experience.

HR questions: 

1.) Strengths. 

2.) Weaknesses.

DBMS standard problems: 1.) ACID properties. 2.) SQL vs NO-SQL. 3.) Concurrency and transactions

OOPS questions: 1.) Types of polymorphism with use cases. 2.) Use case for Abstraction.