MERN Stack Developer

Given a singly linked list of N nodes.The task is to find the middle of the linked list. If in case of N is even then 2 middle element is possible (Nth/2 and Nth/2 + 1) in that case print the second middle element (Nth/2 + 1).Example 1st: if linked list is 5 -> 2 -> 1 -> 3 -> 7, then middle node of linked list is 1.Example 2nd: if linked list is 5 -> 2 -> 1 -> 3 -> 7 -> 4, then middle node is linked list is 3

Given an array Arr[ ] of size N having elements.Your task is to find the next greater element for each element of the array from index 0 to N-1. Next greater element of an element in the array is first element on the right which is greater than the that element.If there is no next greater element of current element, then print -1 for that.

Given two strings X of lengths m and Y of lengths n.Find the string of smallest length in such a way that X and Y both are its subsequences (all character of X and Y is small).For example: if X = abuy and Y = bau then string of smallest length is abauy

Create a React project where there is counter whose default value is 0 that will increase and decrease by clicking respective counter button and reset button that will make counter 0.