Tip 1 : Practice Atleast 250 Questions
Tip 2 : Practice Atleast 250 Questions
Tip 3 : Take time to study DSA
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
English 15 Questions MCQs
Aptitude 15 Questions MCQs
2 coding problem




For the above-linked list, if k=2, then the value at the kth i.e second node from the end is ‘12’.
1.You don’t need to take any input. It has already been taken care of. Just implement the given function and return a pointer pointing to the k-th element from the last of the linked list.
2.It is guaranteed that k<=size of the linked list.
1) Calculate the length of Linked List. Let the length be len.
2) Print the (len – n + 1)th node from the beginning of the Linked List.



153 = 1^3 + 5^3 + 3^3.
Therefore 153 is an Armstrong number.
The approach implemented below is simple. We traverse through all numbers in given range. For every number, we first count number of digits in it. Let the number of digits in current number be n. Them we find sum of n-th power of all digits. If sum is equal to i, we print the number
Tell us about yourself and your projects.
will you accept bond of our company.
Where do you see yourself in next 5 years

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?