$/*$

Interquartile Range

Given a sorted singly linked list without a tail $($e$.$g$,$ head $->1->2->3->4),$

return the interquartile range of the data set using the slow and fast pointer

approach OR using a methodology that does not iterate over the linked list

twice. You must not iterate over the entire linked list more than once and you

cannot use arrays, vectors, lists or an STL implementation of List ADT in this problem.

Sample Input:

$2445678$

Sample Output:

$3\mathrm{.}00$

$*/$

#include

#include

class Node $\{$

public:

int value;

Node$*$ next $=$ nullptr;

$\}$;

Node$*$ insertEnd$($Node$*$ head, int key$)$

$\{$

Node$*$ temp $=$ new Node$()$;

temp$->$value $=$ key;

if$($head $==$ nullptr$)$

head $=$ temp;

else

$\{$

Node$*$ curr $=$ head;

while$($curr$->$next $!=$ nullptr$)$

curr $=$ curr$->$next;

curr$->$next $=$ temp;

$\}$

return head;

$\}$

float interQuartile$($Node$*$ head$)\{$

float IQR $=0\mathrm{.}0$;

Node$*$ Part$1=$ NULL;

Node$*$ Part$2=$ NULL;

Node$*$ Part$3=$ NULL;

Node$*$ Part$4=$ NULL;

if $(!$head $||!$head$->$next $||!$head$->$next$->$next $||!$head$->$next$->$next$->$next$)$

$\{$

return $0\mathrm{.}0$;

$\}$

$//$ Loop that moves pointer

while$($true$)\{$

if$($Part$1!=$ NULL$)\{$

Part$1=$ Part$1->$next;

$\}$

else$\{$

Part$1=$ head;

$\}$

if$($Part$2!=$ NULL$)\{$

Part$2=$ Part$2->$next$->$next;

$\}$

else$\{$

Part$2=$ head$->$next;

$\}$

if$($Part$3!=$ NULL$)\{$

Part$3=$ Part$3->$next$->$next$->$next;

$\}$

else$\{$

Part$3=$ head$->$next$->$next;

$\}$

if$($Part$4!=$ NULL$)\{$

Part$4=$ Part$4->$next$->$next$->$next$->$next;

$\}$

else$\{$

Part$4=$ head$->$next$->$next$->$next;

$\}$

$//$ Breaks loop

if$($Part$4==$ NULL $||$ Part$4->$next $==$ NULL$)\{$

break;

$\}$

$\}$

$//$ When Odd

if$($Part$4==$ NULL$)\{$

IQR $=$ Part$3->$value $-$ Part$1->$value;

return IQR;

$\}$

$//$ When Even

else$\{$

IQR $=($Part$3->$value $+$ Part$3->$next$->$value$)/2\mathrm{.}0-($Part$1->$value $+$ Part$1->$next$->$value$)/2\mathrm{.}0$;

return IQR;

$\}$

$\}$

int main$()\{$

Node$*$ head $=$ new Node$()$;

head$->$value $=2$;

head$->$next $=$ new Node$()$;

head$->$next$->$value $=4$;

head$->$next$->$next $=$ new Node$()$;

head$->$next$->$next$->$value $=4$;

head$->$next$->$next$->$next $=$ new Node$()$;

head$->$next$->$next$->$next$->$value $=5$;

head$->$next$->$next$->$next$->$next $=$ new Node$()$;

head$->$next$->$next$->$next$->$next$->$value $=6$;

head$->$next$->$next$->$next$->$next$->$next $=$ new Node$()$;

head$->$next$->$next$->$next$->$next$->$next$->$value $=7$;

head$->$next$->$next$->$next$->$next$->$next $->$next $=$ new Node$()$;

head$->$next$->$next$->$next$->$next$->$next$->$next$->$value $=8$;

head$->$next$->$next$->$next$->$next$->$next $->$next$->$next $=$ new Node$()$;

head$->$next$->$next$->$next$->$next$->$next$->$next$->$next$->$value $=9$;

head$->$next$->$next$->$next$->$next$->$next $->$next$->$next$->$next $=$ new Node$()$;

head$->$next$->$next$->$next$->$next$->$next$->$next$->$next$->$next$->$value $=10$;

float result $=$ interQuartile$($head$)$;

std::cout $<<$ "Interquartile Ranges: $"<<$ std::fixed $<<$ std::setprecision$(2)<<$ result $<<$ std::endl;

return $0$;

$\}$

This is my code, it works but when I try certain numbers, it gives me a "Exception has occurred. Segmentation fault"

For example if I try the numbers $2445678910$ or $18154382101110245655345137556.$ It gives the same error but work for $18154382101110245655345137556137576$ and $2445678$ and $1234$