Member of Technical Staff

You have been given a singly Linked List of 'N' nodes with integer data and an integer 'K'.

Your task is to remove the 'K'th node from the end of the given Linked List and return the head of the modified linked list.

Example:

Input : 1 -> 2 -> 3 -> 4 -> 'NULL'  and  'K' = 2
Output: 1 -> 2 -> 4 -> 'NULL'
Explanation:
After removing the second node from the end, the linked list become 1 -> 2 -> 4 -> 'NULL'.

Their start from basic and went to medium level in OS. They start from to define what is OS and why we use OS, the difference between Process and thread, What are the different kinds of operations that are possible on semaphore,
What is different between main memory and secondary memory, What do you mean by FCFS, What is the difference between paging and segmentation and some more questions also.

You are given a binary tree with ‘N’ number of nodes and a node ‘K’.Your task is to print a list of all the ancestors of the given node ‘K’ in reverse order (lowest ancestor first).

A binary tree is a hierarchical data structure in which each node has at most two children.

Example:

Here, for ‘k’ = 7, the output will be 14 12 10.

Their start from basic and went to medium level in DBMS. What is DBMS, What are the advantages of DBMS, What is RDBMS, Define a Relation Schema and a Relation, What are the three levels of data abstraction, What is Relational Algebra, What is the E-R model, What are the integrity rules in DBMS and some more questions also.