String questions

`String.prototype.bold` returns a string wrapped in HTML `<b>` tags. Note that this method is deprecated and should not be used in modern applications. 

const str = 'hello';
const boldStr = str.bold();
console.log(boldStr); // '<b>hello</b>'

`String.prototype.link` creates an HTML `<a>` element wrapping the string, which is used to create hyperlinks. This method is deprecated and should not be used in modern applications. 

const str = 'Click here';
const linkedStr = str.link('https://example.com');
console.log(linkedStr); // '<a href="https://example.com">Click here</a>'

`String.prototype.fontcolor` returns a string wrapped in HTML `<font>` tags with a specified color. This method is deprecated and should not be used in modern applications. 

const str = 'hello';
const coloredStr = str.fontcolor('red');
console.log(coloredStr); // '<font color="red">hello</font>'

`String.prototype.fontsize` returns a string wrapped in HTML `<font>` tags with a specified size. This method is deprecated and should not be used in modern applications. 

const str = 'hello';
const sizedStr = str.fontsize(7);
console.log(sizedStr); // '<font size="7">hello</font>'

`String.prototype.anchor` creates an HTML `<a>` element wrapping the string with a specified name attribute. This method is deprecated and should not be used in modern applications. 

const str = 'Click here';
const anchoredStr = str.anchor('top');
console.log(anchoredStr); // '<a name="top">Click here</a>'

`String.prototype.small` returns a string wrapped in HTML `<small>` tags. This method is deprecated and should not be used in modern applications. 

const str = 'hello';
const smallStr = str.small();
console.log(smallStr); // '<small>hello</small>'

Use a hash map to count the frequency of each character, then iterate through the string to find the first character with a count of 1. For example, in 'swiss', the first non-repeating character is 'w'.

Use a dynamic programming approach to build a table that tracks palindromic substrings. For example, in 'babad', the longest palindromic substring is 'bab' or 'aba'.

Use dynamic programming to build a table where each cell represents the length of the longest common subsequence up to those indices. For example, for 'abcde' and 'aceb', the longest common subsequence is 'ace' with length 3.

Use a sliding window and hash maps to compare character counts. Slide the window across the string and check if the counts match. For example, in 'cbaebabacd' with pattern 'abc', the start indices of anagrams are 0 and 6.