Tip 1 : Study and research.
Tip 2 : Keep practicing.
Tip 3 : Ask questions.
Tip 1: Keep it short and crisp.
Tip 2: Mention adjectives and implementation steps.
Afternoon, Environment was good, and interviewer was good speaker and listener.



Symbol Value
I 1
V 5
X 10
L 50
C 100
D 500
M 1000
2 is written as II in the roman numeral, just two one’s added together.
12 is written as XII, which is simply X(ten) + II(one+one).
The number 27 is written as XXVII, which is XX + V + II.
Roman numerals are usually written largest to smallest from left to right.
However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four.
The same principle applies to the number nine, which is written as IX.
There are six instances where subtraction is used:
I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.
Roman numerals are usually written from largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because one is before five, we subtract it, making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
A boy fell off a 30-meter ladder but did not get hurt. Why?
Think smart, as he fell from the bottom step of the ladder.



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.
Convert the LL to a Circular Linked List, then shift the head (n-k) times, and finally fetch the end node and set its next to NULL.
Afternoon, Environment was good, and Interviewer was good speaker and listener.



For N = 1, there is only one sequence of balanced parentheses, ‘()’.
For N = 2, all sequences of balanced parentheses are ‘()()’, ‘(())’.
Generate a binary tree of n pairs and use recursion.
The left path represents possible left parentheses, and the right path represents possible right parentheses. A leaf node contains the answer.
Design a forum-like systems like Quora, Reddit or HackerNews.
Day time, Environment is good, and Interviewer was good.
Tell me about yourself, your family, why you are looking for a job, and why you are fit for this role.
Tip 1: Be confident.
Tip 2: Be clear and concise.
Tip 3: Take a quick look about company and its business.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?