i
AmbitionBox
Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Aug 2023. There were 3 interview rounds.
2 medium level and 1 hard question from dsa
What people are saying about AmbitionBox
I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 2 interview rounds.
I am pavani thank u for wonderful opportunity i prove my talent in ur company
I applied via Naukri.com and was interviewed in Jul 2023. There were 2 interview rounds.
posted on 27 Jan 2017
I was interviewed in Dec 2016.
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
This was a 1 hour online coding round on hackerrank platform. 3 DSA questions were given.
Given the stock prices for 'N' days, your goal is to determine the maximum profit that can be achieved. You can buy and sell the stocks any number of times but can onl...
The goal is to determine the maximum profit that can be achieved by buying and selling stocks on different days.
Iterate through the stock prices and buy on days when the price is lower than the next day, and sell on days when the price is higher than the next day.
Calculate the profit by summing up the differences between buying and selling prices.
Repeat the process for each test case and output the maximum profit possi
Every day, Ninja dreams of a number but does not understand its significance. Upon investigation, Ninja discovers that converting this number to binary, taking its com...
Convert a number to binary, take its complement, and convert back to decimal.
Convert the given number to binary representation
Take the complement of the binary number by swapping '1's and '0's
Convert the complement back to decimal representation
Return the complement number for each test case
You are given an array arr
consisting of N
integers. Construct a number from these integers such that, for each bit position, if the quantity of set bits (1s) is greater tha...
Generate a number based on majority set bits in given integers array.
Iterate through each bit position and count set and unset bits
Construct the resulting number based on majority set bits at each position
Return the final constructed number
Round duration - 60 minutes
Round difficulty - Easy
In this round, a DSA question was first asked. Then a lot of discussion regarding the various test cases around this question took place. (e.g, handing of -ve numbers , decimals , overflow etc).
Main concentration was just to get as many as test cases possible and an efficient solution as well.
And Some common question like why you coding in C++?
Given an integer 'N', continue summing its digits until the result is a single-digit number. Your task is to determine the final value of 'N' after applying this operation ...
Given an integer, sum its digits until a single-digit number is obtained.
Iteratively sum the digits of the integer until a single-digit number is reached
Output the final single-digit integer for each test case
Handle multiple test cases efficiently
OOP allows for code reusability, modularity, and easier maintenance.
Encapsulation: Bundling data and methods together to protect data from outside interference.
Inheritance: Allows for the creation of new classes based on existing classes, promoting code reuse.
Polymorphism: Objects can be treated as instances of their parent class, allowing for flexibility and extensibility.
Modularity: Breaking down a program into small...
Round duration - 60 minutes
Round difficulty - Easy
Again one coding question to be done on shared screen
Given two graphs – a directed graph DIR_GRAPH
and an undirected graph UNDIR_GRAPH
– you are tasked with counting the number of triangles in each of the graphs.
In t...
Count the number of triangles in a directed and undirected graph.
Parse the input to extract vertices, edges, and edges between vertices.
Implement a function to count triangles in both directed and undirected graphs.
Return the counts of triangles for each test case.
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 was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Easy
Technical Interview round with questions based on DSA, UNIX commands , Web Security etc.
You are provided with an array nums
which contains the first N positive integers. In this array, one integer appears twice, and one integer is missi...
Identify the repeating and missing number in an array of first N positive integers.
Iterate through the array and keep track of the sum of elements and sum of squares to find the missing and repeating numbers.
Use a set to identify the repeating number and calculate the missing number using the sum formula.
Handle multiple test cases by looping through each case and applying the same logic.
Example: For nums = [1, 2, 3, 4,...
ps displays a snapshot of current processes, while top provides real-time information and allows for interactive management.
ps displays a static list of processes, while top continuously updates the list
top allows for interactive management of processes (e.g. killing, renicing), while ps does not
ps is useful for a quick snapshot of processes, while top is useful for monitoring real-time system activity
Cross-site scripting (XSS) is a type of security vulnerability that allows attackers to inject malicious scripts into web pages viewed by other users.
XSS occurs when a web application allows users to input unvalidated data that is then displayed on the page without proper encoding.
There are three main types of XSS: stored XSS, reflected XSS, and DOM-based XSS.
An example of XSS is when a user inputs a script into a sear...
Prevent SQL injection by using parameterized queries, input validation, and escaping user input.
Use parameterized queries to separate SQL code from user input.
Validate and sanitize user input to prevent malicious code injection.
Escape special characters in user input before executing SQL queries.
The command to kill all running Java processes is 'pkill -f java'
Use the 'pkill' command followed by the '-f' flag and 'java' keyword to kill all Java processes
Be cautious when using this command as it will terminate all running Java processes
Make sure to have the necessary permissions to kill processes on the system
Round duration - 60 minutes
Round difficulty - Medium
Questions based on designing. My first project as it was related to Image processing, so he also asked questions related to it.
Design a system for a traffic enforcement camera.
1. Install cameras at strategic locations to monitor traffic violations.
2. Use image recognition software to detect violations such as speeding or running red lights.
3. Store captured images and violation data in a secure database.
4. Generate automated tickets and send them to violators.
5. Implement a user interface for law enforcement to review violations and approve ti
JSON is a lightweight data interchange format that is easy for humans to read and write and easy for machines to parse and generate.
JSON is based on key-value pairs, where keys are always strings enclosed in double quotes.
Data is organized in a hierarchical structure using objects and arrays.
Example: {"name": "John", "age": 30}
Example: [{"name": "Alice", "age": 25}, {"name": "Bob", "age": 35}]
I am familiar with testing frameworks such as JUnit, Selenium, and TestNG.
JUnit
Selenium
TestNG
The best protocol for storing images is JPEG (Joint Photographic Experts Group).
JPEG is a widely used format for storing images due to its high compression ratio and good image quality.
It supports millions of colors and is compatible with most devices and software.
Other options include PNG (Portable Network Graphics) for lossless compression and GIF (Graphics Interchange Format) for animations.
Round duration - 30 minutes
Round difficulty - Easy
This was a typical HR round with questions related to my final year project and some behavioral problems.
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 was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
Technical round with questions based on DSA. Also, there was a discussion on my BTP project.
Given a string A
consisting of lowercase English letters, determine the length of the longest palindromic subsequence within A
.
Find the length of the longest palindromic subsequence in a given string of lowercase English letters.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of palindromic subsequences for different substrings.
Fill the array diagonally based on the characters in the string.
Return the length of the longest palindromic subsequence for each test case.
Transform a given Binary Tree into a Doubly Linked List.
Ensure that the nodes in the Doubly Linked List follow the Inorder Traversal of the Binary Tree.
The fi...
Convert a Binary Tree into a Doubly Linked List following Inorder Traversal.
Perform Inorder Traversal of the Binary Tree to get the nodes in order.
Create a Doubly Linked List by linking the nodes in the order obtained from Inorder Traversal.
Return the head of the Doubly Linked List as the output.
Determine if a permutation of a given string S
can form a palindrome.
string S = "aab"
"True"
The permutation "aba" o...
Check if a permutation of a string can form a palindrome.
Create a frequency map of characters in the string.
Count the number of characters with odd frequencies.
If there is at most one character with an odd frequency, return true.
Otherwise, return false.
Round duration - 60 minutes
Round difficulty - Medium
Technical interview round where the interviewer asked me questions based on DSA , algorithms and my project. Large set of questions pertaining to DBMS.
Given a binary tree of integers, your task is to implement serialization and deserialization methods. You can choose any algorithm for serialization...
Implement serialization and deserialization methods for a binary tree of integers.
Use any algorithm for serialization and deserialization.
Ensure the serialized string can be correctly decoded back to form the original binary tree.
Nodes are separated by spaces, and -1 is used to depict a null node.
Output the level order traversal of the deserialized binary tree with nodes separated by single spaces.
You are provided with three strings: A
, B
, and C
. Your task is to determine if C
is formed by interleaving A
and B
. A string C
is considered an interleaving of A
and B
if:
Determine if a string C is formed by interleaving two strings A and B.
Check if the length of C is equal to the sum of lengths of A and B.
Ensure all characters of A and B are present in C.
Verify that the order of characters in C matches the order in A and B.
Round duration - 60 minutes
Round difficulty - Medium
This was a design round where I was grilled on my internship , projects and some new design questions were also asked.
Q1. Design a work flow model of the entire work done in your internship.
Q2. Design a workflow model of any one of the projects you did.
Using a map-based design to check for isomorphic words in a file.
Create a map where the key is the sorted characters of a word and the value is a list of words with the same sorted characters.
Iterate through the file, for each word, sort its characters and check if it exists in the map. If it does, add the word to the list. If not, create a new entry in the map.
After processing the file, iterate through the map and out
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space for storing additional stack data structures.
Use two stacks - one to store the actual elements and another to store the minimum element at each level of the main stack.
When pushing an element, compare it with the current minimum and update the minimum stack accordingly.
For getMin operation, simply ret...
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.
based on 2 interviews
Interview experience
Software Engineer
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Executive
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Foundit
Timesjobs.com
Indeed
Glassdoor