InterviewBit Problems   Diffk II : Solved


About the Diffk II : Solved category (1)
Simple C++ using unordered_map; (1)
It is better to unordered_map instead of map because it takes O(1) to search,insert and delete operations (3)
Simple C++ Solution in 7 lines (1)
A simple python solution (1)
C++ Sol using map! (1)
C++ solution using Unordered_map (1)
Very easy C++ Solution in O(N) time (1)
Short Java solution 6 lines of code (2)
Can we assume that the difference cannot be negative?! What if k=-2 ? A[0]-A[2]=- (4)
[JAVA] clean, short and simple solution using a HashSet (helper code with Array instead of List) (1)
Easy but not O(n) solution (1)
Two solutions || with and without hash (1)
Unordered Set C++ solution (2)
Simple and easy to understand C++ O(n) sol with unordered map (3)
Thank me later :)) (2)
Non-Linear solutions getting accepted but hashing is showing TLE (1)
C++ solution using sort (4)
Simple c++ solution :) (1)
O(n) Solution Using Hash Function (1)
Java HashMap: 10 lines of code (1)
Please Improve the test cases (1)
Unordered Map Solution C++ (1)
Clean and small C++ solution with unordered_set (1)
My .net solution (1)
O(n) - Solution (1)
Solution is showing memory limit exceeded (1)
Overflow and underflow cases are not test (1)
Using map in c++ is resulting in MLE and unordered map solves it... is it cause o (3)
When I used the following code with map it showed memory limit exceeded error but (2)