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

Rahul Kumar Yadav

Rahul Kumar Yadav is pursing B. Tech and M. Tech in Computer Science from Jawaharlal Nehru University (JNU), New Delhi and is an Algorithms and Data Structure Developer, Intern at OpenGenus.

New Delhi •
11 posts •
Python

Interview Questions on NumPy

In this article, we have considered around 80 questions covering conceptual as well as practical foundations of NumPy to help you in dealing with arrays of homogeneous type.

Rahul Kumar Yadav
Algorithms

3D Kadane's algorithm

In this article we are going to learn about what kadane's algorithm is and will also see how to apply it on 3-dimensional arrays to generate a sub-cube with maximum sum of its elements (3D Kadane's algorithm).

Rahul Kumar Yadav
String Algorithms

Lexicographic next string

In this article, we are going to find the lexicographic next string for the given string.

Rahul Kumar Yadav
String Algorithms

Lexicographic rank of string

We will see what is the rank of the string in lexicographic order, for the words which can be made using all the characters of the given string and calculate using a string algorithm.

Rahul Kumar Yadav
String Algorithms

Find permutations of string in lexicographic order

In this article, we have presented an algorithm to Find permutations of string in lexicographic order. We have used the concept of Recursion.

Rahul Kumar Yadav
Decrease & Conquer

Fake Coin Problem

Fake coin problem is an interesting problem in which we have to find a fake coin out of a number of coins, which is assumed to be lighter than the real coins using just a balance scale, which can be used to compare the weights of two piles of coins.

Rahul Kumar Yadav
Greedy Algorithms

Fitting Shelves Problem [Greedy Algorithm]

In this article, we will understand what fitting shelves problem is and will see a greedy approach algorithm of solving this problem.

Rahul Kumar Yadav
divide and conquer

Find floor in sorted array

In this article, we are going to see various methods of finding the floor of a given number from a given sorted array. To solve this efficiently, the concept of Divide and Conquer / Binary Search is required.

Rahul Kumar Yadav
List of Mathematical Algorithms

Egyptian Fraction Problem [Greedy Algorithm]

In this article, we will explore the fascinating concept of Egyptian Fractions and will learn what they are and will also see an example of how they can be solved using greedy algorithm techniques.

Rahul Kumar Yadav
Algorithms

Examples of Hash Functions

In this article, we have listed several examples of good Hash Functions which you are used conveniently. This can be used to hash any data (numeric and string). Some examples are PJW hash, Division Hash, BUZ hash and much more.

Rahul Kumar Yadav
Algorithms

Separate chaining collision resolution technique

In this article, we are going to see how we can actually resolve the collisions which happen during hash mapping using Separate chaining collision resolution technique.

Rahul Kumar Yadav
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