OA Round

There were 4 sections:

• 20 minutes for 15 MCQs.
• 20 minutes: Integer to Roman.
• 25 minutes: In an m*n grid with obstacles, find if (m-1,n-1) can be reached from (0,0) in less than or equal to a given time, where each movement costs 1 unit of time.
• 25 minutes: Given an array of binary strings (like "1101" representing 13) and a maximum 'k' number of operations that can be performed. The operation is taking the 1s complement of a string. Find and return the maximum possible sum of all the strings.

There were 2 rounds, both technical.

Pointers and Error Handling:

• Predicting the output type of pointer-related questions.
• Identifying different types of errors associated with pointers.
• Discussing methods to fix pointer-related errors.

Struct Size Calculation:

• Determining the size of a struct containing an int and a char.
• Coding to verify the size of the struct.
• Explaining the logic behind the size calculation.

Struct and Bit Manipulation:

• Implementing functions to check if the k-th bit of an integer is set.
• Implementing functions to set the k-th bit of an integer.
• The struct provided included a char array.

Data Structures:

• Understanding ordered and unordered maps.
• Discussing various collision resolution techniques for maps.
• Explanation of AVL tree balancing and rotations involved.

Scenario-Based Question:

• Choosing an appropriate collision resolution technique for a given situation.