Upload Button Icon Add office photos

Filter interviews by

Nuance Transcription Services MLS Interview Questions and Answers

Updated 4 Jan 2023

Nuance Transcription Services MLS Interview Experiences

1 interview found

MLS Interview Questions & Answers

user image Anonymous

posted on 4 Jan 2023

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Walk-in and was interviewed before Jan 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Basic English and medical terminology test

Round 3 - HR 

(2 Questions)

  • Q1. Educational background
  • Q2. Previous work experience

Interview Preparation Tips

Interview preparation tips for other job seekers - English test followed by transcription test will be provided

Interview questions from similar companies

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Nov 2020.

Interview Questionnaire 

3 Questions

  • Q1. Simple and Easy questions on OOPS, static variable, Prioriry queue,
  • Q2. Design question,
  • Q3. Binary Search

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy you can crack this shit easily

I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Technical interview with my primary skill set Where all details asked about technology And given one program to do using primary skill
Round 2 - HR 

(1 Question)

  • Q1. Salary Discussion Questions about why to change org And More specific to HR questions About yourself
Round 3 - Managiral 

(1 Question)

  • Q1. Question about last project work About Yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Company is growing with different skillset and domain

I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Why do you want to join Incedo, what is your plan in future, explain your past experience with an example
  • Q2. Basic of capital market
  • Q3. Market capitalisation, capital market, derivatives, accounting knowledge

Interview Preparation Tips

Interview preparation tips for other job seekers - One should be more confident and should give prompt response

Interview Questionnaire 

2 Questions

  • Q1. Basics from all framework you have worked on.
  • Q2. There working all are non technical people's they don't know the projects here major people working in testing and non related work

I applied via Naukri.com and was interviewed before Mar 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Difference between Hashtable and hashmap?
  • Ans. 

    Hashtable is synchronized while hashmap is not.

    • Hashtable is thread-safe while hashmap is not.

    • Hashtable does not allow null keys or values while hashmap allows one null key and multiple null values.

    • Hashtable is slower than hashmap due to synchronization.

    • Hashtable is a legacy class while hashmap is a newer implementation.

  • Answered by AI
  • Q2. Difference between hashmap and concurrent hashmap?
  • Ans. 

    Hashmap is not thread-safe while Concurrent Hashmap is thread-safe.

    • Hashmap is not suitable for multi-threaded environments as it can lead to race conditions and data inconsistencies.

    • Concurrent Hashmap allows multiple threads to access and modify the map concurrently without any data inconsistencies.

    • Concurrent Hashmap uses a technique called lock striping to achieve thread-safety.

    • Concurrent Hashmap is slower than Hashma...

  • Answered by AI
  • Q3. Jdbc step
  • Q4. Spring ioc

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was average they asked questions from core java spring hibernate... And so on..

Skills evaluated in this interview

I applied via Recruitment Consulltant and was interviewed before Apr 2021. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Different types of No SQL DBs
  • Ans. 

    NoSQL databases are non-relational databases that store and retrieve data in a non-tabular format.

    • Document-oriented databases (MongoDB, Couchbase)

    • Key-value stores (Redis, Riak)

    • Column-family stores (Cassandra, HBase)

    • Graph databases (Neo4j, OrientDB)

  • Answered by AI
  • Q2. Different types of scaling
  • Ans. 

    Scaling refers to the process of increasing or decreasing the capacity of a system to handle more or less load.

    • Vertical Scaling: Adding more resources to a single node

    • Horizontal Scaling: Adding more nodes to a system

    • Load Balancing: Distributing the load across multiple nodes

    • Database Sharding: Splitting a database into smaller parts to distribute the load

    • Caching: Storing frequently accessed data in memory for faster acc

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on Problem solving. Have a good understanding on main concepts of DSA. Java technical side is just as same as other companies. Also if you are applying for senior positions. Prepare for System Design rounds

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Sep 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Python code to find the root of a number
  • Ans. 

    Python code to find the root of a number

    • Use the math module to access the sqrt() function

    • Use the ** operator to raise the number to the power of 1/n

    • Handle negative numbers by converting them to complex numbers

  • Answered by AI
  • Q2. Some standard puzzles

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush up python and be thorough with puzzles

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Dec 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. About my previous company experience, And what is investment bank, what is capital and money market, and also mutual and their types.

Interview Preparation Tips

Interview preparation tips for other job seekers - My advice would be for experience candidate as much as possible you can mention your experience and explore more knowledge about investment bank.

Nuance Transcription Services Interview FAQs

How many rounds are there in Nuance Transcription Services MLS interview?
Nuance Transcription Services interview process usually has 3 rounds. The most common rounds in the Nuance Transcription Services interview process are Resume Shortlist, Aptitude Test and HR.

Tell us how to improve this page.

Nuance Transcription Services MLS Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

CitiusTech Interview Questions
3.4
 • 270 Interviews
Tiger Analytics Interview Questions
3.7
 • 222 Interviews
Altimetrik Interview Questions
3.8
 • 216 Interviews
Incedo Interview Questions
3.1
 • 180 Interviews
Xoriant Interview Questions
4.1
 • 180 Interviews
Globant Interview Questions
3.8
 • 172 Interviews
ThoughtWorks Interview Questions
3.9
 • 146 Interviews
Iris Software Interview Questions
4.0
 • 143 Interviews
Apexon Interview Questions
3.3
 • 137 Interviews
View all
Nuance Transcription Services MLS Salary
based on 7 salaries
₹3 L/yr - ₹4.5 L/yr
50% less than the average MLS Salary in India
View more details

Nuance Transcription Services MLS Reviews and Ratings

based on 5 reviews

3.1/5

Rating in categories

3.6

Skill development

3.2

Work-life balance

3.9

Salary

1.6

Job security

3.7

Company culture

2.0

Promotions

2.8

Work satisfaction

Explore 5 Reviews and Ratings
Medical Language Specialist
67 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Medical Transcription Editor
47 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Contact Center Associate
25 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Manager
24 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Contact Center Executive
18 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Nuance Transcription Services with

M*Modal

3.5
Compare

Acusis Software India

4.3
Compare

Imedx Information Services

3.3
Compare

Transdyne IT Services

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview