Search Results for: programming
Given a singly linked list node, return the value of the middle node. If there’s two middle nodes, then return the second one. Constraints n ≤ 100,000 where n …
You are given an integer k and a binary search tree root, where each node is either a leaf or contains 2 children. Find the node containing the value …
Given two sorted linked lists l0, and l1, return a new sorted linked list containing the intersection of the two lists. Constraints n ≤ 100,000 where n is the …
Given a string s, return the longest prefix of s that is not equal to s and exists as a suffix of s. Constraints n ≤ 100,000 where n …
Given two lowercase alphabet strings a and b, return the length of the longest anagram subsequence. Constraints n ≤ 100,000 where n is the length of a m ≤ …