1. Given two strings, determine whether they are anagrams. 2. Given a list of strings, return a list of lists of strings, which represents the list grouping strings by whether they are anagrams of one another.
Intern Interview Questions
248,712 intern interview questions shared by candidates
Signed NDA
Implement a simple compression algorithm where repeated letters in a string are represented by a count and the letter. Example: AAACBBD = 3A1C2B1D
Given two nodes in a binary tree, find their first common ancestor. You may not store nodes, and assume that the tree is already created.
If you were advising a grocery chain on how to find their most loyal customers what data would you want to collect in order to identify these customers?
Write an algorithm that does an in-order traversal of a tree recursively. Now, write the same algorithm iteratively.
What are CBRE's competitors in India?
Write a function to remove all redundant characters in a given string.
Remove duplicates from a linked list. O(n) time.
How will you make this code readable (given a piece of code)
Viewing 541 - 550 interview questions