Pramod Gupta

> @hwclass How about Hindi translation? @dmast3r not sure how hindi translation will help.

@ranvirgraol Can you elaborate a bit more on this?

> else if(s.charAt(i) == ')' && !stack.isEmpty() && stack.peek() == ')') { > } else if(s.charAt(i) == ']' && !stack.isEmpty() && stack.peek() == ']') { > } else if(s.charAt(i) ==...

@dutta14 Are you working on this? If yes, I would also like to contribute to this.

@SalahudinMalik I don't see a solution to the problem you mentioned in the description?

@kdn251 Ready for review.

@kdn251 Gentle Reminder!

@vin0010 I don't have access to merge this PR. @kdn251 has to merge this.

@knasim Even if we go best sorting algorithm(merge/quick/tree), It will have time complexity O(nlogn) with worst space complexity O(n). Using hashmap, we solve this in O(n) time with space O(n)...

@sragha45 Yes, you are correct. But O(NlogN) is the worst case scenario when we have a very poor implementation of hash code which will map all entries to same bucket....