Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by ClarityTTS Team. If you also belong to the team, you can get access from here

ClarityTTS Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

ClarityTTS Software Developer Interview Questions and Answers

Updated 30 Jan 2025

ClarityTTS Software Developer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Basic javascript questions.

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I appeared for an interview before Jan 2024.

Round 1 - Aptitude Test 

General aptitude, SQL, and basic coding exercises.

Round 2 - Coding Test 

Coding according to our current roles.

Round 3 - Technical 

(1 Question)

  • Q1. General questions according to our role.

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
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 - One-on-one 

(2 Questions)

  • Q1. Basics about data and marketing
  • Q2. Basics about tech and new ideas of growth

I applied via Referral

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 

It was quite easy, written test,some multiple choice questions

Round 3 - HR 

(2 Questions)

  • Q1. Previous work history, introduction,about fragomen What is your Salary expectations? How you able to manage pressure? What is your commitment to our company?
  • Q2. What is your salary expectations? What is your commitment to company?

Interview Preparation Tips

Interview preparation tips for other job seekers - Average interview just perform well you will get the job
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.

Round 1 - HR 

(1 Question)

  • Q1. Excel assignment was given
Round 2 - Technical 

(1 Question)

  • Q1. Create a dashboard using Power Bi or Tableau.
  • Ans. 

    Create a dashboard using Power Bi or Tableau

    • Gather relevant data sources for analysis

    • Identify key performance indicators (KPIs) to track

    • Design visually appealing and user-friendly dashboard

    • Utilize interactive features for data exploration

    • Include filters and slicers for customization

    • Consider audience needs and tailor dashboard accordingly

  • Answered by AI

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Explain the program return in round1 like logic used and how to achieve the result.
  • Ans. 

    The program return in round1 is achieved using logic based on the round function.

    • The round1 program uses a specific logic to determine the return value.

    • The logic may involve mathematical calculations, conditional statements, or other operations.

    • The result is achieved by following the steps defined in the round1 logic.

    • Examples of round1 logic could include rounding a number to the nearest integer, performing a specific

  • Answered by AI
  • Q2. Discussion about package and company nomes

Interview Preparation Tips

Round: Test
Experience: Aptitude test
program

Round: System test
Experience: Some problem are give we need to provide solution programmatically and give the output.

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Experience: Given three Dsalgo questions need to write code in an hour.
1.derangement of an array
2.level order traversal in spiral form
3.find the number of duplicates in an unsorted array
Total Questions: 3

Interview Questionnaire 

2 Questions

  • Q1. Technical Q's about profile
  • Q2. Package dicussion

Interview Preparation Tips

Round: Test
Experience: They conduct test about technical knowledge.
Duration: 1 hour
Total Questions: 30

Round: Technical Interview
Experience: Technical Q's about profile

Interview Questionnaire 

1 Question

  • Q1. Why you wanna join company? Why Polaris ? and the regular interview questions :)

Interview Preparation Tips

Round: Test
Experience: I am in ECE , so we had simple aptitude questions.Time and accuracy was the key.Knowledge in any of the languages(C Cpp JAVA etc) is desired but not necessary. We were told that we will be having training sessions prior to getting actually inducted in the company.
Tips: BE good with aptitude.Level of difficulty between easy to medium. NO tough qtns were asked
Total Questions: 60

Round: HR Interview
Experience: Satisfactory
Tips: Prepare the regular interview HR questions (Non -CS )

College Name: NIT CALICUT

ClarityTTS Interview FAQs

How many rounds are there in ClarityTTS Software Developer interview?
ClarityTTS interview process usually has 2 rounds. The most common rounds in the ClarityTTS interview process are Coding Test, Aptitude Test and Technical.

Tell us how to improve this page.

ClarityTTS Software Developer Interview Process

based on 5 interviews

Interview experience

4.4
  
Good
View more
ClarityTTS Software Developer Salary
based on 6 salaries
₹4.2 L/yr - ₹8 L/yr
30% less than the average Software Developer Salary in India
View more details

ClarityTTS Software Developer Reviews and Ratings

based on 2 reviews

1.0/5

Rating in categories

1.0

Skill development

1.0

Work-life balance

1.0

Salary

1.0

Job security

1.0

Company culture

1.0

Promotions

1.0

Work satisfaction

Explore 2 Reviews and Ratings
Senior Software Engineer
15 salaries
unlock blur

₹5 L/yr - ₹10.2 L/yr

Software Engineer
7 salaries
unlock blur

₹3 L/yr - ₹5.4 L/yr

Software Developer
6 salaries
unlock blur

₹4.2 L/yr - ₹8 L/yr

Lead Engineer
6 salaries
unlock blur

₹8.8 L/yr - ₹13 L/yr

Test Engineer
5 salaries
unlock blur

₹4 L/yr - ₹5 L/yr

Explore more salaries
Compare ClarityTTS with

Costa Cruise Lines

4.2
Compare

Carzonrent

3.5
Compare

Fragomen Immigration Services

3.7
Compare

Teletext Holidays

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