title: Find Position Given Number Among Numbers Made 4 7
signature: func findPositionGivenNumberAmongNumbersMade47(n string) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n string, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver("7", 2)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver("305745689", 5)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver("444", 7)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver("4", 1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver("2074", 5)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver("27", 2)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver("447", 8)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver("255", 0)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver("10000111111011", 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver("fAKcSDRTNz", 0)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def find_position_given_number_among_numbers_made_4_7(n):
      i = 0
      j = len(n)
      pos = 0
      while (i < j):
          if (n[i] == '4'):
              pos = ((pos * 2) + 1)
          if (n[i] == '7'):
              pos = ((pos * 2) + 2)
          i = (i + 1)
      return pos
source_cpp: int find_position_given_number_among_numbers_made_4_7(string n) {
    int i = 0, pos = 0;
    while ( n [ i ] != '\0' ) {
      switch ( n [ i ] ) {
        case '4' : pos = pos * 2 + 1;
        break;
        case '7' : pos = pos * 2 + 2;
        break;
      }
      i ++;
    }
    return pos;
  }