Cybercom Creation PHP Developer Interview Questions and Answers

Medium level questions asked

Simple easy to medium 2 questions asked of string and array

Q1. Tell me about yourself
Add your answer
Q2. JavaScript like fetch axios and others
Add your answer

MCQ round with few apti, 2 coding too.

Q1. Into, projects,
Add your answer
Q2. Print node with no edge in a unidirectional graph
Ans. 
To print nodes with no edges in a unidirectional graph, iterate through all nodes and print those without any outgoing edges.
• Iterate through all nodes in the graph

• For each node, check if it has any outgoing edges

• If a node has no outgoing edges, print it
Answered by AI
Add your answer

Q1. Intro, projects, dsa
Add your answer
Q2. Prime number code
Add your answer

Q1. I don't know why they rejected me
Add your answer
Q2. What ever they asked me for coding part the output is correct and logic is also correct
Add your answer

Q1. Javascript MCQs and one coding question
Add your answer

Q1. 3 coding questions, Questions on Resume and Node.js. Scenario based questions.
Add your answer

Q1. Questions on project. Behavioural questions.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Timing was 10AM. The platform was quite good.

Q1. 
Maximum Size Rectangle Sub-matrix with All 1's Problem Statement
You are provided with an N * M sized binary matrix 'MAT' where 'N' denotes the number of rows and 'M' denotes the number of columns. Your t...read more
Ans. Dynamic Programming.
1. We start from the first row and move downwards.
2. We create three 1-dimensional arrays HEIGHT[], LEFT[], RIGHT[].
3. ‘HEIGHT’[i]: stores the number of current continuous 1’s in column i.
4. LEFT[i] : stores the leftmost index ‘j’ such that all indices say ‘K’, ‘K’ belongs to [j, i], ‘HEIGHT’[k] >= ‘HEIGHT’[i].
5. RIGHT [i]: stores the rightmost index ‘j’ such that all indices say ‘K’, ‘K’ belongs to [i, j], ‘HE...read more
Answered Anonymously
Add your answer
Q2. 
Binary Tree Maximum Path Sum Problem Statement
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
• A 'path' is defined as any sequence of adjacent nodes connected...read more
Ans. Recursive Approach
The idea here is to use the recursion. For each node, We can calculate the maximum path sum by keeping track of the following paths:
• Max path sum starting from Left child + Max Path sum starting from Right child + Node’s value.
• Max path sum starting from Left child + Node’s value
• Max path sum starting from Right child + Node’s value
• Node’s value
 
We then pick the maximum one among them. The root of ev...read more
Answered Anonymously
Add your answer
Q3. 
Minimum Number of Swaps to Sort an Array
Find the minimum number of swaps required to sort a given array of distinct elements in ascending order.
Input:
T (number of test cases)
For each test case:
N (siz...read more
Ans. Naive Approach
While iterating over the array, check the current element, and if not in the correct place, replace that element with the index of the element which should have come in this place.
 
Below is the algorithm:
1. Create a copy of the given input array and store it in temp.
2. Sort the temp array.
3. Iterate over the input array, and check whether the current element is at the right place or not by comparing it with t...read more
Answered Anonymously
Add your answer
Q4. 
Infix to Postfix Conversion
Convert a given infix expression, represented as a string EXP, into its equivalent postfix expression.
Explanation:
An infix expression is formatted as a op b where the opera...read more
Ans. Stack
We will scan the expression from left to write and if we encounter an operand we will append it to our answer. If we encounter an operator we will pop all the operators with equal or higher precedence and append them to our answer. And push the current operator. In the end, we will empty the stack.
Order of precedence = [ ‘^’, ‘*’ and ‘/’, ‘+’ and ‘-’, ‘(’, ‘)’]
Order of precedence [ link ]
The algorithm will be-
1. ANS ...read more
Answered Anonymously
Add your answer