Freaks City

set_intersection The set_intersection algorithm computes the intersection of two sorted ranges. It returns the end of the output range. #include <iostream> #include <vector> #include <algorithm> void display(int value) { std::cout << value << " "; } int main() { std::vector<int> first = {1 ...

Finding the Kth Node from the End of a Linked List To locate the kth node from the end efficient, use two pointers—fast and slow. Advance the fast pointer by k steps first. Then move both pointers forward until fast reaches the end. At this point, slow will be pointing to the desired node. int kthToLast(struct ListNode* head, int k) { struc ...