Filter interviews by
Rate your
company
🤫 100% anonymous
How was your last interview experience?
I applied via Internshala and was interviewed in Mar 2021. There was 1 interview round.
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.
I applied via Campus Placement
I am passionate about analyzing data and deriving insights to drive strategic decision-making.
I have a strong background in data analysis and statistics.
I enjoy problem-solving and finding patterns in data.
I believe that my analytical skills can add value to the organization by providing actionable insights.
I have experience using various analytical tools such as Excel, SQL, and Tableau.
I am detail-oriented and thrive
Passion for analyzing data and making informed financial decisions.
I have always been fascinated by numbers and analyzing trends.
I enjoy the challenge of making sense of complex financial data.
I believe finance plays a crucial role in driving business success and growth.
I am motivated by the opportunity to help companies make informed financial decisions.
I find satisfaction in using data to identify opportunities for i
posted on 10 May 2015
Multi tasking, multi processing, and multi programming are different approaches to managing tasks in an operating system.
Multi tasking allows multiple tasks to run concurrently on a single processor.
Multi processing involves multiple processors running tasks simultaneously.
Multi programming allows multiple programs to be loaded into memory and executed concurrently.
Examples of multi tasking operating systems include Wi...
Memory allocation refers to the process of assigning memory to programs during runtime.
Stack allocation is done automatically and is limited in size.
Heap allocation is done manually and is larger in size.
Stack memory is used for local variables and function calls.
Heap memory is used for dynamic memory allocation.
Memory leaks can occur if heap memory is not properly managed.
Use a shared variable and synchronization mechanisms to ensure natural order printing of numbers.
Create two threads, one for printing even numbers and the other for printing odd numbers.
Use a shared variable to keep track of the current number to be printed.
Implement synchronization mechanisms like locks or semaphores to ensure only one thread can access the shared variable at a time.
Each thread should check if it is i...
Printing a matrix in spiral order
Start from the first element and print it
Move in a spiral order towards the center of the matrix
Repeat until all elements are printed
Thread class and Runnable Interface are used for multithreading in Java.
Thread class is a predefined class in Java that provides methods to create and control threads.
Runnable interface is used to define a task that can be executed by a thread.
Thread class implements Runnable interface.
Thread class provides more control over threads than Runnable interface.
Example: Thread t = new Thread(new MyRunnable()); t.start();
Exa...
Linked List is a dynamic data structure while ArrayList is a static data structure.
Linked List is best for frequent insertion and deletion operations.
ArrayList is best for frequent access operations.
Linked List uses more memory than ArrayList.
ArrayList is faster than Linked List for accessing elements.
Use Linked List when you need to frequently add or remove elements from the list.
Use ArrayList when you need to frequen
I am not interested in a career in investment banking.
I am more interested in a career in software development
I enjoy problem-solving and creating innovative solutions through coding
Investment banking does not align with my passion and skill set
I have chosen to apply to J.P. Morgan because of their reputation, global presence, and opportunities for growth.
J.P. Morgan has a strong reputation in the financial industry.
They have a global presence with offices in multiple countries.
The company offers various opportunities for career growth and development.
J.P. Morgan is known for its innovative technology solutions in the financial sector.
I am impressed by their ...
Yes, I have made a mistake in my previous project.
I underestimated the complexity of a task and ended up missing the deadline.
I failed to properly test a feature, resulting in a bug that affected user experience.
I accidentally deleted an important file without having a backup.
I misunderstood a requirement and implemented a feature incorrectly.
posted on 4 Dec 2016
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
Yes, I have coded in curriculum. The most complex one was a project on building a web application using React and Node.js.
Built a full-stack web application using React and Node.js
Implemented user authentication and authorization using JSON Web Tokens (JWT)
Used MongoDB as the database and Mongoose as the ODM
Implemented real-time updates using Socket.IO
Deployed the application on Heroku
Handled errors and implemented log
Big data refers to large and complex data sets that cannot be processed using traditional data processing methods.
Big data is characterized by its volume, velocity, and variety
It is used in various industries such as healthcare, finance, and retail
Examples of big data include social media data, sensor data, and transactional data
It is called 'big' because it involves processing massive amounts of data
Big data requires ...
I am passionate about technology and eager to learn new skills in the IT sector.
I have always had a keen interest in technology and enjoy working with computers.
I believe the IT sector offers more opportunities for growth and advancement in my career.
I have seen the impact of technology on various industries and want to be a part of that innovation.
I have taken courses in programming and networking to prepare myself fo
To find the product of all data points using SelectSum(), log(), and exp() functions.
Use the log() function to convert the product into a sum of logarithms
Apply the SelectSum() function to calculate the sum of logarithms
Finally, use the exp() function to convert the sum back into the product
I was interviewed in Oct 2016.
I cannot provide investment advice, but here are five companies that have shown strong financial performance in recent years.
Apple - consistently high revenue and profit margins
Amazon - dominant player in e-commerce and cloud computing
Microsoft - strong growth in cloud computing and enterprise software
Alphabet (Google) - diversified revenue streams and strong advertising business
Visa - dominant player in the payments i
The Brexit vote could have both positive and negative effects on the Indian economy.
Positive effects: Increased trade opportunities with the UK, potential for attracting foreign investments from companies relocating from the UK.
Negative effects: Uncertainty in global markets leading to volatility in exchange rates, potential decline in exports to the UK.
Example: Indian IT companies may face challenges due to stricter i...
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 1 interview
Interview experience
Anonymously discuss salaries, work culture, and many more
Get Ambitionbox App
Operations Executive
5
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Executive
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive Accountant
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior HR Executive
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Amazon
Snapdeal
Paytm