StoreKing Front end Developer Interview Questions and Answers

Question are very tough and faad

Question like trees linked list and graphs

Round duration - 90 Minutes
Round difficulty - Easy

1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.

Q1. 
LRU Cache Design Question
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key) - Return the value of the key if it exists in the cache; otherw...read more
Ans. 
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
• Implement a doubly linked list to keep track of the order of keys based on their recent usage.

• Use a hashmap to store key-value pairs for quick access and updates.

• When capacity is reached, evict the least recently used item before inserting a new one.

• Update the order of keys in the linked list whenever a ke
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. 
Check if a given string is a palindrome considering only alphanumeric characters.
• Remove non-alphanumeric characters from the input string.

• Compare the string with its reverse to check for palindrome.

• Handle edge cases like empty string or single character input.

• Use two pointers approach for efficient comparison.
Answered by AI
Add your answer
Q2. DBMS Questions
normalization, indexing
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Indexing is a technique to quickly retrieve data from a database.
• Normalization helps in reducing data redundancy by breaking down tables into smaller, related tables.

• Indexing is used to quickly retrieve data by creating indexes on columns in a table.

• Normalization ensures data integrity by minimizing data dupli...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Hard

late at 8.00 pm

Q1. 
Priority CPU Scheduling Problem
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...read more
Ans. 
Implement Priority CPU Scheduling algorithm to compute waiting time and turn-around time for processes.
• Implement a function that takes in burst times, priorities, and number of processes as input

• Sort the processes based on priority, with lower process ID as tiebreaker

• Calculate waiting time and turn-around time for each process based on the scheduling algorithm
Answered by AI
Add your answer
Q2. Can you explain the concept of data spooling in operating systems?
Ans. 
Data spooling is a process where data is temporarily stored in a buffer before being sent to an output device.
• Data spooling helps in managing the flow of data between different devices by storing it temporarily.

• It allows for efficient processing of data by decoupling the input/output operations.

• Examples of data spooling include print spooling, where print jobs are stored in a queue before being sent to the printer.
Answered by AI
Add your answer
Q3. What is the difference between inheritance and generalization in the context of database management systems?
Ans. 
Inheritance is a relationship between a superclass and subclass, while generalization is a relationship between entities with common characteristics.
• Inheritance involves a parent-child relationship where the child class inherits attributes and methods from the parent class.

• Generalization involves grouping entities with common attributes into a higher-level entity.

• Inheritance is a specific form of generalization in obje...read more
Answered by AI
Add your answer

30mins aptitude test

90 mins coding test for 3 questions

Q1. Why are you choosing this role
Ans. 
I am choosing this role because of my passion for creating user-friendly and visually appealing websites.
• Passion for front end development

• Enjoy creating user-friendly interfaces

• Excited about the creative aspect of web design
Answered by AI
Add your answer
Q2. Why should we write you
Ans. 
I am a dedicated and skilled front end developer with a passion for creating user-friendly interfaces.
• I have a strong understanding of HTML, CSS, and JavaScript

• I have experience with responsive design and cross-browser compatibility

• I am proficient in using front end frameworks like React and Angular
Answered by AI
Add your answer

Q1. Given a matrix zeros and ones find minimum distance for each one to a zero.
Ans. 
Given a matrix of zeros and ones, find the minimum distance for each one to a zero.
• Use breadth-first search (BFS) to find the minimum distance from each one to a zero.

• Start by initializing a queue with all the zeros in the matrix.

• While the queue is not empty, dequeue a zero and enqueue its neighboring ones.

• Keep track of the distance from each one to the nearest zero.

• Repeat until all ones have been visited.

• Return the ma
Answered by AI
Add your answer

Coding a frontend UI from provided image. And creating a fucntional star rating system

Q1. Designing a Component API in React using Typescript.
Ans. 
Designing a Component API in React using Typescript involves defining props, state, and methods for the component.
• Define the props interface to specify the expected input data for the component

• Use typescript types to ensure type safety and prevent runtime errors

• Define the state interface to manage the internal state of the component

• Implement methods to handle user interactions and component logic

• Document the component
Answered by AI
Add your answer
Q2. Create a function that can clear all the timer ids at once.
Ans. 
Function to clear all timer ids at once
• Create an array to store all timer ids

• Iterate through the array and clear each timer id using clearTimeout() function
Answered by AI
Add your answer

Q1. Basic array question
Add your answer

Q1. Find the first circular tour that visits all petrol pumps
Ans. 
The first circular tour that visits all petrol pumps can be found using the concept of a circular linked list.
• Create a circular linked list with each node representing a petrol pump

• Calculate the difference between petrol available at each pump and the distance to the next pump

• Start from a pump where the sum of differences is positive and traverse the circular linked list until completing the tour
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

Q1. How can you check if two strings are anagrams of each other?
Ans. 
Check if two strings are anagrams by comparing the sorted versions of the strings.
• Sort both strings and compare if they are equal.

• Use a hashmap to store the frequency of characters in each string and compare the maps.

• Ignore spaces and punctuation when comparing the strings.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

Q1. 
Detect Cycle in a Directed Graph
You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...read more
Ans. 
Detect cycle in a directed graph using depth-first search (DFS) algorithm.
• Use DFS to traverse the graph and detect back edges indicating a cycle.

• Maintain a visited array to keep track of visited nodes during traversal.

• If a node is visited again during traversal and it is not the parent node, then a cycle exists.

• Return true if a cycle is detected, false otherwise.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

Q1. 
Next Smallest Palindrome Problem Statement
Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.
Explanation:
You are given a number in string format, a...read more
Ans. 
Find the next smallest palindrome greater than a given number represented as a string.
• Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

• Handle cases where the number is a palindrome or has all digits as '9'.

• Consider both odd and even length numbers when finding the next palindrome.
Answered by AI
Add your answer

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

Q1. 
Boundary Traversal of a Binary Tree
Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.
Input:
The first line ...read more
Ans. 
Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.
• Traverse the left boundary nodes in a top-down manner

• Traverse the leaf nodes from left to right

• Traverse the right boundary nodes in a bottom-up manner

• Handle cases where duplicates occur in the boundary nodes

• Implement the function without printing as printing is already managed
Answered by AI
Add your answer