×
Home Discussions Write at Opengenus IQ
×
  • About
  • Track your progress
  • Deep Learning Projects
  • Python Projects
  • Join our Internship 🎓
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

S Sudharshan

4 posts •
Dynamic Programming (DP)

Interleaving String [Solved]

The Interleaving Strings problem is a classical dynamic programming problem that involves whether a string can be formed by interleaving two strings. In this article, we'll explore this problem in depth and provide a C++ implementation using dynamic programming.

S Sudharshan
Algorithms

Generating IP Addresses [Backtracking String problem]

In this article, we will explore a common problem of restoring IP addresses from a given string of digits. For example, given the string "25525511135", the valid IP addresses that can be generated are "255.255.11.135" and "255.255.111.35".

S Sudharshan
bitwise algorithm

Find the rightmost set bit in a number (+ toggle it)

Finding the rightmost set bit in a number is a common problem in computer science and is used in many applications, from competitive programming to low-level programming and data compression. In this article, we will explore various techniques to find the rightmost set bit in a number.

S Sudharshan
C++

5 Different ways to initialize Set in C++ STL

Set in C++ STL is a powerful data structure to maintain unique objects in sorted order. There are 5 different ways to initialize a set in C++ which we have covered in depth with C++ code examples.

S Sudharshan
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter