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.

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).

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).