Intuitive AI / Cloud -- Campus Placement Online Assessment Experience
Summary
I shared my Online Assessment experience for campus placements at Intuitive AI / Cloud. The round was challenging, consisting of CS fundamentals, aptitude, and two hard coding questions involving Monotonic Stack, Dynamic Programming, and Greedy Algorithms.
Full Experience
Intuitive AI / Cloud recently visited our campus for placements, and I wanted to share my Round 1 (Online Assessment) experience to help others preparing for similar roles.
Round 1 Structure
The first round was conducted on an online assessment platform and consisted of three sections:
1. CS Fundamentals -- 15 Questions
This section included MCQs from core computer science subjects such as:
- Operating Systems
- DBMS
- Computer Networks
- OOP Concepts
- Basic Data Structures
Some questions were also Python-based conceptual questions, testing basic understanding of Python syntax and behavior.
The questions were mostly conceptual and moderate in difficulty.
2. Aptitude -- 10 Questions (Hard Level)
This section included:
- Quantitative Aptitude
- Logical Reasoning
- Probability-based problems
Most questions were time-consuming and tricky, especially the logical puzzles.
Difficulty: Hard
3. Coding Section -- 2 Questions
In the coding section, we were allowed to choose from the following languages:
- Java
- C++
- Python
- JavaScript
Coding Question 1 (LeetCode Hard)
Number of Visible People in a Queue
https://leetcode.com/problems/number-of-visible-people-in-a-queue/
The problem asks to determine how many people each person can see to their right in a queue based on heights.
A person can see another person if all people between them are shorter than the minimum height of the two.
The optimal solution uses a Monotonic Stack to efficiently process the heights.
Difficulty: Hard
Coding Question 2 (Scenario-Based Problem)
This problem was based on a room ordering / exam redistribution scenario.
Problem Summary
Linda collects exam papers from different rooms and redistributes them for peer review. The students are located in multiple rooms with different sizes.
Process
- Linda starts from the first room and collects all exams.
- In each next room, she distributes exams from the top of her pile.
- Then she collects the newly written exams and puts them at the bottom of the pile.
- After visiting all rooms once, she returns to the first room and distributes the remaining exams.
Constraints
- Linda must never run out of exams while distributing.
- No student should receive their own exam.
- We must determine a safe order of visiting rooms.
- If no valid ordering exists, output "impossible".
Example
Input
4
2 3 3 1
Output
2 3 4 1
This problem required greedy reasoning and ordering rooms based on the number of students.
Difficulty: Hard
Other Coding Questions Asked to Friends
From discussions after the test, it seems that the coding questions were randomized, but most were hard-level LeetCode problems.
Some questions asked were:
1. Minimum Insertion Steps to Make a String Palindrome
https://leetcode.com/problems/minimum-insertion-steps-to-make-a-string-palindrome/
Concepts involved:
- Dynamic Programming
- Longest Palindromic Subsequence (LPS) / LCS variation
2. Best Time to Buy and Sell Stock IV
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/
Concepts involved:
- Dynamic Programming
- Transaction-limited stock trading problem
Overall Difficulty
| Section | Difficulty |
|---|---|
| CS Fundamentals | Medium |
| Aptitude | Hard |
| Coding | Hard |
The coding questions required strong knowledge of:
- Monotonic Stack
- Dynamic Programming
- Greedy Algorithms
Overall, the round was quite challenging, especially the coding section.
Hope this helps anyone preparing for Intuitive AI / Cloud interviews.
Interview Questions (4)
Number of Visible People in a Queue
The problem asks to determine how many people each person can see to their right in a queue based on heights.
A person can see another person if all people between them are shorter than the minimum height of the two.
Room Ordering / Exam Redistribution
Linda collects exam papers from different rooms and redistributes them for peer review. The students are located in multiple rooms with different sizes.
Process
- Linda starts from the first room and collects all exams.
- In each next room, she distributes exams from the top of her pile.
- Then she collects the newly written exams and puts them at the bottom of the pile.
- After visiting all rooms once, she returns to the first room and distributes the remaining exams.
Constraints
- Linda must never run out of exams while distributing.
- No student should receive their own exam.
- We must determine a safe order of visiting rooms.
- If no valid ordering exists, output "impossible".
Example
Input
4
2 3 3 1
Output
2 3 4 1
This problem required greedy reasoning and ordering rooms based on the number of students.
Minimum Insertion Steps to Make a String Palindrome
Concepts involved:
- Dynamic Programming
- Longest Palindromic Subsequence (LPS) / LCS variation