# ddareus

@ddareus

0

validParenthesesString Maximum Nesting Depth of the Parentheses

0

2

0

Draketheb4dass # U nderstand
# What will be the result if the string is empty?
Answer the question3 months ago

0

stackUsingQueuesImplement stack using queues.

0

3

0

Draketheb4dass # E valuate
# Time Complexity O(1)
# Space Complexity O(n)
You should add runtime and space complexity for each operation3 months ago

0

queueUsingStacksImplementing queue using stacks

queueUsingStacks

Implementing queue using stacks0

wordFrequencyFind the number of occurrences of any given word in a book.

1

0

0

0

queueUsingStacksImplementing queue using stacks

0

4

0

Draketheb4dass I don't understand those questions in the UNDERSTAND part:
# What will be the result if the two stacks are empty?
# What will be the result is anyone of them is empty?
# What will be the result is the queue is empty?
You are implementing a class, also understand, you must also write the answer to the quest or only the answers3 months ago

Draketheb4dass # E valuate
# Time Complexity O(1)
# Space Complexity O(n)
You should add Runtime and space complexity for each operation.3 months ago

0

flattenMatrixflattenMatrix

0

0

0