Add office photos
Engaged Employer

Jio

3.9
based on 22.2k Reviews
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by

KOHINOOR TELEVIDEO Interview Questions and Answers

Updated 5 Feb 2024
Popular Designations

Q1. Print all the Elements not present in a sorted array and tell the time and space complexity of the algorithm.

Ans.

Print all elements not present in a sorted array with time and space complexity.

  • Iterate through array and print missing elements

  • Use binary search for faster search

  • Time complexity: O(n log n)

  • Space complexity: O(1)

Add your answer

Q2. Given a sorted array arr, integer start and end. Find all the elements that are in the range of start and end and are missing in the array.

Ans.

Find missing elements in a sorted array within a given range.

  • Loop through the array and check if each element is within the given range.

  • If an element is outside the range, add all the missing elements within the range to a list.

  • Return the list of missing elements.

Add your answer

Q3. Print all the elements not present in an unsorted array and tell the time and space complexity of the algorithm.

Ans.

Print all elements not present in an unsorted array and give time and space complexity.

  • Iterate through array and use a hashset to keep track of seen elements.

  • Print elements not in hashset.

  • Time complexity: O(n), Space complexity: O(n)

Add your answer

Q4. Find the equilibrium index where the sum of all the values before the equilibrium index is equal to the sum of all the values after the equilibrium index.

Ans.

Find the equilibrium index where the sum of all values before it is equal to the sum of all values after it.

  • Iterate through the array and calculate the total sum.

  • Then iterate again and keep track of the left sum and right sum.

  • If they are equal at any index, return that index as the equilibrium index.

Add your answer
Discover KOHINOOR TELEVIDEO interview dos and don'ts from real experiences

Q5. Find the kth smallest value in an unsorted array

Ans.

Find the kth smallest value in an unsorted array

  • Sort the array and return the kth element

  • Use quickselect algorithm to find the kth smallest element in O(n) time

  • Build a min heap of size k and traverse the array to find the kth smallest element

Add your answer

Q6. Difference between Spring MVC and Spring Boot

Ans.

Spring MVC is a framework for building web applications, while Spring Boot is an opinionated framework for building standalone applications.

  • Spring MVC requires more configuration and setup compared to Spring Boot

  • Spring Boot provides a pre-configured environment with sensible defaults

  • Spring Boot includes an embedded server, making it easier to deploy standalone applications

  • Spring MVC is more suitable for building traditional web applications, while Spring Boot is better for mi...read more

Add your answer

Q7. What is a Load Balancer?

Ans.

A Load Balancer distributes incoming network traffic across multiple servers to improve performance and availability.

  • It helps to avoid overloading a single server

  • It improves responsiveness and availability of applications

  • It can be hardware or software-based

  • Examples include Amazon ELB, F5 BIG-IP, and NGINX

  • It can also perform health checks on servers and route traffic accordingly

Add your answer

Q8. Difference between SQL and NoSQL

Ans.

SQL is a relational database management system while NoSQL is a non-relational database management system.

  • SQL databases are structured and use tables with predefined schema while NoSQL databases are unstructured and use collections or documents.

  • SQL databases use SQL (Structured Query Language) for querying and managing data while NoSQL databases use various query languages like MongoDB's query language.

  • SQL databases are vertically scalable while NoSQL databases are horizontal...read more

Add your answer

Q9. Merge Sort Algorithm Implementation

Ans.

Merge Sort is a divide and conquer algorithm that divides an array into two halves, sorts them and then merges them.

  • Divide the array into two halves recursively

  • Sort each half recursively using merge sort

  • Merge the two sorted halves

  • Time complexity is O(nlogn)

  • Space complexity is O(n)

Add your answer
Contribute & help others!
Write a review
Share interview
Contribute salary
Add office photos
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Top SDE (Software Development Engineer) Interview Questions from Similar Companies

3.4
 • 26 Interview Questions
4.1
 • 10 Interview Questions
View all
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
70 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter