SDE - 1

Write a program that can merge a series of files containing JSON array of Objects
into a single file containing one JSON object.
Example:
Suppose there are 3 files - data1.json, data2.json, data3.json.
Let's say data1.json contains -
{"strikers": [
{ "name": "Alexis Sanchez", "club": "Manchester United" },
{ "name": "Robin van Persie", "club": "Feyenoord" }
] }
data2.json contains -
{"strikers": [
{ "name": "Nicolas Pepe", "club": "Arsenal" }
] }
data3.json contains -
{"strikers": [
{ "name": "Gonzalo Higuain", "club": "Napoli" },
{ "name": "Sunil Chettri", "club": "Bengaluru FC" }
] }
A merge of these 3 files will generate a file with the following data.
merge1.json -
{"strikers": [
{ "name": "Alexis Sanchez", "club": "Manchester United" },
{ "name": "Robin van Persie", "club": "Feyenoord" },
{ "name": "Nicolas Pepe", "club": "Arsenal" },
{ "name": "Gonzalo Higuain", "club": "Napoli" },
{ "name": "Sunil Chettri", "club": "Bengaluru FC" }
] }

Functional requirements:
1. Accept the following parameters as an input –
a. Folder Path: The folder where all the JSON files are stored.
b. Input File Base Name: The common prefix all file names share. In our
example above, this prefix was data.
c. Output File Base Name: The prefix for the merged file name
generated by the merge utility.
d. Max File Size: The maximum file size (in bytes) that each merged file
is allowed to be.

2. The utility will read all files in the Folder Path that begin with the Input File
Base Name, and process them in increasing order of the number added as a
suffix to each file (1,2,3,....,12,13,...).
3. The utility will ensure that the output files are named using the Output File
Base Name as a prefix, and a counter as a suffix.
4. Merged files will never be greater than Max File Size.

5. Each output file will contain a proper JSON array.
6. Bonus points for making the solution generic so any kind of JSON array can
be merged. (e.g.: The root key "strikers" becomes "employees". The objects
in the array carry fields like "name", "id", "designation", etc.)
7. Bonus points for supporting non-English characters.

Non-functional requirements:
1. The algorithmic complexity of the merge will be as small as possible. Please
capture the algorithmic complexity of your solution in the README file.
2. The merged files will be as large as possible, without exceeding Max File
Size.
Languages:
Ideally, we would not restrict you from working on a language of your choice.
However, it would be preferable if you stick with one of these:
• NodeJS
• Java
• Python
• GoLang
• Ruby
• C/C++

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

You are given an array of integers. You need to sort the array in ascending order using quick sort.

Quick sort is a divide and conquer algorithm in which we choose a pivot point and partition the array into two parts i.e, left and right. The left part contains the numbers smaller than the pivot element and the right part contains the numbers larger than the pivot element. Then we recursively sort the left and right parts of the array.

Example:

Let the array = [ 4, 2, 1, 5, 3 ]
Let pivot to be the rightmost number.

After the 1st level partitioning the array will be { 2, 1, 3, 4, 5 } as 3 was the pivot. After 2nd level partitioning the array will be { 1, 2, 3, 4, 5 } as 1 was the pivot for the left part and 5 was the pivot for the right part. Now our array is sorted and there is no need to divide it again.

You are given two strings named str1 and str2 of length N and M respectively. Find whether string str2 contains one of the permutations of string str1 as its substring. In other words, whether there exists any permutation of string str1 that is a substring of str2.

For Example :

Input: str1 = “ab” , str2 = “aoba”
Output: True
Explanation : Permutations of first-string str1 i.e. “ab” are [ “ab”, “ba” ].
The substrings of str2 i.e. “aoba” are [ “a”, “o”, “b”, “a”, “ao”, “ob”, “ba”, “aob”, “oba”, “aoba” ].
The string “ba” is present in the list of substrings of string str2.

System design of my project

If a bowl was thrown from n stored buliding, find the floor which the bowls breaks with minimal iterations.
(Question on binary search applications )

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values

Print the left view of the binary tree.

Example :

If the input tree is as depicted in the picture: 

The Left View of the tree will be:  2 35 2 

Tell me about yourself.
Are you Willing to relocate?
Have you any existing offers?