Stack C/C++ Programs

Remove minimum number of characters so that two strings become anagram Given two strings in lowercase, the task is to make them anagram . The only allowed operation is to remove a character from any string. Find minimum number of characters to be deleted to make both the strings anagram? If two strings contains same data set in any order then strings are called Anagrams . Examples : Input : str1 = "bcadeh" str2 = "hea" Output: 3 We need to remove b, c and d from str1. Input : str1 = "cddgk" str2 = "gcd" Output: 2 Input : str1 = "bca" str2 = "acb" Output: 0 // C++ implementation to count number of deletions // required from two strings to create an anagram #include <bits/stdc++.h> using namespace std; const int CHARS = 26; int countDeletions(string str1, string str2) { int arr[CHARS] = {0}; for ( int i = 0; i < str1.length(); i++) ...

[03 Aug 2020] Check if a Number is Odd or Even using Bitwise Operators

August 09, 2020

Given a number N , the task is to check whether the number is even or odd using Bitwise Operators . Examples: Input: N = 11 Output: Odd Input: N = 10 Output: Even Using Bitwise XOR operator : The idea is to check whether last bit of the number is set or not. If last bit is set then the number is odd, otherwise even. As we know bitwise XOR Operation of the Number by 1 increment the value of the number by 1 if the number is even otherwise it decrements the value of the number by 1 if the value is odd. Below is the implementation of the above approach: // C++ program to check for even or odd // using Bitwise XOR operator #include <iostream> using namespace std; // Returns true if n is even, else odd bool isEven( int n) { // n^1 is n+1, then even, else odd if (n ^ 1 == n + 1) return true ; ...

Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum.

February 25, 2020

Subset Sum Problem | DP-25 Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum. Example: Input: set[] = {3, 34, 4, 12, 5, 2}, sum = 9 Output: True //There is a subset (4, 5) with sum 9. // A recursive solution for subset sum problem #include <stdio.h> // Returns true if there is a subset of set[] with sun equal to given sum bool isSubsetSum( int set[], int n, int sum) { // Base Cases if (sum == 0) return true ; if (n == 0 && sum != 0) return false ; // If last element is greater than sum, then ignore it if (set[n-1] > sum) return isSubsetSum(set, n-1, sum); /* else, check if sum...

rakeshkp2006

Algorithm Learning