Linked List problems

114 Linked List DSA practice problems on CampusCode, each with statement, examples and constraints.

• 297. Reverse a Linked List Easy Linked List
• 298. Find the Length of a Linked List Easy Linked List
• 299. Search for an Element in a Linked List Easy Linked List
• 300. Insert a Node at the Beginning Easy Linked List
• 301. Insert a Node at the End Easy Linked List
• 302. Insert a Node at a Given Position Easy Linked List
• 303. Delete a Node by Value Easy Linked List
• 304. Delete a Node by Position Easy Linked List
• 305. Find the Middle Node of a Linked List Easy Linked List
• 306. Detect a Cycle in a Linked List (Floyd's Algorithm) Easy Linked List
• 307. Check if Linked List is a Palindrome Easy Linked List
• 308. Remove Duplicates from Sorted Linked List Easy Linked List
• 309. Merge Two Sorted Linked Lists Easy Linked List
• 310. Count Occurrences of a Value in Linked List Easy Linked List
• 311. Convert Linked List to Array Easy Linked List
• 312. Convert Array to Linked List Easy Linked List
• 313. Print Linked List in Reverse (Recursive) Easy Linked List
• 314. Find the Nth Node from the End Easy Linked List
• 315. Remove Nth Node from End of List Easy Linked List
• 316. Delete Middle Node of Linked List Easy Linked List
• 317. Move Last Node to Front Easy Linked List
• 318. Find Sum of All Nodes in Linked List Easy Linked List
• 319. Check if Two Linked Lists are Identical Easy Linked List
• 320. Swap Nodes in Pairs Easy Linked List
• 321. Remove All Occurrences of a Given Value Easy Linked List
• 322. Segregate Even and Odd Nodes Easy Linked List
• 323. Count Nodes in a Loop (Cycle Length) Easy Linked List
• 324. Add 1 to a Number Represented as Linked List Easy Linked List
• 325. Find the Starting Point of a Cycle Easy Linked List
• 326. Reverse a Linked List Iteratively Easy Linked List
• 327. Reverse a Linked List Recursively Easy Linked List
• 328. Sort Linked List Using Bubble Sort Easy Linked List
• 329. Max Element in Linked List Easy Linked List
• 330. Min Element in Linked List Easy Linked List
• 335. Circular Linked List — Detect Easy Linked List
• 337. Remove Duplicates from Unsorted Linked List Easy Linked List
• 338. Concatenate Two Linked Lists Easy Linked List
• 339. Check if Linked List has Even or Odd Length Easy Linked List
• 340. Swap Data of Two Nodes without Swapping Pointers Easy Linked List
• 341. Rotate Linked List by K Places Easy Linked List
• 342. Delete Last Occurrence of a Given Value Easy Linked List
• 344. Point Arbit Pointer to Greatest Value Right Side Node Easy Linked List
• 347. Multiply Two Numbers Represented as Linked Lists Easy Linked List
• 348. Subtract Two Numbers Represented as Linked Lists Easy Linked List
• 349. XOR Linked List — Insert and Traverse Easy Linked List
• 350. Find Common Elements in Two Sorted Linked Lists Easy Linked List
• 351. Find the Fractional Node (Every Kth Node) Easy Linked List
• 352. Return Kth Node from Beginning Easy Linked List
• 353. Append the Last N Nodes to Beginning Easy Linked List
• 354. Identical Linked Lists Check (Recursive) Easy Linked List
• 355. Merge K Sorted Linked Lists Medium Linked List
• 356. Reverse Linked List in Groups of K Medium Linked List
• 357. Add Two Numbers (Linked List Addition) Medium Linked List
• 358. Add Two Numbers II (No Reverse Allowed) Medium Linked List
• 359. Sort Linked List (Merge Sort) Medium Linked List
• 360. Reorder List Medium Linked List
• 361. Odd Even Linked List Medium Linked List
• 362. Rotate List by K Places Medium Linked List
• 363. Partition List Around a Value X Medium Linked List
• 364. Remove Linked List Elements by Value Medium Linked List
• 365. Linked List Cycle II (Start of Cycle) Medium Linked List
• 366. Reverse Nodes in Even Length Groups Medium Linked List
• 367. Delete Nodes Having Greater Value on Right Medium Linked List
• 368. Segregate 0s, 1s, and 2s in a Linked List Medium Linked List
• 369. Swap Nodes (Not Data) at Two Given Positions Medium Linked List
• 370. Reverse a Sub-list from Position M to N Medium Linked List
• 371. Pairwise Swap of Nodes Medium Linked List
• 372. Rearrange Linked List — Negatives Before Positives Medium Linked List
• 373. Delete N Nodes After M Nodes Medium Linked List
• 374. Check if Linked List is Sorted Medium Linked List
• 375. Skip M Delete N Nodes Medium Linked List
• 376. Find Length of Loop in Linked List Medium Linked List
• 377. Remove Zero-Sum Consecutive Nodes Medium Linked List
• 378. Sort a Linked List of 0s, 1s and 2s by Changing Links Medium Linked List
• 379. Next Greater Node in Linked List Medium Linked List
• 380. Maximum Twin Sum of a Linked List Medium Linked List
• 381. Split Linked List in Parts Medium Linked List
• 382. Rearrange Linked List to Alternating Low-High Medium Linked List
• 383. Count Nodes Deleted (Greater Value on Right) Medium Linked List
• 384. Convert Binary Number in Linked List to Integer Medium Linked List
• 385. Double a Number Represented as a Linked List Medium Linked List
• 386. Swapping Nodes in a Linked List (Values) Medium Linked List
• 387. Middle of the Linked List Medium Linked List
• 388. Palindrome Linked List (O(1) Space) Medium Linked List
• 389. Remove Nodes From Linked List (Monotonic Stack) Medium Linked List
• 390. Minimum Nodes to Remove for K Groups Medium Linked List
• 391. Merge Two Sorted Lists — Recursive Approach Medium Linked List
• 392. Reverse Alternate K Nodes Medium Linked List
• 393. Remove Duplicates from Sorted List II Medium Linked List
• 394. Merge K Sorted Lists (Optimal — Min Heap) Hard Linked List
• 395. Reverse Nodes in K-Group (No Extra Space) Hard Linked List
• 396. Sort List in O(n log n) Time and O(1) Space Hard Linked List
• 397. Serialize and Deserialize Linked List Hard Linked List
• 398. Reverse Linked List in K-Groups (Reverse Remaining Too) Hard Linked List
• 399. Remove Duplicates from an Unsorted Linked List in O(n) Hard Linked List
• 400. Construct a Linked List from a 2D Matrix in Spiral Order Hard Linked List
• 401. Count Inversions via Merge Sort Hard Linked List
• 404. Merge M Sorted Lists of Variable Size Hard Linked List
• 405. Rearrange Linked List for In-Place Quicksort (Partition) Hard Linked List
• 406. Reverse a Linked List in Alternate Groups Hard Linked List
• 407. Sum of Two Numbers in Linked List Without Reverse Hard Linked List
• 408. Longest Palindrome in a Linked List Hard Linked List
• 409. Detect and Remove Loop — All Edge Cases Hard Linked List
• 410. Reorder List to Min-Max Interleaving Hard Linked List
• 411. Remove K Digits to Get Smallest Number (LL + Stack) Hard Linked List
• 413. Find Kth Largest Using a Linked List Min-Heap Hard Linked List
• 414. Partition Linked List into K Consecutive Groups Hard Linked List
• 415. Reverse Every Alternate Group of K Nodes Hard Linked List
• 416. Maximum Sum Path in Two Sorted Linked Lists Hard Linked List
• 630. Remove Nodes From Linked List Medium Stack
• 898. Flatten Binary Tree to Linked List Medium Trees
• 920. Convert Sorted List to BST Medium Trees
• 943. Linked List in Binary Tree Hard Trees
• 947. Convert BST to Sorted Doubly Linked List Hard Trees