Tip 1 : Practice At least 250 Questions
Tip 2 : Ex- Do at least 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume
There were 3 sections
1) Verbal Ability
2) Quantitative and Aptitude
3) Coding round



I have solve this question using Recursion :
Base condition: If the “index” is equal to the size of the nums array then add our current subset array to the final answer because now we cannot traverse the nums array anymore.
We have two choices now
Skip the current element and call the recursive function with index+1 and all other arguments will remain the same.
Add the current element to the current subset and call the recursive function with index +1 and other arguments. After calling the recursive function, do the backtracking step by removing the last element from the current subset.
Print the final answer.



The problem was basic. We have to calculate exponents first . then we have to take modulus of that question.
The problem in this question was constraints. That's why TLE chances were higher. That's why fast exponential method is used here.
I was asked questions about some DS algo theory questions , from my project , 1 coding problem



Input: linked list = [1 2 3 4] , k = 2
Output: 3 4 1 2
Explanation:
We have to rotate the given linked list to the right 2 times. After rotating it to the right once it becomes 4->1->2->3. After rotating it to the right again, it becomes 3->4->1->2.
To rotate the linked list, we need to change the next of kth node to NULL, the next of the last node to the previous head node, and finally, change the head to (k+1)th node. So we need to get hold of three nodes: kth node, (k+1)th node, and last node.
Traverse the list from the beginning and stop at kth node. Store pointer to kth node. We can get (k+1)th node using kthNode->next. Keep traversing till the end and store a pointer to the last node also. Finally, change pointers as stated above

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
To make an AI less repetitive in a long paragraph, you should increase: