Blue Yonder Plsql Developer Interview Questions and Answers

Q1. I don't Remember the question1
Add your answer

Q1. I don't remember the question2
Add your answer
Q2. I don't remember the question
Add your answer

Q1. What is closures
Ans. 
Closures are functions that have access to variables from their outer scope even after the outer function has finished executing.
• Closures allow functions to access variables from their parent function even after the parent function has returned.

• They help in creating private variables and functions in JavaScript.

• Closures are commonly used in event handlers and callbacks.
Answered by AI
Add your answer
Q2. What is call apply bind
Ans. 
call, apply, and bind are methods in JavaScript used to manipulate the context of a function.
• call() is used to invoke a function with a specified 'this' value and arguments provided individually.

• apply() is similar to call() but arguments are passed as an array.

• bind() is used to create a new function with a specified 'this' value and initial arguments.
Answered by AI
Add your answer

Written test coding and with aptitude questions are asked

Q1. Asking about OOPS and C++ basics concepts
Add your answer

Q1. Implement a calculator class which does this cal.add(2).sub(3).mul(4).delay(2000).add(4) etc
Ans. 
Implement a calculator class with chaining methods and delay function.
• Create a Calculator class with add, sub, mul methods that return the instance of the class.

• Implement a delay method that uses setTimeout and returns the instance of the class.

• Use a queue to store the operations and execute them in order after the delay.

• Return the result of the operations when the equals method is called.
Answered by AI
Add your answer
Q2. Problems on Array and bit manipulation. Questions on setTimeout() and bind functions. Polyfill for Promise function currying add(1)(2)(3)(4) etc
Add your answer

Q1. Given a nested checkboxes like parents > children > childre etc write javascript code such that on click of any checkbox all its children should get updated to same value as that parent.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Round 1  was a coding round of 60 min which started around 5:30PM in which 2 problem statements were given. The questions were based on Array and linked list. The platform used for test was coding which was user friendly and which use to display number of test cases passed and some test cases were hidden.

Q1. 
Problem: Deletion in Circular Linked List
You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.
Your task is to implement a function that locates the spec...read more
Ans. Recursion
The idea is to use a recursive approach to find the given key and then remove that node. The recursive idea is very clear that we will traverse through the circular linked list, and we will check if the value of the node is equal to the given key. 
 
We will define a function deleteNodeHelper(root, key, head) to remove the key in which the head is the starting node of the linked list, and we will send ...read more
Answered Anonymously
Add your answer
Q2. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. Using Sorting
Approach: A brute force approach could be to just sort the given array in ascending order. This will result in all negative numbers to appear at the beginning and positive number at the end.
Space Complexity: O(1)Explanation:
O(1)
 
Because no extra space is required.
Time Complexity: O(nlogn)Explanation:
O(N*logN), where N is the number of elements in the array.
 
In the worst case, sorting requires O...read more
Answered Anonymously
Add your answer

Round duration - 30-35 minutes
Round difficulty - Medium

This round was of technical interview and they asked me various concepts