Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Algebra

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Excel

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

Given a singly linked list, write a function to swap elements pairwise.Input : 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;6-&gt;NULL&nbsp; Output : 2-&gt;1-&gt;4-&gt;3-&gt;6-&gt;5-&gt;NULL Start from the head node and traverse the list. While traversing swap data of each node with its next node’s data. Pairwise swap elements of a given linked list : <a href="https://www.geeksforgeeks.org/pairwise-swap-elements-of-a-given-linked-list/">https://www.geeksforgeeks.org/pairwise-swap-elements-of-a-given-linked-list/</a>

Pairwise swap elements of a given linked list

Two Linked Lists are identical when they have the same data and the arrangement of data is also the same. For example, Linked lists a (1-&gt;2-&gt;3) and b(1-&gt;2-&gt;3) are identical. . Write a function to check if the given two linked lists are identical.To identify if two lists are identical, we need to traverse both lists simultaneously, and while traversing we need to compare data.Identical Linked Lists: <a href="https://www.geeksforgeeks.org/identical-linked-lists/">https://www.geeksforgeeks.org/identical-linked-lists/</a>

Identical Linked Lists

Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which is in increasing order. SortedMerge() should return the new list. The new list should be made by splicing together the nodes of the first two lists.For example if the first linked list a is 5-&gt;10-&gt;15 and the other linked list b is 2-&gt;3-&gt;20, then SortedMerge() should return a pointer to the head node of the merged list 2-&gt;3-&gt;5-&gt;10-&gt;15-&gt;20. Merge two sorted linked lists : <a href="https://www.geeksforgeeks.org/merge-two-sorted-linked-lists/">https://www.geeksforgeeks.org/merge-two-sorted-linked-lists/</a>

Merge two sorted linked lists

Write a function that takes a list sorted in non-decreasing order and deletes any duplicate nodes from the list. The list should only be traversed once.&nbsp; For example if the linked list is 11-&gt;11-&gt;11-&gt;21-&gt;43-&gt;43-&gt;60 then removeDuplicates() should convert the list to 11-&gt;21-&gt;43-&gt;60.Remove duplicates from a sorted linked list: <a href="https://www.geeksforgeeks.org/remove-duplicates-from-a-sorted-linked-list/">https://www.geeksforgeeks.org/remove-duplicates-from-a-sorted-linked-list/</a>

Remove duplicates from a sorted linked list

Circular linked list is a linked list where all nodes are connected to form a circle. There is no NULL at the end. A circular linked list can be a singly circular linked list or doubly circular linked list.Advantages of Circular Linked Lists:1) Any node can be a starting point. We can traverse the whole list by starting from any point. We just need to stop when the first visited node is visited again.2) Useful for implementation of queue. Unlike this implementation, we don’t need to maintain two pointers for front and rear if we use circular linked list. We can maintain a pointer to the last inserted node and front can always be obtained as next of last.Circular Linked List _ Set 1: <a href="https://www.geeksforgeeks.org/circular-linked-list/">https://www.geeksforgeeks.org/circular-linked-list/</a>

Circular Linked List | Set 1 (Introduction and Applications)

Given pointer to the head node of a linked list, the task is to reverse the linked list. We need to reverse the list by changing the links between nodes.Examples:Input: Head of following linked list&nbsp; 1-&gt;2-&gt;3-&gt;4-&gt;NULL&nbsp; Output: Linked list should be changed to,&nbsp; 4-&gt;3-&gt;2-&gt;1-&gt;NULL&nbsp;Reversing a linked list : <a href="https://www.geeksforgeeks.org/reverse-a-linked-list/">https://www.geeksforgeeks.org/reverse-a-linked-list/</a>

Reversing a linked list

Write a function detectAndRemoveLoop() that checks whether a given Linked List contains a loop and if the loop is present then removes the loop and returns true. If the list doesn’t contain a loop then it returns false.&nbsp;The below diagram shows a linked list with a loop. detectAndRemoveLoop() must change the below list to 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;NULL.Detect and Remove Loop in a Linked List &nbsp;: <a href="https://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/">https://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/</a>&nbsp;

Detect and Remove Loop in a Linked List (Explained in Hindi)

Traverse the list one by one and keep putting the node addresses in a Hash Table. At any point, if NULL is reached then return false, and if the next of the current nodes points to any of the previously stored nodes in &nbsp;Hash then return true. Have a visited flag with each node. Traverse the linked list and keep marking visited nodes. If you see a visited node again then there is a loop. This solution works in O(n) but requires additional information with each node. A variation of this solution that doesn’t require modification to basic data structure can be implemented using a hash, just store the addresses of visited nodes in a hash and if you see an address that already exists in hash then there is a loop.&nbsp;Detection of Loop in a Linked List : <a href="https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/">https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/</a>

Detection of Loop in a Linked List (Explained In Hindi)

Write a C function to insert a new value in a sorted Circular Linked List (CLL).Allocate memory for the newly inserted node and put data in the newly allocated node. Let the pointer to the new node be new_node. After memory allocation, following are the three cases that need to be handled. &nbsp;Sorted insert for circular linked list: <a href="https://www.geeksforgeeks.org/sorted-insert-for-circular-linked-list/">https://www.geeksforgeeks.org/sorted-insert-for-circular-linked-list/</a>

Sorted insert for circular linked list

Write a function detectAndCountLoop() that checks whether a given Linked List contains loop and if loop is present then returns count of nodes in loop. For example, the loop is present in below-linked list and length of the loop is 4. If the loop is not present, then the function should return 0.Find the length of loop in linked list : <a href="https://www.geeksforgeeks.org/find-length-of-loop-in-linked-list/">https://www.geeksforgeeks.org/find-length-of-loop-in-linked-list/</a>

Find the length of loop in linked list

Given a singly linked list, delete the middle of the linked list. For example, if the given linked list is 1-&gt;2-&gt;3-&gt;4-&gt;5 then the linked list should be modified to 1-&gt;2-&gt;4-&gt;5If there are even nodes, then there would be two middle nodes, we need to delete the second middle element. For example, if given linked list is 1-&gt;2-&gt;3-&gt;4-&gt;5-&gt;6 then it should be modified to 1-&gt;2-&gt;3-&gt;5-&gt;6. If the input linked list is NULL, then it should remain NULL.If the input linked list has 1 node, then this node should be deleted and a new head should be returned.Delete middle of linked list: <a href="https://www.geeksforgeeks.org/delete-middle-of-linked-list/">https://www.geeksforgeeks.org/delete-middle-of-linked-list/</a>

Delete middle of linked list

Given a singly linked list of 0s and 1s find its decimal equivalent.&nbsp; Input &nbsp;: 0-&gt;0-&gt;0-&gt;1-&gt;1-&gt;0-&gt;0-&gt;1-&gt;0 &nbsp; Output : 50 &nbsp;&nbsp; Input &nbsp;: 1-&gt;0-&gt;0 &nbsp; Output : 4Decimal Equivalent of Binary Linked List : <a href="https://www.geeksforgeeks.org/decimal-equivalent-of-binary-linked-list/">https://www.geeksforgeeks.org/decimal-equivalent-of-binary-linked-list/</a>

Decimal Equivalent of Binary Linked List