Learn how to find three elements in an array such that the sum is closest to a given number.
Also find me here:
Baeldung Author
Gang Wu
Gang Wu has over 15 years of experience as a software developer in multiple industries. He is proficient in software design and implementation with various programming languages, such as Java, C++, C#, etc. For the past five years, he has been working on web applications with Java technologies. When he is not writing code, he enjoys playing games and watching movies with his family.
Here's what I've written (so far):
Calculate the Number of Binary Search Trees with N Distinct Elements
Filed under Algorithms, Graphs
Learn how to calculate the number of possible binary trees from the number of nodes.
Number of Nodes in a Binary Tree With Level N
Filed under Graph Traversal
Learn how to calculate the minimum and maximum number of nodes in binary trees
Print All Paths With a Given Sum in a Binary Tree
Filed under Graph Traversal, Trees
Learn how to construct a binary tree path sum sequence in linear time
Polynomial Addition and Multiplication Using Linked List
Filed under Data Structures, Math and Logic
Learn how to represent a polynomial with the linked list data structure.
Serialize and Deserialize a Binary Tree
Filed under Graph Theory, Trees
Learn algorithms to serialize and deserialize a binary tree
Comparison Between Uniform-Cost Search and Dijkstra’s Algorithm
Filed under Path Finding
Learn how to use both Dijkstra’s algorithm and the uniform-cost search algorithm to find the shortest paths between vertices in a graph
String Similarity Metrics – Edit Distance
Filed under Algorithms, Artificial Intelligence
Learn about the ways to quantify the similarity of strings
Algorithms to Check If a Linked List is a Circular Linked List
Filed under Algorithms, Data Structures
Learn two linear-time algorithms that can check if a linked list is a circular linked list
How to Reverse a Linked List
Filed under Algorithms, Programming
Have a look at the algorithm for reversing a linked list.