Try it on GfG Practice Given a linked list of size n where each node has two links: next pointer pointing to the next node and random pointer to any random node in the list. The task is to create a clone of this linked list. Table of Content [Naive Approach - 1] Using Hashing - O(2n) Time and O(2n)…

Try it on GfG Practice Given a Singly linked list containing n nodes. The task is to reverse every group of k nodes in the list. If the number of nodes is not a multiple of k then left-out nodes, in the end, should be considered as a group and must be reversed. Example: Input: head: 1 -> 2 -> 3 -> 4…

Given a Doubly linked list containing n nodes. The task is to reverse every group of k nodes in the list. If the number of nodes is not a multiple of k then left-out nodes, in the end should be considered as a group and must be reversed. Examples: Input: 1 <-> 2 <-> 3 <-> 4 <-> 5 <-> 6 <-> NULL, k =…

Given two linked lists, the task is to check whether the first list is present in 2nd list or not. Examples: Input: list1 = 10->20, list2 = 5->10->20 Output : Yes Explanation: 5 -> 10 -> 20 Input: list1 = 1->2, list2 = 1->2->1->2->3->4 Output: Yes Explanation: 1 -> 2 -> 1 -> 2 -> 3 -> 4 Input: list1…

Try it on GfG Practice Given a Binary Tree (BT), the task is to convert it to a Doubly Linked List (DLL) in place. The left and right pointers in nodes will be used as previous and next pointers respectively in converted DLL. The order of nodes in DLL must be the same as the order of the given…

What is LRU Cache? Cache replacement algorithms are efficiently designed to replace the cache when the space is full. The Least Recently Used (LRU) is one of those algorithms. As the name suggests when the cache memory is full, LRU picks the data that is least recently used and removes it in order…

Try it on GfG Practice Given two singly linked lists that merge into a single Y-shaped list. The two lists initially have distinct paths but eventually converge at a common node, forming a Y-shape, the task is to find and return the node where the two lists merge. Intersection Point of two Linked…

Try it on GfG Practice Given a Binary Tree, convert it to a Circular Doubly Linked List (In-Place). The left and right pointers in nodes are to be used as previous and next pointers respectively in the converted Circular Linked List.The order of nodes in the List must be the same as in Inorder for…

There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around the circle in a fixed direction. In each step, a certain number of people are skipped and the next person is executed. The elimination proceeds around the circle…

Try it on GfG Practice Given a doubly-linked list, the task is to rotate the linked list counter-clockwise by p nodes. Here p is a given positive integer and is smaller than the count of nodes in the linked list. Examples: Input: Output: Explanation: After rotating the list by p = 2, the new head…

Given an unsorted doubly linked list containing n nodes, the task is to remove duplicate nodes while preserving the original order. Examples: Input: Doubly Linked List = 1 <-> 2 <-> 3 <-> 2 <-> 4 Output: Doubly Linked List = 1 <-> 2 <-> 3 <-> 4 Removal of duplicate node 2 from Doubly Linked List…

Menu Back to Explore Page

Try it on GfG Practice Given a pointer to a node to be deleted, delete the node. Note that we don’t have a pointer to the head node. Examples: Input: list = 10 -> 20 -> 4 -> 30, delNode = 20 Output: 10 -> 4 -> 30 Explanation: Node with value 20 is deleted. Input: list = 1 -> 2, delNode = 1 Output: 2…

Try it on GfG Practice Given a sorted doubly linked list of positive distinct elements, the task is to find pairs in a doubly-linked list whose sum is equal to the given value x in sorted order. Examples: Input: Output: (1, 6), (2,5) Explanation: We can see that there are two pairs (1, 6) and (2, 5)…

Try it on GfG Practice Given a Sorted Doubly Linked List in (non-decreasing order) and an element x, the task is to insert the element x into the correct position in the Sorted Doubly Linked List. Example: Input: LinkedList = 3<->5<->8<->10<->12 , x = 9 Output: 3<->5<->8<->9<->10<->12 Explanation:…

Try it on GfG Practice Given a doubly linked list, The task is to sort the doubly linked list in non-decreasing order using merge sort. Examples: Input: 10 <-> 8 <-> 4 <-> 2 Output: 2 <-> 4 <-> 8 <-> 10 Input: 5 <-> 3 <-> 2 Output: 2 <-> 3 <-> 5 Note: Merge sort for a singly linked list has already…

Try it on GfG Practice You have a browser of one tab where you start on the homepage and you can visit another URL, get back in the history number of steps or move forward in the history number of steps. The task is to design a data structure and implement the functionality of visiting a URL…

Try it on GfG Practice Given a Circular linked list. The task is split into two Circular Linked lists. If there are an odd number of nodes in the given circular linked list then out of the resulting two halved lists, the first list should have one node more than the second list. Examples: Input:…

Try it on GfG Practice Given an unsorted linked list containing n nodes, the task is to remove duplicate nodes while preserving the original order. Examples: Input: 12 -> 11 -> 12 -> 21 -> 41 -> 43 -> 21 Output: 12 -> 11 -> 21 -> 41 -> 43 Explanation: The second occurrence of 12 (the one after 11)…

Try it on GfG Practice Given a linked list sorted in non-decreasing order. Return the list by deleting the duplicate nodes from the list. The returned list should also be in non-decreasing order. Example: Input : Linked List = 11->11->11->21->43->43->60 Output : 11->21->43->60 Explanation: Remove…

Try it on GfG Practice Given the head of a linked list. The task is to find the length of the loop in the linked list. If the loop is not present return 0. Examples: Input: head: 1 → 2 → 3 → 4 → 5 → 2 Output: 4 Explanation: There exists a loop in the linked list and the length of the loop is 4.…

Try it on GfG Practice Given a singly linked list, check if the linked list has a loop (cycle) or not. A loop means that the last node of the linked list is connected back to a node in the same list. Examples: Input: head: 1 -> 3 -> 4 -> 3 Output: true Input: head: 1 -> 8 -> 3 -> 4 -> NULL Output:…

Try it on GfG Practice Given a singly linked list, the task is to swap linked list elements pairwise. Examples: Input : 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> NULL Output : 2 -> 1 -> 4 -> 3 -> 6 -> 5 -> NULL Input : 1 -> 2 -> 3 -> 4 -> 5 -> NULL Output : 2 -> 1 -> 4 -> 3 -> 5 -> NULL Table of Content…

Try it on GfG Practice Given a Doubly Linked List, the task is to reverse the Doubly Linked List. Examples: Input: Doubly Linked List = 1 <-> 2 <-> 3 -> NULL Doubly Linked List Output: Reversed Doubly Linked List = 3 <-> 2 <-> 1 -> NULL Reversed Doubly Linked List Input: Doubly Linked List = 1…

Try it on GfG Practice Deleting a node in a doubly linked list is very similar to deleting a node in a singly linked list. However, there is a little extra work required to maintain the links of both the previous and next nodes. In this article, we will learn about different ways to delete a node in…

Given a singly linked list, the task is to convert it into a circular linked list. Examples: Input: head: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> NULL Output: Explanation: Singly linked list is converted to circular by pointing last node to head. Input: head: 2 -> 4 -> 6 -> 8 -> 10 -> 12 -> NULL Output:…

Given Circular linked list exchange the first and the last node. The task should be done with only one extra node, you can not declare more than one extra node, and also you are not allowed to declare any other temporary variable. Note: Extra node means the need of a node to traverse a list.…

루마니아의 극우 대통령 후보 칼린 제오르제스쿠의 지지자들이 헌법재판소 앞에서 시위를 벌이고 있다. /사진=로이터/뉴스1 2025.02.07 15:52 The Atlantic 9min 서리 얹은 소나무가 얼어붙은 호수를 에워싸고 있다. 눈이 내리고, 배경에는 은은한 음악이 흐른다. 호숫가에 인상 좋은 백발의 남성이 서 있다. 그가 옷을 벗기 시작한다. 자신의 신앙을 증명하고, 과학, 기술, 현대성에 맞서는 신념을 입증하기 위해 이 얼음물에서 수영을 하겠다고 그는 말한다. "난 페이스북도, 인터넷도, 어느 누구도 필요 없다. 단지 내…

2025.02.07 15:53 Washington Post 5min 에곤 실레, <두 그루의 나무가 있는 강 풍경>, 1913, Oil on canvas, Private Collection 실레의 인물화처럼 그의 풍경화도 대개 아름답지는 않으며 대신 인상이 강렬하다. 그의 비극적으로 짧은 생애 중―이 오스트리아 화가는 1918년 28세의 나이로 독감에 걸려 죽었다― 실레는 비교적 일찍 자연의 목가적인 장면이나 소박한 마을 풍경을 그리는 것에서 벗어나, 가을의 앙상한 나무와 시든 꽃, 건물로 가득하지만 사람은 거의 보이지 않는 도시…

This animation of Rick was made with 240 lines of code. No libraries, no images. I’m going to show you how to use GPU shaders and signed distance fields to make animations like it for videos, video games, or just for fun! I even built a live coding editor into the page so you can see the examples…

The C++ final keyword is a powerful tool that prevents class inheritance and virtual function overriding. While primarily used to enforce design constraints, final can also influence compiler optimizations and program performance. What is final in C++? The C++ final specifier was introduced in C++11…

Although the C and C++ languages provide facilities for localization, the default locale is the so-called “C” locale, which barely understands anything. In the “C” locale, the uppercase characters are “A” through “Z“; the lowercase characters are “a” through “z“, the decimal separator is “.“, and…

A customer wanted to log exceptions that emerged from a function, so they used the WIL scope_exit object to specify a block of code to run during exception unwinding. void DoSomething() { auto logException = wil::scope_exit([&] { Log("DoSomething failed", wil::ResultFromCaughtException()); }); ⟦ do…

Last time, we tried to create a generic insertion iterator but ran into trouble because our iterator failed to satisfy the iterator requirements of default constructibility and assignability. We ran into this problem because we stored the lambda as a member of the iterator. So let’s not do that!…

The Millennium Bridge. Photo by Richard Watkins LRPS. It's one of the most striking of the Thames bridges, and definitely one of our favourites. Here's everything you need to know about the Millennium Bridge. 1. It's a winner The Millennium Bridge was the result of a 1996 competition held by…

This laser marks the line's path through Greenwich Park Ever trekked up to the Royal Observatory in Greenwich to stand on the Meridian line? You wasted your time — there are plenty of other places around London and beyond where the course of the Meridian line is marked in some way. What is the…

지하철을 타고 노원역에서 내려 버스로 갈아타고 종점에서 내렸다. 104(백사) 마을 입구 풍경은 작년 가을과 별다르지 않다. 그사이 재개발에 관해 뭔가 진척이 없어 보인 다. ​ ​ ​ ​ 오른쪽 길을 따라가다가 화분이 가득 놓여있는 부동산 옆 골목으로 들어간다. 강아지가 짖지 않고 빤히 쳐다본다. ​ ​ ​ ​ 낡은 담장이 이어지는 좁은 골목을 걸어간다. 메마른 호박넝쿨이 걸려있다. 지난여름 피었던 고운 호박꽃이 떠오른다. ​ ​ ​ ​ ​ 좁은 골목을 빠져나와 골목 시장을 걸어간다. 토요일 아침 골목 시장에는 오가는 사람도…

Astronomy & Observing News By: Bob King February 5, 2025 0 Get Articles like this sent to your inbox By submitting this form, you are consenting to receive marketing emails from: . You can revoke your consent to receive emails at any time by using the SafeUnsubscribe® link, found at the bottom of…

“I have got to make everything that has happened to me good for me,” Oscar Wilde wrote from prison. “There is not a single degradation of the body which I must not try and make into a spiritualising of the soul.” The cruel kindness of life is that our sturdiest fulcrum of transformation is the…