Freaks City

Swapping Nodes in Pairs Problem: Given a linked list, swap every two adjacent nodes and return the modified list. You must not modify the values in the nodes, only the nodes themselves. The key approach involves careful pointer manipulation and the use of a temporray node to preserve references. We'll use a dummy node to simplify the edge ca ...

Pairwise Node Swapping To swap adjacent nodes in pairs, we utilize a dummy node to simplify edge cases. The core idea involves manipulating pointers to reverse each pair while maintaining proper linkage with the rest of the list. A cursor pointer tracks the predecessor of each pair being processed. The termination condition varies based on whet ...

1. Valid Anagram Given two strings s and t, determine if they are anagrams — i.e., contain the exact same characters with the same frequencies. Since characters are constrained to lowercase English letters, a fixed-size integer array of length 26 suffices for counting frequencies. public boolean checkAnagram(String text1, String text2) { i ...

24. Swap Nodes in Pairs Problem Link: LeetCode 24 Solution: This problem involves swapping adjacent nodes in a linked list in pairs. A dummy head node simplifies edge case handling, such as when the list has only one or two nodes. struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(nullptr) {} }; class Soluti ...