STAR O & M Interview Questions and Answers

Q1. OOPS Concepts, collections framework, memory management, exception handling, java 8 features, spring framework
Add your answer

Q1. System design questions, spring framework, project roles and responsibilities, scenario based questions
Add your answer

Q1. Salary Negotiation, reason for leaving organization
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The test was scheduled around 5 evening and it had 3 coding questions. First question was on Dynamic Programming and other was medium question and was easy and the third was based on graph. And there were 20 mcq questions on Data structures, DBMS and OS

Q1. 
Matrix Word Search Problem
Explanation: You are given an 'M' x 'N' matrix of characters named CHARACTER_MATRIX and a string WORD. Your task is to identify and list all the occurrences of the string within...read more
Ans. 
Matrix Word Search Problem - Find occurrences of a given word in all eight possible directions within a matrix.
• Iterate through each cell in the matrix and check for the starting character of the word.

• For each occurrence of the starting character, check all eight directions for the complete word.

• Keep track of the coordinates of each character in the word for each occurrence found.

• Ensure boundaries are not crossed while ...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Normal Coding question on Graphs and some basics from DBMS

Q1. 
Transitive Closure of Directed Graph Problem Statement
Given a directed graph with 'V' vertices and 'E' edges, determine if a vertex i is reachable from vertex j for all pairs of vertices (i, j). A vertex...read more
Ans. 
Determine reachability between all pairs of vertices in a directed graph.
• Use Floyd Warshall algorithm to find transitive closure of the graph.

• Initialize a V x V matrix with 1s on the diagonal and 0s elsewhere.

• Update matrix by checking if there is a path from i to j through k.

• Repeat the process for all vertices to get the transitive closure matrix.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

He asked me to read about Morse language in wikepedia and asked me to write a code on it i. e. If the input Morse code and in output we should get it in English

Q1. 
Morse Code to English Problem Statement
You are provided with a string of morse code(s) of length N. Your task is to convert this morse code into the corresponding alphanumeric code consisting of lowercas...read more
Ans. 
Convert Morse code to alphanumeric code using a predefined table.
• Iterate through the morse code string and convert each morse code to its corresponding alphanumeric character using the given table.

• Join the converted characters to form the final alphanumeric string.

• Handle spaces between morse code characters by adding a space in the final alphanumeric string.
Answered by AI
Add your answer