JOVEO Interview Questions and Answers

2 coding questions .
topics were array and string

Q1. 2D array question and a linkedlist question (find the middle element of the list)
Add your answer
Q2. Dbms questions like keys ,normalization, acid properties, types of network layer , deadlock in os
Add your answer

Q1. Detect loop in a linkedlist
Ans. 
Use Floyd's Tortoise and Hare algorithm to detect loop in a linked list.
• Initialize two pointers, slow and fast, at the head of the linked list.

• Move slow pointer by one step and fast pointer by two steps.

• If they meet at any point, there is a loop in the linked list.
Answered by AI
Add your answer
Q2. SQL queries basic level .
Add your answer

Q1. Oops questions like inheritance and interface
Add your answer
Q2. Sql queries from leetcode hard level
Add your answer

Two questions that I solved in JavaScript: one on arrays and the other on binary search.

Q1. In the DSA round, I was asked to write code to determine whether two rectangles intersect, given the top left corner, length, and breadth of both rectangles.
Add your answer
Q2. Next was to check whether two circles intersect, given their radii and centers?
Add your answer

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Q1. What is the index of the first occurrence where a pattern string matches with a text string?
Add your answer
Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Add your answer