✅ 4ms || Simple || C++ || Easy
\n```\n  ListNode deleteDuplicates(ListNode head) \n    {\n        if(!head || !head->next)\n        {\n            return head;\n        }\n        \n        i
\n```\n  ListNode* deleteDuplicates(ListNode* head) \n    {\n        if(!head || !head->next)\n        {\n            return head;\n        }\n        \n        int x=head->val;\n        int y=head->next->val;\n        \n        if(x!=y)\n        {\n            head->next=deleteDuplicates(head->next);\n        }\n        else\n        {\n            while(head && x==head->val)\n            {\n                head=head->next;\n            }\n           return deleteDuplicates(head);\n        }\n     \n        return head;\n    }\n\t
['Recursion', 'C']