dixg / Design-2

Design-2

Problem 1: (https://leetcode.com/problems/implement-queue-using-stacks/)

• peek time-complexity O(n)
• push and isempty O(1)
• push n(1)

Problem 2:(https://leetcode.com/problems/design-hashset/)

• I implemented single hashing function where time coplexity is O(1) even though if collioson occure we have to itrate over the appended list.