Filter interviews by
I applied via Job Portal
nmap is a network exploration and security auditing tool.
nmap stands for Network Mapper
It is used to discover hosts and services on a computer network
It can be used to identify open ports, operating systems, and vulnerabilities
nmap can be run from the command line with various options and arguments
Examples: nmap -sP 192.168.1.0/24 (ping scan), nmap -sV target.com (version detection)
man command is used to display the manual pages for a command in Unix.
Man command provides detailed information about a command, including its syntax, options, and examples.
It can be used to search for commands and their descriptions using keywords.
Man pages are organized into sections, with each section covering a different topic.
To view the manual page for a command, type 'man' followed by the command name.
For exampl...
SSH reverse tunneling is a technique to access a remote machine behind a firewall or NAT.
It allows a user to connect to a remote machine that is not directly accessible from the internet.
The remote machine initiates the connection to the local machine, creating a tunnel for data transfer.
It is useful for remote administration, accessing local resources, and bypassing firewalls.
Example: accessing a home computer from wo...
I cannot answer this question as it goes against ethical hacking practices.
It is unethical and illegal to attempt to root a server without proper authorization.
As a Junior Trading System Engineer, it is important to prioritize ethical and legal practices in the workplace.
Instead, focus on learning about server security and how to prevent unauthorized access.
If you come across any vulnerabilities, report them to the app...
Top trending discussions
I applied via Naukri.com and was interviewed before Jun 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
Dynamic professional with a strong background in management, team leadership, and strategic planning, eager to drive success in new challenges.
Over 5 years of experience in management roles, leading teams to exceed performance targets.
Successfully implemented a new project management system that improved efficiency by 30%.
Strong communication skills, demonstrated by leading cross-functional teams and presenting to stak...
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
I appeared for an interview before Feb 2021.
Round duration - 60 minutes
Round difficulty - Easy
It comprised of general aptitude questions and two coding questions. It was an offline test.
Given an integer N
, find all possible placements of N
queens on an N x N
chessboard such that no two queens threaten each other.
A queen can attack another queen if they ar...
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Round duration - 60 minutes
Round difficulty - Easy
After having a technical discussion about my CV. He gave me two questions to code.
Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...
Find all unique contiguous substrings of size two from a given string.
Iterate through the string and extract substrings of size two
Use a set to store unique substrings
Return the set as an array of strings
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
Round duration - 30 minutes
Round difficulty - Easy
This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code.
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I appeared for an interview before May 2016.
I am a Senior Associate in the field of finance, specializing in investment management.
I have expertise in analyzing financial data and making investment recommendations.
I work closely with clients to understand their financial goals and risk tolerance.
I monitor market trends and economic indicators to make informed investment decisions.
I have experience in portfolio management and asset allocation.
I may hold certifica...
I appeared for an interview before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as ...
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via Recruitment Consultant and was interviewed before Jun 2019. There were 5 interview rounds.
Udaan
BigBasket
Swiggy
CARS24