AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Livevox Solutions Interview Questions and Answers
Livevox Solutions Interview Experiences
1 interview found
Selected
Automate a web application
(2 Questions)
- Q1. My project related questions
- Q2. Questions on whatever I had mentioned on my resume
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
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
- 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
- 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.
- 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
- 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
- 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
- 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.
- 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
Interview Preparation Tips
College Name: Na
Skills evaluated in this interview
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Questions about Oops, data structures based on the projects I had done, and my resume
- Q2. Questions about classes and abstraction
Interview Preparation Tips
Interview Preparation Tips
Experience: PAPER DURATION: 3 hours
NO. OF QUESTIONS: 2 (20 marks each)
MAXIMUM MARKS: 20*2 = 40 marksQUESTION 1:
JSON Prettier:-Write a program which takes JSON as input and gives prettified JSONYou need to read JSON from STDIN. Input gives one line of uglified JSON.Output should be formatted JSON. Check the standard output link.Use 2 white spaces (not‘\t’) for one indentation.SAMPLE INPUT:{“group” : {list : [1,2,3]}, “list” : [“a”,”b”,”c”]}SAMPLE OUTPUT:{“group” : {List : [1,2,3]},“list” : [“a”,”b”,”c”]}EXPLANATION: Input will be uglifiedjson in one line and output will be prettified format of that. QUESTION 2:XML parse plus series computationEvaluate an expression given in XML format. Keys will be Expr- contains the entire expression. Elem – contains the digit, sum, Prod- contains two or more keys whose evaluation needs to be summed or multiplied respectively. Sub will contain 2 keys or more, where the second key onwards will have to be subtracted from the first one. Div- will contain 2 keys in which first key will need to be divided by second. SAMPLE INPUT:
20EXPLANATION:Input will be xml file through standard input. End of xml file marked by .
Duration: 180 minutes
Total Questions: 2
College Name: NA
I applied via Recruitment Consultant and was interviewed in Apr 2021. There were 4 interview rounds.
Interview Questionnaire
2 Questions
- Q1. Core concepts of javascript.
- Q2. Defining the high-level component structure of a page.
- Ans.
High-level component structure of a page refers to the organization of the main elements on a webpage.
Identify the main content area of the page
Determine the navigation menu and its placement
Decide on the placement of secondary content such as ads or related articles
Consider the footer and its contents
Ensure the page is responsive and adaptable to different screen sizes
Interview Preparation Tips
Skills evaluated in this interview
anusha jabu
(1 Question)
- Q1. More about API automation
Senior Software Engineer Interview Questions & Answers
3Pillar Global
Anonymous
posted on 1 Feb 2024
(1 Question)
- Q1. 1. Pattern print code. 2. Types of S3 bucket in AWS. 3. Java basic question. 4. Spring/ Spring boot basic question. 5. Hibernate basic interview question. 6. Some behavioral question.
- Ans.
This is a list of questions asked in an interview for Senior Software Engineer position.
1. Pattern print code: Write a code to print a specific pattern using loops.
2. Types of S3 bucket in AWS: Explain the different types of S3 buckets in Amazon Web Services.
3. Java basic question: Provide a basic question related to Java programming language.
4. Spring/Spring Boot basic question: Give an example of a basic question rel...
Interview Preparation Tips
Skills evaluated in this interview
Selected
I appeared for an interview before Jun 2024, where I was asked the following questions.
- Q1. To create CI/CD pipeline
- Ans.
A CI/CD pipeline automates code integration, testing, and deployment for efficient software delivery.
Define the stages: Build, Test, Deploy, Monitor.
Use tools like Jenkins, GitLab CI, or CircleCI for automation.
Implement version control with Git for source code management.
Automate testing with frameworks like JUnit or Selenium.
Deploy using containerization tools like Docker or orchestration with Kubernetes.
- Q2. Questions related to cloud
- Q3. Programs like Fibonacci,factorial for Devops engineer
I appeared for an interview in Apr 2021.
(2 Questions)
Round duration - 120 Minutes
Round difficulty - Medium
I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.
- Q1.
Ninja Competition Problem Statement
Ninja is organizing a coding competition where two teams compete at a time. To keep it fair and interesting, both teams must have an equal number of members. Ninja’s ta...
- Ans.
Check if Ninja can create two teams with equal members given an integer N and its divisors.
Iterate through all divisors of N and assign members to the first or second team based on whether the divisor is even or odd.
Keep track of the total members in each team and check if they are equal at the end.
Return true if the total members in both teams are equal, false otherwise.
- Q2.
Help Bob Out! - Validating IFSC Code
Bob has just turned 18 and opened a bank account. Being inexperienced with banking, Bob needs your help to validate whether an IFSC code provided by his bank is valid.
... - Ans.
Validate IFSC code based on given rules and return True or False for each test case.
Check if the code is 11 characters long.
Verify the first four characters are uppercase alphabets.
Ensure the fifth character is '0'.
Validate that the last six characters are alphanumeric.
Round duration - 50 Minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Interview Preparation Tips
Tip 1 : Be strong at your basics.
Tip 2 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.
Selected
I applied via Job Portal and was interviewed before May 2023. There were 4 interview rounds.
Hacker rank test. Basic coding questions on arrays, list etc.
(1 Question)
- Q1. Interactive session. Theoritical questions on oops, multithreading, springboot, java8 and few coding questions.
(1 Question)
- Q1. Design round. Questions on system design and best practices to be followed while developing any service. Few managerial questions as well.
(1 Question)
- Q1. Profile related questions and salary discussion.
Interview Preparation Tips
- Java8 and above
- Data structure
- Springboot
Livevox Solutions Interview FAQs
Tell us how to improve this page.
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 2 interview experiences
Interview Questions from Similar Companies
Livevox Solutions Reviews and Ratings
based on 14 reviews
Rating in categories
|
Implementation Engineer
9
salaries
|  ₹2.2 L/yr - ₹9.7 L/yr |
|
Senior Software Engineer
6
salaries
| ₹12 L/yr - ₹16 L/yr |
|
Senior Desktop Support Engineer
6
salaries
| ₹23 L/yr - ₹23.5 L/yr |
|
Sdet Lead
5
salaries
| ₹45 L/yr - ₹70 L/yr |
|
Software Engineer
4
salaries
| ₹4.8 L/yr - ₹8 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo
- Home >
- Interviews >
- Livevox Solutions Interview Questions
