Pathfinder Business Analysis Software Developer Interview Questions and Answers

Q1. Questions based on Java , C++ , OOPs, cloud computing, one coding question, regarding previous projects, some behavioural questions.
Add your answer

Q1. Questions on PHP MySQL, HTML CSS
Add your answer

Q1. Explain your backgroun
Add your answer

Hackerrank online assessment

Case study with a little bit of math for scenario based questions

2 questions of coding with a live interviewer

Behavioral and coding with a senior engineer

Q1. How do you handle conflicts
Add your answer
Q2. What was the most challenging problem you had to solve so far
Add your answer

Round duration - 100 Minutes
Round difficulty - Hard

There were 2 interviewers. It started with an introduction from me and one of the interviewers directly started with a DSA questions. Two problems were asked and I had to code them on a compiler of my choice by sharing my screen. Level of DSA question was medium but I was severely grilled on oops. I had to create different abstract classes, interface and explain entire oops with examples.

This was followed by a set of core JAVA questions :

Difference between == and .equals() ?
Mention some methods of the object class?
Difference between TreeSet and SortedSet?
How is a String saved in JAVA?
difference between string pool and heap memory?

Q1. Shortest Distance
You have been given a Binary Search Tree and two keys 'NODE1' and 'Node2' in it.
Your task is to find the shortest distance between two nodes with the given two keys. It...read more
Ans. 
I directly gave an approach to find the lowest common ancestor of the two nodes and then finding separate distances between the Ancestor node and the two nodes and returning the sum of the distances. I was then asked to code the whole solution which I correctly completed.
Answered by CodingNinjas
Add your answer
Q2. Greatest Common Divisor
You are given two numbers, ‘X’ and ‘Y’. Your task is to find the greatest common divisor of the given two numbers.
The Greatest Common Divisor of any two integers is the largest n...read more
Ans. 
I was happy after seeing the question and coded it in 3 minutes using while loop. I was the asked to do it by recursion and i successfully did it but the catch here was to explain to the interviewer the entire memory management in heap and stack along with complexity solution.
Answered by CodingNinjas
Add your answer
Q3. Bridges In A Graph
Given an undirected graph of V vertices and E edges. Your task is to find all the bridges in the given undirected graph. A bridge in any graph is defined as an edge which, when removed, ...read more
Ans. 
I solved it using o(e+v) algo and interviewers were very patient and helpful
Answered by CodingNinjas
Add your answer