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

Shubhankar Maurya

Shubhankar Maurya is pursuing B.Sc in Computer Science from KD College, Mumbai University. He is an Intern at OpenGenus.

Mumbai •
11 posts •
Algorithms

Find elements that appear more than N/3 times

In this article, we have solved the problem of finding elements that appear more than N/3 times. This involve ideas of Hash Map and Boyer Moore algorithm.

Shubhankar Maurya Shubhankar Maurya
Problems on Binary Tree

Boundary Traversal of Binary Tree

In this article, we have explored the approach of Boundary Traversal of Binary Tree along with Time and Space Complexity.

Shubhankar Maurya Shubhankar Maurya
List of Mathematical Algorithms

N-th root of a number

In this article, we have explained three different algorithms to find the N-th root of a number.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Find Cube root using Binary Search

In this article, we have explained the algorithm to Find Cube root using Binary Search along with Time and Space Complexity analysis.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Find starting point of loop in linked list

In this article, we have explored three different algorithmic techniques to find starting point of loop in linked list.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Data Structure for Spreadsheet / Excel

In this article, we have explored several Data Structures that are used in Spreadsheet / Excel Sheet. These involve ideas like Sparse Matrix, AVL Tree and much more.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Quick Sort with two pivots (Dual-Pivot)

Quick Sort is a Sorting Algorithm that takes a divide-and-conquer approach. We will be looking at how to do this while selecting two pivots points instead of one.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Dutch National Flag Problem

In this article, we have explored the Dutch National Flag Problem which is a standard Algorithmic Problem proposed by Edsger Dijkstra. It is solved efficiently using Three Way Partitioning technique.

Shubhankar Maurya Shubhankar Maurya
Time Complexity

Time and Space Complexity of Heap data structure operations

In this article, we have explored the Time and Space Complexity of Heap data structure operations including different cases like Worst, Average and Best case. At the end, we have added a table summarizes the complexities.

Shubhankar Maurya Shubhankar Maurya
Algorithms

Absolute value of Integer using Bitwise Operations

In this article, we have explained two approaches to find the Absolute value of Integer using Bitwise Operations namely Right shift, OR and XOR operations.

Shubhankar Maurya Shubhankar Maurya
Rust Programming

Different ways to terminate and pause program in Rust

Rust has multiple built-in ways to terminate the program, and every method has specific behavior whenever it's called. We're going to see how different functions in Rust (which we use to exit the program) act and how to use them.

Shubhankar Maurya Shubhankar Maurya
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