Pyroguard Engineers Interview Questions and Answers

Mettle test consists of Aptitude, domain specific Mcq's and 2 coding questions.

Q1. Technical round of around 60 minutes, questions majorly on HTML, CSS, javascript, React.js and one or two coding questions to solve
Add your answer

Q1. This round also based on domain specific questions, majorly on javascript and React.js
Add your answer

Q1. HR round majorly focused on Salary discussion round.
Add your answer

Q1. Offer letter was released after 2 days.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

First round has 4 coding Questions in which i have solved 3 complete and 1 partial.

Q1. 
Crazy Numbers Pattern Challenge
Ninja enjoys arranging numbers in a sequence. He plans to arrange them in 'N' rows such that:
• The first row contains 1 number.
• The second row contains 2 numbers.
• Th...read more
Ans. 
Arrange numbers in a sequence in 'N' rows with increasing order and repeating after 9.
• Iterate through each test case and for each row, print numbers in increasing order with a loop.

• Keep track of the current number to print and reset to 1 after reaching 9.

• Handle formatting to align numbers correctly in each row.

• Ensure to print the correct number of rows based on the input 'N'.
Answered by AI
View 1 more answer
Q2. 
Count Pairs with Difference K
Given an array of integers and an integer K, determine and print the count of all pairs in the array that have an absolute difference of K.
Input:
The first line of the inp...read more
Ans. 
Count pairs in an array with a specific absolute difference.
• Iterate through the array and for each element, check if the element + K or element - K exists in the array.

• Use a hash set to store elements for constant time lookups.

• Keep track of the count of valid pairs found.
Answered by AI
Add your answer
Q3. 
Fibonacci Membership Check
Given an integer N, determine if it is a member of the Fibonacci series. Return true if the number is a member of the Fibonacci series, otherwise return false.
Fibonacci Series...read more
Ans. 
Check if a given integer is a member of the Fibonacci series.
• Implement a function to check if the given number is a perfect square.

• Check if 5*N^2 + 4 or 5*N^2 - 4 is a perfect square to determine Fibonacci membership.

• Return true if the number is a perfect square of 5*N^2 + 4 or 5*N^2 - 4, otherwise false.
Answered by AI
Add your answer
Q4. 
Ninja and the New Year Guests Problem
Ninja has organized a new year party and wants to verify if the guests are programmers by challenging them with a coding task. As an invited programmer, you're tasked...read more
Ans. 
Compute the number of valid permutations of integers from 0 to N-1 such that at least K positions satisfy ARR[I] = I.
• Use dynamic programming to solve the problem efficiently.

• Consider the cases where K is equal to N or N-1 separately.

• Modulo the result by 10^9 + 7 to avoid overflow issues.
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Easy

Every single question were based on the concept of data structure.
I have to answer my approach for solving a particular real life Problem.

Q1. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...read more
Ans. 
The task is to determine if given strings containing only parentheses are balanced or not.
• Iterate through each character in the string and use a stack to keep track of opening parentheses.

• If a closing parenthesis is encountered, check if the stack is empty or if the top of the stack matches the corresponding opening parenthesis.

• If all parentheses are balanced, the stack should be empty at the end.

• Return 'Balanced' if t...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

Round duration - 90 Minutes
Round difficulty - Easy

This round was also conducted on Metll platform. This round is totally based on coding. There are so many choices in language, so you can easily select the language in which you are comfortable in. There are three problems to solve. I choose Java 8 to solve the problems. The problems are ranging from easy to hard-

To find the maximum occurring character in a given string.
To find the factorial of a given number.
Count Derangements.

Q1. 
Count Derangements
Determine the number of derangements possible for a set of 'N' elements. A derangement is a permutation where no element appears in its original position.
Input:
An integer 'T' repres...read more
Ans. 
Count the number of derangements possible for a set of 'N' elements.
• Derangements are permutations where no element appears in its original position.

• Use the formula: !n = n! * (1 - 1/1! + 1/2! - 1/3! + ... + (-1)^n/n!).

• Calculate the derangements modulo (10^9 + 7) for each test case.
Answered by AI
Add your answer
Q2. 
Factorial Calculation Problem Statement
Develop a program to compute the factorial of a given integer 'n'.
The factorial of a non-negative integer 'n', denoted as n!, is the product of all positive integ...read more
Ans. 
Program to compute factorial of a given integer 'n', with error handling for negative values.
• Create a function to calculate factorial using a loop or recursion

• Check if input is negative, return 'Error' if true

• Handle edge cases like 0 and 1 separately

• Use long data type to handle large factorials
Answered by AI
Add your answer
Q3. 
Most Frequent Word Problem Statement
You are given two strings 'A' and 'B' composed of words separated by spaces. Your task is to determine the most frequent and lexicographically smallest word in string ...read more
Ans. 
Find the most frequent and lexicographically smallest word in string 'A' that is not present in string 'B'.
• Split strings 'A' and 'B' into words

• Count frequency of each word in 'A'

• Check if word is not in 'B' and is the most frequent and lexicographically smallest

• Return the word or -1 if no such word exists
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The interviewer was so polite. He firstly asks me to describe myself and then ask about my family. After that he ask which language I choose to solve problems in Coding round and why I choose that language. Then he started to ask the technical questions.

Round duration - 180 Minutes
Round difficulty - Medium

Q1. 
Maximum Meetings Problem Statement
Given the schedule of N meetings with their start time Start[i] and end time End[i], you need to determine which meetings can be organized in a single meeting room such ...read more
Ans. 
Given N meetings with start and end times, find the maximum number of meetings that can be organized in a single room without overlap.
• Sort the meetings based on their end times.

• Iterate through the sorted meetings and select the next meeting that does not overlap with the current meeting.

• Keep track of the selected meetings and return their indices in the order they are organized.
Answered by AI
Add your answer
Q2. 
K Subsets with Equal Sum Problem Statement
Determine whether it is possible to partition an array ARR into K subsets, each having an equal sum.
Example:
Input:
ARR = [3, 5, 2, 4, 4], K = 2
Output:
tr...read more
Ans. 
Yes, it is possible to partition an array into K subsets with equal sum.
• Check if the total sum of the array is divisible by K.

• Use backtracking to try all possible combinations of subsets.

• Keep track of visited elements to avoid repetition.

• Example: ARR = [3, 5, 2, 4, 4], K = 2. Possible subsets: [4, 5] and [2, 3, 4].
Answered by AI
Add your answer
Q3. 
Merge k Sorted Linked Lists
You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of ...read more
Ans. 
Merge k sorted linked lists into one single sorted linked list.
• Create a min-heap to store the heads of all k linked lists.

• Pop the smallest element from the heap and add it to the result list.

• If the popped element has a next element, push it back to the heap.

• Repeat until the heap is empty and return the merged sorted list.
Answered by AI
Add your answer
Q4. 
Sort a "K" Sorted Doubly Linked List Problem Statement
You are given a doubly linked list with 'N' nodes, where each node can deviate at most 'K' positions from its actual position in the sorted list. You...read more
Ans. 
Sort a doubly linked list with nodes that can deviate at most K positions from their actual position in the sorted list.
• Iterate through the doubly linked list and maintain a window of size K+1 to sort the elements within the window.

• Use insertion sort within the window to sort the elements efficiently.

• Repeat the process until the entire list is sorted.

• Time complexity can be optimized to O(N*log(K)) using a priority queu
Answered by AI
Add your answer
Q5. 
Duplicate Subtrees Problem Statement
Given a binary tree, return the root values of all duplicate subtrees. Two subtrees are considered duplicate if they have the same structure with identical node values...read more
Ans. 
Find root values of duplicate subtrees in a binary tree.
• Traverse the tree in a bottom-up manner to identify duplicate subtrees.

• Use a hashmap to store the subtree structure and count occurrences.

• Return the root values of duplicate subtrees found.

• Handle null nodes by using -1 in the input sequence.
Answered by AI
Add your answer

Round duration - 25 Minutes
Round difficulty - Medium

Q1. Can you explain the concept of keys in database management systems?
Ans. 
Keys in database management systems are unique identifiers for rows in a table.
• Keys are used to uniquely identify each record in a table.

• Primary key is a unique identifier for a record in a table.

• Foreign key is a field in one table that refers to the primary key in another table.

• Composite key is a combination of multiple columns that uniquely identify a record.

• Unique key ensures that all values in a column are unique.
Answered by AI
Add your answer

Round duration - 15 Minutes
Round difficulty - Easy

Round duration - 20 minutes
Round difficulty - Easy

50 Logical ability, mathematical and image patterns questions are to be done in 20 minutes. A minimum cutoff has to be cleared. (ask your recruiter)
Tip – majority questions are of image pattern, so try to solve those first as they take lesser time

Round duration - 90 minutes
Round difficulty - Easy

Q1. 
Secret Message Decoding Problem
Ninja encountered an encoded secret message where each character from 'A' to 'Z' is mapped to a numeric value (A = 1, B = 2, ..., Z = 26). Given a numeric sequence (SEQ) de...read more
Ans. 
The problem involves decoding a numeric sequence back into a valid string based on a given mapping of characters to numeric values.
• Use dynamic programming to keep track of the number of ways to decode the sequence at each position.

• Consider edge cases such as '0' and '00' which do not have valid decodings.

• Handle cases where two digits can be combined to form a valid character (e.g., '12' corresponds to 'L').
Answered by AI
Add your answer
Q2. 
Digits Decoding Problem Statement
A few days back, Ninja encountered a string containing characters from ‘A’ to ‘Z’ which indicated a secret message. For security purposes, he encoded each character of th...read more
Ans. 
The problem involves decoding a numeric sequence into a valid string using a given mapping of characters to numbers.
• Use dynamic programming to count the number of ways to decode the sequence.

• Consider different cases for decoding single digits and pairs of digits.

• Keep track of the number of ways to decode at each position in the sequence.

• Return the final count modulo 10^9 + 7 as the answer.
Answered by AI
Add your answer

Round duration - 180 minutes
Round difficulty - Easy

Since I applied for senior frontend role (React), I was asked questions on following topics – Javascript (easy, medium, hard), HTML, HTML5 api, CSS, SVG, React (easy, medium, hard), UI/UX related
A very lengthy and tiring round.

Round duration - 20 minutes
Round difficulty - Easy

Round duration - 180 mins
Round difficulty - Medium

It was aptitude & english then coding round

Q1. 
Character Counting Challenge
Create a program that counts and prints the total number of specific character types from user input. Specifically, you need to count lowercase English alphabets, numeric digi...read more
Ans. 
Create a program to count lowercase alphabets, digits, and white spaces from user input until '$' is encountered.
• Read characters from input stream until '$' is encountered

• Count lowercase alphabets, digits, and white spaces separately

• Print the counts of each character type as three integers separated by spaces
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Online coding round 3 questions were there leetcode easy

Q1. 
Preorder Traversal Problem Statement
You are provided with the root node of a binary tree comprising N nodes. Your objective is to output its preorder traversal. Preorder traversal of a binary tree is per...read more
Ans. 
Implement a function to perform preorder traversal on a binary tree given the root node.
• Create a recursive function to traverse the tree in preorder fashion.

• Visit the root node, then recursively traverse left subtree, followed by right subtree.

• Store the visited nodes in an array and return the array as the result.

• Example: For the input tree [1, 2, 3, 4, -1, 5, 6, -1, 7, -1, -1, -1, -1, -1, -1], the preorder traversal o
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

They tested my basic data structure knowledge

Q1. Can you explain the concept of static variables and classes in Object-Oriented Programming?
Ans. 
Static variables and classes in OOP are used to store data that is shared among all instances of a class.
• Static variables are shared among all instances of a class and retain their value throughout the program's execution.

• Static classes cannot be instantiated and are used to group related static members together.

• Example: In a class representing a bank account, a static variable could be used to store the total number o...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was more about technical knowledge and problem solving skills

Q1. Can you design a login page for Facebook?
Ans. 
I can design a login page for Facebook with user input fields for email/phone and password, a 'Login' button, and 'Forgot password?' link.
• Include user input fields for email/phone and password

• Add a 'Login' button for submitting credentials

• Include a 'Forgot password?' link for password recovery

• Design the page with Facebook branding and color scheme
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

General question and CTC discussion

Q1. Can you discuss the CTC (Cost to Company) offered in this position?
Ans. 
The CTC offered for this position is competitive and includes salary, benefits, and bonuses.
• CTC includes salary, benefits, bonuses, and any other perks offered by the company.

• It is important to consider the overall compensation package, not just the base salary.

• Negotiation for a higher CTC may be possible based on experience and skills.

• Example: CTC for this position ranges from $100,000 to $120,000 per year.
Answered by AI
Add your answer

Q1. Tell me about yourself.
Add your answer