GK02-Tech Supportproblem Atatement - Integration Using Postman and Scripting Assignment
GK02-Tech Supportproblem Atatement - Integration Using Postman and Scripting Assignment
Problem 1:
Example:
8
0 -3 5 -4 -2 3 1 0
Output:
Your program should emit the positions (0-indexed) where the sum of the
sub-sequences before and after the position are the same. For the above:
037
Meaning the zeroth, third and seventh positions have the same sum before and after.
Challenge Input:
11
3 -2 2 0 3 4 -6 3 5 -4 8
11
9 0 -5 -4 1 4 -4 -9 0 -7 -1
11
9 -7 6 -8 3 -9 -5 3 -6 -8 5
Output:
5
8
6
Hint:
See if you can find the O(n) solution and not the O(n2) solution.
Problem 2:
In this task of Integrating you are required to integrate the below API’s using postman tool:
https://docs.cashfree.com/docs/payout/guide/
Note:
Be prepared with All API which you have integrated which may be questioned in further rounds.
Instructions
1. Submit through a private bitbucket repository with read access granted to ‘yuyudhan’
and gokul_signzy usernames
2. Your submission should contain a detailed instruction in README.md, to help us
understand and run at our end.
3. Don’t include any library files, instead provide instructions on how we can install at our
end.
Judgement:
The assignment will be judged based on the
1. Structure, design and modularity in project 2. Accuracy and speed of code
3. Functionality completion 4. The commits and overall flow while
development. (Solution approach)
Constraints:
You are free to use any frameworks of your choice.
Submission
Time allotted: 7 hours from the time when received.
Zip your directory as per instructions above and upload on the google form provided on mail.
You also need to document your findings and learnings.