Arms Software Engineer Intern Interview Questions and Answers

2 Coding Questions, first was easy, second was medium

Q1. A question on trie data structure
Add your answer
Q2. Another DSA based question
Add your answer

Q1. Nodejs, full stack
Add your answer

Q1. Node js, full stack
Add your answer

Problems on ...
time and work
Pipes and cistern
Speed and distance
Probablity

Q1. Active and passive voice Spot the error Idoms Speech recognition Listen and answer
Add your answer
Q2. Talk for about a minute on given topic Listen for speech and ans questions based on them
Add your answer

Q1. Hr asked self intro. From that skills u have mentioned, u'll be questioned. Tell about your projects Ready for rellocation Salary expectations Bond agreement
Add your answer

There was 2 ques in OA round. One question out which i solved by using dp here OA focus mainly over graph and dp

Q1. Minimum element in stack in O(1) space
Ans. 
To find the minimum element in a stack in O(1) space, use an auxiliary stack to keep track of the minimum element at each step.
• Create an auxiliary stack to store the minimum element at each step.

• When pushing an element onto the main stack, compare it with the top element of the auxiliary stack and push the smaller one onto the auxiliary stack.

• When popping an element from the main stack, also pop the top element from th...read more
Answered by AI
Add your answer
Q2. What is segmentation fault and write the code to show this
Ans. 
A segmentation fault occurs when a program tries to access a memory location that it is not allowed to access.
• Segmentation faults commonly occur due to accessing an uninitialized pointer or accessing an array out of bounds.

• Here is an example code that causes a segmentation fault: int main() { int* ptr; *ptr = 10; return 0; }
Answered by AI
Add your answer
Q3. Balanced parenthesis and have to do all permutation of it and store it in vector and return this vector
Ans. 
Generate all permutations of balanced parentheses and store them in a vector.
• Use backtracking to generate all possible combinations of parentheses

• Check for balanced parentheses using a stack

• Store each valid combination in a vector

• Return the vector of permutations
Answered by AI
Add your answer

OA consist of two dsa questions

Q1. Dsa question based on string
Add your answer
Q2. Questions on oops , cn , linux
Add your answer

Dynamic programming, Graph, Hashing

1 Coding Problem
Questions on Projects and DBMS, OS, OOPS.

Q1. Behavioural Questions
Add your answer