Internship
Interview Date
Not Specified (Posted 2025)
Result
Not Specified
Difficulty
Medium
Rounds
3 rounds (Screening, Technical Round 1, Technical Round 2)
Drive Type
Not Specified (likely On-Campus/Off-Campus based o
Topics asked
Detailed experience
College: Not Specified
Interview Date: Not Specified (Posted 2025)
Interview Type: Not Specified (likely On-Campus/Off-Campus based on screening round)
Result: Not Specified
Difficulty: Medium
Rounds: 3 rounds (Screening, Technical Round 1, Technical Round 2)
Topics Asked: Aptitude, Coding (Arrays, String, DP, Sorting), HTML/CSS, Projects, Logical Reasoning, DBMS (SQL)
The internship interview process involved three rounds.
Screening Round: This round consisted of 30 aptitude questions (30 minutes, negative marking -0.25 for incorrect) followed by 4 easy coding questions. Coding questions included: "Sort an array of 0s, 1s, and 2s", "Stock Buy Sell", "Program Decimal Binary Conversion", and "Given a string containing '0', '1', and '?', replace '?' to form all possible binary strings".
Technical Round One: This round was conducted via Microsoft Teams. The interviewer started with a background discussion. The candidate was then asked to write HTML/CSS code on codeshare.io for a simple web page layout, and questions on CSS specificity and rules were asked. Following this, questions about previous internship experience and projects were covered. The interviewer also gave a question: "Given a string of lowercase alphabets, print the length of the longest palindromic subsequence that can be formed using the characters of the original string. Order of arrangement is not important. For example for string 'bcbdcddcdac', we can construct a palindromic string as 'cdcbdadbcdc'". The focus was on an optimized solution.
Round Two: The interviewer was a project manager. This round focused on 2 coding questions and one logical reasoning question. Coding questions included: "Given a paragraph, split that paragraph into an array of words, and print them in lexicographically descending order along with the frequencies" (optimized solution was sought), and "Given an array of integers, return the count of distinct pairs whose sum is greater than 0" (optimized solution was sought). A logical reasoning question involved explaining the conversion of MAQ=>ZBH and CAT=>FBN.