Java O(1) Solution --> [Total Moves For Bishop! : Solved] (1)
C++ using stack easy way [Minimum Parantheses! : Solved] (1)
2 ptr approach c++ solution O(n) [Sort array with squares! : Solved] (1)
Example output given is wrong [Valid BST from Preorder : Unsolved] (4)
C++ | level order right->left + reverse [Reverse Level Order : Solved] (1)
O(N) time and O(1) space solution C++ using 2 pointers [Sort Binary Linked List : Solved] (1)
C++ | Longest Subarray Length | unordered_map O(N) [Longest Subarray Length : Solved] (2)
C++ | Can't get any easier | Map will give TLE | Use array [Subarray with equal occurences! : Solved] (1)
Whats wrong with my code [Pick from both sides! : Unsolved] (1)
O(n)time and o(n)space solution using sliding window [Subarrays with distinct integers! : Solved] (1)
Easy C++ Shortest Hashing solution [First Repeating element : Solved] (1)
C++ | DFS tweaked [Right view of Binary tree : Solved] (1)
C++ | bfs using STL <list> [Cousins in Binary Tree : Solved] (1)
Easy sliding window O(n) solution [Counting Subarrays! : Solved] (1)
CPP Recursive without boolean function, Using Global Vector [Path to Given Node : Solved] (1)
Simplest solution without recursion, using queue only [Cousins in Binary Tree : Solved] (3)
Solution in O(n)! [Sort array with squares! : Unsolved] (1)
Solution: height/level --> printLevel --> call printLevel for each level in rev [Reverse Level Order : Solved] (1)
My code long but easy to understand in c++ [Next Smallest Palindrome! : Unsolved] (1)
It says 'didn't complete in the allocated time limit'. I have used only one while loop [Sort Binary Linked List : Unsolved] (1)
Just check this out. Samajh aa jaaye shayad [Valid BST from Preorder : Solved] (1)
Using c++ stl we can get max and min in 0(1) [Max Min : Unsolved] (4)
C++ code so elegant has no curly bracket [Balanced Parantheses! : Solved] (2)
Single pass O(n) time O(1) space C++ [Kth Node From Middle : Solved] (1)
Pathological test case for Submit [Pair With Given Difference : Unsolved] (2)
Very easy Java two pointers solution in O(n) with comments [Kth Node From Middle : Solved] (1)
O(n) with O(1) memory [Balance Array : Unsolved] (2)
Very simple 4 line Python Solution using Counter [Balanced Parantheses! : Solved] (1)
Following their hints [First non-repeating character in a stre : Solved] (2)
O(n) without calling isPalindrom() twice [Convert to Palindrome : Solved] (1)