InterviewBit Problems   Partition List : Unsolved

About the Partition List : Unsolved category (1)
Test Case is wrong1 (2)
What is the problem with it (1)
Quite small using double pointers (1)
Using vectors in c++ (2)
Quite a stupid question we can use extra memory should be mentioned (2)
Easy python Wenja solution (1)
Unable to find error in the code (1)
Is the test case correct (2)
Why is this code showing runtime error? (1)
Why TLE(partially correct ) at O(n)?(short code) (2)
Getting Segmentation Fault for the most trivial case (1)
Wrong testcase its checking for absolute order (4)
TLE error on submission (2)
Explain the logic (2)
Read question carefully ,language is bit deceptive (1)
Expected output gives wrong result (4)
Solution is correct still it shows incorrect output (2)
I had done the problem in O(n) ,then why ,my code is giving TLE (3)
Partitions question not clear (2)
Wrong input in partition list problem (1)
No printout if seg fault (1)
Is the implementation of check function wrong? (3)
Improvement offer ( in order to make this problem less straightforward ) (1)
I think there is a wrong test case (1)
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x (1)
There seems to be a bug in the Question/Testcases, You did not clearly define wh (2)
Unable to test or submit . Please look into it (1)
Is the example correct? the question states 'all nodes less than x come before no (3)