Kth Node From Middle | Amazon Interview Question

0:00​ intro

Kth Node From Middle | Amazon Interview Question

Problem Description

Given a linked list A of length N and an integer B.

You need to find the value of the Bth node from the middle towards the beginning of the Linked List A.

If no such element exists, then return -1.


Position of middle node is: (N/2)+1, where N is the total number of nodes in the list.

Getways Solution contains all academics and industrial technical information related to programming skills like web Development, Software Engineering, Data Structure, Algorithm, here you will also find competitive platforms coding solution like Leetcode(leetcode), Hackerrank, Codechef, Interviewbit and you can learn various programming skills too like Java, C, JSP, HTML, C++ etc. for more information visit our official website: https://www.getwayssolution.com/
Thank You ❤❤❤
Github:- https://github.com/NAJMUS7834

Linkedin:- https://www.linkedin.com/in/najmus-seemab/
Be the first to comment