This is giving run time error but i dont understand why please help :/ [Find Nth Fibonacci : Solved] (1)
O(n*log(max(element)) WoodCutting [WoodCutting Made Easy! : Solved] (3)
Single deque is sufficient by maintaining parent and child variables [Cousins in Binary Tree : Solved] (1)
PYTHON 3 SOLUTION using stack [Balanced Parantheses! : Solved] (1)
Single Iteration - Simple CPP Solution [Kth Node From Middle : Solved] (1)
Simple solution in c++ using stl algorithm [K Largest Elements : Solved] (2)
What a stupid question [Maximum Area of Triangle! : Unsolved] (1)
Kth Largest Element solution using priority queue [K Largest Elements : Solved] (1)
IDK why nlogn doesnt pass. Its showing error might be for larger testcases [WoodCutting Made Easy! : Solved] (4)
Can Anyone tell me why is it giving me Wrong Answer [Maximum Area of Triangle! : Unsolved] (1)
Input second is not even balanced.(problem is solvable but can't use balanced tree property) [K DISTANCE : Unsolved] (1)
TLE for O(n) code [Infix to Postfix : Unsolved] (6)
SImple C++, 1 time Level order Traversal [Cousins in Binary Tree : Solved] (1)
Wront testcase for the given problem [Chain of Pairs : Unsolved] (1)
Cpp solution passed all the test cases [Partitions : Solved] (1)
The toughest solution! [Balanced Parantheses! : Unsolved] (1)
C++ dp solution for this problem [Longest Common Subsequence : Solved] (2)
My Approach in C++ [Balanced Parantheses! : Solved] (1)
Java Solution with Queue O(n) [First non-repeating character in a stre : Solved] (1)
O(n) cpp solution [Subarray with B odd numbers : Solved] (1)
Wrong solution is getting accepted [Largest BST Subtree : Unsolved] (1)
Easy two pointer approach O(n) solution [Maximum Ones After Modification : Solved] (2)
The easiest solution for this problem [Path to Given Node : Solved] (1)
Easy Java solution without stack ! Time-O(n) Space -O(1) [Balanced Parantheses! : Solved] (1)
Easy C++ Solution using Maps and Simple Loops [Two out of Three : Solved] (2)
Simple C++ solution using maps and loops [Two out of Three : Solved] (1)
Understandable c++ solution [Next Similar Number : Solved] (1)
Solution in C++ ( 1st find level, 2nd get all nodes from their level, 3rd in final vector dont consider the input node and sibling ) [Cousins in Binary Tree : Solved] (1)
Wrong test case kth node from middle [Kth Node From Middle : Unsolved] (1)
Time limit Exceed please help if anyone solve [Partitions : Solved] (1)