Ocrolus East Intern Interview Questions and Answers

2 DSA, 1 SQL, 5 ML MCQ

Q1. Probability Questions
Add your answer
Q2. Tree Based Models
Add your answer

Q1. Probability Questions
Add your answer
Q2. Transformer Architecture
Add your answer

30 Questions - 90 minutes
Difficulty level - medium

Q1. General Introduction, then cross questions on projects mentioned in resume. Discussion on interest and my field of interest. After that the interviewer tested my coding skills in sql by asking 7-8 question...read more
Add your answer

Q1. Basic Introduction. Some guesstimate questions. Some questions related to business analysis. Finally he asked me about working of various ML algorithms mentioned in my resume.
Add your answer

Q1. More of a formal talk. About my family background, my projects, what were my role in them. How do I manage myself while on a project. Finally confirmation on relocation availability.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timings: it was late night. I started the test at 10 pm

Q1. 
Partial BST Problem Statement
Check if a given binary tree is a Partial Binary Search Tree (BST). A Partial BST adheres to the following properties:
• The left subtree of a node contains only nodes with...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

It was the interviw round.
the environment was good.
the interviewer was very nice to me.

Q1. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

The online test was for 2 hrs in which 5 coding questions were asked. 3 questions were pretty easy and 2 were of medium difficulty level. I was able to solve all 5 questions.

Q1. 
Shortest Path in an Unweighted Graph
The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It started with the introduction and then we had a discussion on the projects I had made. He asked for several Backend and Database concepts like locking in DB, sessions, etc as I had mentioned backend internship in my resume. It took around half an hour.

Then he gave me a coding question based on the graph

Q1. 
Capture Region Problem Statement
You are given a matrix having N rows and M columns. Each cell of the matrix contains either 'X' or 'O'. Your task is to flip all the regions of 'O' that are completely sur...read more
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Two DSA questions were asked in this round in 45 min.

Q1. 
Maximum Subarray Sum Problem Statement
Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array.
Example:
Input:
array = [34, -50, 42, 14, -5, 86]
Out...read more
Add your answer
Q2. 
Odd Occurrence Element Problem Statement
Given an array of integers where each element appears an even number of times except for one element which appears an odd number of times, find the element that ap...read more
Add your answer