Beyond Codes Interview Questions and Answers

Q1. End to end implementation cycle of isms
Ans. 
The end to end implementation cycle of ISMS involves planning, implementation, monitoring, review, and improvement.
• Planning involves identifying the scope, objectives, and risks of the ISMS.

• Implementation involves designing and implementing controls to mitigate identified risks.

• Monitoring involves regular checks to ensure the controls are effective.

• Review involves assessing the effectiveness of the ISMS and identifying...read more
Answered by AI
Add your answer
Q2. Risk assessment steps
Ans. 
Risk assessment involves identifying, analyzing, and evaluating potential risks to determine the likelihood and impact of those risks.
• Identify potential risks

• Analyze the likelihood and impact of each risk

• Evaluate the risks to determine their priority

• Develop a plan to mitigate or manage the risks

• Monitor and review the risks regularly
Answered by AI
Add your answer

Q1. Enterprise risk assessment
Add your answer
Q2. Annex A control of iso 27001
Ans. 
Annex A controls are the information security controls listed in ISO 27001 standard.
• Annex A contains 114 controls categorized into 14 sections.

• These controls are designed to ensure the confidentiality, integrity, and availability of information.

• Examples of controls include access control, asset management, cryptography, incident management, and more.

• Organizations must select and implement controls based on their risk a...read more
Answered by AI
Add your answer

Online test with two section one is general aptituide and Basic cs concepts. And Second round containing the 2 dsa question with intermediate level question.

Q1. Two sorted array in asscending order give the media of two array after merging in asscending order.
Ans. 
The median of two sorted arrays merged in ascending order.
• Merge the two sorted arrays into a single sorted array.

• Find the median of the merged array.

• If the merged array has an odd length, the median is the middle element.

• If the merged array has an even length, the median is the average of the two middle elements.
Answered by AI
Add your answer
Q2. Question on resume on java script 1. whats is closure? 2. what is hoisting? cookie session.
Add your answer

Q1. Data structure and algorithm problems
Add your answer

It will be around 3 hours and 2 questions of leetcode hard difficulty will be asked in the interview and 1 question is of codeforces 2400+ difficulty question.

Q1. 1-2 DSA medium-hard difficulty question will be asked.
Add your answer
Q2. CS fundamentals in depth had been asked in the ending of the interview.
Add your answer

Q1. System Design problem was asked.
Add your answer

Q1. This is a cultural fit round. Common HR question was asked.
Add your answer

Round duration - 75 minutes
Round difficulty - Easy

This round was conducted in Hackerrank portal for a total duration of 75 minutes and was divided into 4 sections.

1st Section : Aptitude Section : 14 questions , 28 minutes
2nd Section : Technical Section : 12 questions , 17 minutes
3rd Section :1 coding Questions : 20 minutes+30 minutes

This Round was Conducted on Hackerrank (Webcam Enabled).

Q1. Given a problem statement and a piece of code, how would you find and correct the bug in the code?
Ans. 
To find and correct a bug in code, analyze problem statement, review code, use debugging tools, and test different scenarios.
• Understand the problem statement and expected output

• Review the code for syntax errors, logical errors, and potential bugs

• Use debugging tools like breakpoints, print statements, and IDE debuggers

• Test the code with different inputs and edge cases to identify the bug

• Make necessary corrections and re
Answered by AI
Add your answer
Q2. 
Nodes at Distance K from Target Node in Binary Tree
Given a Binary Tree of distinct integers and two integers, target and K, return a list of values of all nodes located at a distance K from the target no...read more
Ans. 
Find nodes at distance K from target node in a Binary Tree.
• Use BFS to traverse the tree and keep track of the distance of each node from the target node.

• Maintain a set to keep track of visited nodes to avoid revisiting them.

• Return the values of nodes at distance K from the target node.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM

Q1. 
Subarray Challenge: Largest Equal 0s and 1s
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input:
Input beg...read more
Ans. 
Find the length of the largest subarray with equal number of 0s and 1s in a given array.
• Iterate through the array and maintain a count of 0s and 1s encountered so far.

• Store the count difference in a hashmap with the index as key.

• If the same count difference is encountered again, the subarray between the two indices has equal 0s and 1s.

• Return the length of the longest subarray found.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.