×
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
Yash Kedia

Yash Kedia

Intern at OpenGenus | Student at Jaypee Institute of Information Technology, Noida

Uttar Pradesh, India •
3 posts •
Algorithms

Smallest Palindrome greater than N using the same set of digits

We are given an number and we have to find the smallest pallindrome number greater than N which can be formed by using the same set of digits as in N. We have solved this using a Greedy approach in linear time.

Yash Kedia Yash Kedia
Algorithms

Closest string such that no two consecutive characters are same

We are given a string and we have to find the closest string such that no two characters in the string are same. This problem can be solved using a simple greedy approach which will take linear time O(N) and constant space O(1).

Yash Kedia Yash Kedia
Software Engineering

Writing to a File in C++

In this article, we have explored the way to write to a file in C++ in depth and explored opening and closing a file, appending data to the front of a file and appending data to end of a file (default).

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