Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Jun 2024. There was 1 interview round.
Cash flow of a company with continued and discontinued operations is calculated by combining cash flows from both segments.
Combine cash flows from both continued and discontinued operations to get total cash flow
Consider any one-time gains or losses from discontinued operations separately
Analyze the impact of discontinued operations on overall cash flow
Ensure accurate reporting of cash flows from both segments in finan...
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
Experience in handling related party transactions (RPT) is essential for Assistant Manager Finance role.
Experience in identifying, monitoring, and disclosing related party transactions.
Knowledge of regulatory requirements and accounting standards related to RPT.
Ability to ensure arm's length transactions and prevent conflicts of interest.
Experience in preparing RPT disclosures in financial statements.
Examples: Reviewin...
ICD stands for International Classification of Diseases, used for coding diseases and medical procedures.
ICD is a standardized system used for classifying diseases, injuries, and medical procedures.
It is used for statistical and billing purposes in healthcare settings.
ICD codes are alphanumeric codes that represent specific diagnoses or medical procedures.
Familiarity with ICD coding can be beneficial for accurate docum...
I applied via Walk-in and was interviewed in Oct 2022. There were 2 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed before Sep 2022. There were 3 interview rounds.
I applied via LinkedIn and was interviewed before Jul 2021. There were 2 interview rounds.
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I successfully led projects that improved efficiency, increased sales, and enhanced team collaboration in my previous roles.
Increased sales by 20% in one year by implementing a new marketing strategy.
Led a team of 10 in a project that reduced operational costs by 15%.
Developed a training program that improved employee performance and satisfaction.
Successfully managed a cross-departmental initiative that streamlined com...
I applied via Naukri.com and was interviewed before Jan 2021. There were 6 interview rounds.
In my previous role as a team leader, I managed projects, coordinated with clients, and ensured timely delivery of services.
Led a team of 10 in executing a project that increased client satisfaction by 20%.
Implemented a new project management tool that improved workflow efficiency by 30%.
Conducted regular training sessions for team members to enhance their skills and productivity.
Collaborated with cross-functional team...
I can sell you a pen by showing you how it can solve your problems and increase your productivity.
I understand that you need a pen to write down important information and ideas.
This pen has a comfortable grip and writes smoothly, making it easy to use for extended periods of time.
It also has a clip that can attach to your notebook or shirt pocket, ensuring that you always have it on hand.
By investing in this pen, you'l...
I appeared for an interview before Jan 2021.
Round duration - 60 minutes
Round difficulty - Easy
Two coding questions were given in the first round to be solved in 60 minutes.
Given an array A
containing 'N' integers and an integer m
, rearrange the elements of the array such that the differences between the array elements and m
are sor...
Rearrange array elements based on their differences from a given integer.
Calculate the differences between each element and the given integer.
Sort the elements based on their differences while maintaining the original order for elements with the same difference.
Implement a function to rearrange the array elements as per the given criteria.
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...
The task is to find all nodes in a binary tree that are at a distance K from a given node.
Traverse the binary tree to find the given node
From the given node, perform a depth-first search to find all nodes at distance K
Use a list to store the values of the nodes at distance K
Return the list of values in any order
Round duration - 60 minutes
Round difficulty - Easy
This was a technical round with questions based on DSA, DBMS, Computer Networking and project based questions.
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
N = 4
1
232
34545
4567654
The pat...
Print a triangle pattern of numbers based on a given number 'N'.
Iterate through each row and print the numbers accordingly
Use spaces to center-align the numbers in each row
Increment the numbers in each row as per the pattern
Web server serves static content over HTTP, while application server runs dynamic content and business logic.
Web server handles HTTP requests and responses, serving static content like HTML, images, and CSS.
Application server executes business logic, runs dynamic content, and interacts with databases.
Web server examples include Apache, Nginx, while application server examples include Tomcat, JBoss.
Web server focuses on...
The internet is a global network of interconnected computers that communicate using standardized protocols.
The internet is made up of a vast number of interconnected networks of computers.
Data is transmitted over the internet using protocols such as TCP/IP.
Websites are hosted on servers connected to the internet, and users access them using web browsers.
Internet Service Providers (ISPs) provide access to the internet f...
SQL query to find the nth highest salary
Use the 'SELECT DISTINCT' statement to get unique salary values
Order the salaries in descending order using 'ORDER BY' clause
Use 'LIMIT' and 'OFFSET' to get the nth highest salary
Round duration - 30 minutes
Round difficulty - Easy
Typical HR round with 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 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...
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.
based on 3 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Driver
764
salaries
| ₹2 L/yr - ₹6.1 L/yr |
CAR Driver
485
salaries
| ₹1.8 L/yr - ₹5 L/yr |
Assistant Manager
266
salaries
| ₹8.8 L/yr - ₹15 L/yr |
Team Lead
197
salaries
| ₹2.3 L/yr - ₹7 L/yr |
Business Analyst
194
salaries
| ₹10 L/yr - ₹17.6 L/yr |
Uber
Meru cabs
Flipkart
Indiamart Intermesh