MS in computer science. The specific question I was surprised about was a O(log (m+n)) algorithm for finding the median of the union of two sorted arrays. This is in-scope for elite leetcoders and similar. The code ChatGPT generated had some issues resulting in out of bounds array accesses. It also wasn't clear if the algorithm was the desired log(m+n) one or a simpler but inferior log(m) + log(n) one. Was the model was confused and blended parts of different approaches? Is that statement too anthropomorphic for a LLM?