Round 1
Questions:
- The OA was conducted on HackerRank with negative marking.
- Duration: 60 minutes
- Total Questions: 29
- 15 Analytical Questions (considering time, they were a bit hard)
- 12 CS Fundamentals and C Code Questions (easy to medium)
- 1 DSA Question: Check whether a binary number is a power of two (only C allowed, basic)
- 1 Question worth 75 marks: Similar to the "Good Substring" problem on GeeksforGeeks but more difficult (C/C++ allowed). The difference was that we could swap two good substrings to create a new good substring, and we needed to find the total number of good substrings we could make.
Follow-up Question
- Specific question not provided.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.