Banksathi Front end Developer Interview Questions and Answers

Graph question repeat previous year

Q1. About yourself and examine about you
Add your answer
Q2. Hobbie and games you play
Ans. 
I enjoy playing video games in my free time, particularly RPGs and strategy games.
• I like playing RPGs such as The Witcher 3 and Skyrim

• I also enjoy strategy games like Civilization VI and XCOM

• In addition, I dabble in indie games and puzzle games for a change of pace
Answered by AI
Add your answer
Q3. Weakness and strength
Add your answer

3 graph question were asked .

Q1. Hackthon on hackerrank
Add your answer

DSA-keep practicing multithreading questions

3 questions 2 hrs most questions are from graph

Q1. Optimize the given problem
Ans. 
Optimize the problem by analyzing algorithms and improving efficiency through various techniques.
• Identify bottlenecks: Use profiling tools to find slow parts of the code.

• Algorithm selection: Choose the most efficient algorithm for the task, e.g., using quicksort instead of bubble sort.

• Data structures: Use appropriate data structures, like hash tables for fast lookups.

• Parallel processing: Utilize multi-threading or dist...read more
Answered by AI
Add your answer
Q2. Solve the problem in given time
Add your answer

30 question -30 min,topics - profit or loss , time work distance ,time speed ,upstreaam downstream percentage ,probability

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
Ans. 
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.
Answered by AI
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?
Ans. 
Design a URL shortener system
• Generate a unique short code for each URL

• Store the mapping of short code to original URL in a database

• Redirect users from short URL to original URL when accessed

• Consider implementing features like custom short codes, expiration dates, and analytics

• Ensure scalability and performance by using distributed systems and caching
Answered by AI
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?
Ans. 
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 en...read more
Answered by AI
Add your answer

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.
Ans. 
Design a chess game with classes for pieces, board, and game logic.
• Create a class for each chess piece (e.g., Pawn, Rook, Knight) with movement rules.

• Implement a Board class to manage the 8x8 grid and piece placement.

• Design a Game class to handle turns, check/checkmate conditions, and game state.

• Use an Enum for piece colors (e.g., WHITE, BLACK) to differentiate players.

• Consider implementing a user interface for player ...read more
Answered by AI
Add your answer

Q1. Hiring manager round. Grilling on resume and past experience questions
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. 
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.

• Use a set to store distinct elements for efficient processing.
Answered by AI
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. 
Find 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 so far

• Return the longest palindromic substring
Answered by AI
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. 
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
Answered by AI
Add your answer