Skip to content
Open navbar menu
Sign UpLog In
ddareus

ddareus

@ddareus
ddareus
ddareus
published a Repl
1 year ago
0
validParenthesesString
validParenthesesString Maximum Nesting Depth of the Parentheses
Draketheb4dass
Draketheb4dass
# U nderstand # What will be the result if the string is empty? Answer the question1 year ago
Draketheb4dass
Draketheb4dass
Apresa tt bagay ok! good job1 year ago
ddareus
ddareus
published a Repl
1 year ago
0
stackUsingQueues
stackUsingQueuesImplement stack using queues.
Draketheb4dass
Draketheb4dass
# E valuate # Time Complexity O(1) # Space Complexity O(n) You should add runtime and space complexity for each operation1 year ago
Draketheb4dass
Draketheb4dass
Can you use two queues instead of a deque? Just try1 year ago
ddareus
ddareus
published an Update
1 year ago
0
queueUsingStacks
queueUsingStacksImplementing queue using stacks
queueUsingStacks
Implementing queue using stacks
#Queue
#python
#stacks
ddareus
ddareus
published a Repl
1 year ago
0
wordFrequency
wordFrequencyFind the number of occurrences of any given word in a book.
ddareus
ddareus
published a Repl
1 year ago
0
queueUsingStacks
queueUsingStacksImplementing queue using stacks
Draketheb4dass
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 answers1 year ago
Draketheb4dass
Draketheb4dass
# E valuate # Time Complexity O(1) # Space Complexity O(n) You should add Runtime and space complexity for each operation.1 year ago
ddareus
ddareus
published a Repl
1 year ago
0
flattenMatrix
flattenMatrixflattenMatrix