Filter interviews by
Test is on Icd 10 guidelines
I applied via Campus Placement
Database questions and email addressing.
I applied via LinkedIn and was interviewed in Apr 2024. There were 2 interview rounds.
I was interviewed before Apr 2022.
I applied via Referral and was interviewed in Jun 2023. There were 3 interview rounds.
Test contains 100 questions
1 hr. General Accounting, Case studies etc.
Budget vs. Forecast involves comparing planned vs. predicted financial outcomes.
Budget is a financial plan for a specific period, while forecast is a prediction of future financial outcomes.
Budget is typically set at the beginning of a period, while forecasts are updated regularly based on new information.
Budgets are usually more rigid and set in stone, while forecasts are more flexible and subject to change.
Discrepanc...
Budgeting involves planning and managing financial resources to achieve organizational goals.
Identify financial goals and objectives
Estimate income and expenses
Allocate funds to different departments or projects
Monitor and track spending
Adjust budget as needed based on actual financial performance
Yes, I have experience in process transition.
Led a team through a software system upgrade
Managed the transition of a project from development to production
Implemented new processes for a more efficient workflow
Managing multiple stakeholders involves effective communication, prioritization, and relationship-building.
Establish clear communication channels with each stakeholder
Understand the needs and expectations of each stakeholder
Prioritize stakeholders based on their impact on the project
Build strong relationships with stakeholders through regular updates and feedback
Resolve conflicts and address concerns promptly
posted on 11 Mar 2022
I was interviewed before Mar 2021.
Round duration - 60 minutes
Round difficulty - Medium
This test consisted of 10 questions with no negative marking to test my problem solving ability.
Round duration - 60 minutes
Round difficulty - Medium
Technical Interview round with questions based on DSA and algorithms.
Given a document represented as an array/list ARR
of words with length N
, find the smallest distance between two given words for multiple queries. The distance is defined as the ...
Find the smallest distance between two words in a document for multiple queries.
Iterate through the document to find the indices of the given words in the document array.
Calculate the distance between the two indices for each query.
Return the smallest distance or 'N' if a word from the query is not present in the document.
Given a 9 x 9 2D matrix 'MATRIX', where some cells are filled with digits (1-9) and others are empty (denoted by 0), determine if there is a way to fill the empty cells suc...
The task is to determine if a given 9x9 Sudoku puzzle can be solved.
Check if each row, column, and 3x3 subgrid contains all numbers from 1 to 9 without repetition.
Iterate through each empty cell and try filling it with a valid number, then recursively check if the puzzle can be solved.
If all empty cells are filled without violating Sudoku rules, output 'yes'; otherwise, output 'no'.
Round duration - 60 minutes
Round difficulty - Easy
You will be having 2 or 3 members per panel and questions may be from databases , object oriented programming, operating systems, Linux commands and algorithm may be asked for problems
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 ...
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
Traverse the linked list using two pointers, one moving at double the speed of the other
If the two pointers meet at any point, there is a cycle in the linked list
If one of the pointers reaches the end of the list (null), there is no cycle
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
The task is to implement a function that returns the level order traversal of a binary tree given in level order.
Create a queue to store nodes for level order traversal
Start with the root node and enqueue it
While the queue is not empty, dequeue a node, print its value, and enqueue its children
Repeat until all nodes are traversed
Virtual functions are functions in a base class that are overridden in derived classes, allowing for polymorphic behavior.
Virtual functions are declared in a base class with the 'virtual' keyword.
They are meant to be overridden in derived classes to provide specific implementations.
They allow for polymorphism, where a pointer to a base class can call a derived class's overridden function.
Example: virtual void display()
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 in Aug 2016.
based on 4 interviews
Interview experience
based on 14 reviews
Rating in categories
Medical Coder
68
salaries
| ₹0 L/yr - ₹0 L/yr |
Medical Billing Executive
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Billing Executive
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Medical Coder
34
salaries
| ₹0 L/yr - ₹0 L/yr |
AR Caller
28
salaries
| ₹0 L/yr - ₹0 L/yr |
Oracle Cerner
Veradigm
McKesson
Siemens Healthineers