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

Sourajeet Mohanty

Intern at OpenGenus | B. Tech student at College of Engineering and Technology, Bhubaneswar | Interested in Competitive programming and Blockchain

Khorda, Orissa, India •
9 posts •
Algorithms

Breadth first search (BFS)

Breadth first search (BFS) is one of the most used graph traversal techniques where nodes at the same level are traversed first before going into the next level. Queue is used internally in its implementation.

Sourajeet Mohanty Sourajeet Mohanty
Algorithms

Fundamentals of Euler path in Graph Theory

In this article, we have explored the basic ideas/ terminologies to understand Euler Path and related algorithms like Fleury's Algorithm and Hierholzer's algorithm.

Sourajeet Mohanty Sourajeet Mohanty
Algorithms

Pairs whose sum is divisible by a given number

In this article, we explored how we can find the number of pairs whose sum is divisible by a given number K. This can be done using brute force approach in O(N^2) time but an efficient approach can reduce it to O(N) time.

Sourajeet Mohanty Sourajeet Mohanty
Algorithms

2 Sum Problem: Number of pairs with a given sum

We will find out how we can count the number of pairs in an array whose sum is equal to a certain number. Brute force approaches will take O(N^2) time but we can solve this in O(N) time using a Hash Map.

Sourajeet Mohanty Sourajeet Mohanty
Algorithms

Number of ways to pair elements

In this article, we are going to discuss about element pairing problem where we need to find the number of ways a set of elements can be pair or kept separate. This can be solved using Dynamic Programming in linear time O(N).

Sourajeet Mohanty Sourajeet Mohanty
Software Engineering

Hashing in C++ using std::hash

In this article, we will cover how hashing is natively supported in C++ through STL (std:hash) and how we can use it to generate hash of any object in C++.

Sourajeet Mohanty Sourajeet Mohanty
Algorithms

Finding number of pairs with a certain XOR value

In this article, we are going to find the number of pairs in an unsorted array, whose XOR values matches with our target value (say K). Using our efficient approach (with Hash map), we can solve this in O(N) time complexity while the brute force approach takes O(N^2) time complexity

Sourajeet Mohanty Sourajeet Mohanty
Software Engineering

Map vs Multimap in C++ STL

The only difference between map and multimap in C++ is that map can only store unique key-value pairs while is multimap, no key value pair is unique.

Sourajeet Mohanty Sourajeet Mohanty
Software Engineering

Different ways to initialize unordered_map in C++

In this article, we are going to learn about Unordered_map in C++ and specifically how to initialize them in our code in 4 different ways.

Sourajeet Mohanty Sourajeet Mohanty
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