A guide to detecting collisions between a circle and a line or line segment.
Also find me here:
Baeldung Author
Said Sryheni
I am a backend JEE developer specialized in technologies like Spring and Hibernate with +3 years of experience. I have been an ICPC competitive programmer using C++ for +5 years. You can check my ICPCID on https://icpc.baylor.edu/ICPCID/VHOFJ5IO88M4
Here's what I've written (so far):
Hashing a Tree Structure
Filed under Trees
Learn how to build a hash function for a tree structure.
Count the Number of Set Bits in an Integer
Filed under Algorithms
Have a look at a few different approaches and algorithms for counting the number of set bits in an integer.
Finding the Number of Occurrences of a Subsequence in a String
Filed under Searching
Learn how to find the number of subsequences of a string
Searching in a Sorted and Rotated Array
Filed under Algorithms, Math and Logic
A quick overview of the most efficient way to find an integer in a sorted rotated array.
Finding the Only Unpaired Element in the Array
Filed under Algorithms, Searching
Understand the problem of finding the only unpaired element in an array, and a few approaches to solve it.
Finding Maximum Size Square in a Matrix Filled With Ones
Filed under Algorithms, Graphs
Learn how to find the maximum square size filled with ones in a matrix that contains only zeros and ones.
The Most Efficient Way to Implement an Integer Based Power Function
Filed under Algorithms, Math and Logic
Learn about different ways to implement an integer-based power function and compare their efficiency.
Finding the Next Smaller Element for Each Element in an Array
Filed under Algorithms, Math and Logic
Learn a few algorithms for finding the next smaller element for each element in an array.
Algorithms to Check If a Number Is a Power of 2
Filed under Algorithms, Math and Logic
Understand the problem of verifying if a number is a power of two, and a few ways to approach it.