LeetCode Question · Apr 2021 · Los Angeles

Qualcomm | Phone | HashMap

4 upvotes 794 views

Question Details

Given a BST, check if is balanced or not. Solution: Wrote a recursive code to check the heights. 2. Find the contiguos substrings in a string S, with no duplicates....

Full Details

🔒

Unlock all Qualcomm questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a qualcomm interview for a swe role reported in 2021.

It covers the following topics: Binary Tree, Hash Table, Recursion, Strings .