Skip to content

Courses
- For Working Professionals
- For Students
- Programming Languages
- Web Development
- Machine Learning and Data Science
  - Complete Data Science Program(Live)
  - Mastering Data Analytics
- New Courses
- School Courses
  - CBSE Class 12 Computer Science
  - School Guide
- All Courses
Tutorials
- DSA
- Data Structures
- Algorithms
- System Design
  - System Design Tutorial
  - Software Design Patterns
- Interview Corner
- Languages
  - C
  - C++
  - Java
  - Python
  - JavaScript
  - PHP
  - C#
  - SQL
  - Scala
  - Perl
  - Go Language
  - Kotlin
- Web Development
  - HTML
  - CSS
  - JavaScript
  - PHP
  - CSS Frameworks
  - JavaScript Frameworks
  - JavaScript Libraries
  - WordPress
  - JSON
- School Learning
  - English Grammar
  - School Programming
  - Mathematics
  - CBSE Syllabus
  - Maths Notes (Class 8-12)
  - Maths Formulas (Class 8 -11)
  - NCERT Solutions
  - RD Sharma Solutions
  - Science Notes
  - Physics Notes (Class 8-12)
  - Chemistry Notes
  - Biology Notes
  - Social Science Syllabus
  - Social Science Notes
    - SS Notes (Class 7-12)
    - CBSE History Notes (Class 7-10)
    - CBSE Geography Notes (Class 7-10)
    - CBSE Civics Notes (Class 7-10)
      - Civics Class 7
      - Civics Class 8
  - Commerce
- ML & Data Science
  - Machine Learning
  - Data Science
- CS Subjects
- GATE
- GFG Sheets
  - Web Dev Cheat Sheets
  - Company-Wise SDE Sheets
  - DSA Sheets
- CS Exams/PSUs
  - ISRO
  - UGC NET
- Student
- UPSC
- SSC CGL
- Banking Exams
Jobs
Practice
Contests

Category Archives: Geometric

Convex Hull using Graham Scan

Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of… Read More

Convex Hull using Jarvis’ Algorithm or Wrapping

Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of… Read More

How to check if a given point lies inside or outside a polygon?

Given a polygon and a point ‘p‘, find if ‘p‘ lies inside the polygon or not. The points lying on the border are considered inside.… Read More

How to check if two given line segments intersect?

Given two line segments (p1, q1) and (p2, q2), find if the given line segments intersect with each other.Before we discuss the solution, let us… Read More

Geometric-Lines

Closest Pair of Points using Divide and Conquer algorithm

We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the… Read More

Closest Pair of Points

Divide and Conquer

Check whether a given point lies inside a triangle or not

Given three corner points of a triangle, and one more point P. Write a function to check whether P lies within the triangle or not.… Read More

Start Your Coding Journey Now!