Sort 9 Discussions, By:

Sorry, you do not have a permission to answer to this question.

  • dvdvdmt 9 years ago + 1 comment

    With the help of recursion it solves pretty easy:

    function calcOperations(row, left, right) {
        if (left >= right) return 0;
    
        var leftCode = row.charCodeAt(left);
        var rightCode = row.charCodeAt(right);
        var diff = Math.abs(rightCode - leftCode);
        return diff + calcOperations(row, left + 1, right - 1);
    }
    

    Add Reply Preview cancel

    Sorry, you do not have a permission to answer to this question.

    • wasifhossain 9 years ago + 0 comments

      simplicity wins!

      Add Reply Preview cancel

      Sorry, you do not have a permission to answer to this question.

    • Jarun14 9 years ago + 1 comment

      function processData(input) { var lines = input.split('\n'); var n = Number(lines[0]);

      for (var i=1; i<=n; ++i){
          var ops=0;
          var first_loc = 0;
          var last_loc = lines[i].length -1;
          do{
              var first = lines[i].charCodeAt(first_loc);
              var last = lines[i].charCodeAt(last_loc);
              if(first!=last){
                  ops+= Math.abs(first-last);
              }
              ++first_loc;
              --last_loc;
          }while(first_loc<=last_loc);
          console.log(ops);
      }
      

      }

      Runs in all cases

      Add Reply Preview cancel

      Sorry, you do not have a permission to answer to this question.

      • PRASHANTB1984 9 years ago + 0 comments

        Neat and clean code! Thank you for sharing your solution.

        Add Reply Preview cancel

        Sorry, you do not have a permission to answer to this question.

      • khyatigaur13_kg 6 years ago + 0 comments

        var arr = input.split("\n");
            var newarr= arr.slice(1);
            for (k=0;k<newarr.length;k++){
            var str=newarr[k];
            var mid=Math.floor(str.length/2);
            var count=0;
            var diff=0;
            var j= str.length-1;
            for (let i=0;i<mid;i++){
                diff=Math.abs(str.charCodeAt(j)-str.charCodeAt(i));
                    count+=diff;
                    j--;
            }
            
            console.log(count);
            
            }
        

        Add Reply Preview cancel

        Sorry, you do not have a permission to answer to this question.

        • gopal_554 6 years ago + 0 comments

          My Solution:

          function processData(input) {
              var strs = input.split("\n");
              for (var i = 1; i< strs.length; i++) {
                  var tempStr = strs[i];
                  var changeReq = 0;
                  for (var j = 0; j < Math.floor(tempStr.length / 2); j++) {
                       changeReq = changeReq + Math.abs(tempStr.charCodeAt(j) - tempStr.charCodeAt((tempStr.length - 1) - j));
                  }
                  console.log(changeReq);
              }
          }
          

          Add Reply Preview cancel

          Sorry, you do not have a permission to answer to this question.

          • ameyb2018 6 years ago + 0 comments

            function processData(input) {
                //Enter your code here
                var ip = input.split(/\s+/g);
                var lenArr = ip.length;
                var strLen = ip[1].length;
                var i = 1;
            
                while(i<lenArr)
                    {
             
                        convertToAscii(ip[i]);
                        i++;
                    }
            
                
            } 
            function convertToAscii(str)
            {
             
                var cstrLen = str.length;
                var i = 0;
                var j = 0;
                var ascArr = new Array();
                var receivedCounter = 0;
                for(i=0;i<cstrLen;i++)
                    {
                        ascArr[j] = str[i].charCodeAt();
                        j++;
                    }
              
               findPalindrome(ascArr);//97,98,99,100
            }
            
            function findPalindrome(asciiArray)
            {
                var asciiArrayLen = asciiArray.length;
                var i = 0;
                var j = asciiArrayLen-1;
                var counter = 0;
               
                while(i<=j)
                    {
               
                        if(asciiArray[i]<asciiArray[j])
                        {
                            while(asciiArray[i]!=asciiArray[j])    
                                {
                                    asciiArray[j] = asciiArray[j]-1;
                                    counter++;
                                }
                        }
                        else
                        {
                            while(asciiArray[i]!=asciiArray[j])    
                                {
                                    asciiArray[i] = asciiArray[i]-1;
                                    counter++;
                                }
                        }
                        i++;
                        j--;   
             
                    }
                console.log(counter);
            }
            
            process.stdin.resume();
            process.stdin.setEncoding("ascii");
            _input = "";
            process.stdin.on("data", function (input) {
                _input += input;
            });
            
            process.stdin.on("end", function () {
               processData(_input);
            });
            

            Add Reply Preview cancel

            Sorry, you do not have a permission to answer to this question.

            1. Challenge Walkthrough
              Let's walk through this sample challenge and explore the features of the code editor.1 of 6
            2. Review the problem statement
              Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
            3. Choose a language
              Select the language you wish to use to solve this challenge.3 of 6
            4. Enter your code
              Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
            5. Test your code
              You can compile your code and test it for errors and accuracy before submitting.5 of 6
            6. Submit to see results
              When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
            1. Check your score