RUBRIK INDIA UI Developer Interview Questions and Answers

Coding is important three problems and mcqs of java and testing

Q1. Oops concepts were asked
Add your answer
Q2. Java questions static jvm and all
Add your answer

Array , LL , string, dp, binary tree, binary search tree, heaps

Array question , string, dp, binary search tree, heaps

3 question . . . . . . . . . . .

2 questions . . . . . . . .

Q1. Oops . . . . . .
Add your answer
Q2. Projects . . . . . .. .
Add your answer

It was fine but hard. Study well and go

Q1. What is polymorphism
Ans. 
Polymorphism is the ability of a single function or method to operate on different types of data.
• Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).

• Example: Inheritance in object-oriented programming languages like Java allows for polymorphism.
Answered by AI
Add your answer
Q2. Write code for reversing string
Ans. 
Code to reverse a string using array of characters
• Create an array of characters from the input string

• Iterate through the array in reverse order and append each character to a new string

• Return the reversed string
Answered by AI
Add your answer

Round duration - 65 Minutes
Round difficulty - Hard

There were 15 MCQS you have to do in 25 Minutes and 3 Coding questions you have to do in 40 minutes. They also give a demo test link to get you use to the environment.

Q1. 
Sliding Maximum Problem Statement
Given an array of integers ARR of length 'N' and a positive integer 'K', find the maximum elements for each contiguous subarray of size K.
Example:
Input:
ARR = [3, 4,...read more
Ans. 
It was a standard problem so I know the exact solution, you can simply use dequeue + two pointers to solve this questions.
Answered Anonymously
Add your answer
Q2. 
Jump Game Problem Statement
In this problem, you are given an array ARR consisting of N integers. Your task is to determine the minimum number of jumps required to reach the last index of the array N - 1....read more
Ans. 
I did it by using DP, again it was a standard problem.
Answered Anonymously
Add your answer
Q3. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...read more
Ans. 
I solve it by using dp in O(n^2) time complexity.
Answered Anonymously
View 1 more answer

Round duration - 180 Minutes
Round difficulty - Hard

It was more of Design + Data structure round. They give access to their server and ask us to do code there.

Need to convert psd into HTML and hosted in net

Q1. General Questions
Add your answer
Q2. Why you chose Yellow.ai.?
Add your answer

Round duration - 7 days
Round difficulty - Easy

Web Development, Databases

Round duration - 60 minutes
Round difficulty - Medium

This was the final round and was a telephonic interview.

Q1. 
Implementation of HashMap with Constant Time Operations
Design a data structure that effectively stores a key-value mapping and performs specific operations in constant time.
Explanation:
Your data stru...read more
Add your answer
Q2. 
Isomorphic Trees Problem Statement
You are provided with two arbitrary binary trees. Determine if both trees are isomorphic.
Explanation:
Two binary trees are considered isomorphic if one tree can be tr...read more
Add your answer