Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Create Closest pair of points - Geometrical Algorithms #485

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

sahanihit
Copy link


Description 📜

  • Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context.
  • Fixes # <issue_number_here>

Type of change 📝

  • Code
  • Documentation (Content Creation in the form of codes or tutorials)
  • Notes (Handwritten notes, cheatsheets, presentations, mind-maps)
  • Web Dev Projects
  • Others (If you choose other, Please mention changes below)

Programming Language

  • C#
  • C++
  • Python
  • Java
  • Javascript
  • Others

Domain of Contribution 📊

  • Introduction
  • Data Structures
  • Algorithms
  • Competitive Programming
  • Mathematics
  • Bit Magic
  • Recursion
  • Arrays
  • Searching
  • Sorting
  • Matrix
  • Hashing
  • String
  • Linked List
  • Stacks
  • Queue
  • Deque
  • Tree
  • Binary Search Tree
  • Heap
  • Graph
  • Greedy
  • Backtracking
  • Dynamic Programming
  • Trie
  • Segment Tree
  • Disjoint Set
  • Others

Checklist ✅

  • I follow Contributing Guidelines & Code of conduct of this project.
  • I have performed a self-review of my own code or work.
  • I have commented my code, particularly in hard-to-understand areas.
  • My changes generates no new warnings.

Screenshots / Gif (Optional) 📸


Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant