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

Aravind Mohandas

Aravind Mohandas is a Master's student at Indian Institute of Technology, Ropar with B.Sc in Computer Science from Christ University, Bangalore. He is an intern at OpenGenus.

Bengaluru, Karnataka, India •
11 posts •
Algorithms

0-1 Knapsack problem using Branch and Bound

In this article, we have explored the Branch and Bound algorithm for 0-1 Knapsack problem.

Aravind Mohandas Aravind Mohandas
Algorithms

Branch and Bound Technique

With this article, you have explained the idea of Branch and Bound Technique, types of Branch and Bound Technique and applications of the technique.

Aravind Mohandas Aravind Mohandas
Algorithms

De Bruijn Sequences

In this article, we have explored De Bruijn Sequences and 3 algorithms to calculate De Bruijn Sequences using ideas like Hamiltonian Cycle, Euler's path.

Aravind Mohandas Aravind Mohandas
Time Complexity

Recurrence Tree Method for Time Complexity

In this article, we have explored Recurrence Tree Method for calculating Time Complexity of different algorithms.

Aravind Mohandas Aravind Mohandas
computational geometry

Art Gallery Problem

In this article, we have explored Art Gallery Problem in depth along with variants of Art Gallery Problem and important results.

Aravind Mohandas Aravind Mohandas
computational geometry

Check if 4 Line Segments form a Rectangle

In this article, we will solve the problem of Check if 4 Line Segments form a Rectangle. This is a core problem of Computational Geometry.

Aravind Mohandas Aravind Mohandas
Time Complexity

Time and Space Complexity of Circular Linked List

In this article, we have explored Time and Space Complexity of Circular Linked List. We have covered different cases like Worst Case, Average Case and Best Case.

Aravind Mohandas Aravind Mohandas
Algorithms

3 Way Partitioning Quick Sort

In this article, we have explored 3 Way Partitioning Quick Sort in depth. This is relatively faster than 2 way Quick Sort (Normal version) in practical applications.

Aravind Mohandas Aravind Mohandas
Algorithms

Three Way Partitioning

In this article, we have explored Three Way Partitioning technique which is used in Three Partition Quicksort and Dutch National Flag Algorithm.

Aravind Mohandas Aravind Mohandas
Algorithms

Josephus Problem

In this article, we have explored and solved Josephus Problem in depth which is a Standard Problem in Computer Science. We have presented two solutions to Josephus Problem.

Aravind Mohandas Aravind Mohandas
C++

Different ways to initialize List in C++ STL

In this article, we have explained Different ways to initialize List in C++ STL including Initializing list with elements of another list, using a vector or array and much more.

Aravind Mohandas Aravind Mohandas
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