What is a d-heap data structure?

How do I solve http://www.spoj.com/problems/BUD13TLF/ on SPOJ?

How do I complete queries in O(1) time in the RANGESUM problem on SPOJ? I am a beginner and have been struggling for a few days.

How does one take care of numerical stability of the results while running any ML algorithm?

What is the best approach to guess Arabic diacritics programmatically?

How are machine learning algorithms (written in Python) applied on data residing in a database (say MySQL or MongoDB)?

How can I create a combination algorithm software?

What are some of the toughest problems based on the algorithms, counting principles, graph theory and probability?

How do I prepare for an interview at Coviam Technologies for an Android developer? Do they ask a lot of data structure and algorithms questions?

Why does String [] part = string.split(” “) return a single string in place of returning a string array and gives an ArrayIndexOutOfBoundException?

What are the trade-offs between optimizing hardware to target algorithms vs optimizing algorithms to account for hardware?

What are some examples of quantum algorithms being run on dWave and the like? What are their state transitions?

Is there a problem for which it is proven that there is no optimal algorithm?

How do you map the strings using algorithms?

Did Google Deepmind succeed because of its breakthrough in algorithm or because it found the right problem to tackle?

What is the initial direction of the head in the C-SCAN disk scheduling algorithm?

Why don’t they use the shortest path algorithm with brute force in the traveling salesman problem?

How can I remove all the duplicate elements in a string? (Conditions apply.)

Why can’t we use “regular” computers with libquantum to simulate Shor’s algorithm and crack encryption keys? Do we need quantum computers to do this?

How are crossing edges identified in a 2-opt swap for TSP?