Westside Product Developer Interview Questions and Answers

Q1. Prototype read values from url map vs for
Ans. 
Reading values from URL using map vs for loop in JavaScript
• Use the window.location.search property to get the query string from the URL

• Map can be used to transform each value in the query string array

• For loop can be used to iterate through each value in the query string array
Answered by AI
Add your answer

Q1. Create ui component to display matched results in dropdown
Ans. 
Create a UI component to display matched results in a dropdown
• Use HTML, CSS, and JavaScript to create the dropdown component

• Implement a search functionality to filter and display matched results

• Use event listeners to handle user interactions like selecting a result
Answered by AI
Add your answer

Q1. Frontend design -
Ans. 
Frontend design involves creating the user interface of a website or application.
• Focus on user experience and usability

• Use responsive design for different screen sizes

• Implement accessibility features for users with disabilities
Answered by AI
Add your answer

Question related to java , springboot , hibernate, one dsa question based on two pointer

Aptitude and coding test was there

Q1. Return the maximum element of an array
Ans. 
Return the maximum element of an array
• Iterate through the array and keep track of the maximum element found so far

• Compare each element with the current maximum and update if a larger element is found

• Return the maximum element after iterating through the entire array
Answered by AI
Add your answer

Q1. Unique elements in an array using es6
Ans. 
Using Set and spread operator to get unique elements in an array.
• Create a Set from the array using Set constructor

• Use spread operator to convert Set back to array

• Alternatively, use Array.from() method to convert Set to array
Answered by AI
Add your answer

Coding question of react application.

Q1. Project related discussion.
Add your answer

Speed distance time basic

Q1. DSA oops sql project basic
Add your answer
Q2. Oops basic questions
Add your answer

Q1. Group discussion basic
Add your answer
Q2. Basic questions in project in resume
Add your answer

Q1. Java questions with code snippets
Add your answer
Q2. DSA questions based on heapsort etc
Add your answer

Questions asked were DP, maps, sorting etc. There were two questions and duration of the test was 1 hour 30 minutes. Platform used for the test was unstop

The duration of the test was 90 minutes. Questions were hard in this round. The test was conducted on unstop.

Round duration - 45 minutes
Round difficulty - Hard

There were 2 coding questions to be solved in 45 minutes. Questions were a bit difficult and topics covered in my set were DP and Graphs.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
The problem is to color a graph with two colors such that no two connected vertices have the same color.
• Use a graph coloring algorithm such as Depth First Search (DFS) or Breadth First Search (BFS).

• Start with an arbitrary vertex and color it with one color (e.g., blue).

• Color all its adjacent vertices with the other color (e.g., red).

• Continue this process for all connected components of the graph.

• If at any point, you en...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

I was asked questions on data structures, OOPs, OS and he grilled me on Machine Learning and Microsoft Azure (as is was mentioned in my resume).

Q1. 
Maximum Frequency Number Problem Statement
Given an array of integers with numbers in random order, write a program to find and return the number which appears the most frequently in the array.
If multip...read more
Ans. 
The program finds the number that occurs the maximum times in an array of integers.
• Iterate through the array and count the frequency of each number using a dictionary.

• Keep track of the number with the maximum frequency and its index.

• Return the number with the maximum frequency and the lowest index.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It involved a few technical questions based on my resume followed by leadership questions.