Candidates applying for Software Engineer roles take an average of 90 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Phillips 66 overall takes an average of 33 days.
Common stages of the interview process at Phillips 66 as a Software Engineer according to 1 Glassdoor interviews include:
One on one interview: 25%
Phone interview: 25%
Drug test: 25%
Background check: 25%
Here are the most commonly searched roles for interview reports -
I had a great experience interviewing here. The process was well-structured and smooth. It started with an initial phone screen with HR, followed by a technical interview, and finally, a panel interview with team members. The interviewers were friendly, and they asked a mix of technical and behavioral questions. I felt like they were genuinely interested in getting to know me as a person, not just my skills. Communication was clear at every stage, and they were transparent about next steps and timelines. I left the interview feeling positive about the company.
1- OA round had 1 coding and 30 mcq question based in cs fundamentals. 2-technical interview- the interviewer asked to introduce myself. then he moved towards oops concept , i was grilled over that for 20 minutes then he moved to some basic javascript questions, after this he asked me to reverse a string , reverse a number. the whole round went for about 30 minutes. 3-HR round - started with introduction, then he moved towards some technical questions like regression testing and some system design questions. also asked some situation based question, it went around 30 minutes.
Interview questions [1]
Question 1
1-OA->Os , OOPS, DBMS and a coding question having a greedy approach. 2-Technical->OOPS-inheritance, constructor, this keyword ans some JS questions. 3-HR->Regression testing, scaling DataBase.
I applied through college or university. I interviewed at Phillips 66 (New Delhi) in Jan 2022
Interview
easy but difficultA straightforward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?
Interview questions [1]
Question 1
A straightforward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?