practice #code-wars

11_8_2022.md

Kata : https://www.codewars.com/kata/525e5a1cb735154b320002c8/train/dart

void main() {
//   print(" - ".trim() == '-');
  var _value = 0;
    for (int i = 14999; i > 0; i--){
      _value += i;
    }
  
// recursite(14999);
  print("_value : $_value");
}


/// Can't handle 14999 and more
int recursite(int i, [int value = 0]){
  if (i == 0){
    return value;
  }
  
  final newValue = i + value;
  return recursite(i - 1, newValue);
}

/// Best Solution
triangular(n) => n < 0 ? 0 : (n+1)/2 * n;

12_4_2022.md

https://www.codewars.com/kata/56484848ba95170a8000004d/train/dart

My Answer

int gps(int s, List<double> x) {
  if (x.length <= 1) {
    return 0;
  }
  
   final _listResult = <double>[];
  for (int i = x.length; i > 0; i--){
    if (i == 1){
      break;
    }
    _listResult.add(x[i - 1] - x[i - 2]);
  }
  var oldestUser = _listResult.reduce((currentUser, nextUser) => currentUser > nextUser ? currentUser : nextUser);
  
  
  final _i = (3600 * oldestUser) / s;
  return _i.toInt();
}

Most Liked :

import 'dart:math';

int gps(int s, List<double> x) {
  var maxSpeed = 0;
  for (int i = 1; i <= x.length - 1; i++) {
    maxSpeed = max(maxSpeed, (3600 * (x[i] - (x[i - 1])) / s)).toInt();
  }
  return maxSpeed;
}

2_2_2022.md

1. https://www.codewars.com/kata/54ff3102c1bad923760001f3/train/dart

My Answer :

int getCount(String inputStr){
  final _listData = ["a","i","u","e","o"];
  final _lengthVocal = inputStr.split("").where((e)=> _listData.contains(e)).length;
  return _lengthVocal;
}

Most Liked :

int getCount(String str) => new RegExp('[aeiou]').allMatches(str).length;

2. https://www.codewars.com/kata/55e6f5e58f7817808e00002e/train/dart

My Answer

List<int> seven(int m) {
  var _var1 = m.toString();
  var _count = 0;
  bool _isContinue = _var1.replaceAll("-", "").length > 2;
  while (_isContinue){
    _count++;
    final _currValue = _var1.substring(0, _var1.length - 1);
    final _newValue = int.parse(_currValue) - (int.parse(_var1[_var1.length -1]) * 2);
    _var1 = _newValue.toString();
    
    final _checkLength = _var1.replaceAll("-", "").length > 2;
    final _isSeven = int.parse(_var1) % 7 == 0 || int.parse(_var1) % 7 != 0;
  
    
    _isContinue = _checkLength && _isSeven;
  }
  
    return [int.parse(_var1), _count];
}

Most Liked :

List<int> seven(int m) {
  int count = 0;
    while(m > 99){
      m = (m/10).floor() - (2*(m%10));
      count++;
    }
  return [m, count];
}