Software Engineer

Step 1 : Create an another arraylist(ans) and also a boolean visited array.
Step 2 : Traverse from 0 to n.check every ith element that it is kth element of array or not then,Mark every (i+1)th as true in visited array and insert that ith element from given araylist into the ans.
Step 3 : Again Traverse from 0 to n,add every non visited ith element (vis[i]==false) from the given araylist into ans 
Step 4 : convert the ans araylist into Linkedlist and return the head of Linkedlist.

STEPS:
1)I sort the vector intervals.

2)I initialize low and high integers to store the first value and then assign them to the new vector V.

3) then I maintain another pointer j which is used to input the values in our vector V.

4) Traverse the whole intervals vector and I stumble upon 2 cases:
first: if the value of the element in intervals[i][0] is higher than the value of high I add them to vector V and update high.
second: if value of intervals[i][1] is higher than high but value of intervals[i][0] is less than or equal to high, then I update the element at V[j-1][1].

5)At the end we remove/erase the excess elements from vector V.

Step 1 : The easiest thing to do here is to create separate linked lists for the front and back portions of list i want to return.
Step 2 : In order to accomplish that ,I first created some dummy heads (fdum, bdum), then created pointers for the current nodes each of the front, back, and main lists (front, back, curr).
Step 3 : Then I simply iterate through the main list and stitch together each node to either front or back, depending on the node's value.
Step 4 : Once I reached the end, I just need to stitch together the two sub-lists, making sure to cap off the end of back, and then return new list, minus the dummy head.

Tip 1 : Go through each and every definition in OS
Tip 2 : Answer the question to the point don't talk about irrelevant points
Tip 3 : Prefer Interviewbit, GFG, and any other question and answer pages on internet

Tip 1 : Go through each and every definition in DBMS
Tip 2 : Answer the question to the point don't talk about irrelevant points
Tip 3 : Prefer Interviewbit, GFG, and any other question and answer pages on internet

Tip 1 : Research the company you’re interviewing with. Take in as much information as you can about the business, read their entire website, look at all their social media platforms, and look up the latest news about them. You can’t be too thorough here.
Tip 2 : Research the person who is interviewing you. Look at their LinkedIn and understand their path to the company, as well as their past experience. Be prepared to ask them questions about their role and their time at the company.
Tip 3 : Carefully read the job description and understand every point, as well as how your own skills fulfil all the requirements. If there is a gap, don’t worry, just be prepared to explain and use some of your soft skills or other applicable experience to fill it.
Tip 4 : Review your CV and be prepare to answer questions about it, as well. From why you want to leave your current role or what you did and didn’t enjoy about past roles, it’s good to have a handle on your career progression.
Tip 5 : Prepare answers to any questions you think you might be asked. More on that in the next section