Uncategorized

If you want to see how to implement a stack using two queues with the costly pop method or just one queue, click here and here. Also, I highly suggest reading the explanation and implementation of queues here if you don’t have a good grasp of them already. In this question, we need to create …

Implement Stack Using Queues | LeetCode 225 (Costly Push) Read More »

The function in this question needs to determine if two strings are anagrams. Strings are anagrams if you can use the letters in one string to form the other string (in this case, each letter can be used only once). For example, map is an anagram of pam, angle is an anagram of angel, and …

Valid Anagram | LeetCode 242 Read More »