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. Sorting
  4. Intro to Tutorial Challenges
  5. Discussions

Intro to Tutorial Challenges

Sort by

recency

|

401 Discussions

|

  • afzal_saiyed931
     + 0 comments
     def introTutorial(V, arr):
    # Write your code here
    
    start = 0
    end = len(arr) - 1
    
    while start <= end:
        mid = (start + end) // 2
        if arr[mid] == V:
            return mid
        elif arr[mid] > V:
            end = mid - 1
        else:
            start = mid + 1
    return -1

  • ahmedmhmouad41
     + 0 comments

    Iterative solution with built-in functions 

    int introTutorial(int V, vector<int> arr) {
    auto it = std::find(arr.begin(), arr.end(), V);
    if (it != arr.end()) return std::distance(arr.begin(), it);
    return -1;
}

  • yashdeora98294
     + 0 comments

    Here is problem solution in Python Java c++ c and Javascript - https://programmingoneonone.com/hackerrank-super-reduced-string-problem-solution.html

  • alban_tyrex
     + 0 comments

    Here are my c++ solutions, you can watch the explanation here : https://youtu.be/teDaBhua0bc

    solution 1: 

    int introTutorial(int V, vector<int> arr) {
    for(int i = 0; i < arr.size(); i++) if(arr[i] == V) return i;
    return 0;
}

    solution 2:

    int introTutorial(int V, vector<int> arr) {
    return distance(arr.begin(), find(arr.begin(), arr.end(), V));
}

  • akash_prajapati6
     + 0 comments
    def introTutorial(V, arr):
    return arr.index(V)