Скачать с ютуб Deletion and Reverse in Circular Linked List | GeekForGeeks | Problem of the Day в хорошем качестве

Deletion and Reverse in Circular Linked List | GeekForGeeks | Problem of the Day

Given a Circular Linked List. The task is to delete the given node, key in the circular linked list, and reverse the circular linked list. Note: You don't have to print anything, just return head of the modified list in each function. Examples: Input: Linked List: 2-5-7-8-10, key = 8 Output: 10-7-5-2 Explanation: After deleting 8 from the given circular linked list, it has elements as 2, 5, 7, 10. Now, reversing this list will result in 10, 7, 5, 2. Input: Linked List: 1-7-8-10, key = 8 Output: 10-7-1 Explanation: After deleting 8 from the given circular linked list, it has elements as 1, 7,10. Now, reversing this list will result in 10, 7, 1. Expected Time Complexity: O(n) Expected Auxillary Space: O(1) #geeksforgeeks #problemoftheday #education #computerscience #coding #array #sorting #sorts #sort #datastructure #algorithmicproblemsolving #algorithms #algorithm #dynamicprogramming #dp #potd #gfg #binarytree #binarysearchtree #bst #string #dictionary #python #stack #queue #python #c++ #interview Table of Contents 0:00 Problem Statement 0:35 Solution - Deletion 4:25 Solution - Reverse 7:30 Pseudo Code - Deletion 12:47 Pseudo Code - Reverse 14:59 Code - Python 17:19 Code - C++