Upload Button Icon Add office photos

Filter interviews by

Clear (1)

Securonix Software Developer Intern Interview Questions and Answers

Updated 27 Jul 2023

Securonix Software Developer Intern Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Institute of Technical Education and Research, Bhuvaneshwar and was interviewed in Jun 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Aptitude Test 

Average difficulty basic questions

Round 3 - Technical 

(1 Question)

  • Q1. 2 codes 1 subquery OOPS DBMS Linux data structures
Round 4 - Technical 

(1 Question)

  • Q1. Based on understanding of OOPS and DBMS .In depth knowledge required.

Rate your
company

🤫 100% anonymous

How was your last interview experience?

Share interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Job Fair and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

More focus on dp,graphs.

Round 2 - Technical 

(2 Questions)

  • Q1. Focus on backend concepts,routing.
  • Q2. Question on flood fill algo,backtracking.
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Graphs ,arrays , Hashmaps and Heaps

Round 2 - One-on-one 

(2 Questions)

  • Q1. Graphs related dfs
  • Q2. Changes on graph structure
  • Ans. 

    Changes on graph structure involve adding, removing, or modifying nodes and edges.

    • Adding a new node to the graph

    • Removing an existing node from the graph

    • Modifying the weight of an edge in the graph

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was based on dynamic programming

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA very well
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at Malviya National Institute of Technology (NIT), Jaipur and was interviewed before Sep 2022. There were 3 interview rounds.

Round 1 - Coding Test 

This round had first questions about behavior, team work and hr type mcq questions.
Then there were 10 computer science mcqs. Then two coding questions.

Round 2 - Technical 

(1 Question)

  • Q1. This was of 1 hour. He asked about 2-3 dsa questions and some hr questions in last part.
Round 3 - Technical 

(1 Question)

  • Q1. This was also a similar round like round 2. In this he asked 2 medium dsa questions and some hr questions at last.

I was interviewed in May 2022.

Round 1 - Face to Face 

(2 Questions)

Round duration - 150 minutes
Round difficulty - Medium

The interview was scheduled at 6 pm and the duration of the interview was 1.5 hrs but went for around 2.5 hrs. The interviewer started with a brief intro about me. Asked me some coding questions. After coding questions he started asking questions on dbms like difference between sql and no sql, what is horizontal and vertical scaling and when we use them. Then some questions on computer networks like how web browsers works, different between http and HTTPS, what is TCP. After this he asked about my projects and the technology I worked on during the intern.

  • Q1. 

    Snake and Ladder Problem Statement

    Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each...

  • Q2. 

    Deletion In Doubly Linked List

    You are given a Doubly Linked List with 'N' positive integers. Your task is to delete a node at a given position 'POS' in this linked list.

    Input:

    The first line of input ...
Round 2 - HR 

Round duration - 20 minutes
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteriaNeed good projects in your resume.Zomato interview preparation:Topics to prepare for the interview - Dsa, computer networks, operating system, system design, dbmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Study all the concepts of dbms and cn deeply
Tip 2 : Zomato focus on development, so you have to do some good projects or should have previous internship experience.

Application resume tips for other job seekers

Tip 1 : Have good Projects
Tip 2 : Study all the topics deeply that u mentioned in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Easy

2 easy problems for coding.

  • Q1. 

    All Prime Numbers Less Than or Equal to N

    Given a positive integer N, your task is to return all the prime numbers less than or equal to N.

    Note:

    1) A prime number is a number that has only two factors:...
  • Q2. 

    Running Absolute Difference in Arrays

    Given an array ARR consisting of 'N' non-negative integers, compute the running absolute difference of elements at even and odd index positions, respectively.

    Input:

    ...
Round 2 - Video Call 

Round duration - 30 minutes
Round difficulty - Hard

Face to face interview, design and coding involved.

Interview Preparation Tips

Professional and academic backgroundI completed Software Engineering from Delhi Technological University. I applied for the job as SDE - Intern in LondonEligibility criteriaCGPA above 7Facebook interview preparation:Topics to prepare for the interview - DBMS, Data Structures and Algorithms , OOP, Maths puzzles, Aptitude , CN, OSTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

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.
Tip 4 : Atleast 4 projects in Resume

Application resume tips for other job seekers

Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.

Final outcome of the interviewRejected

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 65 minutes
Round difficulty - Hard

Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.

  • Q1. 

    Determine Count of Good Triplets

    You are given two arrays ARR1 and ARR2, containing N and M elements respectively. There are two types of 'good triplets' that need to be identified in these arrays.

    Type ...

  • Q2. 

    Split the String Problem Statement

    You are given a string str consisting of N lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...

Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Medium

  • Q1. 

    Check if Two Trees are Mirror

    Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.

    Explanation:

    Two trees are considered mirror of each other if...

  • Q2. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in HyderabadEligibility criteriaAll students were allowedLinkedIn interview preparation:Topics to prepare for the interview - Arrays, recursion, DP, trees and graphs, stack, queueTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do questions from GFG.
Tip 2 : SDE sheet of striver can be helpful.

Application resume tips for other job seekers

Tip 1 : Do at least 3 major web dev project
Tip 2 : should be precise and descriptive
Tip 3 : also add your past experiences in the resume

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.

  • Q1. 

    Meeting Rescheduling Challenge

    Ninja is tasked with organizing a meeting in an office that starts at time ‘0’ and ends at time ‘LAST’. There are ‘N’ presentations scheduled with given start and end times....

  • Ans. Brute Force Approach

    Algorithm:

     

    • The idea here is to find the maximum sum subarray of size ‘K+1’, where the array will contain empty slots.
    • First, we create an array named emptySlots[], to store the time duration in which there is no presentation.
    • Run a loop to traverse all presentations, and in each iteration, add START[i] - END[i-1] (which gives a free slot between the ith presentation) into the array emptySlots[].
    • N...
  • Answered Anonymously
  • Q2. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. Recursive Approach

    We can easily count the total number of paths by making a recursive algorithm.

     

    The steps are as follows:

     

    1. We are given a function UNIQUEPATHS(), which takes two integers ‘M’ and ‘N’ as parameters and returns a single integer. This will be the definition of our recursive function too.
    2. As our base condition, we will check if our number of rows (‘M’) or a number of columns (‘N’) is equal to 1. If...
  • Answered Anonymously
Round 2 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM

  • Q1. 

    Minimum Operations to Connect a Graph

    You are given a graph with 'N' vertices labeled from 1 to 'N' and 'M' edges. In one operation, you can shift an edge from being between two directly connected vertice...

  • Ans. Breadth First Search.

    For a graph with ‘N’ vertices to be connected, there must be at least ‘N’ - 1 edges in the graph. If a graph has less than ‘N' - 1 edges it is impossible to make the graph connected. Otherwise, it is always possible to make graph connected. As we need to find the minimum number of operations to make the graph connected we will think greedily. We will find the total number of connected components in...

  • Answered Anonymously
  • Q2. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. BFS

    We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.

    1. We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
    2. Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
    3. Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...
  • Answered Anonymously
Round 3 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Hard

This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.

  • Q1. 

    XOR Query Problem Statement

    Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.

    There are two types of que...

  • Ans. Brute Force

    Approach:

    • It is a brute force approach where we will create an empty array initially of size 10^5 + 1.
    • Now, whenever we have a query of type 1 we will insert the value of VAL in the array. And when the query of type 2 comes then we will iterate through our array and perform an XOR operation with VAL to every value present in our array.
    • Finally, we will return our array.

     

    Algorithm:

    • Create an array ans.
    • Now it...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaAbove 6 CGPAUber interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPs, Computer Network, Operating System, Game TheoryTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : prepare all Topics from Coding Ninjas of Course Competitive Programming. Also I practiced atleast one question everyday from sites like Leetcode,Interviewbit and also took part in Codeforces Contest.
Tip 2 : Though Data Structure is the base for any tech interview, one must know some other subjects as well like Operating System, Networking, and Database Management System for which I took help from Coding Ninja’s notes and from GeeksforGeeks.

Application resume tips for other job seekers

Tip 1 : Keep your resume up to date and mention 2-3 good level projects which will give a good impression to the interviewer .
Tip 2 : Don't put false things on the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. System design, coding and debugging
Contribute & help others!
anonymous
You can choose to be anonymous

Securonix Interview FAQs

How many rounds are there in Securonix Software Developer Intern interview?
Securonix interview process usually has 4 rounds. The most common rounds in the Securonix interview process are Technical, Resume Shortlist and Aptitude Test.
What are the top questions asked in Securonix Software Developer Intern interview?

Some of the top questions asked at the Securonix Software Developer Intern interview -

  1. Based on understanding of OOPS and DBMS .In depth knowledge requir...read more
  2. 2 codes 1 subquery OOPS DBMS Linux data structu...read more

Recently Viewed

INTERVIEWS

Boeing

85 interviews

INTERVIEWS

Apexon

135 interviews

INTERVIEWS

Xogene

8 interviews

INTERVIEWS

OpenBet

3 interviews

INTERVIEWS

ABB

233 interviews

INTERVIEWS

Publicis Sapient

No Interviews

INTERVIEWS

Digit Insurance

No Interviews

INTERVIEWS

Nutanix

No Interviews

INTERVIEWS

Mr Cooper

No Interviews

INTERVIEWS

Daimler Truck

No Interviews

Tell us how to improve this page.

Securonix Software Developer Intern Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Anonymously discuss salaries, work culture, and many more

Get Ambitionbox App

Senior Software Engineer
39 salaries
unlock blur

₹16.5 L/yr - ₹41 L/yr

Software Engineer
35 salaries
unlock blur

₹8 L/yr - ₹30.4 L/yr

Devops Engineer
34 salaries
unlock blur

₹7 L/yr - ₹20 L/yr

Cloud Security Engineer
30 salaries
unlock blur

₹6 L/yr - ₹18 L/yr

Technical Lead
25 salaries
unlock blur

₹15 L/yr - ₹50 L/yr

Explore more salaries
Compare Securonix with

Splunk

4.4
Compare

OpenText Technologies

3.7
Compare

IBM

4.0
Compare

RSA Security

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent