Streamoid Technologies Interview Experience | Set 1 (For Freshers)
Question Details
Written Round: This Round was pen and paper round consisted of 45 questions out of which only 2-3 are aptitude and rest are from DS, OS, C, C++, Networking, DBMS. Question...
Full Details
Written Round: This Round was pen and paper round consisted of 45 questions out of which only 2-3 are aptitude and rest are from DS, OS, C, C++, Networking, DBMS. Questions were standard so you should well aware of these concepts though most of the questions were from geeksforgeeks. You need to correct about 30 – 35 question to clear this round. Total 227 students appeared out of which 82 students are shortlisted Coding round(9 Were shortlisted): This round consists of 4 questions that has to be solved in 2 hours. 1.Given an array find whether it can be divided into two parts such that both parts sum is equal. 2. https://www.geeksforgeeks.org/dsa/find-the-smallest-window-in-a-string-containing-all-characters-of-another-string/ 3. Print the prime number between some given range 4. Given a sorted array of numbers, find the total number of elements within a range(inclusive). Please do mention the time and space complexity in the comments otherwise your solution will not be accepted. Ex a = [1,2, 4,5, 8,10,12] range = [3,6] Output:- 4 5 Restriction:- You can’t use STL Round 1( 6 were shotlisted :: Duration 2 hours) 1. You are given an array of integers and four operators + , * , ( , ) and using these four operator you have to find the maximum sum that you can make Example: array elements are {1,2,3) Lets examine two scenario 123 and (1+2)*3 so second is giving 9 and first is giving 6 so answer should be 9. 2.You are given a integer n find how many ways you can make palindrome number consisting of n digits and print it also you are not supposed to use any array or character array means you can only use recursion.
Example : n = 2 then answer would be 11,22,33,………………………. 3. https://www.geeksforgeeks.org/dsa/find-the-number-of-islands-using-dfs/ 4. Project discussion thoroughly. Round 2(Duration 1 hours approx.) 1. Given a matrix with some empty cell and some cell having bomb and you are at (0,0) and you have to reach to a given location say (destx, desty) find whether there is a possible path of not if Yes print the minimum distance you can only go through empty cell. 2. https://www.geeksforgeeks.org/dsa/given-sorted-dictionary-find-precedence-characters/ 3. Given an integer you have to find the minimum length of factor such that none of the factor is perfectly divisible by any perfect square. Input#1: n = 180 Output#1 : 6 * 30 having length 2 Input#2: n = 166320 Output#2: 2x6x6x2310 having length 4 Note : Firstly find prime factor and then think 4. Topological sorting(Kahn’s algorithm discussion) 5. Small discussion on project Round 3(Duration : 45 minutes) This was skype round and taken by founder and roughly about 5 minute project discussion and about 30 minute OS question In OS: How OS execute some program. Thrashing , reason of thrashing and how to resolve it. Deadlock and starvation thoroughly discussion how to eliminate. Demand paging Page replacement techniques Some basic HR questions Related Practice Problems Smallest window in a string containing all the characters of another string
About This Question
This is a reported interview question from a streamoid interview for a data science role during the phone screen round reported in 2025.
It covers the following topics: Strings, Graph, Networking, Recursion, Sorting, Os, Math, Graphs, Hash Table, Arrays, Matrix .
Difficulty rating: Easy
About Streamoid Interview Reports
This question was reported by a candidate who interviewed at Streamoid. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Streamoid are the higher-signal extractions to take from this report.
For broader preparation context, the Streamoid interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Streamoid reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Streamoid Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Streamoid reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.