Software Developer

The brute force approach is to use recursion. Generate all subsets and count the number of subsets with sum as 0. The time complexity of this approach would be exponential (2^n).
Dynamic programming can be used to optimize the above solution.
For every index i, we have two options, to include it in the sum or leave it. Suppose the sum of the elements we've chosen up to index 'i-1' is 'S'. From index ‘i’, we need to compute the number of subsets of the sub-array [i, N-1] whose sum equals -S. 
dp[i][S] is defined as follows : the number of the subset of the subarray[i, N-1] with sum equal to '-S'.
Therefore, following recurrence relation can be used : dp[i][s] = dp[i+1][s+arr[i]] + dp[i+1][s]

BFS is a traversing algorithm we start traversing from a selected node (starting node) and traverse the graph layer wise thus exploring the neighbor nodes (nodes which are directly connected to source node). And then move towards the next-level neighbor nodes.
Pseudocode :
BFS (G, s) 
Q.push( s ) //Inserting s in queue Q until all its neighbor vertices are marked.
mark s as visited.
while ( Q is not empty)
//Removing that vertex from queue, whose neighbor will be visited now
u = Q.pop( )
//processing all the neighbors of u 
for all neighbors v of u in Graph G
if v is not visited 
Q.push( v ) //Stores v in Q to further visit its neighbor
mark w as visited.

One approach could be to calculate the number of spaces in the given string. Calculate the new length of the string as original length + 2*(number of spaces). Create a new string of the length calculated. Traverse the original string and keep appending all characters except spaces in the new string. As soon as a space is encountered, append '%20' in the string. Return the new string created.

Tip 1 : The cross questioning can go intense some time, think before you speak.
Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.
Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team you are mentoring. How all is the work environment etc.
Tip 4 : Since everybody in the interview panel is from tech background, here too you can expect some technical questions. No coding in most of the cases but some discussions over the design can surely happen.