Strategic Resources Software Developer Interview Questions and Answers

Q1. Abstract class and interface
Add your answer
Q2. Oops concepts and
Add your answer

Q1. Configuration, project handling,Integrations
Add your answer

Profit and loss average , simple intesest

Fibonacci numbers , prime numbers , even odd numbers

Q1. SQL, Oracle PL SQL QUESTIONS
Add your answer
Q2. DML DDL TRIGGER PROCEDURE ETC
Add your answer

Q1. Check Valid parenthesis
Ans. 
Check if a string of parentheses is valid
• Use a stack to keep track of opening parentheses

• Pop from stack when encountering a closing parenthesis

• If stack is empty at the end and all parentheses are matched, it is valid
Answered by AI
Add your answer

Medium leveln coding round

Q1. Oops concepts, mvc related questions
Add your answer
Q2. Store procedure, function,
Add your answer
Q3. Asked SQL query scenario based questions
Add your answer

Q1. Oops , SQL and mvc questions. Mostly question was scenario based
Add your answer

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

Q1. Aggressive Cows
Given an array of length ‘N’, where each element denotes the position of a stall. Now you have ‘N’ stalls and an integer ‘K’ which denotes the number of cows that are aggressive. To prevent...read more
Ans. 
The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.
• Sort the array of stall positions in ascending order.

• Use binary search to find the largest minimum distance between cows.

• Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

• If it is possible, update the maximum distance and continue binary search ...read more
Answered by AI
View 2 more amswers
Q2. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. 
The problem is to find the shortest path between two houses in an unweighted graph.
• The graph represents the city of Ninjaland with houses connected by roads.

• The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

• The output is a vector of nodes representing the shortest path from the starting house to the ending house.

• If there are multiple shor...read more
Answered by AI
View 1 more amswer
Q3. Count Set Bits
You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N.
Since the count of ‘1’ can be huge, you are ...read more
Ans. 
The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.
• Convert each number from 1 to N into its binary representation

• Count the number of '1' bits in each binary representation

• Sum up the counts of '1' bits for all numbers

• Return the sum modulo 1e9+7
Answered by AI
View 2 more amswers

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

Q1. Reverse Words In A String
You are given a string of length N. You need to reverse the string word by word. There can be multiple spaces between two words and there can be leading or trailing spaces but in ...read more
Ans. 
The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.
• Split the string into words using spaces as delimiters

• Reverse the order of the words

• Join the reversed words with a single space between them

• Remove any leading or trailing spaces
Answered by AI
View 2 more amswers
Q2. Reverse List In K Groups
You are given a linked list of 'N' nodes and an integer 'K'. You have to reverse the given linked list in groups of size K i.e if the list contains x nodes numbered...read more
Ans. 
The task is to reverse a linked list in groups of size K.
• Iterate through the linked list in groups of size K

• Reverse each group using a helper function

• Connect the reversed groups to form the final reversed linked list
Answered by AI
View 2 more amswers
Q3. OS Questions
What is seamaphores?
Types of seamaphores?
What is virtual memory?
Ans. 
Semaphores are synchronization tools used in operating systems to control access to shared resources.
• Semaphores are integer variables used to solve the critical section problem.

• They can be used to control access to shared resources in a multi-threaded or multi-process environment.

• There are two types of semaphores: binary semaphores and counting semaphores.

• Binary semaphores can have only two values: 0 and 1, and are use...read more
Answered by AI
Add your answer
Q4. DBMS Questions
What is Normalisation?
Types of normal forms and condtion for BCNF.
What are ACID Properties.
Ans. 
Normalization is the process of organizing data in a database to eliminate redundancy and improve data integrity.
• Normalization is used to minimize data redundancy and dependency.

• It involves dividing a database into two or more tables and defining relationships between them.

• The goal is to eliminate data anomalies and ensure data consistency.

• There are different normal forms, such as 1NF, 2NF, 3NF, and BCNF.

• BCNF (Boyce-Co...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

Q1. Remove Consecutive Duplicates From String
You are given a string 'STR' consisting of lower and upper case characters. You need to remove the consecutive duplicates characters, and return the new st...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, add the current character to the new string

• Return the new string
Answered by AI
View 3 more amswers
Q2. Maximum Path Sum in the matrix
You have been given an N*M matrix filled with integer numbers, find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in th...read more
Ans. 
The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.
• Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

• For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

• Store the maximum sum path ending at each cell in a se...read more
Answered by AI
View 3 more amswers