SafexPay Software Developer Interview Questions and Answers

Q1. 1 - Easy Medium Question. Discuss the approach with interviewer and then implement it. The code should work, thats important.
Add your answer

Q1. LLD round to design Chess.
Add your answer

Q1. Hiring manager round. Grilling on resume and past experience questions
Add your answer

Q1. There were 3 dsa questions which were of topic arrays and strings
Add your answer

Q1. It was more like a managerial round where they asked questions about resume projects and past experience
Add your answer

It was leetcode questions for 60 min for 2 questions.

Q1. Tell me about your self
Add your answer

Q1. Tell me about your work experience
Add your answer

They have problem of K sorted array and you need to make an sorted array of it.

Q1. Your current job role
Add your answer
Q2. Software Developer
Add your answer

Round duration - 50 mins
Round difficulty - Medium

First round was coding round, where i was asked 2 DS algo questions, 1 was easy and other was of medium difficulty

Q1. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Add your answer

Round duration - 50 mins
Round difficulty - Easy

I was asked to design url shortner

Q1. Can you explain how you would design a URL shortener?
Add your answer

Round duration - 50 mins
Round difficulty - Medium

This was hiring manager round

Q1. Can you discuss a coding problem you encountered, your past projects, and any behavioral questions related to your experiences?
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 9 PM. Platform was not good. Platform was very lagging so overall it was bad experience.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. Sorting Based Approach
The idea is to sort the array in non-decreasing order, and then return the third element from the back of the array.
 
The steps are as follows :
1. Sort the array in non-decreasing order.
2. Return the third element from the back of the array.
Space Complexity: O(logn)Explanation:
O(1)
 
We are not using any extra space. Thus, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explan...read more
Answered Anonymously
Add your answer
Q2. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Ans. Brute Force
1. Generate substrings of the given string such that substring having greater length will be generated first.
2. To do this, run a loop where iterator len will go from N to 1, where N is the length of the given string.
3. Run a nested loop and fix an iterator j that will point at the starting index of the substring.
4. Get the substring from j to j+len.
5. If the substring is a palindrome, return the substring (As the substrin...read more
Answered Anonymously
Add your answer
Q3. 
Ninja and Geometry Problem Statement
In this problem, Ninja is provided with two lines on a 2D plane. The first line 'AB' is determined by two points A and B. The second line 'PQ' is determined by two poi...read more
Ans. Mathematics
The idea behind this approach is to derive the equation of both of the lines ‘AB’ and ‘PQ’ and check if the Slope of these two lines is equal or not. Following are the two cases:
• If the slope of ‘AB’ and ‘PQ’ is the same that means they are parallel so we return -1.
• Else there must a point where ‘AB’ and ‘PQ’ are intersecting.
For a better understanding of this approach, Assume that we have two points which are...read more
Answered Anonymously
Add your answer