Skip to content
#

algorithms-datastructures

Here are 744 public repositories matching this topic...

This repository contains all the questions asked in ACM-ICPC. This will act as a reference for geeks who are going to participate in ACM-ICPC. Anybody can provide solutions to the given problems. Solutions in different languages is encouraged. Changes will be updated after checking the complexity and approach. #Best Solutions.

  • Updated Aug 15, 2019

The Closest Pair of Points problem is a computational geometry problem in which the task is to find the two points in a set of points in a plane that are closest to each other. The solution to this problem has numerous applications in areas such as computer graphics, geographic information systems, and pattern recognition.

  • Updated Feb 8, 2023
  • Kotlin

Improve this page

Add a description, image, and links to the algorithms-datastructures topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the algorithms-datastructures topic, visit your repo's landing page and select "manage topics."

Learn more