project44 General Intern Interview Questions
& Process
Real candidates share what happened, how many rounds they had,
and how the experience turned out.
Based on 5 interview experiences · FREE TO READ
Candidate interview experiences
First-hand accounts from people who interviewed at project44.
project44
Intern
Intern Average Positive experience Accept offer 3 rounds
Interview process
Take home Technical screen Onsite
Interview formats
Coding Technical Behavioral
The hiring process had three stages. It began with an online assessment on HackerRank that tested core problem-solving skills through data structures, algorithms, and a few implementation tasks. After clearing that round, there was a technical interview of about 45 to 50 minutes. This round focused on coding questions, discussion of approaches, edge cases, and a brief look at foundational concepts like time complexity and data structures. The final stage was a 30-minute conversation with the hiring manager that also included technical evaluation. This round explored how I approach real-world problems, communicate ideas, and think through system-level decisions while also checking my fit with the team’s expectations and work culture.
Confirmed questions2 questions
- The first problem was a multi source BFS scenario on a grid. The grid contained three types of cells. Zero represented vaccinated people who are immune and cannot be infected. One represented healthy people who can catch the infection. Two represented already infected people. The infection spreads to the four neighbouring cells up, down, left, and right every unit of time. Multiple infected people can start this spread at the same time, so all cells with value two act as starting points. The task was to simulate this process using a breadth first search that begins from all infected cells at once, then spreads level by level. The final answer was the time needed for the infection to reach every healthy cell. If any healthy cell stays unreachable because it is blocked by vaccinated cells, the answer becomes impossible.
- The second problem was a two pointer pattern involving a binary array. The array is made of zeros and ones. The goal was to find the longest streak of consecutive ones, but with a twist. You are allowed to flip exactly one zero to one. The challenge is to use two pointers, often called left and right, to maintain a window that contains at most one zero. As the right pointer moves through the array, you count how many zeros are inside the window. If the window contains more than one zero, you shift the left pointer forward until the extra zero is removed. The maximum length reached by such a window is the answer, which represents the longest possible chain of ones after flipping a single zero.
project44
Intern
Intern Average Positive experience No offer 2 rounds
Interview process
Technical screen Phone screen
Interview formats
Coding Technical Behavioral
First, I had a Hackerrank test with 2 coding questions. After that, I got invited for a technical round where I was asked 2 live coding questions and had a short discussion about my projects and past experience.
Confirmed questions1 question
- Coding questions based on Leetcode, medium difficulty.
project44
Intern
Intern Difficult Negative experience No offer 1 round
Interview process
Take home Recruiter call
Interview formats
Coding
I was given a HackerRank test and then I didn't hear back from the HR. I messaged her a few times but got no response. It's not cool to treat candidates like this after they've put in time and effort.
Confirmed questions1 question
- A DSA-based question was asked on HackerRank.
project44 General Intern Interview Questions
Quoted word for word from project44 interview reports.
“The second problem was a two pointer pattern involving a binary array. The array is made of zeros and ones. The goal was to find the longest streak of consecutive ones, but with a twist. You are allowed to flip exactly one zero to one. The challenge is to use two pointers, often called left and right, to maintain a window that contains at most one zero. As the right pointer moves through the array, you count how many zeros are inside the window. If the window contains more than one zero, you shift the left pointer forward until the extra zero is removed. The maximum length reached by such a window is the answer, which represents the longest possible chain of ones after flipping a single zero.”
Read reports →“A DSA-based question was asked on HackerRank.”
Read reports →“The first problem was a multi source BFS scenario on a grid. The grid contained three types of cells. Zero represented vaccinated people who are immune and cannot be infected. One represented healthy people who can catch the infection. Two represented already infected people. The infection spreads to the four neighbouring cells up, down, left, and right every unit of time. Multiple infected people can start this spread at the same time, so all cells with value two act as starting points. The task was to simulate this process using a breadth first search that begins from all infected cells at once, then spreads level by level. The final answer was the time needed for the infection to reach every healthy cell. If any healthy cell stays unreachable because it is blocked by vaccinated cells, the answer becomes impossible.”
Read reports →“Coding questions based on Leetcode, medium difficulty.”
Read reports →“Can you solve a coding question in any programming language?”
Read report →Formats, difficulty and experience
Across all 5 project44 interview reports.