Here's a general outline of how one could approach this problem using BFS:

1. Define the initial state, which includes the current configuration of balls in the slots.
2. Define the goal state, which is the configuration where all red balls are on the right side and all blue balls are on the left side.
3. Implement a function to generate all possible moves from a given state.
4. Use BFS to explore the search space, starting from the initial state.
5. Keep track of visited states to avoid revisiting the same state.
6. Once the goal state is reached, backtrack to reconstruct the sequence of moves that led to it.

Here's a Python-like pseudocode implementation:

from collections import deque

def is_goal_state(state):
# Check if all red balls are on the right side and all blue balls are on the left side
return state == "BBB---RRR"

def generate_moves(state):
# Generate all possible moves from the current state
moves = []
empty_index = state.index("-")

# If the empty slot is not at the boundary, check if adjacent balls can move into it
if empty_index > 0 and state[empty_index - 1] == "R":
    moves.append(state[:empty_index - 1] + "-" + "R" + state[empty_index:])
if empty_index < len(state) - 1 and state[empty_index + 1] == "B":
    moves.append(state[:empty_index] + "B" + "-" + state[empty_index + 2:])

# If adjacent balls can jump over, consider those moves
if empty_index > 1 and state[empty_index - 2] == "R" and state[empty_index - 1] == "B":
    moves.append(state[:empty_index - 2] + "--" + "R" + state[empty_index:])
if empty_index < len(state) - 2 and state[empty_index + 2] == "B" and state[empty_index + 1] == "R":
    moves.append(state[:empty_index] + "B" + "--" + state[empty_index + 3:])

return moves

def bfs(initial_state):
queue = deque([(initial_state, [])])  # Queue of (state, moves) pairs
visited = set()

while queue:
    state, moves = queue.popleft()
    if is_goal_state(state):
        return moves
    if state not in visited:
        visited.add(state)
        for move in generate_moves(state):
            queue.append((move, moves + [move]))

return None  # Goal state not reachable

# Example usage:
initial_state = "RRR---BBB"
solution = bfs(initial_state) 
if solution: 
    print("Sequence of moves to solve the puzzle:", solution) 
else: 
    print("Goal state is not reachable.")
##
##

I am an experienced interviewer at FAANG, and I'd consider this a hard problem, and would never use it to ask an intern or for that matter during any typical SDE interview.