SkillVertex Web Developer Interview Questions and Answers

Q1. Tell me about your self ?
Ans. 
Thankyou for giving me this opportunity to introduce myself. My name is Mahesh Singh Matiyali I am from Haldwani, Nainital. I did completed my schooling from H. N. Inter College Haldwani. And I did completed my graduation form Kumaon University. I am belong to a joint family background. My father is a farmer and mother is a homemaker. We are 12th brothers and sisters. My hobbies: reading - Newspapers and storys book'...read more
Answered by gorgeousrasmalai
Add your answer
Q2. What is your strength and weakness?
Ans. 
My strength is are i am self motivated, good listener, disciplined person and I respected anywhere person. And my weakness is a handwriting and I have a bit weak communication skills. I am trying to improve my communication skills.
Answered by gorgeousrasmalai
Add your answer
Q3. What is your short term goals and long term goals?
Ans. 
My short term goal is to get a job in required company where I can utilize my skills and improve my career path. My long term goal is I want to become a good and expert Web Developer.
Answered by gorgeousrasmalai
Add your answer
Q4. Why do you need a job ?
Add your answer
Q5. Why should I hire you ?
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. 
Create a deep copy of a linked list with random pointers without using references of original nodes.
• Iterate through the original linked list and create a new node for each node in the list.

• Store the mapping of original nodes to new nodes in a hashmap to handle random pointers.

• Update the random pointers of new nodes based on the mapping stored in the hashmap.

• Return the head of the copied linked list.
Answered by AI
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. 
Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.
• Create an array 'dp' to store the maximum money that can be stolen from each house without looting two consecutive houses.

• Iterate through the houses and update 'dp' based on the maximum money that can be stolen from the current house.

• Return the maximum value in 'dp' as the answer.
Answered by AI
Add your answer
Q2. Can you design a website similar to Amazon?
Ans. 
Yes, I can design a website similar to Amazon by focusing on user-friendly interface, robust search functionality, secure payment options, and personalized recommendations.
• Focus on user-friendly interface with easy navigation

• Implement robust search functionality with filters and sorting options

• Provide secure payment options with encryption and fraud protection

• Include personalized recommendations based on user behavior
Answered by AI
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

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. Find duplicates in an array
Ans. 
Use a hash set to find duplicates in an array of strings.
• Create a hash set to store unique elements.

• Iterate through the array and check if the element is already in the hash set.

• If it is, then it is a duplicate. If not, add it to the hash set.
Answered by AI
Add your answer
Q2. Find single duplicate element in an array where contents of the array are length of array - 1
Ans. 
Find the single duplicate element in an array of strings with length n-1.
• Iterate through the array and use a HashSet to keep track of elements seen so far.

• If an element is already in the HashSet, that is the duplicate element.

• Return the duplicate element once found.
Answered by AI
Add your answer

Create a student support system

Q1. Design an order and payments system for an EdTech company
Ans. 
Design an order and payments system for an EdTech company
• Allow users to browse and select courses

• Implement a shopping cart for users to add courses

• Integrate payment gateways for secure transactions

• Provide order confirmation and receipt to users

• Allow users to track their order status
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. 
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
• Use Dijkstra's algorithm to find the shortest path between the given vertices.

• Create a graph data structure to represent the weighted, undirected graph.

• Handle cases where no path exists between the given vertices by returning -1.

• Optimize the algorithm to handle multiple queries efficiently.

• Consider edge cases such as...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively

• Sort the two halves separately

• Merge the sorted halves to produce a fully sorted array

• Time complexity of Merge Sort is O(n log n)

• Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
Answered by AI
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. 
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
• Use backtracking to explore all possible paths from the starting cell to the destination cell.

• At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.

• Keep track of the path taken so far and mark the cells accordingly.

• Once the destination cell i...read more
Answered by AI
Add your answer

Q1. Tell me about your self , internship or exp. Why sales?
Ans. 
I have a background in marketing and sales through internships and previous work experience. I am passionate about sales because of the opportunity to build relationships and drive revenue.
• Interned at XYZ company where I learned about sales strategies and techniques

• Worked as a sales associate at ABC store, exceeding sales targets consistently

• Enjoy the challenge of meeting customer needs and closing deals

• Passionate abou...read more
Answered by AI
Add your answer

A sales pitch round in which a scenario was provided.

Q1. Final interview questions from cv.
Add your answer

Q1. About Myself in details
Add your answer
Q2. Past internships and work experiences
Add your answer

Q1. Primary keys, Unique key
Add your answer
Q2. Usage advantages and disadvantages of Indexing
Add your answer

SQL- 1 departments with no users
2 dept_id and their respective no. of users

DSA1: Most frequent no. in an array
DSA2: Zero Sum subarray exists