×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

Manas Hira

Associate Professor of Computer Science at IIEST, Shibpur | B. Tech + M. Tech from IIT Kharagpur (1991)

Howrah, India •
9 posts •
Algorithms

Check if given point is inside a convex polygon

In this post, we discuss how to check if a given point is inside a convex polygon using the Graham scan algorithm and list application areas for the solution.

Erick Lumunge
Algorithms

Consistent Hashing

Consistent Hashing is a distributed hashing scheme that operates independently of the number of servers in a distributed hash table.

Mohd Ehtesham Uddin Qureshi Mohd Ehtesham Uddin Qureshi
Algorithms

List of Randomized Algorithms

In this article, we have listed several important Randomized Algorithms such as Fisher Yates shuffle, Minimum Cut with Karger's, Matrix Product Verification and many more.

Joe Gorst Joe Gorst
computational geometry

Number of integral points between two points

In this post, we solve an algebraic geometrical problem using programming whereby we find the number of integral points between two given two points.

Erick Lumunge
Algorithms

Simple closed path in a set of points

In this article, we have explored an insightful approach/ algorithm to find a simple closed path in a set of points. This is an important concept in the field of computational geometry.

Rohan Chandrashekar Rohan Chandrashekar
Algorithms

Klee's algorithm (Union of Line Segments)

In this article, we will dive deep into Klee's algorithm and understand it better. Klee's algorithm is used to find the union of overlapping line segments when projected on a line.

Sanjana Babu
System Design

System Design of Google Search

We have explored the System Design of Google Search and the hardware infrastructure, technologies and strategies that makes Google Search return results from Millions of webpages in a fraction of a second.

Kirti Singh
Algorithms

Parallel Merge Sort

In this post, we discuss various approaches used to adapt a sequential merge sort algorithm onto a parallel computing platform. We have presented 4 different approaches of Parallel Merge Sort.

Erick Lumunge
Algorithms

Fruit into Baskets

In this article, we have explained how to solve Fruit into Baskets problem efficiently using the idea of Sliding Window.

Akash Ilangovan
OpenGenus IQ © 2025 All rights reserved â„¢
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship