Upload Button Icon Add office photos

Filter interviews by

FarEye SDE Interview Questions and Answers

Updated 19 Sep 2024

FarEye SDE Interview Experiences

1 interview found

SDE Interview Questions & Answers

user image Anonymous

posted on 19 Sep 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Good HackerRank Question

Round 2 - Technical 

(2 Questions)

  • Q1. 2 sum Array question
  • Q2. Left View of a tree
  • Ans. 

    The left view of a tree shows the nodes that are visible when looking at the tree from the left side.

    • Traverse the tree in a level order manner

    • Keep track of the first node encountered at each level

    • Add the first node at each level to the result array

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

SDE Interview Questions & Answers

Chegg user image Anonymous

posted on 19 Mar 2024

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Technical coding round, DSA questions

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions about projects,resume,SQL,DSA.
Round 3 - One-on-one 

(1 Question)

  • Q1. If cleared the first round of interviews, another technical round, followed by HR.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before May 2023. There was 1 interview round.

Round 1 - Coding Test 

Coin Change Problem from DSA

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

One easy , one medium question Array based

I applied via Recruitment Consultant and was interviewed in May 2020. There were 3 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is diameter of Binary Tree? Write full working code.
  • Ans. 

    Diameter of a binary tree is the longest path between any two leaf nodes.

    • Calculate the height of left and right subtrees recursively.

    • Calculate the diameter recursively using the formula max(left_height + right_height + 1, max(left_diameter, right_diameter)).

    • Return the maximum diameter.

  • Answered by AI
  • Q2. Find interchanged terms from an AP, where terms are arranged in series
  • Ans. 

    To find interchanged terms from an AP series

    • Identify the common difference between terms

    • Swap the positions of adjacent terms

    • Check if the new series is also an AP

    • Repeat until no more interchanged terms can be found

  • Answered by AI
  • Q3. Explain database indexing
  • Ans. 

    Database indexing is a technique to improve the performance of database queries.

    • Indexing creates a data structure that allows for faster retrieval of data.

    • Indexes are created on one or more columns of a table.

    • Queries that use indexed columns can be executed faster.

    • Indexes can be clustered or non-clustered.

    • Clustered indexes determine the physical order of data in a table.

    • Non-clustered indexes create a separate structure...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on basic data structures, operating systems and database.

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Dec 2020. There were 4 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Design a stack that support getmin in O(1) time and O(1) space complexities
  • Ans. 

    Design a stack that supports getmin in O(1) time and O(1) space complexities.

    • Use two stacks, one for storing the actual values and the other for storing the minimum values.

    • When pushing a new value, check if it is smaller than the current minimum value and push it to the minimum stack if it is.

    • When popping a value, check if it is the current minimum value and pop it from the minimum stack if it is.

    • To get the minimum val...

  • Answered by AI
  • Q2. Questions related OS and DBMS
  • Q3. Binary tree traversal
  • Ans. 

    Binary tree traversal is the process of visiting each node in a binary tree exactly once in a specific order.

    • There are three main types of binary tree traversal: inorder, preorder, and postorder.

    • Inorder traversal visits the left subtree, then the root, then the right subtree.

    • Preorder traversal visits the root, then the left subtree, then the right subtree.

    • Postorder traversal visits the left subtree, then the right subt...

  • Answered by AI
  • Q4. LRU cache explanation
  • Ans. 

    LRU cache is a data structure that stores the most recently used items and discards the least recently used items.

    • LRU stands for Least Recently Used

    • It has a fixed size and when the cache is full, the least recently used item is removed to make space for a new item

    • It uses a combination of a doubly linked list and a hash map to achieve O(1) time complexity for both insertion and deletion

    • Example: A web browser cache that ...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Good with your programming skills and fundamentals.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Dec 2021. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - One-on-one 

(2 Questions)

  • Q1. Framework related questions.
  • Q2. String palindrome, MySQL queries etc.
Round 3 - Coding Test 

Matrix rotation and counting 0 and 1's.

Round 4 - CTO 

(1 Question)

  • Q1. Salary negotiation and interview feedback.

Interview Preparation Tips

Interview preparation tips for other job seekers - Basic data structures knowledge, MySQL queries and your framework related knowledge is what all is needed.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(2 Questions)

  • Q1. Jump Game - II
  • Q2. Number of Island
  • Ans. 

    Count the number of islands in a given grid of '1's and '0's.

    • Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited.

    • Increment the island count for each new island encountered.

    • Consider edge cases like grid boundaries and handling visited cells.

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Questions on mobile development
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Golang specific question regarding worker pool implementation

FarEye Interview FAQs

How many rounds are there in FarEye SDE interview?
FarEye interview process usually has 2 rounds. The most common rounds in the FarEye interview process are Coding Test and Technical.
What are the top questions asked in FarEye SDE interview?

Some of the top questions asked at the FarEye SDE interview -

  1. Left View of a t...read more
  2. 2 sum Array quest...read more

Tell us how to improve this page.

FarEye SDE Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

SDE Interview Questions from Similar Companies

XpressBees SDE Interview Questions
3.6
 • 2 Interviews
Chegg SDE Interview Questions
4.1
 • 1 Interview
Mobikwik SDE Interview Questions
3.7
 • 1 Interview
Zenoti SDE Interview Questions
3.0
 • 1 Interview
View all
Solution Engineer
109 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Solution Engineer
58 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Support Engineer
56 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer II
37 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer
36 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare FarEye with

LogiNext Solutions

1.8
Compare

Shiprocket Private Limited

3.7
Compare

Shadowfax Technologies

3.6
Compare

Delhivery

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview