Ttykuu

Extreme, but not acceptable situation and I can't start the work tomorrow morning

Symmetry in quantum mechanics

Are white and non-white police officers equally likely to kill black suspects?

Information to fellow intern about hiring?

Could Giant Ground Sloths have been a Good Pack Animal for the Ancient Mayans

Weird behaviour when using querySelector

New order #4: World

Prime joint compound before latex paint?

How to answer pointed "are you quitting" questioning when I don't want them to suspect

Lied on resume at previous job

OA final episode explanation

When blogging recipes, how can I support both readers who want the narrative/journey and ones who want the printer-friendly recipe?

How to create a consistant feel for character names in a fantasy setting?

Need help identifying/translating a plaque in Tangier, Morocco

How can I add custom success page

What is the meaning of "of trouble" in the following sentence?

Does a dangling wire really electrocute me if I'm standing in water?

Why was the "bread communication" in the arena of Catching Fire left out in the movie?

Can produce flame be used to grapple, or as an unarmed strike, in the right circumstances?

Pristine Bit Checking

What does "enim et" mean?

Landlord wants to switch my lease to a "Land contract" to "get back at the city"

How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?

extract characters between two commas?

Hackerrank Beautiful Strings

Output strings from a set in lexicographical orderHackerrank Gem StonesGiven two strings, a and b, determine the minimum number of character deletions required to make a and b anagramsCamelCase word countSuper Reduced StringBeautiful Binary StringHackerrank: Sherlock and anagramHackerrank “Strings: Making Anagrams” Javascript SolutionStrings: Making AnagramsMorgan and a String HackerRank challenge

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

0

$begingroup$

Problem Statement

You are given a string, S , consisting of lowercase English letters.

A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.

Find and print the number of different strings that are beautiful with respect to S.

Input Format

A single string of lowercase English letters denoting S.

Output Format

Print the number of different strings that are beautiful with respect
to S.

Sample Input

abba

Sample Output

4

Explanation

The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.

This gives us our set of unique beautiful strings, B = ab, ba, aa,
bb as |B| = 4, we print 4

Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.

function beautifulStrings(str) 
 const res = new Set()

 for (let i = 0; i < str.length - 1; i++) 
 for (let j = i + 1; j < str.length; j++) 
 let s = str.split('')
 s[i] = undefined
 s[j] = undefined
 res.add(s.join(''))
 
 

 return res.size

javascript programming-challenge dynamic-programming

share|improve this question

edited 43 mins ago

Alex

1,333419

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485

$endgroup$

add a comment | 

0

$begingroup$

Problem Statement

You are given a string, S , consisting of lowercase English letters.

A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.

Find and print the number of different strings that are beautiful with respect to S.

Input Format

A single string of lowercase English letters denoting S.

Output Format

Print the number of different strings that are beautiful with respect
to S.

Sample Input

abba

Sample Output

4

Explanation

The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.

This gives us our set of unique beautiful strings, B = ab, ba, aa,
bb as |B| = 4, we print 4

Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.

function beautifulStrings(str) 
 const res = new Set()

 for (let i = 0; i < str.length - 1; i++) 
 for (let j = i + 1; j < str.length; j++) 
 let s = str.split('')
 s[i] = undefined
 s[j] = undefined
 res.add(s.join(''))
 
 

 return res.size

javascript programming-challenge dynamic-programming

share|improve this question

edited 43 mins ago

Alex

1,333419

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485

$endgroup$

add a comment | 

$begingroup$

Problem Statement

You are given a string, S , consisting of lowercase English letters.

A string is beautiful with respect S to if it can be derived from S by removing exactly 2 characters.

Find and print the number of different strings that are beautiful with respect to S.

Input Format

A single string of lowercase English letters denoting S.

Output Format

Print the number of different strings that are beautiful with respect
to S.

Sample Input

abba

Sample Output

4

Explanation

The following strings can be derived by removing characters from S:
ab, bb, ba, ab, ba, aa and bb.

This gives us our set of unique beautiful strings, B = ab, ba, aa,
bb as |B| = 4, we print 4

Here is my solution but it's not using dynamic programming. I am not getting any hints about how it can be solved via a DP approach.

function beautifulStrings(str) 
 const res = new Set()

 for (let i = 0; i < str.length - 1; i++) 
 for (let j = i + 1; j < str.length; j++) 
 let s = str.split('')
 s[i] = undefined
 s[j] = undefined
 res.add(s.join(''))
 
 

 return res.size

javascript programming-challenge dynamic-programming

share|improve this question

edited 43 mins ago

Alex

1,333419

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485

$endgroup$

function beautifulStrings(str) 
 const res = new Set()

 for (let i = 0; i < str.length - 1; i++) 
 for (let j = i + 1; j < str.length; j++) 
 let s = str.split('')
 s[i] = undefined
 s[j] = undefined
 res.add(s.join(''))
 
 

 return res.size

share|improve this question

edited 43 mins ago

Alex

1,333419

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485

share|improve this question

edited 43 mins ago

Alex

1,333419

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485

edited 43 mins ago

Alex

1,333419

edited 43 mins ago

Alex

1,333419

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485

asked 55 mins ago

Rajat SaxenaRajat Saxena

1485