Summary
I interviewed for an AI Engineer Intern position at Scaler in Bengaluru. The process included a resume shortlisting, a proctored viva round focused on Python concepts and concurrency, and a DSA round featuring a minimum cost path problem and LeetCode's Longest Common Prefix.
Full Experience
Scaler AI Engineer Intern , Bengaluru (Stipdend=35k+ month)
(OnCampus Tier 3)
- So we had a resume shortlisting round after wards we have had coding rounds. Resumes with a strong focus on either Python or Javascript were selected
Assessment Details
Round 1: It had 2 options Python/Javascript. I selected Python. It was a proctored test. My went for around 10-15 minutes. Followinf questions were asked
- Dunder methods in Python
- OOPS Concept In python
- Polymorphism in Python
- What is lock (GIL Lock) in Python
- Name some duner methods?
- Is python thread-safe?
- How is multi threading & multiprocessing achieved
so basically on our laptop screen was an AI who was speaking questions. In response to that we did speak answers
Round 2: DSA (Medium Prolems) (Both Leetcode (DP & Sorting))
Question 1: Imagine I am at top left, and I need to reach bottom right. Now at each time I can go down right etc. Now what is the min cost to react there. Each arr element I go adds up to cost(Question was this or similar to this)
Question 2: I think it was this one https://leetcode.com/problems/longest-common-prefix/ (Longest Common Prefix)
I think both questions were easy-medium. (Although one disadvantage was there, I couldnt run the question anywhere. Basically again it was an AI questioning us. and We were supposed to explain approach to it only . (We didn't have a compiler online, just a place to write code))
Interview Questions (3)
Questions covered Python Dunder methods, OOPS concepts, Polymorphism, GIL Lock, thread-safety, and multi-threading/multi-processing mechanisms.
Imagine I am at top left, and I need to reach bottom right. Now at each time I can go down right etc. Now what is the min cost to react there. Each arr element I go adds up to cost(Question was this or similar to this)
I think it was this one https://leetcode.com/problems/longest-common-prefix/ (Longest Common Prefix)