The following asteroid collision problem is from Leetcode. The problem We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning right, negative meaning left). Each asteroid moves at the same speed. Find out the state of the asteroids after all collisions. If two...

## Basic shapes collision detection without complicated maths

This article demonstrates the collision between square, circle, and points using Android Kotlin. We will focus on the programming aspect rather than using complicated mathematical equations. A video tutorial is at the end of the article. Two rectangle collision Using complicated math for rectangle collision is not always necessary. Java and Kotlin offer a convenient way to detect the collision...