Please help for this one

#1

Why it is not working?

I am implementing some functions in Linked Lists, Please help for this one.

#2

Hey @cbcao263 it’s a plain code, showing nothing but basic c++ template, I think you forgot to add your code here & also forgot to saved it. Please provide your code.

#3


Sir, This is the code only.
Please check the functions and explanation below.

piicc3
piicc31171×4674 436 KB

This is Question.

#4

If you feel it wrong, can you please solve it.

#5

Hey @cbcao263 you have tagged wrong topic for wrong question. I can help you but you have to tag linked list by creating a new problem as this problem has been tagged by c++ function which is not used. I would request you to create a new doubt and add all those attachments over there so that I can help you with that :slight_smile:

1 Like
#6

Done bro.
Please check it

#7

Hey @cbcao263 I guess your doubt has been assigned to some other TA , but no worries he will solve it for sure. Moreover your code runs perfectly fine on my compiler . Try to submit it, it will get accepted. :slight_smile:

#8

Broo :frowning:
Ek baat btaado bas
Uxp waala function define nhi horha
baaki mene sab krliya
Kaise krenge wo btaado plz

#9

nd I have even tagged you in that doubt too.

#10

Ohho Chlo Mai bta Deta hu

#11

Uxp function kya krega, woh sbse pehle xth element ko find krega fr joh xth element ka next element hoga(right side par) usko link krdega pth position distance away from x. Pr yaha catch hai, jaise ki maan lo pth distance se pehle he linked list khtm ho jatti hai, then tumhe kya krna hoga ki iterate kro jb tk last element ni mil jatta, or uska count yaad rkho. Or fr (p-count) distance from x pr uss node ko place krdo. Aise perform krke ho jayega.

#12

Bro yeh shi hain.
Insufficient mein dikkat aarhi.

#13

Yaar shi toh hai, accept no Jana Chhiye . Maine joh smjhaya woh smjh Mai Aaya na?

#14

void uxp(node*&head,int x,int p)
{
//2 Cases
//1. Sufficient Nodes
//2. Insufficient Nodes
node* temp1=head;
node* temp2=head;
int pos=searching(head,x);
cout<<pos<<endl;
while(pos–)
{
temp1=temp1->next;

    //Insufficient Condition
    temp2=temp2->next;
}
while(p--)
{
        temp2=temp2->next;
    if(temp2->next==NULL)
    {
        break;
    }
}
if(temp2->next!=NULL)
{
    //Insufficient Nodes nhi hain
    //Simply alag krdo 
    temp1->next=temp2;
    return;
}
else
{
    //Insufficient Condition.
    //Now we know temp2->next=NULL
    //Insufficient Nodes hain ton simply temp2->next=head se connect krdo
    //so It will be circular.
    //But ek panga aur padega yahan pe
    //Kuch ek aur condition bhi mentioned hogi jisse last test case galt horha mera.
    temp2->next=head;
    return;
}

}

Bro yeh jyaada shi lagi

#15

Han aagya
but pehle mene Inssuficient condition nhi daali thi
ab likhi
shi hai na?

#16

Arey haa, ab shi lg rha hai.

#17

Btw, I am impressed that you have taken my suggestions seriously and have started doing competitive programming :slight_smile:

#18

Nhi bro
Abhi thoda galat hain

Like Second Last Case dekho

image

Like isme mene 7 ko direct 1 se connect krdiya
But dhyan se dekho
2 ko bhi alag krdiya isne.
It means kuch aur pnga hain

#19

Han Bhai :smiley:
Ab krna pdega hi
6 Months mein Internship season bhi aarha
Mei thapar mei hu
Bhut kam bache select hote for Internship
Like 10 in 1500
Iss baar itne hue
but koi na prep ton kr skte

leetcode nd cp pe
achaa rhega :smiley:

#20

Yaar is me thoda circular linked list bhi hai. Kaifi creeped out question hai.