Web Link Services Web Developer Interview Questions and Answers for Experienced

Round duration - 90 minutes
Round difficulty - Easy

It happens in very friendly manner.

Q1. 
Paths in a Matrix Problem Statement
Given an 'M x N' matrix, print all the possible paths from the top-left corner to the bottom-right corner. You can only move either right (from (i,j) to (i,j+1)) or dow...read more
Ans. 
Print all possible paths from top-left to bottom-right in a matrix by moving only right or down.
• Use backtracking to explore all possible paths from top-left to bottom-right in the matrix.

• At each cell, recursively explore moving right and down until reaching the bottom-right corner.

• Keep track of the current path and add it to the result when reaching the destination.
Answered by AI
Add your answer
Q2. Can you create 2 tables in SQL and perform different operations on them?
Ans. 
Yes, I can create 2 tables in SQL and perform operations like INSERT, SELECT, UPDATE, and DELETE.
• Create Table 1: CREATE TABLE employees (id INT, name VARCHAR(50), salary DECIMAL(10,2));

• Create Table 2: CREATE TABLE departments (dept_id INT, dept_name VARCHAR(50));

• Insert Data: INSERT INTO employees VALUES (1, 'John Doe', 50000);

• Select Data: SELECT * FROM employees WHERE salary > 40000;

• Update Data: UPDATE employees SET...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

No problem occur very friendly environment.

Round duration - 90 minutes
Round difficulty - Hard

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions (up, down, left, right) from each cell.

• Add the current direction to the path and recursively explore further.

• If the destination is reached, add the path to the list of valid paths.
Answered by AI
Add your answer