SingleInterface Software Developer Interview Questions and Answers for Experienced

Leecode medium level question

Leetcode Hard level Question

Q1. This is cto round asked some interview questions
Add your answer

- simple basic ios questions

Q1. Asked DSA array questions
Add your answer

Kadance algorithm and find the middle of the linklist

More on java and Python based coding questions

Q1. Behavioural questions were asked
Add your answer
Q2. What are your expectations from this job
Add your answer
Q3. What are your plans ahead
Add your answer
Q4. Where do you see yourself in 5 years ahead
Add your answer

Solving normal Puzzles to test aptitude.

Sample app was asked to create.

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening. Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.

• Output the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer
Q2. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function to traverse the maze using depth-first search or breadth-first search.

• Keep track of visited cells to avoid infinite loops.

• Return 'True' if destination is reachable, 'False' otherwise.
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

Test Comprises of 3 coding questions and some MCQs

Round duration - 60 minutes
Round difficulty - Medium

2 coding questions of (1 easy and 1 medium level) on hackerrank code-pair with the Interviewer

Round duration - 60 minutes
Round difficulty - Easy

This Round was based on CS fundamentals and One coding question was there as a Code-pair.

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
Find the Next Greater Element for each element in a list of integers.
• Iterate through the list of integers from right to left.

• Use a stack to keep track of elements whose NGE is yet to be found.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Assign the NGE as the top element of the stack or -1 if the stack is empty.
Answered by AI
Add your answer

Q1. Impliment counter using closure in js
Ans. 
Implement a counter using closure in JavaScript.
• Create a function that returns another function which increments a counter variable.

• The counter variable should be defined in the outer function's scope and only accessible to the inner function.

• Each time the inner function is called, increment the counter variable and return its value.
Answered by AI
Add your answer
Q2. Explain promises, promise.all(), impliment binary search
Ans. 
Promises are objects representing the eventual completion or failure of an asynchronous operation. promise.all() is a method that takes an array of promises and returns a single promise that resolves when all of the promises have resolved.
• Promises are used in JavaScript to handle asynchronous operations.

• promise.all() takes an array of promises and returns a single promise that resolves when all promises in the array ha...read more
Answered by AI
Add your answer

Q1. Questions on kafka, cache invalidation, diff b/w authentication and authorization
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from start to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions (up, down, left, right) from each cell.

• Add the current direction to the path and recursively explore further.

• When reaching the destination, add the path to the list of valid paths.
Answered by AI
Add your answer