OA on Codility\nRound 1->\nfirst Interviewer discussed about  my current work which i explained clearly, got two coding questions\n\nI was asked  to write the code on codility \nQ1. merge two sorted array  without extra space\n\n-explained and coded the logic and code was working fine\n\nQ2- find the distance between any two given node in a Binary TREE (GFG HARD)\n-created the tree and nodes, was writing the logic , could not complete the code as time up\n\nRound 2->\nQ1->Interviewer gave me Wildcard Matching question Leetcode Hard\n-I was not sure about the solution hence i asked to move on to the next question\n\nQ-2 find unique element in array of elements , all elements are repeated twice except the unique element\n-I explained all possible methods\nfollow up questions ->what if the array is sorted \n i explained binary search logic as well and coded , initially code was compiling but not giving the correct output , but i fixed the code and it was working fine\n \n Interviewer asked me to change the name of variables with appropriate names which i did\n \n Suggestions-> practice more Leetcode Hard Questions, if you ignore Leetcode Hard then somone will get the job\n \n Verdict -Rejected\n

OA on Codility\nRound 1->\nfirst Interviewer discussed about  my current work which i explained clearly, got two coding questions\n\nI was asked  to write the c