Linked List problems

120 Linked List problems on CampusCode, in order. Open any for its full statement, examples and constraints.

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