Interview Experience: bounteous x Accolite
- Result
- Withdrew
- Posted
- 22 Sept 2024
Summary
I recently interviewed for a Software Engineer position at Accolite through an on-campus drive. The process included an online assessment with MCQs and a DSA problem, followed by an online interview where I discussed a LeetCode problem and various CS fundamentals. Although more rounds were scheduled, I decided to withdraw my candidacy due to a company bond associated with the offer.
How it went
My interview journey with Accolite for a Software Engineer role began with an online assessment. This assessment was split into two sections. The first section comprised 30 multiple-choice questions, which tested my knowledge in code debugging, output analysis, data structures and algorithms, SQL queries, and concepts in Java and C++. Notably, there were no questions on core computer science fundamentals in this section.
The second section presented a single Data Structures and Algorithms problem, for which I had 45 minutes to solve. The problem involved an ant moving on the x-axis, starting from the origin (0) and needing to reach a target position 'x'. The ant could move 'a' units forward or 'b' units backward, with the constraint of not going behind position 0. The objective was to find the minimum steps to reach 'x', and a hint suggested using a Breadth-First Search (BFS) approach.
Following the online assessment, I proceeded to the online interview round. The interviewer started by asking me to introduce myself, then quickly moved on to technical questions. I was asked to solve LeetCode problem #6, 'ZigZag Conversion'.
Beyond the DSA problem, the interviewer delved into several Computer Science fundamentals. We discussed the concepts of deadlock and starvation, along with various deadlock avoidance methods. I had to differentiate between processes and threads, and explain multiprogramming and page faults. Database concepts were also covered, specifically normalization (1NF, 2NF, 3NF), and I described network topologies and their types. Lastly, I clarified the distinctions between deep copy and shallow copy, and explained the use of a copy constructor.
Initially, two more technical rounds and an HR round were planned. However, I decided not to participate in the subsequent rounds as I was not comfortable with the two-year company bond clause associated with the offer.
Questions asked (10)
- 01
Ant Movement on X-axis
Data Structures & Algorithms
An ant is traveling in a forest represented as the x-axis. Starting from the origin (position = 0), the ant must reach a target position x. With each step, the ant can move either ‘a’ units forward or ‘b’ units backward. The ant cannot move behind position 0, but it can go beyond position x if necessary to eventually reach x in a finite number of steps. The task is to find the minimum number of steps required for the ant to reach position x from the origin.
Hint: Consider using a Breadth-First Search (BFS) approach.
- 02
ZigZag Conversion
Data Structures & Algorithms · Medium
Open the problemThe interviewer asked me to solve LeetCode problem #6: ZigZag Conversion.
- 03
Deadlock and Starvation Concepts
Other
Explained the concepts of Deadlock and Starvation.
- 04
Deadlock Avoidance Methods
Other
Deadlock avoidance methods.
- 05
Process vs. Threads
Other
Differentiate between Processes and Threads.
- 06
Multiprogramming and Page Faults
Other
Multiprogramming and Page Faults.
- 07
Database Normalization
Other
Normalization in databases, including 1NF, 2NF, and 3NF.
- 08
Network Topologies
Other
Explain Network topologies and their types.
- 09
Deep Copy and Shallow Copy
Other
What is Deep copy and Shallow copy?
- 10
Copy Constructor Use
Other
Describe the use of a Copy constructor.