Apple SSE Interview Experience

Anonymous User
1483
Feb 24, 2026
Mar 09, 2026

Round 2: Started with project discussion.
Started discussion on Kubernetes and Deployment processes. Did not had much idea.
Then discussed around AI and LLM models. How does Agentic AI works? MCP servers works.
Then asked about Authentication process. Where to use, how to use it and how to implement. I preferred JWT so deep dived on how JWT works.

Then was asked two questions:

  1. SQL question where needed to join two tables to get the result
  2. Basic recursive function to get all permutation of results. Leetcode medium level question only. But had to write modular code so used basic OOPS concept.

Round 1:

Discussion around AI and it's usage. Some Java streams and multi-threading related questions.

Only 1 problem solving question asked:

I give you a input string , print the pretty odd statements
{
  {"The", "A"},
  {"dog","cat"},
  {"runs","walks"},
  {"quickly","slowly"},
  {".","!"}
}

Expected Output:

The dog runs quickly.
The dog runs slowly.
The dog walks quickly.
The dog walks slowly.
The cat runs quickly.
The cat runs slowly.
The cat walks quickly.
The cat walks slowly.



// TC : exponential time complexity 



class Solution {
  public static void main(String[] args) {
    List<List<String>> input = List.of(
                List.of("The"),
                List.of("dog", "cat"),
                List.of("runs", "walks"),
                List.of("quickly", "slowly"),
                List.of(".")
        );
    printOdd(input);
  }

  private static void printOdd(List<List<String>> input){
    List<String> answer = new ArrayList<>();
    recursive(input, 0, new StringBuilder(""), answer);
    for(String s: answer){
      System.out.println(s);
    }
  }

  private static void recursive(List<List<String>> input, int row, StringBuilder sb , List<String> answer){
    if(row== input.size()){
      answer.add(sb.toString().trim());
      return;
    }

    for(String s : input.get(row)){       
        sb.append(s);
        sb.append(" ");
      recursive(input, row+1, sb, answer);
      sb.delete(sb.length()-s.length()-1, sb.length());
    }
    
  }
}
Comments (3)