giulianopietoso Yep, the "IDE" is bugged. All codes are correct but it keeps saying:
Your Output (stdout) Right Answer!
And doesn't pass.
manmohankhandel1 I am also facing the same issue
Saurabh_rajvaid1 Same here
rashmishukla1893 Yes! I am also acing the same issue.
zakarh [deleted]abhiram_n Still has indentation issue
O________o Still has an indentation issue http://https://imgur.com/GSKppsx
alexjvalentino 2 weeks later and it still isn't fixed.
saralbhagat0 still not fixed
shivaaprs still the same issue.
SutaxKapoor still not fixed
kunal_tyagi Its working in C, try this out. All test case passed SinglyLinkedListNode* insertNodeAtHead(SinglyLinkedListNode* llist, int data) {
SinglyLinkedListNode* temp = (SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode)); temp->data = data; temp->next = NULL; if(llist == NULL){ llist = temp; }else{ temp->next = llist; llist = temp; } return llist;}
zakarh Stop with the comments. Let this comment thread die.
ch_krishnapriya I dont see a need for if condition here.
SinglyLinkedListNode* temp = (SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode)); temp->data = data; temp->next = llist; return temp;
lavanyamanohar12 [deleted]lavanyamanohar12 for c++, the following code worked, SinglyLinkedListNode *pNew= new SinglyLinkedListNode(data); if(llist == nullptr){ llist = pNew; }else{ pNew->next = llist; llist = pNew; } return llist;
dwivedihimanshu hi kunal, i have written same login in java but it is not working for me it is printing only last value of the node which is added, rest of the value is not printing so it is failing.
rock_vikash21 import java.io.; import java.math.; import java.security.; import java.text.; import java.util.; import java.util.concurrent.; import java.util.regex.*;
public class Solution {
static class SinglyLinkedListNode { public int data; public SinglyLinkedListNode next; public SinglyLinkedListNode(int nodeData) { this.data = nodeData; this.next = null; } } static class SinglyLinkedList { public SinglyLinkedListNode head; public SinglyLinkedListNode tail; public SinglyLinkedList() { this.head = null; this.tail = null; } } public static void printSinglyLinkedList(SinglyLinkedListNode node, String sep, BufferedWriter bufferedWriter) throws IOException { while (node != null) { bufferedWriter.write(String.valueOf(node.data)); node = node.next; if (node != null) { bufferedWriter.write(sep); } } } // Complete the insertNodeAtHead function below. /* * For your reference: * * SinglyLinkedListNode { * int data; * SinglyLinkedListNode next; * } * */ static SinglyLinkedListNode insertNodeAtHead(SinglyLinkedListNode llist, int data) { SinglyLinkedListNode newNode = new SinglyLinkedListNode(data) ; if(llist == null) { llist = newNode; return llist; }else{ newNode.next = llist; return newNode; } } private static final Scanner scanner = new Scanner(System.in);
NerdX Thanks Man
ghoshabhinavjio u dont need these
if(llist == null) {
llist = newNode; return llist;
}just -
newNode.next = llist; return newNode;will do
apdebian can u please give the solution of "Insert a Node at the Tail of a Linked List
" using c.
shashi1iitk SinglyLinkedListNode* temp =(SinglyLinkedListNode*)malloc(sizeof(SinglyLinkedListNode)); temp->data = data; temp->next = llist;
return temp;
shubham1297kumar still not fixed
chhayaprakashj this code in c++ worked: -
SinglyLinkedListNode* insertNodeAtHead(SinglyLinkedListNode* llist, int data) {
//llist->next=NULL; SinglyLinkedListNode *temp=new SinglyLinkedListNode(data); if(llist==NULL){ return new SinglyLinkedListNode(data); } else{ temp->next=llist; temp->data=data; llist=temp; } return llist;}
peterparker Yes, because that's how the C++ class has been defined, which is expecting a constrcutor argument.
Very funny, I never like this hackerrank anways.
peterparker No, the C++ class has a constructor method, which is epxecting a data argument, and which also has method assigned to null pointer.
Suhasmv98 try this out:- SinglyLinkedListNode* insertNodeAtHead(SinglyLinkedListNode* llist, int data) { SinglyLinkedListNode* newnode = new SinglyLinkedListNode(data); if(llist==NULL){ llist= newnode; }else{ newnode->next = llist; llist = newnode; } return llist; }
vijaysaurabh1999 bro, you dont have to if and else condition, only else part will do. ..PLEASE CAN YOU TELL WHY TO PASS 'data' while allocating memory by 'new' function.
edrouwendaal In C# the same for not unsafe PrintSinglyLinkedList(llist->head, "\n", textWriter);
alex_ge999 Still not fixed yey
gmlike4 I am also facing the same issue.
Jagdeep_one7 [deleted]edrouwendaal @7jdeep, what do you mean? is that cpp?
Jagdeep_one7 [deleted]
zoher_ali Same for me.
sarahaarar98 yes that's right !
akashksinghal This is my answer and it works perfectly fine in C++:
SinglyLinkedListNode* insertNodeAtHead(SinglyLinkedListNode* llist, int data) { SinglyLinkedListNode* head=new SinglyLinkedListNode(data); head->next=llist; return head;
}
abhimanyuaj001 solution in py3
class Node: def __init__(self,data): self.data=data self.next=None class SinglyLinkedList: def __init__(self): self.head=None def insertNodeAtHead(llist, data): new=Node(data) if llist==None: llist=new else: new.next=llist llist=new return llist
Preethi1327 solution in py3
def insertNodeAtHead(llist, data): new_node = SinglyLinkedListNode(data) if llist == None: llist = new_node else: new_node.next = llist llist = new_node return llist
GustavK Uneditable code in C# doesn't compile as it is.
solution.cs(78,36): error CS0214: Pointers and fixed size buffers may only be used in an unsafe context solution.cs(78,36): error CS0193: The * or -> operator must be applied to a pointer Compilation failed: 2 error(s), 0 warnings
gags13_13 same issue
edordo This line in the uneditable code: PrintSinglyLinkedList(llist->head, "\n", textWriter);
Should be PrintSinglyLinkedList(llist.head, "\n", textWriter);
cristi92 how are we supposed to fix this? Are there any admins around here?
shivaaprs I am also facing the same issue. seems admnis are not looking into this.
inatan_hertzog I've the same issue too.
RupaMistry This issue is still not fixed. Not able to compile the code.
colber16 Issue is still not solved.
rohan17ghy Issue not fixed.
ccasbre27 Issue not fixed yet. Change the programming language to Java (is the same code than C#) and it will works
rohan17ghy Thanks for the response
Buliasz Yep, still not fixed. Sorry, C# is not liked here :(
xxDOOMbox same issue, i just had to write this one in c++ ...
anilkumarsindhe Same problem.! Getting Compilation Error :( "Check the compiler output. fix the eror and try again". Compile Message says solution.cs(88,36): error CS0214:Pointers and fixed size buffers may only be used in any unsafe context solution.cs(88,36): error CS0193: The * or -> operator must be applied to a pointer Compilation failed: 2 error(s), 0 warnings.
Coding language is : C#
rm_rudro Facing this issue not able to solve
neerajjethnani01 It gets compiled with Java.
EricGeek Have the same issue using C#. The error comes from line 93 which is not changeable. The main function should be executed in unsafe mode or not using pointer at all.
Silamoth I'm experiencing the same issue using C#
randomvi Try compiling with java
neerajjethnani01 Java works
BuckAMayzing Meh, just write it in C++ for now. It's just three lines of code.
Use SinglyLinkedListNode* on the left side of the assignment operator, and instead of head.next, use head-> next. This problem is simple enough that you can still implement it even if you don't understand C++.
It's still pretty ridiculous that it doesn't get looked at, though.
shai3 It's a year later and still no fix.
achrafawzi2000 Yes, the issue is still there!
SHWAUBH Your code did not pass this test case.
Input (stdin)
3 75 226 329 722 Your Output (stdout)
Right Answer! Expected Output
722 75 226 329 Compiler Message
Wrong Answer
Please assist me on this Weird error....
Node n = new Node(); n.data=x; n.next = head; return n;
This is my Code.......shuklayash We have to print the list in reverse order
bs436 solution.c: In function ‘main’: solution.c:111:36: error: ‘SinglyLinkedList {aka struct SinglyLinkedList}’ has no member named ‘headhead’; did you mean ‘head’? free_singly_linked_list(llist->headhead);
There is a typo in the default code and I cant edit it
PeaceMac Same thing is happening with me.
I think this bug is very recent and nobody else faced it before us!!
nicknickolaev Same here, it's obviously a typo. Nikolay
iammanoj0513 same error ...........for me also
thegirlnotknown same error!
16tucs228 sameeeee
srikarsunny444 Same here!
shubhamjain2810 it seems that this error is only in the code template for C language. This is why codes in other languages are running.
bejugamrevathi did anyone get the solution for this error
abdulrahimanbas1 same issue
vaibhav_verma261 issue isn't fixed yet...!!!
shrti_2018202010 yes same here
17131A05A3 yes same here!!!!
manikgoel_59 sme here
Manish061 same for me
CandidBihari [deleted]
king4sam990816 bug is still there...
CandidBihari WRITE #define headhead head, It will work
krishnasandeep01 thank u bro
krishnasandeep01 same error is showing to me also.
CandidBihari [deleted]
CandidBihari WRITE #define headhead head, It will work
maa_21shubham but we can't edit the code.So how to write #define headhead head????
CandidBihari yes, we can't edit the main function but do write what I have said earlier inside the insertNodeAtHead function.
sathesh2001 I am getting below error when I added #define
solution.cs(67,0): error CS1032: Cannot define or undefine preprocessor symbols after first token in file Compilation failed: 1 error(s), 0 warnings
Line which I added
static SinglyLinkedListNode insertNodeAtHead(SinglyLinkedListNode llist, int data) { #define headhead head
ev0rtex I had the same issue with the 'C' language version. I did what others suggested and added '#define headhead head' and that got it to pass fine but there is obviously an issue in need of correcting here.
esHack Node Insert(Node head,int x) {
Node node1 =new Node(); node1.data = x; node1.next= head; return node1;}
nish456 What is the Big O notation for this code? Does creating a pointer to the head of the list actually copy it all over again one by one? if not, is it constant time?
helluvamatt O(1) aka Constant time
You are not copying anything other than the pointer to the head node into the newly created node. Linked lists are not like arrays in that you don't have to copy elements to insert/delete elements.
VirajSingh19 We should also check if head == null then there we could write a different code like head= new Node();, head.data = data and finally return head and in the else part your code should be written?
go_st_go There is no need to. If head is null then the new head of the list will point to null (that means that it is the only node in the list).
Sort 511 Discussions, By:
Please Login in order to post a comment