Technology Analyst

Step 1: Divide the pattern into 2 patterns, Pattern 1st increasing, Pattern 2nd decreasing
Step 2: Print increasing pattern
Step 3: Print Decreasing Pattern


#include 
using namespace std;
int main()
{
int n;
cin>>n;
int p=n;


for(int i=1;i<=n;i+=2)
{
int k=(i-1)*n+1;
for(int j=0;j0;i-=2)
{
int k=(i-1)*n+1;
for(int j=0;j {
cout< k++;
}
cout< cout<}

return 0;
}

1) First find the leaf node that is on the maximum sum path. In the following code getTargetLeaf() does this by assigning the result to *target_leaf_ref.
2) Once we have the target leaf node, we can print the maximum sum path by traversing the tree. In the following code, printPath() does this.

Step 1: Brute force copying every element in this linked list to another array and then returning n the element from the end of that array 

Step 2: The interviewer asked me to solve without using extra space.
Step 3: Then I gave a solution with 2 pointers starting from the start with the difference of n element between them.

Tip 1: In the HR round always think about what is good for the company and answer the questions accordingly.
Tip 2: Try to have basic knowledge of the interviewer and his background.
Tip 3: Ask questions at the last to the interviewer which will make him think you are very interested to join this firm.
Tip 4: At any point don't say anything which will make him think that you can leave the company you are applying to.