Bounteous

Role: Software Engineer

College: Not Specified

Interview Date: Not Specified

Interview Type: On-Campus, Full-Time

Result: Not Specified

Difficulty: Easy to Medium

Rounds: 3 rounds completed

Topics Asked: Code Debugging, Data Structures and Algorithms, SQL, Java/C++ Concepts, CS Fundamentals (Operating Systems, DBMS, Networking, OOPS), Smart Pointers

Experience:

This is another interview experience for a Software Engineer role during campus hiring by Bounteous x Accolite. Similar to the previous experience, the CTC was under 10 LPA with a 2-year bond clause. The candidate noted that DSA problems were mostly in the easy category, with the exception of ZigZag Conversion in Round 1. A strong focus on CS fundamentals, especially OOPS concepts, was observed.

Round 1: Online Assessment

The online assessment consisted of two sections. Section 1 had 30 multiple-choice questions covering code debugging and output analysis, data structures and algorithms, SQL queries, and concepts in Java and C++. Section 2 presented a single DSA problem to be solved within 45 minutes: "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."

Round 2: Online Interview (Technical)

This round began with a self-introduction, followed by direct questioning. The DSA problem asked was LeetCode problem #6: ZigZag Conversion. CS Fundamentals questions included explanations of Deadlock and Starvation, deadlock avoidance methods, differentiation between Processes and Threads, Multiprogramming and Page Faults, Normalization in databases (1NF, 2NF, 3NF), Network topologies and their types, Deep copy and Shallow copy, and the use of a Copy constructor.

Round 3: Online Interview (Technical)

This round heavily focused on CS Fundamentals, with a majority of questions on OOPS concepts. The DSA problem asked was to Implement Stack Using Queue. A string-based problem, described as quite easy, was also asked. Many theoretical CS fundamental questions were covered, which the candidate felt could be answered confidently with a basic understanding of the topics. Questions related to C++ concepts like Smart pointers were also asked, which the Python-fluent candidate found challenging.