




def SCREAMING_SNAKE_CASE				(       lowercase_ ,				lowercase_						)   ->       list:



       """simple docstring"""

       A__       =    len(lowercase_						)
       A__       =    []
       for i in range(len(lowercase_						) - pat_len + 1						):
              A__       =    True
              for j in range(lowercase_						):
                     if s[i + j] != pattern[j]:
                            A__       =    False
                            break
              if match_found:
                     position.append(lowercase_						)
       return position


if __name__ == "__main__":
  assert naive_pattern_search("""ABCDEFG""", """DE""") == [3]
  print(naive_pattern_search("""ABAAABCDBBABCDDEBCABC""", """ABC"""))








def SCREAMING_SNAKE_CASE				(       lowercase_						)   ->       Any:



       """simple docstring"""

       A__       =    [0] * len(lowercase_						)
       A__       =    []
       A__       =    [1] * len(lowercase_						)

       for values in graph.values():
              for i in values:
                     indegree[i] += 1

       for i in range(len(lowercase_						)						):
              if indegree[i] == 0:
                     queue.append(lowercase_						)

       while queue:
              A__       =    queue.pop(0						)
              for x in graph[vertex]:
                     indegree[x] -= 1

                     if long_dist[vertex] + 1 > long_dist[x]:
                            A__       =    long_dist[vertex] + 1

                     if indegree[x] == 0:
                            queue.append(lowercase_						)

       print(max(lowercase_						)						)


# Adjacency list of Graph
_lowerCamelCase	:		Optional[int]							       =   {0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}
longest_distance(graph)


