Loading Question...
Interview Overview Mode: Telephonic Duration: ~30–35 minutes Focus: Communication, Web fundamentals, Problem-solving, Projects Note
Some of my answers were not completely correct. I was a bit nervous during the interview, which the interviewer also pointed out. Because of that, I made a few mistakes. So I would suggest not relying completely on my answers. One important takeaway: don’t get nervous. The interviewer is usually there to guide you and make you comfortable.
Interview Flow
The interview started with a formal introduction. The interviewer explained the role:
Internship duration: 10–12 weeks Location: Hyderabad Responsibilities included: Working with advertisers and internal teams Handling end-to-end solution lifecycle Managing feature requests and deployments
They also confirmed my personal details.
I explained that I am interested in how technology is used to solve real-world problems.
This role matched my interests in:
Web technologies Practical problem solving Building useful solutions
I also mentioned that the role is not just about coding, but about applying technology to real user problems.
Technical Questions Q1: How would you improve a slow-loading website?
I answered in a structured way:
Load Balancing Distribute traffic across multiple servers to reduce latency Caching Store frequently accessed data to avoid repeated processing Scaling Vertical scaling (better hardware) Horizontal scaling (more servers) Data Partitioning Fetch only required data to reduce unnecessary load
The interviewer added a few more points like optimizing media, reducing HTTP requests, using CDN, and writing clean code. I acknowledged those and continued the discussion.
Tech Stack Discussion
I mentioned:
C++ for DSA HTML, CSS, JavaScript, React.js, Next.js Python (basic ML knowledge)
Also discussed solving around 230+ problems on LeetCode.
Project Discussion Project 1: Inventory Management System Built using Next.js and Google Sheets API Solved a real-world problem for a bookstore
Features:
Easy data entry Automatic tracking Basic analytics
My role:
Frontend development Designing the solution Project 2: Research Article Summarizer Built using Flask and Python Converts long research papers into short summaries
My role:
UI development Partial backend integration Core Concepts Web Architecture, Networking & Services
I explained:
Frontend, Backend, APIs Client-server communication APIs and microservices for data exchange Databases (SQL vs NoSQL vs MongoDB vs PostgreSQL) SQL Structured data, strong consistency MongoDB / NoSQL Flexible schema, JSON-based, scalable PostgreSQL Mentioned as a relational database (basic understanding) My Question to Interviewer
I asked for feedback.
Feedback:
Overall performance was good Need to improve communication clarity Practice more DSA, especially medium/hard problems Final Impression
The interview was more discussion-based than coding-heavy. It mainly focused on:
Clarity of thought Practical understanding Communication Key Takeaways Communication is as important as knowledge Try to structure your answers Be clear while explaining projects Don’t guess if you don’t know something Keep practicing DSA
Interview Mode: Online (Google Meet) Duration: ~45–60 minutes
Problem Statement
The interviewer gave me a data structures problem based on queues.
We were given multiple queues Allowed operations: pop() (removes front element, expensive) isEmpty() We were not allowed to access the size of any queue
Task: Find the length of the shortest queue
Approach Initial Idea (Brute Force)
I first suggested a simple approach:
Pop all elements from each queue Count the size of each Return the minimum
But this approach was inefficient because it destroys all queues and takes unnecessary time.
Optimized Approach
Then I realized we don’t need all queue lengths, only the shortest one.
So I proposed a better approach:
Pop elements from all queues in parallel Keep track of the number of rounds As soon as any queue becomes empty, return the count
The idea is that the first queue to become empty must be the shortest.
Edge Cases Discussed No queues → return 0 Any queue already empty → return 0 Null pointer handling Different queue sizes Further Discussion
I also mentioned an alternative idea using binary search on the answer, where we try to check if a queue becomes empty after a certain number of pops. This was more of a conceptual discussion to show another way of thinking.
Complexity Time complexity: O(n × minLength) Efficient because it stops as soon as the shortest queue is found Overall
The interviewer seemed satisfied with:
My problem-solving approach Optimization thinking Code clarity Handling of edge cases Key Takeaways Try to simplify the problem instead of solving everything Look for early stopping conditions Explain your thought process clearly Cover edge cases properly Suggesting alternative approaches helps
SOME ANSWERS I ANSWERED WERE A BIT INCORRECT SO I AM JUST PROVIDING WHAT I SAID RATHER YOU MAY NOT REFER TO MY ANSWERS AS I GOT A LOT NERVOUS DURING THE INTERVIEW THATS WHAT INTERVIEWER ALSO POINTED OUT AND I DID MISHAP MANY TIMES DUE TO THAT SO A TIP DONT GET NERVOUS INTERVIEWER IS THERE TO CALM YOU DOWN