Search Results

10 matches found for 'merge'

Merge Intervals

Problem Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].

February 13, 2019

Merge k sorted linked lists

... self.val = x # self.next = None Approach Normally when we think about merge sort, we usually only consider two linked lists. Given that the two linked lists are sorted, merging two linked lists is quite inexpensive -- we can achieve this in linear time complexity.

February 9, 2019

Merging Sorted Linked Lists

... ll3.layout(); Problem Given two sorted singly-linked lists, merge the lists Input L1 - pointer to the HEAD of the first linked list L2 - pointer to the HEAD of the second linked list Approach This algorithm is quite basic but it is a building block to other trickier linked list algorithms.

January 24, 2019

Git the Essentials

... 30e0ccb Polish contract Save and quit with :wq. Merging Scenario: I want to merge this remote branch R into my current branch. git merge <branch R> Scenario: I got some merge conflicts after I tried to merge.

May 17, 2017

Algorithm Handbook

... another attractive divide-and-conquer sorting algorithm. Interview Advice 1: Split merge sort into two functions - one for diving an array into subarrays and another for the merge operation.

June 18, 2017

B-Trees vs. LSM Trees

B-Trees Modern databases are typically represented as B-Trees or LSM Trees (Log structured merge trees). B-trees are "tried and true" data structures that are popular in database usage, most notably SQL databases.

March 14, 2018

Algorithm Interview Problems

Welcome This page contains solutions to common interview problems that may be encountered. Arrays Longest Substring Without Repeating Characters Rotate a 2D Matrix Buy/Sell Two Stocks Merge Intervals Next Permutation Random Permutation Replace all occurrences of a space with a string Linked Lists Reversing sublists of singly linked lists Cycles in singly linked lists Overlapping singly linked lists Merging two sorted singly linked lists Merge k sorted lists Recursion Counting the path of sums Money Denominations Phone Number Mnemonics Unique Permutation Dynamic Programming Perfect Squares Find the Maximum Min Path Binary Trees Tree Symmetry Iterative In-Order Traversal of a Binary Tree Construct a Binary Tree from Pre-Order Traversal and In-Order Traversal BST Validate a BST Binary Heaps Merge k sorted lists Graphs Find a path in a maze from start to finish Flip colors in a matrix Search Search in a rotated sorted array Find the Duplicate Number Greedy Algorithms Queue Reconstruction By Height Trie Build a Trie in Python Invariant Compute the max.

January 25, 2019

A primer on MapReduce

... is also known as folding or aggregation. The idea of reduce is to accumulate values, or merge them together. For example, if I want to add a total of a list of numbers in Javascript: const INITIAL_TOTAL = 0 [0, 1, 2, 3].

July 11, 2020

Sharding User IDs of Celebrities

... JMomona761, JMomoa762, and so on, we would need to do a read query on all partitions and merge the data. As a consequence, there will be added latency and total roundtrip times when a user wants to fetch JMomoa76's posts.

January 15, 2022

Local Secondary Index vs. Global Secondary Index

... that when you need to do reads based on the eyes field, you need to query all partitions and merge all of the results back to the requester; this can be an expensive and time-consuming operation.

January 15, 2022