Coding Ninjas Software Engineer Interview Questions and Answers

Q1. FIRST QUESTIONS INTRO MYSELF
Ans. 
I am a passionate software engineer with a strong background in full-stack development and a love for problem-solving.
• Education: Bachelor's degree in Computer Science from XYZ University.

• Experience: 3 years of experience in developing web applications using React and Node.js.

• Projects: Developed an e-commerce platform that increased sales by 30% within the first quarter.

• Skills: Proficient in JavaScript, Python, and SQL,...read more
Answered by AI
Add your answer
Q2. SECOND QUESTIONS SOFTWARE RELEATED BASIC TYPE OF QUESTIONS
Add your answer
Q3. LAST QUESTIONS I WANT WORK FROM HOME INTERNSHIP.
Add your answer

3 questions in 3 hr, topics were Dp, Strings, Tree

1hr durations 40 questions, main topics were patterns, profit loss, work man , etc.

Q1. OOPS, JAVA, Mysql, general questsjons
Add your answer

Coding test around front end using react

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

Pizza restaurant website

Q1. Javascript related questions
Add your answer
Q2. React fundamentals and redux and saga function
Add your answer

Q1. Round with CEO for culture fit
Add your answer

Q1. What is OOPS concepts.
Add your answer
Q2. What is PDO and uses in PHP.
Ans. 
PDO stands for PHP Data Objects, a database access layer providing a uniform method of access to multiple databases.
• PDO is a PHP extension that provides a data-access abstraction layer.

• It supports multiple database systems like MySQL, PostgreSQL, SQLite, etc.

• PDO helps prevent SQL injection attacks by using prepared statements.

• It allows for error handling and supports transactions.

• Example: $pdo = new PDO('mysql:host=loc...read more
Answered by AI
Add your answer

Basic coding and MySQL queries. Like Types of join, having and where difference etc.

Q1. Salary Discussion.
Add your answer