Group anagrams and count string in grid

Q: Group anagrams and count string in grid

This is a Coding & Algorithms interview question from J.P. Morgan for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Part 1 — Group Anagrams: Given an array of strings, group together strings that are anagrams of one another and output both the grouped lists and the count of groups. Specify the time and space complexities. Part 2 — Count Target in Grid: Given a 2D matrix of characters and a target string, count how many distinct paths in the grid spell the string by moving to orthogonally adjacent cells (up, down, left, right). You may start at any cell; a cell cannot be reused within a single match. Return the total count, or -1 if the string does not occur at least once. Discuss an efficient algorithm and its complexity.

Group anagrams and count string in grid

Comments (0)