Jupiter Money Software Developer Interview Questions and Answers

Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.

• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

• Update the path length as you traverse through the matrix.

• Return -1 if no valid path exists.

Find the third largest element in an array of distinct integers.

• Sort the array in descending order and return the element at index 2.

• Handle cases where the array has less than 3 elements separately.

• Consider using a set to ensure distinct elements in the array.

Identify the longest palindromic substring in a given string.

• Iterate through the string and expand around each character to find palindromes

• Keep track of the longest palindrome found

• Return the longest palindromic substring with the smallest start index

Calculate the intersection point of two lines on a 2D plane with precision up to six decimal places.

• Implement a function to calculate the intersection point of two lines on a 2D plane

• Handle precision up to six decimal places in the output

• Return -1.000000 -1.000000 if the lines do not intersect

• Ensure the lines 'AB' and 'PQ' are distinct

Discussed coding problem, past projects, and behavioral questions in SDE - 1 interview.

• Coding problem: Discussed how I optimized a sorting algorithm in a previous project.

• Past projects: Talked about a web application I developed using React and Node.js.

• Behavioral questions: Shared how I handled a conflict within a team during a project.

• Example: Explained how I implemented a feature in a mobile app that improved user engagement.