INTUIT

## Round 0: Written Round Four questions were asked: **Greedy Solution Using Priority Queue** **Multi-source BFS Question** Similar to the LeetCode problem "Rotten Oranges." **Maximize Sum of Non-Adjacent Elements** Standard problem where the goal is to maximize the sum of non-adjacent elements. **Dynamic Programming on Trees Question** ## Round 1: Technical Interview **Duration:** Approximately 45 minutes. **Focus Areas:** Core concepts in Operating Systems (OS), Database Management Systems (DBMS), and Object-Oriented Programming (OOP). No questions from Computer Networks (CN). **Interview Style:** Real-life scenarios requiring solutions based on core concepts. Heavy emphasis on OS and OOP. ### DSA/Coding Questions: **Pattern Printing** **Task:** Given a number `n`, print a pattern in O(N) time and O(1) space. **Example for ( n = 4 ):** ``` 1 12 123 1234 ``` **Solution:** Use a variable `num`, iterate from `i = 1` to `i <= n`, update `num` as `num * 10 + i`, and print `num`. **Graph Question** Similar to LeetCode Medium. Discussion on which is better, DFS or BFS. **Solution:** Explained an algorithm using DFS with O(V+E) time complexity and O(1) space. ## Round 2: Technical Interview **Duration:** 75 minutes. **Interview Style:** No greetings, two interviewers were there. Started immediately with questions about the project. Detailed questions about the tech stack used in the project (20-25 minutes). ### Core Questions: Core questions were simpler than the previous round, but they covered topics across OS, DBMS, and OOP. This time, more focus was on DBMS, specifically on Concurrency and Data Integrity (e.g., how to achieve both). Questions on **SOLID Principles**. **NoSQL questions:** For example, "What are all the properties that NoSQL satisfies in ACID?" ### Design Task: **Task:** Design Instagram using OOP principles. Implement classes, attributes, methods, and relationships among classes. Examples: `UploadContent`, `WatchContent`, `Searches`, `Profiles`, etc. ### DSA/Coding Question: **Task:** Given a string `s` and an integer `k`, reverse the first `k` characters of `s` for all `k` from 1 to `k` (where the previous reversals persist). **Example:** `S = "12345"`, `k = 4` `K = 1`: `S = "12345"` `K = 2`: `S = "21345"` `K = 3`: `S = "31245"` `K = 4`: `S = "42135"` **Final Answer:** `S = "42135"`