@rintureji12
Software Engineer
Nothing here yet.
Nothing here yet.
Aug 12, 2025 · 2 min read · Remove Outermost Parentheses A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. For example, "", "()", "(())()", and "(()(()))" are all valid ...
Join discussionJul 27, 2025 · 10 min read · N meetings in one room You are given timings of n meetings in the form of (start[i], end[i]) where start[i] is the start time of meeting i and end[i] is the finish time of meeting i. Return the maximum number of meetings that can be accommodated in...
Join discussionJun 30, 2025 · 29 min read · Binary Tree Inorder Traversal Given the root of a binary tree, return the inorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,3,2] Explanation: Example 2: Input: root = [1,2,3,4,5,null,8,null,null,6,7,9] Output...
Join discussionJun 13, 2025 · 25 min read · Implement Stack using Queues Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty). Implement the MyStack class: void push(int x) Push...
Join discussionMay 26, 2025 · 79 min read · Largest element in the array Given an array ‘arr’ of size ‘n’ find the largest element in the array. Example: Input: 'n' = 5, 'arr' = [1, 2, 3, 4, 5] Output: 5 Explanation: From the array {1, 2, 3, 4, 5}, the largest element is 5. solution: def ...
Join discussion