Algouniversity

Online Assessment (OA) The OA consisted of 6 DSA questions covering topics such as Graphs, Dynamic Programming, Matrix Exponentiation (Fibonacci), and Binary/Ternary Search,Gready. One of the questions was Codeforces 1999G2 – Ruler (Hard Version), an interactive problem involving ternary search. The problem is rated 1700 on Codeforces. Topics covered: Graphs Dynamic Programming Gready Matrix Exponentiation / Fibonacci Binary/Ternary Search Codeforces 1999G2 – Ruler (Hard Version) I was able to solve 3 out of the 6 questions, which was enough to get shortlisted for the technical interview round. Technical Interview The interview started with the interviewer asking me to introduce myself and briefly explain my background and projects. After that, I was given a 0/1 Knapsack DP problem. I first explained the standard DP approach and was then asked to optimize the solution to O(W) space complexity. I explained how the 2D DP table can be reduced to a 1D array by iterating the capacity in reverse order. The interviewer then moved on to OOP concepts, asking questions such as: What is Abstraction? What is a Virtual Function? Why and where are virtual functions used? The interview also covered Operating Systems. One of the questions was: What is the difference between a Process and a Thread? Overall, the technical round focused mainly on DSA, OOP, and OS fundamentals, with the DSA portion testing both problem-solving ability and space optimization.