Senior Software Engineer

Given 3 Strings, check whether the 3rd string contains all the characters of string 1 and 2 in any order. If all the characters are present, print "YES" otherwise print "NO".

There should not be any extra character and any missing character.

The string s contains uppercase Latin letters only.

You are given an array 'ARR' of integers having 'N' elements. Your task is to convert the input array into a min-Binary Heap.

A min-Binary heap is a complete binary tree in which the value of each internal node is smaller than or equal to the values of the children of that node.

Note :

1. Input array follows 0 - based indexing. 

2. After constructing the min-heap, the Left child of the 'i-th' node should be present at the (2*i + 1)-th index if it exists.

3. After constructing the min-heap, the Right child of the 'i-th' node should be present at the (2*i + 2)-th index if it exists.

4. Note that you do not need to create a tree, just update the array.

How can circular references be fixed in C#?
Dependency Injection in C#
Types of Design pattern use
Angular practical question
Write a test case using XUnit for a scenario
What is garbage collection and use

Questions related to People management, time management 
How do you fix a situation where your coworker is unavailable at the last moment
How do you handle panic scenarios
What are disadvantages of Code first approach in EF

What are your plans?

What are your expectations?