i
Blue
Yonder
Work with us
Filter interviews by
I appeared for an interview in Sep 2024.
What people are saying about Blue Yonder
Printing even and odd numbers using two threads in Java
Create two threads, one for even numbers and one for odd numbers
Use a loop to iterate through the numbers and print them
Use synchronization to ensure alternate printing of even and odd numbers
Use wait() and notify() methods to control the execution of threads
I applied via Approached by Company and was interviewed in Aug 2023. There were 5 interview rounds.
Medium data structure problem was given and asked to solve. System design questions was asked.
Medium data structure problem was asked. Java questions were asked and previous projects were discussed.
posted on 8 Jan 2025
posted on 23 Apr 2025
I appeared for an interview before Apr 2024, where I was asked the following questions.
Using a constant reference in a copy constructor avoids unnecessary copying and ensures the original object remains unchanged.
Efficiency: Passing by constant reference prevents the overhead of copying large objects, improving performance.
Const Correctness: It ensures that the original object cannot be modified, maintaining the integrity of the data.
Syntax Example: In a copy constructor, you might see 'ClassName(const C...
Runtime polymorphism allows methods to be invoked at runtime based on the object's type, enabling dynamic method resolution.
Achieved through method overriding in inheritance.
Example: A base class 'Animal' has a method 'sound()', overridden by 'Dog' and 'Cat'.
The method invoked depends on the object type at runtime.
Facilitates code flexibility and reusability.
Commonly used in frameworks and libraries for dynamic behavio...
Creating a custom string class using char* involves managing memory, constructors, destructors, and operator overloading.
Memory Management: Use dynamic memory allocation (e.g., new and delete) to manage the char* array, ensuring proper allocation and deallocation.
Constructor: Implement a constructor to initialize the string from a char* input, copying the content and allocating necessary memory.
Destructor: Define a des...
Vector projection involves calculating the component of one vector along another using dot products.
The formula for projecting vector A onto vector B is: proj_B(A) = (A · B / B · B) * B.
Here, A · B represents the dot product of vectors A and B.
The result is a vector that points in the direction of B and has a magnitude equal to the component of A in that direction.
Example: If A = (3, 4) and B = (1, 0), then proj_B(A) =...
posted on 3 Sep 2022
I applied via Naukri.com and was interviewed in Aug 2022. There were 2 interview rounds.
posted on 25 Feb 2022
Reverse a string without any library function.
Create an empty string to store the reversed string
Loop through the original string from end to start
Append each character to the empty string
Return the reversed string
I appeared for an interview in Aug 2016.
I appeared for an interview before Mar 2021.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
You are given a string of length N
. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...
Reverse words in a string while handling leading, trailing, and multiple spaces.
Split the input string by spaces to get individual words
Reverse the order of the words
Join the reversed words with a single space in between
Handle leading, trailing, and multiple spaces appropriately
You are given a stack of integers. Your task is to reverse the stack using recursion without using any extra space other than the internal stack space used due to recursion...
Reverse a stack using recursion without using any extra space other than the internal stack space.
Use recursion to pop all elements from the original stack and store them in function call stack.
Once the stack is empty, push the elements back in reverse order.
Base case of recursion should be when the original stack is empty.
Round duration - 45 minutes
Round difficulty - Medium
Technical Interview round with questions on DSA.
Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirror of a bin...
Convert a binary tree to its mirror tree by interchanging left and right children of all non-leaf nodes.
Traverse the binary tree in a recursive manner.
Swap the left and right children of each non-leaf node.
Continue this process until all nodes have been processed.
You are given a singly linked list with 'N' nodes, each containing integer data, and an integer 'K'. Your goal is to remove the 'K'th node counting from the end of ...
Remove the Kth node from the end of a singly linked list.
Use two pointers approach to find the Kth node from the end.
Handle edge cases like removing the head node or removing the last node.
Update the pointers to remove the Kth node and reconnect the list.
Round duration - 30 minutes
Round difficulty - Easy
Typical Managerial round.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview experience
Difficulty level
Senior Software Engineer
384
salaries
| ₹18.1 L/yr - ₹32.8 L/yr |
Software Engineer
301
salaries
| ₹9.8 L/yr - ₹17 L/yr |
Technical Consultant
271
salaries
| ₹6.9 L/yr - ₹21.3 L/yr |
Senior Technical Consultant
202
salaries
| ₹16.6 L/yr - ₹30 L/yr |
Senior Business Consultant
199
salaries
| ₹18 L/yr - ₹30 L/yr |
SAP
24/7 Customer
Thomson Reuters
Oracle Cerner