BeyondWalls Web Developer Interview Questions and Answers

Q1. What is str in c
Ans. 
str in C is a data type used to represent strings as arrays of characters.
• str in C is typically declared as an array of characters, terminated by a null character '\0'.

• Functions like strcpy(), strcmp(), and strlen() are commonly used with str in C.

• Example: char str[10] = "hello"; // Declaration of a string in C
Answered by AI
Add your answer
Q2. What is pointers in c
Ans. 
Pointers in C are variables that store memory addresses of other variables.
• Pointers are used to access and manipulate memory directly.

• They are denoted by an asterisk (*) before the variable name.

• Example: int *ptr; // declares a pointer to an integer variable
Answered by AI
Add your answer

Q1. What are React lifecycle Method
Ans. 
React lifecycle methods are functions that are called at different stages of a component's life.
• Mounting: constructor(), render(), componentDidMount()

• Updating: render(), componentDidUpdate()

• Unmounting: componentWillUnmount()

• Error Handling: componentDidCatch()
Answered by AI
Add your answer
Q2. How would you optimize the api call on input change(Debouncing)
Ans. 
Debounce the API call on input change to optimize performance.
• Implement a debounce function to delay the API call until the user has finished typing.

• Set a time interval for the debounce function to wait before making the API call.

• Cancel the previous API call if a new input change occurs before the time interval is up.

• Use a loading spinner to indicate to the user that the API call is in progress.

• Consider using a caching...read more
Answered by AI
View 1 more answer
Q3. A code where I have to apply memoize
Add your answer
Q4. Tell me about yourself
Add your answer
Q5. What is usememo hook
Ans. 
useMemo is a hook in React that memoizes the result of a function and returns the cached value when the inputs don't change.
• useMemo is used to optimize performance by avoiding unnecessary re-renders.

• It takes two arguments: a function that returns a value and an array of dependencies.

• If any of the dependencies change, the function is re-executed and the new value is cached.

• Example: useMemo(() => expensiveFunction(a, b),...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Online Coding Test on Calyxpod platform. There were 2 coding questions

Q1. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Add your answer
Q2. 
Most Frequent Non-Banned Word Problem Statement
Given a paragraph consisting of letters in both lowercase and uppercase, spaces, and punctuation, along with a list of banned words, your task is to find th...read more
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

Advance Subjective Round on Calyxpod platform: 5 questions. One question was related to data structures and algorithms. Other 4 were related to Html, CSS and Javascript.

Q1. 
Balanced Parentheses Combinations
Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Explanati...read more
Add your answer

Round duration - 20 Minutes
Round difficulty - Easy

very easy questions related to web development. 1 coding question

Q1. 
Clone a Linked List with Random Pointers
Given a linked list where each node has two pointers: the first points to the next node in the list, and the second is a random pointer that can point to any node ...read more
Ans. Recursion
The basic idea is to consider the linked list like a binary tree. Every node of the Linked List has 2 pointers. So we consider these nodes as binary tree nodes. The head of the list becomes the root of the tree. So what we basically have to do now is to traverse the binary tree and clone it. The main issue that we need to tackle here is that of loops.
 
For example, we can have, 1 1 2 0 -1, we need to handl...read more
Answered Anonymously
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

Q1. 
Loot Houses Problem Statement
A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...read more
Ans. Recursive Approach
Suppose that the robber is at the ith house. The robber has two options:
• If he decides to rob this house, then he cannot rob the next house, so he’ll have to go to the house after that.
• If he decides not to rob this house, he has no restriction over choosing the next house.
You will follow the same for the rest of the houses. Thus, if maxLoot(i) is the maximum loot possible when we’re at the ith house, t...read more
Answered Anonymously
Add your answer
Q2. Can you design a website similar to Amazon?
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy