Vikram Bhat questions

Vikram Bhat answers

• What is Time Complexity of the following function?
• Text Compression Algorithm
• memory efficient structure to track a subset of an array in its original order
• Finding Smallest Number of Elements to make a Sum
• 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?