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

Coding test of your skills and how well can you cope up with a problem given.

Q1. LAC of 3 nodes
Ans. 
LAC stands for Location Area Code, a unique identifier for a group of cells in a mobile network.
• LAC helps in identifying the location of a mobile device within a cellular network.

• It is used for handover procedures when a device moves between different cells.

• In a network with 3 nodes, each node would have a unique LAC assigned to it.
Answered by AI
Add your answer
Q2. Reverse of the array
Ans. 
Reverse the order of strings in an array
• Use the reverse() method to reverse the array

• Example: ['apple', 'banana', 'cherry'] -> ['cherry', 'banana', 'apple']
Answered by AI
Add your answer
Q3. Sum or product asked
Add your answer

Q1. Past experience
Add your answer
Q2. How much da u know
Add your answer

Q1. Merge sort in js
Ans. 
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.
• Divide the array into two halves recursively

• Sort each half using merge sort recursively

• Merge the sorted halves back together
Answered by AI
Add your answer
Q2. Hoising based question
Add your answer

Questions for dbms,os

Q1. How was your day today
Ans. 
My day was productive and busy, with a lot of coding and problem-solving.
• Completed a new feature for the website

• Fixed a bug in the existing codebase

• Attended a team meeting to discuss project updates
Answered by AI
Add your answer
Q2. Where do you see in 5 yrs
Ans. 
In 5 years, I see myself as a senior front end developer leading a team and working on cutting-edge technologies.
• Leading a team of developers on various projects

• Working on advanced technologies like AR/VR, AI, and machine learning

• Contributing to open source projects and attending tech conferences

• Continuing to learn and grow in the field of front end development
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
You are given two Singly Linked List of integers, which are merging at some node of a third linked list.
Your task is to find the data of the node at which merging starts. If ...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered by CodingNinjas
View 2 more amswers
Q2. Most Frequent Word
You are given a paragraph that may have letters both in lowercase and uppercase, spaces, and punctuation. You have also given a list of banned words. Now your task is to find the most fr...read more
Ans. Brute Force
1. To find the frequency of each word we need to extract the words from the paragraph.
2. So we will convert all the punctuation to space in the paragraph and lowercase alphabets to uppercase.
3. Now we can use the library function (e.g sstream in C++) to extract words from the paragraph in an array of strings say WORDS.
4. We will iterate over WORDS and do:
   1. Iterate over the banned array and check if the current word is pre...read more
Answered by CodingNinjas
View 3 more amswers

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
Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.
Note :
...read more
Ans. Recursion
The idea is to generate all possible combinations and check whether the combination is the combination of balanced parentheses or not. We have two choices whether to consider ‘(‘ or ‘)’.
When the number of closing brackets is greater than the number of opening brackets we can consider taking ‘)’ in the sequence and in the other case we can consider taking ‘(‘ for all numbers of opening brackets until the number...read more
Answered by CodingNinjas
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 having two pointers in each node. The first one points to the next node of the list, however, the other pointer is random and can point to any n...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 by CodingNinjas
View 2 more amswers

Round duration - 150 Minutes
Round difficulty - Medium

Q1. Loot Houses
A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.
Input Format :
The first line of...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 by CodingNinjas
View 2 more amswers
Q2. System Design Question
Design a website like amazon.
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Q1. Basic HR Questions
Why do you like to play?
What have you built before?
What is your biggest achievement?
Add your answer