Glassdoor users rated their interview experience at Polynomial.Ai as 50% positive with a difficulty rating score of 3 out of 5 (where 5 is the highest level of difficulty). Candidates interviewing for Software Developer and Software Developer L1 rated their interviews as the hardest, whereas interviews for Software Developer and Software Developer L1 roles were rated as the easiest.
The hiring process at Polynomial.Ai takes an average of 20 days when considering 2 user submitted interviews across all job titles. Candidates applying for Software Developer had the quickest hiring process (on average 20 days), whereas Software Developer roles had the slowest hiring process (on average 20 days).
Interview Experience at Polynomial AI
Overall Experience: Mixed
Interview Process Duration:
Interview Process:
The interview process consisted of multiple rounds:
1. Data Structures & Algorithms Assessment
- First round focused on DSA problems
- Questions were relatively easy but time-consuming
- Good opportunity to demonstrate problem-solving skills
2. Full Stack Development Assignment
- Practical coding assignment
- Required to develop a complete full stack application
- Tests real-world development capabilities
3. Senior Team Interview
- Conversation with senior team members
- Less technical (less doesn't mean not at all)
- Opportunity to discuss background and experience
4. Additional Technical Round
- Added later in the process
- Conducted because they identified potential fit for a different role
- More specific to the new position being considered
Interview questions [1]
Question 1
some long but easy dsa problem; then the full stack assignment;
I applied online. The process took 2 weeks. I interviewed at Polynomial.Ai (Bengaluru) in Jul 2023
Interview
3 rounds in total.
1st round - overall coding, dsa ques 1-2, project related
2nd round - frameworks, coding, projects, basic problem solving
3rd round - final round for judging attitude and personality towards work.
Interview questions [1]
Question 1
Find two sum (leetcode) .
Find triplets whose sum is 0.