Filter interviews by
I applied via Job Portal
Ping command sends packets of data to a specific IP address to test network connectivity.
Ping uses Internet Control Message Protocol (ICMP) to send and receive packets.
It measures the time taken for a packet to travel from the source to the destination and back.
Ping can be used to test network connectivity, troubleshoot network issues, and determine network latency.
Ping can also be used to determine the IP address of a...
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 was interviewed 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...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
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.
posted on 26 Jun 2017
I was interviewed before Jun 2016.
The question asks to construct a k-ary tree using the given k and DFS traversal string.
Iterate through the DFS traversal string
If the current character is 'P', create a parent node
If the current character is 'L', create a leaf node
Link the nodes according to the DFS traversal order
To determine if a graph has a node with n degree, iterate through all nodes and count their edges.
Iterate through each node in the graph
Count the number of edges connected to each node
If any node has n edges, then the graph has a node with n degree
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...
My ambition is to become a respected leader in my field, making a positive impact through innovative solutions and mentorship.
To continuously learn and grow in my role
To lead and inspire a team towards success
To contribute to the advancement of the organization and industry
To mentor and guide junior colleagues in their professional development
posted on 14 Sep 2021
I was interviewed in Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.
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 to identify the bug.
Make necessary corrections based on the iden...
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
Given a binary tree, a target node, and an integer K, find all nodes at distance K from the target node.
Traverse the binary tree to find the target node.
Use BFS to traverse the tree from the target node to nodes at distance K.
Keep track of the distance while traversing the tree.
Return the values of nodes at distance K in any order.
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
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 beg...
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 the 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.
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.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.
posted on 28 May 2022
I was interviewed in Feb 2022.
Round duration - 90 minutes
Round difficulty - Easy
Consisted of 3 DSA questions and MCQ on python proficiency
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Return all distinct palindromic substrings of a given string in alphabetical order.
Iterate through all possible substrings of the given string.
Check if each substring is a palindrome by comparing it with its reverse.
Store all palindromic substrings in a set to ensure uniqueness.
Return the sorted list of palindromic substrings.
Round duration - 60 minutes
Round difficulty - Medium
It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems
Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.
The grid has only one i...
Calculate the perimeter of an island represented by a binary grid.
Iterate through the grid and count the perimeter based on land cells and their adjacent cells.
Each land cell contributes 4 units to the perimeter, subtract 2 units for each adjacent land cell.
Handle edge cases where land cells are at the boundaries of the grid.
Return the total perimeter for each test case.
Round duration - 60 minutes
Round difficulty - Hard
DSA+OS
Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...
Calculate the minimum number of steps Ninja needs to cut down all trees in a forest grid.
Iterate through the grid to find the shortest path to cut down all trees in order.
Use a priority queue to keep track of the shortest trees to cut next.
If it's impossible to cut all trees, return -1.
Consider all four cardinal directions for movement in the grid.
Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional
posted on 28 May 2022
I was interviewed in Jun 2022.
Round duration - 70 Minutes
Round difficulty - Hard
The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N
houses numbered from 1 ...
Find the shortest path between two houses in a city represented as an unweighted graph.
Use breadth-first search (BFS) algorithm to find the shortest path in an unweighted graph.
Start BFS from the source house and keep track of the path taken to reach each house.
Once the destination house is reached, backtrack from destination to source to find the shortest path.
Consider using a queue data structure to implement BFS eff...
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a
and b
. Your task is to determine if ...
Check if two nodes in a binary tree are cousins by comparing their levels and parents.
Traverse the tree to find the levels and parents of the given nodes.
Compare the levels and parents of the two nodes to determine if they are cousins.
If the levels are the same and the parents are different, the nodes are cousins.
Round duration - 60 Minutes
Round difficulty - Medium
It contained two programming questions.
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...
Count the total number of nodes in a complete binary tree given its root.
Traverse the tree in level order and count the nodes
Use a queue to keep track of nodes at each level
Check for null nodes represented by -1 in the input
The total number of nodes in the example tree is 7
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...
Rearrange array numbers to form the largest possible numerical value by combining digits of each number in the array.
Convert integers in the array to strings for easier manipulation.
Sort the array of strings in non-increasing order based on custom comparison function.
Join the sorted strings to form the largest possible number.
Round duration - 60 Minutes
Round difficulty - Medium
This was more of a interaction round with some technical skills.
ACID properties ensure database transactions are processed reliably. Rollback mechanism undoes changes if transaction fails.
ACID properties: Atomicity, Consistency, Isolation, Durability
Atomicity ensures all operations in a transaction are completed successfully or none at all
Consistency ensures database remains in a valid state before and after transaction
Isolation ensures transactions are independent and do not inter...
Tip 1 : Focus on different varieties of problems, quality of problems matter greater than the quantity.
Tip 2 : Focus on design thinking, that will help in rounds other than problem solving.
Tip 1 : Focus on demonstrating your academic excellence and course projects
Tip 2 : Mention internship details with clarity
posted on 28 May 2022
I was interviewed in May 2022.
Round duration - 45 Minutes
Round difficulty - Easy
The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.
Given an array prices
representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...
Find the maximum profit by buying and selling a stock once based on given prices.
Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.
Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.
Return the maximum profit, ensuring it is not negative.
Example: prices = [2, 100, 150, 120], Buy at 2, sell a
Round duration - 60 Minutes
Round difficulty - Medium
Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N
, the number of girls M
, a...
The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.
Parse the input to get the number of test cases, boys, girls, and potential pairings.
Iterate through the potential pairings and form pairs based on the given indexes.
Output '1' if a set of maximum possible pairs is returned, else output '0'.
There can be multiple valid configurations of pa...
Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.
Multiprocessing utilizes multiple processes to execute tasks simultaneously.
Multithreading involves multiple threads within a single process sharing the same memory space.
Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.
E...
Round duration - 60 Minutes
Round difficulty - Hard
Splitwise is a system for managing shared expenses among groups of people.
Classes: User, Expense, Group
Functions: addExpense(), settleUp(), calculateBalance()
Round duration - 60 Minutes
Round difficulty - Hard
Tip 1 : Practice at least 5 questions of each topic of various difficulty levels
Tip 2 : Read out theory articles about your preferred language showing your proficiency in the same.
Tip 3 : Hard work is overrated, consistency is the key.
Tip 1 : Own everything you have there, do not add random skills that you are not proficient in.
Tip 2 : Keep it clean and try to give out minimal but most of the relevant information for the role.
posted on 16 Sep 2024
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
DSA medium level questions were asked.
MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.
Include features like flight/hotel search, booking, payment gateway integration, and user profiles.
Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.
Integrate maps for location tracking, weather forecasts, and customer support chatbot.
Offer discounts, loyalty p...