kishan-dhankecha

import 'package:flutter/material.dart';

class FancyButton extends StatefulWidget {
  const FancyButton({
    Key key,
    @required this.child,
    @required this.size,
    @required this.color,
    this.duration = const Duration(milliseconds: 160),
    this.onPressed,

kishan-dhankecha

/// Write a function 'canConstruct(target, wordBank)' that accepts a
/// target string and an array of strings.

/// The function should return a boolean indicating whether or not the
/// 'target' can be constructed by concatenating elements of the
/// 'wordBank' array.

/// You may reuse elements of ‘wordBank' as many times as needed.

const canConstruct = (target, wordBank, memory = {}) => {

kishan-dhankecha

/// Write a function 'bestSum(targetSum, numbers)' that takes in a
/// targetSum and an array of numbers as arguments.

/// The function should return an array containing the shortest
/// combination of numbers that add up to exactly the targetSum.

/// If there is a tie for the shortest combination, you may return any
/// one of the shortest.

const bestSum = (targetSum, numbers, memory = {}) => {

kishan-dhankecha

/// Write a function 'howSum(targetSum, numbers)' that takes in a
/// targetSum and an array of numbers as arguments.

/// The function should return an array containing any combination of
/// elements that add up to exactly the targetSum. If there is no
/// combination that adds up to the targetSum, then return null.

/// If there are multiple combinations possible, you may return any
/// single one.

kishan-dhankecha

/// Write a function 'canSum( targetSum, numbers)' that takes in a
/// targetSum and an array of numbers as arguments.

/// The function should return a boolean indicating whether or not it
/// is possible to generate the targetSum using numbers from the array.

/// You may use an element of the array as many times as needed.
/// You may assume that all input numbers are nonnegative.

const canSum = (targetSum, numbers, memory = {}) => {

kishan-dhankecha

/// Say that you are a traveler on a 2D grid. You begin in the
/// top-left corner and your goal is to travel to the bottom-right
/// corner. You may only move down or right.

/// In how many ways can you travel to the goal on a grid with
/// dimensions m * n?

/// Write a function 'gridTraveler(m, n)' that calculates this.

const gridTraveler = (n, m, memory = {}) => {

kishan-dhankecha

/// Write a function 'fib(n)' that takes in a number as an argument.
/// The function should return the n-th number of the Fibonacci sequence.

/// The 1st and 2nd number of the sequence is 1.

/// To generate the next number of the sequence, we sum the previous two.
/// fib(n): 1, 1, 2, 3, 5, 8, 13, 21, 34,

const fib = (num, memory = {}) => {
    // Check in memory.

kishan-dhankecha

void main() {
  /// Temporary string for store number character.
  var tempString = '';

  /// Input string.

  const string = '123sdc123s1d s sd155626sd s ds';

  /// Split the input string in list of characters.

kishan-dhankecha

import 'dart:io';

void main() {
  print('PROJECT FROM: https://github.com/Kishan-Dhankecha');
  print('--------------------');

  //Take the inputs from User
  print('Enter the count of column:');
  var _column = int.parse('${stdin.readLineSync()}');
  print('Enter the count of row:');

kishan-dhankecha

String checkCountOf = 'id';

List objects = [
  {"id": "123"},
  {"id": "123"},
  {"id": "20"},
  {"id": "35"},
  {"id": "20"},
];