Algorithm to Remove a Interval from Segments
Given a sorted list of disjoint intervals, each interval intervals = represents the set of real numbers x such that a <= x < b. We remove the intersections …
Category: c / c++
Algorithm to Find the Winner on a Tic Tac Toe Game
Tic-tac-toe is played by two players A and B on a 3 x 3 grid. Here are the rules of Tic-Tac-Toe: Players take turns placing characters into empty squares …
How to Compute the Interval List Intersections using Two Pointer Algorithms?
Given two lists of closed intervals, each list of intervals is pairwise disjoint and in sorted order. Return the intersection of these two interval lists. (Formally, a closed interval …
How to Summary Ranges using O(N) Two Pointer Algorithm?
Given a sorted integer array without duplicates, return the summary of its ranges. Example 1: Input: Output: Explanation: 0,1,2 form a continuous range; 4,5 form a continuous range. Example …
Add Two Numbers by Two Linked List (most significant digit comes first)
ou are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contain a single digit. Add the two …