Like I wrote in previous post you will get some coding questions, like other one is this-
You are given an array of integers having both positive & negative numbers in it.
Now you need to find the count of subarrays, such that sum of each subarray is 0.

 Obviously I was not able to solve it in the given time limit & I believe many will not be able to
solve in that pathetic IDE of Bigshyft also, and again sometimes the right idea hit at the right
moment or many times it doesn't.
​
So below is the solution you can apply whether sum should be 0 or any other number-

BigShyft is a platform which promises you opportunities with big IT companies, rest you can
check.
So there it also gives various exercises/problems to solve to show case your talent to the
recruiters using this platform.
 I tried its Java coding platform to solve 2 problems & its platform sucks, plus you are not
allowed to switch to any other window & you can't copy any content from other window.
 You can get max 2 chances to move away from the current BigShyft window & after that your
code will automatically be submitted.
 In short my experience here was pathetic though the problems were interesting but difficult to
code for, on such platform.
 One problem was to print the connected cities in the given input, if you think in terms of a tree
then you are supposed to print the data in Breadth First order.
 For this problem, the solution is as given & note due to the input taken from console, it
becomes tricky further.
 Please keep posting the coding questions/answers here, you get on BigShyft & if answer is
not present then I will try to provide my answer here as per my understanding.

Input format:
First Line : Number of pairs of connected cities
Next : Every pair ine new line. And every pair is separated by a space
Last Line : City to start with

Example:
5
Bangalore Hyderabad
Bangalore Chennai
Hyderabad Mumbai
Hyderabad Delhi
Chennai Kerala
Bangalore

Output for above Input:
​Bangalore
Hyderabad
Chennai
Mumbai
Delhi
Kerala