Grey Orange Interview Questions, Process, and Tips

Medium level coding questions were asked

Q1. Implementation of Breadth First Search
Ans. 
Breadth First Search is a graph traversal algorithm that explores all the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.
• Start by visiting the root node and then visit all the neighbor nodes at the present depth level before moving on to the nodes at the next depth level.

• Use a queue data structure to keep track of the nodes to be visited.

• Mark each node as visited to avoid re...read more
Answered by AI
Add your answer
Q2. Implementation of Depth First Search
Ans. 
Depth First Search is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
• Start at a node and explore as far as possible along each branch before backtracking

• Use a stack to keep track of nodes to visit

• Mark visited nodes to avoid revisiting them

• Can be implemented recursively or iteratively
Answered by AI
Add your answer
Q3. Implementation of Inorder Traversal of a Binary Tree
Ans. 
Inorder traversal of a binary tree involves visiting the left subtree, then the root, and finally the right subtree.
• Start at the root node

• Recursively traverse the left subtree

• Visit the current node

• Recursively traverse the right subtree

• Repeat until all nodes are visited
Answered by AI
Add your answer

Q1. Swap Alternative nodes of a Linked list
Ans. 
Swap alternative nodes of a linked list
• Iterate through the linked list and swap the data of alternate nodes

• Use temporary variables to store data during swapping

• Ensure to handle cases where the linked list has an odd number of nodes
Answered by AI
Add your answer
Q2. Reverse a Linked list
Ans. 
Reverse a linked list by changing the next pointers of each node
• Start with three pointers: current, prev, and next

• Iterate through the linked list, updating the next pointer of each node to point to the previous node

• Update prev, current, and next pointers for each iteration

• Example: 1 -> 2 -> 3 -> 4 -> null, after reversing: 4 -> 3 -> 2 -> 1 -> null
Answered by AI
Add your answer

Q1. What is NPD process?
Ans. 
NPD process stands for New Product Development process, which is a systematic approach to bringing a new product to market.
• Idea generation and screening

• Concept development and testing

• Business analysis

• Product development

• Test marketing

• Commercialization
Answered by AI
Add your answer
Q2. What is P2P cycle ?
Ans. 
P2P cycle stands for Procure to Pay cycle, which is the process of obtaining goods or services from a supplier and paying for them.
• P2P cycle involves requisitioning, purchasing, receiving, and paying for goods or services.

• It starts with a purchase requisition, followed by supplier selection, purchase order creation, goods receipt, invoice verification, and payment processing.

• Efficient P2P cycle management helps in cont...read more
Answered by AI
Add your answer
Q3. What is the process of Pcb Development
Ans. 
The process of PCB development involves designing the circuit, selecting components, creating the layout, prototyping, testing, and final production.
• Designing the circuit based on the requirements and functionality

• Selecting components such as resistors, capacitors, and integrated circuits

• Creating the layout using software like Altium Designer or Eagle

• Prototyping the PCB to test its functionality and performance

• Testing ...read more
Answered by AI
Add your answer
Q4. What is process of wire harness development
Ans. 
Wire harness development involves designing, prototyping, testing, and manufacturing electrical wiring systems for various applications.
• Designing the wire harness layout based on the electrical requirements and space constraints

• Prototyping the wire harness to ensure proper fit and functionality

• Testing the wire harness for electrical continuity, insulation resistance, and durability

• Manufacturing the wire harness using a...read more
Answered by AI
Add your answer

Q1. The interviewer asked Basic SQL and Linux OS-related questions.
Add your answer

Q1. The interviewer asked questions regarding projects and experience.
Add your answer
Q2. The interviewer asked some aptitude and logical reasoning questions.
Add your answer

Q1. Salary negotiations.
Add your answer

Round duration - 120 minutes
Round difficulty - Easy

The test had it's webcam on, we were not allowed to go out of the frame.

Q1. Nth Fibonacci Number
Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
    F(n) = F(n-1) + F(n-2), 
    Where, F(1) = F(2) = 1
Provided N you have...read more
Ans. 
The program calculates the Nth Fibonacci number using a recursive formula.
• The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.

• The program uses a recursive function to calculate the Nth Fibonacci number.

• The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.
Answered by AI
View 3 more answers
Q2. Longest Consecutive Sequence
You are given an unsorted array/list 'ARR' of 'N' integers. Your task is to return the length of the longest consecutive sequence.
The consecutive sequence i...read more
Ans. 
The task is to find the length of the longest consecutive sequence in an unsorted array of integers.
• Sort the array to bring consecutive numbers together

• Iterate through the sorted array and keep track of the current consecutive sequence length

• Update the maximum length if a longer sequence is found
Answered by AI
View 3 more answers

Round duration - 30 minutes
Round difficulty - Medium

The interview was online from home.

Q1. Technical Questions
Data Structures and OOPS Problems
The interview contained mostly data structures and oops problems. I was asked to implement the node class of linked list and queue using circular array. ...read more
Ans. 
The interview focused on data structures and object-oriented programming concepts.
• Implementing the node class of a linked list and queue using a circular array

• Explaining polymorphism in detail, including overriding, overloading, and runtime polymorphism

• Providing examples to illustrate the concepts

• Answering other questions related to data structures and OOPS
Answered by AI
Add your answer
Q2. Reverse the String
You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.
For example:
 If the given string is: STR...read more
Ans. 
The task is to reverse a given string containing lowercase letters, uppercase letters, digits, and special characters.
• Iterate through the string from the last character to the first character and append each character to a new string.

• Alternatively, you can use built-in string reversal functions or methods available in your programming language.

• To solve the follow-up question with O(1) space complexity, you can use a tw...read more
Answered by AI
View 1 more answer

Round duration - 20 minutes
Round difficulty - Easy

This was last round. In this round interviewer ask about me and what i know about company. Also he ask about my projects as well as my future goals . 
The interviewer was very understanding and supportive.

Q1. Basic HR Questions
Why do you want to join this company?
Who is your role model?
Ans. 
I want to join this company because of its strong reputation in the software engineering industry and its commitment to innovation.
• The company has a strong reputation in the software engineering industry

• The company is known for its commitment to innovation

• The company offers opportunities for professional growth and development

• The company has a positive work culture and values its employees
Answered by AI
View 1 more answer

Just was some normal question for screening

GD was about Science topics or impact of science in the life

Q1. General questions about career objective, aim, after 5 years?
Add your answer
Q2. Hobbies, interest, your quality
Add your answer