Online Assessment Overview
Platform: Hackerrank
Duration: 100 minutes
Login Window: 30 minutes
Total Questions: 36 (1 Coding, 35 MCQs)
Coding Problem: Interesting Substrings
Problem Statement
You are given a string `mapping` of length 26, containing only '0's and '1's. Each character in
`mapping` corresponds to a lowercase English letter, where 'a' is mapped to `mapping[0]`, 'b' to
`mapping[1]`, and so on.
Given another string `s` and an integer `k`, find the length of the largest substring of `s` that
contains at most `k` '0's when the characters of `s` are mapped using the `mapping` string.
Solution Approach
The problem can be solved using the sliding window technique:
1. Mapping Conversion: Convert the input string `s` into a new binary string using the provided
`mapping`. For example, if `s = "abc"` and `mapping = "110..."`, then the new string would be
`'110'`.
2. Sliding Window Technique:
- Initialize two pointers to represent the current window of the string.
- Iterate through the binary string, expanding the window by moving the right pointer.
- If the count of '0's within the window exceeds `k`, shrink the window by moving the left
pointer until the condition is satisfied again.
- Track the maximum window length that meets the criteria.
Code:
Problem: Efficient Harvest
Approach:
Another sliding window
problem that I tried solving
Prefix sums, there can be
some mistake in this solution
of mine. I just solved it and
passed it to some other
person. Not sure if it would
work on all the cases.
Multiple-Choice Questions (MCQs)
The assessment included 35 multiple-choice questions, which were relatively easy. The topics
covered a range of areas, including core subjects, logical reasoning, and analytical problems
involving graphs. Some questions required interpreting graphs and returning answers based on
the data presented. Additionally, there were questions focused on English language skills.
Interview Experience
Overview
I went through four rounds during my interview process with Oracle, each focusing on different
aspects of my technical and interpersonal skills.
First Round: Technical Interview
- Introduction: The interview started with an introduction, where I talked about my passion for
Data Structures and Algorithms (DSA) and competitive programming.
- OOP Questions: The interviewer asked me about Object-Oriented Programming (OOP)
concepts, starting from the basics and moving on to abstract classes. We covered various OOP
topics in depth, and although I couldn’t answer all the questions, I found the problems to be
quite interesting.
- Linked Lists: I was asked two basic questions related to Linked Lists:
1. Reversing a Linked List.
2. Finding the intersection of two Linked Lists.
- String Manipulation: I also had to solve a problem on reversing words in a string.
- Experience: Overall, this round was quite interactive and engaging, with a good mix of easy
and challenging questions.
Second Round: Technical Interview
- Postorder Traversal: I was asked to provide and explain a recursive approach for postorder
traversal.
- Networking Questions: The interviewer then moved on to networking topics, asking me about
the OSI model, TCP/UDP protocols, HTTPS, and SSL.
- Deadlock Scenario: I was given a scenario where I had to determine if a deadlock would
occur.
- Key Takeaway: The main takeaway from this round was the importance of confidence and
honesty. It was clear that maintaining accuracy in my resume and demonstrating confidence in
my answers were crucial.
Third Round: Resume-Focused Interview
- Resume Discussion: This round was mainly focused on my resume. I was asked detailed
questions about my experiences, work ethics, and involvement in team projects, such as
internships and college projects.
- Puzzles:
1. Train and Bee Puzzle: I was asked to solve a famous puzzle involving two trains and a bee.
I found this puzzle relatively easy to solve.
- You can refer to this for more details.
2. Hourglass Puzzle: I was given two hourglasses—one with 7 minutes and the other with 11
minutes—and was asked to measure 15 minutes. I partially solved it and later simulated the
solution by getting the 11-minute hourglass to 8 minutes, letting those 8 minutes pass, and then
starting the 7-minute hourglass to measure the full 15 minutes.
- Refer to this puzzle for more details.
HR Round
- Resume-Based Questions: The HR round was straightforward, with some basic questions
from my resume.
- Preferred Location: I was also asked about my preferred job location and the reasons behind
my choice.
Conclusion
At the end of each interview, I was given the opportunity to ask questions. I made sure to use
this time to gain some insights, focusing on actively listening and demonstrating that I was
paying close attention.
All the interviews I was asked about my experience cause each one of them wants to evaluate
for your experience. So one day beforehand try to ask your questions regarding your resume.
