We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Sequence Equation
  5. Discussions

Sequence Equation

Sort by

recency

|

1547 Discussions

|

  • akulbachandra67
     + 0 comments

    **Mine Python Solution **

    def permutationEquation(p):
    # Write your code here
    a = [p.index(i)+1 for i in range(min(p),max(p)+1)]
    b = [p.index(i)+1 for i in a ]
return b

  • troytjh
     + 0 comments

    C++ solution

    vector<int> permutationEquation(vector<int> p)
{
    vector<int> o(p.size());
    int j,k=0;
    for (int i = 1; i <= p.size(); ++i)
    {
        while (p[j] != i && j < p.size()) {++j;};
        while (p[k] != j+1 && k < p.size()) {++k;};
        
        o.at(i-1) = k+1;
        
        j = 0;
        k = 0;
    }
    
    return o;
}

  • afzal_saiyed931
     + 0 comments
    def permutationEquation(p):
    # Write your code here
    temp = {value: index + 1 for index, value in enumerate(p)}
    result = []
    for x in range(1, len(p)+1):
        i = temp.get(x)
        j = temp.get(i)
        result.append(j)
        
    return result

  • spriyamalar
     + 0 comments
    public static List<Integer> permutationEquation(List<Integer> p) {
    Map<Integer, Integer> map = IntStream.
            range(0, p.size()).
            boxed().
            collect(Collectors.toMap(s-> p.get(s), s-> s+1));
    List<Integer> result = IntStream.range(1, p.size()+1).
        boxed().
        map(map::get).
        map(map::get).
        collect(Collectors.toList());
    return result;
}

  • prajjwal077
     + 0 comments

    Here's my easiest javascript solution :)

    let result=Array.from({ length: p.length });
    let positionVal;
    
    p.forEach((elem,index)=>{
        positionVal=(p.indexOf(index+1))+1;
        result[elem-1]=positionVal
    })
  
    return result;