Securonix Associate Software Engineer Interview Questions and Answers

It was an online assessment. Some coding questions. Some cs fundamental mcqs. SQL query, Rest Api question.

An assignment to create a game using nodejs/ go lang/ java.

Q1. Discussion related to Assignment. Told some changes and told to add some more functionalities.
Add your answer
Q2. Some APIS were given. It was case study. You had to show the dishes to a customer according to his preferences.
Add your answer

Online aptitude test with general aptitude questions.

Q1. Basic js, ES6 features, Angular Questions, Node.js Lifecycle, event loop, mongodb questions, some HR questions
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Medium level competitive programming question. Interviewer looked for the approach and working code.

Q1. 
Time to Burn Tree Problem
You are given a binary tree consisting of 'N' unique nodes and a start node where the burning will commence. The task is to calculate the time in minutes required to completely b...read more
Ans. 
Calculate the time in minutes required to completely burn a binary tree starting from a given node.
• Perform a depth-first search (DFS) to calculate the time taken to burn the entire tree.

• Track the time taken to burn each node based on its distance from the starting node.

• Consider the maximum time taken among all nodes as the total time to burn the entire tree.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

Timing : Evening
Interviewer was frank. He checked for indepth knowledge of the subject.

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
0/1 Knapsack Problem Statement
A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...read more
Ans. 
Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).
• Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

• Iterate through each item and update the array based on whether including the item would increase the total value.

• The final value in the array at index W will be the maximum value that can be stolen.
Answered by AI
Add your answer
Q2. 
Find the Second Largest Element
Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.
If a second largest element does not exist, return -1.
Example:
Input:
ARR = [2,...read more
Ans. 
Find the second largest element in an array of integers.
• Iterate through the array to find the largest and second largest elements.

• Handle cases where all elements are identical.

• Return -1 if a second largest element does not exist.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
Ans. 
Design a scalable system for Twitter with key components and architecture.
• Use microservices architecture for scalability and fault isolation.

• Key components include user service, tweet service, timeline service, and notification service.

• Use a distributed database like Cassandra for storing tweets and user data.

• Implement a message queue like Kafka for handling real-time updates and notifications.

• Use a caching layer like ...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality