C/C++ Programs

Comments

  1. Blogger15 March 2020 at 05:33

    https://www.geeksforgeeks.org/zigzag-or-diagonal-traversal-of-matrix/

    ReplyDelete

Post a Comment

Popular posts from this blog

[11 Feb 2020] Remove minimum number of characters so that two strings become anagram

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++)  ...
Read more

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.

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...
Read more

[17 Feb 2020] Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side.

Find the nearest smaller numbers on left side in an array Given an array of integers, find the nearest smaller number for every element such that the smaller element is on left side. Examples: Input:  arr[] = {1, 6, 4, 10, 2, 5} Output:         {_, 1, 1,  4, 1, 2} First element ('1') has no element on left side. For 6, there is only one smaller element on left side '1'. For 10, there are three smaller elements on left side (1, 6 and 4), nearest among the three elements is 4. Input: arr[] = {1, 3, 0, 2, 5} Output:        {_, 1, _, 0, 2} Expected time complexity is O(n). // C++ implementation of efficient algorithm to find // smaller element on left side #include <iostream> #include <stack> using namespace std;   // Prints smaller elements on left side of every element void printPrevSmaller(int arr[], int n) {     // Create an empty stack     stack<int> S;   ...
Read more