Round 1 – Technical Interview

Following the initial discussion, I progressed to the technical assessment phase. This round, conducted via Google Meet, proved to be quite rigorous. The questions primarily revolved around arrays and dynamic programming. The questions asked in this round are listed below:

Finding an element in an array where the sum of elements to its left equaled the sum of elements to its right.

Java

public class EquilibriumIndex { 
    public static int findEquilibriumIndex(int[] arr) 
    { 
        int totalSum = 0; 
        int leftSum = 0; 
  
        for (int num : arr) { 
            totalSum += num; 
        } 
  
        for (int i = 0; i < arr.length; i++) { 
            totalSum -= arr[i]; // deduct the current 
                                // element from total sum 
            if (leftSum == totalSum) { 
                return i; 
            } 
            leftSum += arr[i]; // add current element to 
                               // left sum 
        } 
  
        return -1; // return -1 if no equilibrium 
    } 
  
    public static void main(String[] args) 
    { 
        int[] arr = { 1, 2, 3, 4, 3, 2, 1 }; 
        int result = findEquilibriumIndex(arr); 
        if (result != -1) { 
            System.out.println( 
                "Equilibrium index found at index " + result 
                + ": " + arr[result]); 
        } 
        else { 
            System.out.println( 
                "No equilibrium index found in the array."); 
        } 
    } 
}

Output

Equilibrium index found at index 3: 4

Determining the first missing positive number in an array.

Java

public class FirstMissingPositive { 
    public static int firstMissingPositive(int[] nums) 
    { 
        int n = nums.length; 
  
        // Step 1: mark non-positive numbers and numbers 
        // greater than n as n+1 
        for (int i = 0; i < n; i++) { 
            if (nums[i] <= 0 || nums[i] > n) { 
                nums[i] = n + 1; 
            } 
        } 
  
        // Step 2: mark the presence of +ve numbers within 
        // the range [1, n] 
        for (int i = 0; i < n; i++) { 
            int num = Math.abs(nums[i]); 
            if (num <= n) { 
                nums[num - 1] = -Math.abs(nums[num - 1]); 
            } 
        } 
  
        // Step 3: find the first missing +ve number 
        for (int i = 0; i < n; i++) { 
            if (nums[i] > 0) { 
                return i + 1; 
            } 
        } 
  
        return n + 1; // no +ve numbers, return n+1 
    } 
  
    public static void main(String[] args) 
    { 
        int[] nums = { 3, 4, -1, 1 }; 
        int result = firstMissingPositive(nums); 
        System.out.println( 
            "The first missing +ve number is: " + result); 
    } 
}

Output

The first missing +ve number is: 2

Loyalty Juggernaut Interview Experience for Product Engineer Role

I applied to Loyalty Juggernaut through the AngelList website and received a call from their HR shortly after to discuss interview scheduling. Given that I was in my 6th semester with the on-campus placement drive approaching, I decided to explore my options. Nonetheless, I proceeded with the interview rounds to gain valuable experience.

Tags:

#Loyalty Juggernaut #Off-Campus #Write it Up #Experiences #Interview Experiences

Background Verification:

Round 2 – Technical Interview:

Round 1 – Technical Interview

Java

Java

Loyalty Juggernaut Interview Experience for Product Engineer Role

Similar Reads

Contact Us