Simple three lines code in python
[
First Repeating element : Unsolved
]
(2)
Simple CPP two line code , TC O(n)
[
Find a peak element : Solved
]
(2)
C++ || simple solution
[
Clear the Array : Solved
]
(1)
Easy Solution , must check
[
Longest Subarray Length : Unsolved
]
(1)
Can't figure out the wrong test-case
[
Pick from both sides! : Unsolved
]
(2)
Easiest/fastest solution in cpp
[
Kth Node From Middle : Solved
]
(1)
Using multiset. Store the open/close times, and count the number of opened meetings at any time
[
Meeting rooms : Solved
]
(1)
See it before solving to save your time, ques statement and test cases are wrong
[
Useful Extra Edges : Unsolved
]
(1)
Simplest C++ solution using STL
[
K Largest Elements : Unsolved
]
(2)
Using c++ stl we can get max and min in 0(1)
[
Max Min : Unsolved
]
(6)
Return type of solution
[
Find Nth Fibonacci : Unsolved
]
(2)
Simplest solution ever in O(1)
[
Trailing Zeroes : Unsolved
]
(1)
Easy solution using Longest Increasing Subsequence method
[
Chain of Pairs : Solved
]
(2)
Error in the solution
[
Pair and Tuple : Solved
]
(2)
Fix the base vary vertex
[
Maximum Area of Triangle! : Solved
]
(1)
I have applied the solution algorithm but still getting TLE
[
Maximum Sum Triplet : Unsolved
]
(1)
C++ Solution using Dijkshtra Algorithm
[
Min Cost Path : Unsolved
]
(1)
[python] Clean solution with explanations
[
Pick from both sides! : Solved
]
(2)
Why this is wrong? Trying with stack DFS approach
[
Delete Edge! : Unsolved
]
(1)
SHUT OFFFFFFFFFFFFFFFFFF solution
[
Largest Permutation : Unsolved
]
(1)
Easy C++ solution without using stacks
[
Balanced Parantheses! : Solved
]
(2)
Simple recursive sol Python
[
Burn a Tree : Solved
]
(1)
Please verify if my code time compleity is NlogN or not
[
WoodCutting Made Easy! : Unsolved
]
(2)
O(1) solution best appproch
[
Trailing Zeroes : Solved
]
(1)
Memoization approach having error. Please debug!
[
Subset Sum Problem! : Solved
]
(2)
Java O(n) recursion
[
Convert to Palindrome : Solved
]
(2)
[C++] Easy Binary Search solution
[
Search in Bitonic Array! : Solved
]
(1)
Java solution, O(n log n) using Map of Priority Queues
[
An Increment Problem : Solved
]
(3)
Best in JAVA solution using Backtracking with T.C.=> O(N log_N) ;
[
Maximal String : Unsolved
]
(3)
C# Code runs in visual studio but not in given IDE
[
Diagonal Traversal : Unsolved
]
(1)
next page →
