EagleView Software Engineer Level 1 Interview Questions and Answers

Q1. Company overview, salary + perks and bonuses, team, project and culture
Add your answer

Basic questions on python and palindrome

Medium level complexity problems in python

Q1. Technical details on previous projects
Add your answer

Share the link for codesignal

Q1. Java related questions
Add your answer
Q2. Based on the resume
Add your answer

Q1. Current time and their angles
Ans. 
The question is asking for the current time and the angles formed by the hour and minute hands on a clock.
• The angle between the hour and minute hands of a clock can be calculated using the formula: angle = |(30*hour - (11/2)*minutes)|

• At 3:00, the angle between the hour and minute hands is 90 degrees.

• At 6:00, the angle between the hour and minute hands is 180 degrees.

• At 9:00, the angle between the hour and minute hands
Answered by AI
Add your answer

Q1. Didnt qual here btw
Add your answer

Q1. Didnt qual either btw
Add your answer

Q1. Angular and JavaScript.
Add your answer

Q1. Behavioral Questions
Add your answer
Q2. CI-CD, Jenkins, AWS
Add your answer

Q1. Client Interview - Security related.
Add your answer

There was a coding round and out of 75 students 28 got selected for next round

Q1. Total on resume and basic coding questions like write code for different sorting algorithms.
Add your answer
Q2. Explain your project in detail and asking cross questions regarding project.
Add your answer

Q1. I was rejected in round 2.
Add your answer

Q1. Types of data structure and their time complexities
Ans. 
Data structures are used to organize and store data efficiently. Time complexity is the measure of efficiency.
• Arrays - O(1) for access, O(n) for search and insertion

• Linked Lists - O(n) for access, O(1) for insertion and deletion

• Stacks - O(1) for access, insertion and deletion

• Queues - O(1) for access, insertion and deletion

• Trees - O(log n) for access, insertion and deletion

• Hash Tables - O(1) for access, insertion and de
Answered by AI
Add your answer
Q2. Types of Binary Tree
Ans. 
Binary trees are classified based on the number of children each node can have.
• Full binary tree: every node has either 0 or 2 children

• Complete binary tree: all levels except possibly the last are completely filled, and all nodes are as far left as possible

• Perfect binary tree: all internal nodes have two children and all leaf nodes are at the same level

• Balanced binary tree: the difference in height between the left and ...read more
Answered by AI
Add your answer