Photon Technologies Software Developer Interview Questions and Answers

Round duration - 2 hours
Round difficulty - Medium

In the 1st round 
Aptitude
Reasoning
English
Automata fix( code debug) 
Timing in morning
Environment is good
Interviewer was very cool and interactive

Q1. 
Encode the Message Problem Statement
Given a text message, your task is to return the Run-length Encoding of the given message.
Run-length encoding is a fast and simple method of encoding strings, repres...read more
Ans. 
Implement a function to encode a text message using run-length encoding.
• Iterate through the message and count consecutive characters

• Append the character and its count to the encoded message

• Handle edge cases like single characters or empty message
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This is interview round 
Ques from basic electronics
C language

Q1. 
Print Name and Age Problem Statement
Create a class named Person with a string variable 'name' and an integer variable 'age', such that these variables are not accessible outside the class. Implement a me...read more
Ans. 
Create a class Person with private variables name and age, and methods to set and get their values.
• Create a class Person with private variables 'name' and 'age'.

• Implement a method setValue to set the variables' values.

• Implement a method getValue to print the variables' values.

• Ensure the name is a non-empty string and the age is a non-negative integer.

• Encapsulate the data and provide a clear interface for setting and ge...read more
Answered by AI
Add your answer

C , java

HTML

Aptitude and resume shortlist and HTML

Q1. Java Collection, OOPS, Seralization
Add your answer

Q1. Java OOPS, Collection, threading, SQL
Add your answer

Q1. Nothing specific, Salary Negotiations.
Add your answer

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