CIS - Cyber Infrastructure interview experience Real time questions & tips from candidates to crack your interview
Software Engineer Intern
CIS - Cyber Infrastructure
2 rounds | 2 Coding
problems
Selected Interview preparation journey
Journey
Our seniors informed us how important DSA is to crack interviews. Therefore, I started practicing DSA from GeeksFromGeeks, Leetcode, and code studio in my second year. I practice a lot of questions.
Application story
This company visited to my campus for the internship. We just had to upload resume and fill all details in the form. First, they took the online assessment. Later, they called us for the interview rounds.
Why selected/rejected for the role?
I was selected because I was able to answer all coding questions properly. I started with a naive approach and went ahead to explain the optimized approach for almost all the questions.
Preparation
Duration: 4 months
Topics: DBMS, Data Structures and Algorithms , OOPS, Aptitude
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Application process
Where: Campus
Eligibility: Above 6 CGPA
Tip 1 : Keep it simple and readable and don't bluff
Tip 2 : Not more than 1 page
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 mins
Interview date10 Feb 2022
Coding problem1
1. Maximum In All Sub-Arrays Of Size K
Easy
10m average time
90% success
0/40
Asked in companies
Given an array/list ‘ARR’ of integers and an integer ‘K’. You are supposed to return the maximum for every subarray of the given array of length ‘K’.
Note :
An array ‘B’ is a subarray of an array ‘A’ if ‘B’ that can be obtained by deletion of, several elements(possibly none) from the start of ‘A’ and several elements(possibly none) from the end of ‘A’.
Problem approach
Made a prefix sum array.
For every index i, subtracted the minimum value between (prefix[0.....i-1]) from prefix[i].
02
Round
Easy
Video Call
Duration60 mins
Interview date18 Feb 2022
Coding problem1
1. LCA Of Binary Tree
Moderate
10m average time
90% success
0/80
Asked in companies
You have been given a Binary Tree of distinct integers and two nodes ‘X’ and ‘Y’. You are supposed to return the LCA (Lowest Common Ancestor) of ‘X’ and ‘Y’.
The LCA of ‘X’ and ‘Y’ in the binary tree is the shared ancestor of ‘X’ and ‘Y’ that is located farthest from the root.
Note :
You may assume that given ‘X’ and ‘Y’ definitely exist in the given binary tree.
For example :
For the given binary tree
LCA of ‘X’ and ‘Y’ is highlighted in yellow colour.
Problem approach
I first used both DFS and BFS to solve the problem and also wrote the code.
Then I explained the Binary lifting approach but was not asked to code.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Junior Associate: Marketing Strategy and Analysis
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Rejected
902 views
0 comments
0 upvotes
Associate Technology
3 rounds | 4 problems
Interviewed by CIS - Cyber Infrastructure
Selected 1057 views
0 comments
0 upvotes
Associate Software Engineer
2 rounds | 3 problems
Interviewed by CIS - Cyber Infrastructure
Selected 598 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by CIS - Cyber Infrastructure
Selected 580 views
1 comments
0 upvotes
Companies with similar interview experiences
Software Engineer Intern
3 rounds | 9 problems
Interviewed by NCR Corporation
Selected 1260 views
0 comments
0 upvotes