Vikram Bhat questions

Vikram Bhat answers

• What's time complexity of this algorithm for finding all Path Sum?
• Best way to find the number of pairs in an array whose difference is k
• Why does decreasekey in Dijkstra's algorithm take O(logN) time?
• Find all connected nodes in adjacency list
• Finding all unique elements from a big sorted array in log n time?
• Improve number compression algorithm?
• Prove maximum number of rotations for two trees to become equal
• Time complexity of N Queen using backtracking?
• Smart way to generate permutation and combination of String
• Why isn't my heuristic for the A* algorithm admissible?