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

Vansh Pratap Singh

Tough times don't last, tough people do. =)

India •
11 posts •
Algorithms

Lomuto Partition Scheme

We have explained the Lomuto partition scheme, which is used in the famous Quicksort algorithm. It is an algorithm to partition an array into two parts based on a given condition.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Why O(1) time complexity does not exist? + Memory Model

We have taken an in-depth look at the operations or algorithms that have a constant time in terms of asymptotic notation of time complexities. Is O(1) really a practical way of representing the time complexity of certain algorithms/ operations?

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Recursive Backtracking

Backtracking is one of the many algorithmic techniques that can be used to solve various problems. In this article, we will exploring the idea of backtracking with the help of recursion (Recursive Backtracking) along with examples as well.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Comparison using bitwise operations

We have explored the idea of making comparisons (equal, larger, smaller) through bitwise operations along with the basic idea of bitwise operations and their examples.

Vansh Pratap Singh Vansh Pratap Singh
Software Engineering

Introduction to OpenGL

We have introduced and explored the world of OpenGL and some topics that are related to it like what is OpenGL?, What is GLEW?, What is GLFW?, Shaders in OpenGL, Rendering Pipeline, Stages of Rendering Pipeline and Advantages of OpenGL.

Vansh Pratap Singh Vansh Pratap Singh
Approximation Algorithm

Probabilistic / Approximate Counting [Complete Overview]

We have introduced and explored the idea of Probabilistic algorithms in depth with the different algorithms like Morris Algorithm, HyperLogLog, LogLog and others in this domain.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Remove K digits to make smallest number

We will be solving the problem of removing K digits from a given number to form the smallest number possible without changing the order of the original number. We will use the idea of Monotonic Stack

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Number of Substrings with distinct characters

We have explored various algorithms that will help us in determining the number of substrings that a string can have with distinct characters.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Time and Space Complexity of Bucket Sort

We have explained the Time and Space Complexity analysis of Bucket Sort along with its algorithm, space complexity and time complexity for worst case, average case and best case.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Least frequent element in an array

Given an array of N elements, our task is to find the least frequent element present in it. In this article, we are going to talk about 3 methods to solve this problem along with their implementation.

Vansh Pratap Singh Vansh Pratap Singh
Algorithms

Xiaolin Wu's Line Drawing Algorithm

Xiaolin Wu's Line Drawing Algorithm is a recognized Line Drawing Algorithm in Computer Graphics which is used to produce Anti-aliased lines. In this article, we have explored this in depth.

Vansh Pratap Singh Vansh Pratap Singh
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