Interview Preparation Strings - Revision history

Proj user14 at 09:01, 15 December 2016

2016-12-15T09:01:16Z

2016-12-12T10:42:15Z

‎More on Strings

2016-12-12T10:41:56Z

‎More on String

2016-12-12T03:32:48Z

‎Other frequently asked questions

2016-12-12T03:28:14Z

‎Other frequently asked questions

2016-12-12T03:18:40Z

‎Other frequently asked questions

2016-12-12T03:16:51Z

‎Other frequently asked questions

2016-12-12T03:11:15Z

‎Other frequently asked questions

2016-12-12T03:06:54Z

‎Other frequently asked questions

2016-12-12T03:05:30Z

‎Other frequently asked questions

← Older revision		Revision as of 09:01, 15 December 2016
Line 113:		Line 113:
	}		}

		+	</syntaxhighlight>
		+
		+	<BR/>
		+	== Convert numeric String to an int without using stoi function ==
		+
		+	<syntaxhighlight lang="c">
		+	int string_to_int(char *str)
		+	{
		+	int i = 0;
		+	int number = 0;
		+	/* Loop till end of string */
		+	while (str[i] != '\0')
		+	{
		+	if(str[i] >= '0' && str[i] <= '9') //Check if value is between number 0 to 9
		+	{
		+
		+	/*
		+	* If it is between 0 to 9 then calculate its numeric value.
		+	* Below value of str[i] is substracted from '0' to get exact numeric value of that numeric character.
		+	*/
		+	number = number*10 + str[i] - '0';
		+	}
		+	else
		+	{
		+	break;
		+
		+	}
		+	i++;
		+
		+	}
		+	return number;
		+
		+	}
	</syntaxhighlight>		</syntaxhighlight>

@@ Line 180: / Line 180: @@
 <BR/>
-== More on Strings ==
+== More on strings ==
 Strings are one-dimensional array of characters terminated by a null character '\0'. Thus a null-terminated string contains the characters that comprise the string followed by a null.
 The following declaration and initialization create a string consisting of the word "Hello". To hold the null character at the end of the array, the size of the character array containing the string is one more than the number of characters in the word "Hello."

@@ Line 180: / Line 180: @@
 <BR/>
-== More on String ==
+== More on Strings ==
 Strings are one-dimensional array of characters terminated by a null character '\0'. Thus a null-terminated string contains the characters that comprise the string followed by a null.
 The following declaration and initialization create a string consisting of the word "Hello". To hold the null character at the end of the array, the size of the character array containing the string is one more than the number of characters in the word "Hello."

@@ Line 594: / Line 594: @@
 White spaces: 2
 </syntaxhighlight>
-. Remove duplicate characters from a string
+. Program to remove all characters in second string that are present in first string.
 <syntaxhighlight lang="c">
+/*
 </syntaxhighlight>

@@ Line 522: / Line 522: @@
+     }
+}
 </syntaxhighlight>

@@ Line 458: / Line 458: @@
 rr occurs 2 times in prrrogram c prrrogramming
 </syntaxhighlight>
-. Program to find the Most/Least repeated character in the string
+. Program to find the frequency of every word in the string
 <syntaxhighlight lan="c">
 </syntaxhighlight>

@@ Line 413: / Line 413: @@
 CAB
 </syntaxhighlight>
-. Occurence of a word
+. Program To Count the Occurence of a Substring in String

← Older revision		Revision as of 03:05, 12 December 2016
Line 363:		Line 363:
	C gnimmargorP ssalC		C gnimmargorP ssalC
	</syntaxhighlight>		</syntaxhighlight>
		+	2. Program to print all permutations of a string
		+	<syntaxhighlight lang="c">
		+
		+	/* Function to swap values at two pointers */
		+	void swap(char x, char y)
		+	{
		+	char temp;
		+	temp = *x;
		+	x = y;
		+	*y = temp;
		+	}
		+
		+	/* Function to print permutations of string
		+	This function takes three parameters:
		+	1. String
		+	2. Starting index of the string
		+	3. Ending index of the string.
		+	*/
		+
		+	void permute(char *a, int l, int r)
		+	{
		+	int i;
		+	if (l == r)
		+	printf("%s\n", a);
		+	else
		+	{
		+	for (i = l; i <= r; i++)
		+	{
		+	swap((a+l), (a+i));
		+	permute(a, l+1, r);
		+	swap((a+l), (a+i)); //backtrack
		+	}
		+	}
		+	}
		+
		+	int main()
		+	{
		+	char str[] = "ABC";
		+	int n = strlen(str);
		+	permute(str, 0, n-1);
		+	return 0;
		+	}
		+	OUTPUT:
		+	ABC
		+	ACB
		+	BAC
		+	BCA
		+	CBA
		+	CAB
		+	</syntaxhighlight>
		+	3.