Items also occurs in a set Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Stone Game One FourHackerRank “Manasa and Stones” in PythonArranging words in sentences alphabeticallyThe Thirsty CrowHackerrank > Woman's CodeSprint 2 > stone division, Revisited ( recursive function)Hackerrank “Strings: Making Anagrams” Javascript SolutionStrings: Making AnagramsLeetCode “Jewels and Stones”: counting certain characters in a stringMr. Muffin's ball-passing gameSum of two numbers in array

How could a hydrazine and N2O4 cloud (or it's reactants) show up in weather radar?

First Component in PCA

By what mechanism was the 2017 UK General Election called?

Is there night in Alpha Complex?

An isoperimetric-type inequality inside a cube

First paper to introduce the "principal-agent problem"

Any stored/leased 737s that could substitute for grounded MAXs?

Does the universe have a fixed centre of mass?

Searching extreme points of polyhedron

Marquee sign letters

Vertical ranges of Column Plots in 12

Why not use the yoke to control yaw, as well as pitch and roll?

How to achieve cat-like agility?

calculator's angle answer for trig ratios that can work in more than 1 quadrant on the unit circle

Why is there so little support for joining EFTA in the British parliament?

Why do C and C++ allow the expression (int) + 4*5?

draw a pulley system

Where did Ptolemy compare the Earth to the distance of fixed stars?

Did any compiler fully use 80-bit floating point?

.bashrc alias for a command with fixed second parameter

Does a random sequence of vectors span a Hilbert space?

Does the main washing effect of soap come from foam?

Is honorific speech ever used in the first person?

Was the pager message from Nick Fury to Captain Marvel unnecessary?



Items also occurs in a set



Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Stone Game One FourHackerRank “Manasa and Stones” in PythonArranging words in sentences alphabeticallyThe Thirsty CrowHackerrank > Woman's CodeSprint 2 > stone division, Revisited ( recursive function)Hackerrank “Strings: Making Anagrams” Javascript SolutionStrings: Making AnagramsLeetCode “Jewels and Stones”: counting certain characters in a stringMr. Muffin's ball-passing gameSum of two numbers in array



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








0












$begingroup$


The task




You're given strings J representing the types of stones that are
jewels, and S representing the stones you have. Each character in S
is a type of stone you have. You want to know how many of the stones
you have are also jewels.



The letters in J are guaranteed distinct, and all characters in J and
S are letters. Letters are case sensitive, so "a" is considered a
different type of stone from "A".



Example 1:



Input: J = "aA", S = "aAAbbbb" Output: 3



Example 2:



Input: J = "z", S = "ZZ" Output: 0



Note:



S and J will consist of letters and have length at most 50. The
characters in J are distinct.




My functional solution



const findNumberOfJewels = (j,s) => [...s].reduce((num, x) => [...j].includes(x) ? num + 1 : num , 0);

console.log(findNumberOfJewels("aA", "aAAbbbb"));


My imperative solution



function findNumberOfJewels2(j,s) 
let res = 0;
const set = new Set(j);
for (const x of s)
if (set.has(x)) ++res;

return res;
;

console.log(findNumberOfJewels2("aA", "aAAbbbb"));








share









$endgroup$


















    0












    $begingroup$


    The task




    You're given strings J representing the types of stones that are
    jewels, and S representing the stones you have. Each character in S
    is a type of stone you have. You want to know how many of the stones
    you have are also jewels.



    The letters in J are guaranteed distinct, and all characters in J and
    S are letters. Letters are case sensitive, so "a" is considered a
    different type of stone from "A".



    Example 1:



    Input: J = "aA", S = "aAAbbbb" Output: 3



    Example 2:



    Input: J = "z", S = "ZZ" Output: 0



    Note:



    S and J will consist of letters and have length at most 50. The
    characters in J are distinct.




    My functional solution



    const findNumberOfJewels = (j,s) => [...s].reduce((num, x) => [...j].includes(x) ? num + 1 : num , 0);

    console.log(findNumberOfJewels("aA", "aAAbbbb"));


    My imperative solution



    function findNumberOfJewels2(j,s) 
    let res = 0;
    const set = new Set(j);
    for (const x of s)
    if (set.has(x)) ++res;

    return res;
    ;

    console.log(findNumberOfJewels2("aA", "aAAbbbb"));








    share









    $endgroup$














      0












      0








      0





      $begingroup$


      The task




      You're given strings J representing the types of stones that are
      jewels, and S representing the stones you have. Each character in S
      is a type of stone you have. You want to know how many of the stones
      you have are also jewels.



      The letters in J are guaranteed distinct, and all characters in J and
      S are letters. Letters are case sensitive, so "a" is considered a
      different type of stone from "A".



      Example 1:



      Input: J = "aA", S = "aAAbbbb" Output: 3



      Example 2:



      Input: J = "z", S = "ZZ" Output: 0



      Note:



      S and J will consist of letters and have length at most 50. The
      characters in J are distinct.




      My functional solution



      const findNumberOfJewels = (j,s) => [...s].reduce((num, x) => [...j].includes(x) ? num + 1 : num , 0);

      console.log(findNumberOfJewels("aA", "aAAbbbb"));


      My imperative solution



      function findNumberOfJewels2(j,s) 
      let res = 0;
      const set = new Set(j);
      for (const x of s)
      if (set.has(x)) ++res;

      return res;
      ;

      console.log(findNumberOfJewels2("aA", "aAAbbbb"));








      share









      $endgroup$




      The task




      You're given strings J representing the types of stones that are
      jewels, and S representing the stones you have. Each character in S
      is a type of stone you have. You want to know how many of the stones
      you have are also jewels.



      The letters in J are guaranteed distinct, and all characters in J and
      S are letters. Letters are case sensitive, so "a" is considered a
      different type of stone from "A".



      Example 1:



      Input: J = "aA", S = "aAAbbbb" Output: 3



      Example 2:



      Input: J = "z", S = "ZZ" Output: 0



      Note:



      S and J will consist of letters and have length at most 50. The
      characters in J are distinct.




      My functional solution



      const findNumberOfJewels = (j,s) => [...s].reduce((num, x) => [...j].includes(x) ? num + 1 : num , 0);

      console.log(findNumberOfJewels("aA", "aAAbbbb"));


      My imperative solution



      function findNumberOfJewels2(j,s) 
      let res = 0;
      const set = new Set(j);
      for (const x of s)
      if (set.has(x)) ++res;

      return res;
      ;

      console.log(findNumberOfJewels2("aA", "aAAbbbb"));






      javascript algorithm programming-challenge functional-programming ecmascript-6





      share












      share










      share



      share










      asked 1 min ago









      thadeuszlaythadeuszlay

      997616




      997616




















          0






          active

          oldest

          votes












          Your Answer






          StackExchange.ifUsing("editor", function ()
          StackExchange.using("externalEditor", function ()
          StackExchange.using("snippets", function ()
          StackExchange.snippets.init();
          );
          );
          , "code-snippets");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "196"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217870%2fitems-also-occurs-in-a-set%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















          draft saved

          draft discarded
















































          Thanks for contributing an answer to Code Review Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217870%2fitems-also-occurs-in-a-set%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          名間水力發電廠 目录 沿革 設施 鄰近設施 註釋 外部連結 导航菜单23°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.7113923°50′10″N 120°42′41″E / 23.83611°N 120.71139°E / 23.83611; 120.71139計畫概要原始内容臺灣第一座BOT 模式開發的水力發電廠-名間水力電廠名間水力發電廠 水利署首件BOT案原始内容《小檔案》名間電廠 首座BOT水力發電廠原始内容名間電廠BOT - 經濟部水利署中區水資源局

          Prove that NP is closed under karp reduction?Space(n) not closed under Karp reductions - what about NTime(n)?Class P is closed under rotation?Prove or disprove that $NL$ is closed under polynomial many-one reductions$mathbfNC_2$ is closed under log-space reductionOn Karp reductionwhen can I know if a class (complexity) is closed under reduction (cook/karp)Check if class $PSPACE$ is closed under polyonomially space reductionIs NPSPACE also closed under polynomial-time reduction and under log-space reduction?Prove PSPACE is closed under complement?Prove PSPACE is closed under union?

          Is my guitar’s action too high? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Strings too stiff on a recently purchased acoustic guitar | Cort AD880CEIs the action of my guitar really high?Μy little finger is too weak to play guitarWith guitar, how long should I give my fingers to strengthen / callous?When playing a fret the guitar sounds mutedPlaying (Barre) chords up the guitar neckI think my guitar strings are wound too tight and I can't play barre chordsF barre chord on an SG guitarHow to find to the right strings of a barre chord by feel?High action on higher fret on my steel acoustic guitar