Grey Orange Interview Questions, Process, and Tips

Quants, aptitude and logical reasoning

Dsa basics and machine learning

Data structures and algorithms. can do in c++ or many other languages.

Q1. From gfg, simple array question. 3/5 difficultly.
Add your answer
Q2. Based on resume. Discussion around that.
Add your answer

Q1. Asked domain related technical question
Add your answer
Q2. Any experience of transformation projects
Ans. 
Yes, I have experience leading transformation projects in finance.
• Led a finance transformation project to implement a new financial system across the organization

• Streamlined financial processes and implemented automation tools to improve efficiency

• Managed change management initiatives to ensure smooth transition and adoption of new processes

• Collaborated with cross-functional teams to align finance transformation goals ...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Easy

Q1. 
Rectangle Area Calculation
Given a list of rectangles, where each rectangle is represented by an array of four integers indicating its bottom-left and top-right corners, calculate the total area covered b...read more
Ans. 
Calculate total area covered by a list of rectangles on a plane.
• Iterate through each rectangle and calculate its area

• Check for overlapping areas between rectangles

• Sum up the total area covered by all rectangles
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Oops concepts and 1 DSA problem

Q1. 
Bit Set Problem Statement
You are provided with a string, termed as DIGIT_PATTERN, which consists solely of digits. The objective is to identify the first digit that repeats in the sequence. If there's no...read more
Ans. 
Identify the first repeating digit in a given string of digits.
• Iterate through the string and keep track of seen digits using a set.

• Return the first digit that repeats, or -1 if no digit repeats.

• Time complexity: O(n), where n is the length of the input string.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Firstly Some general questions and then suddenly a cosing question with modifications

Q1. 
Print All Permutations of a String
Given an input string STR, generate and print all possible permutations of the string.
Input:
str
Output:
All permutations of the input string, each on a new line.
...read more
Ans. 
Generate and print all possible permutations of a given input string.
• Use recursion to generate all permutations by swapping characters in the string.

• Maintain a visited array to keep track of characters already used in a particular permutation.

• Print each permutation as it is generated.

• Handle duplicate characters by skipping swapping if the character is already in the current position.
Answered by AI
Add your answer

Q1. Ds ALGO, RECURSION BASED PROBLEMS
Add your answer

Q1. DS ALGO DESIGN and Job fitment
Add your answer

Q1. Normal salary discussion and company policies
Add your answer

Q1. Effective Project Management
Add your answer

Q1. Team Building & Project Management
Add your answer

Q1. Compensation and Perks
Add your answer