I want to create a permanent link to the most-downvoted questions that I've written, so that I can find out which of my own questions (and which specific types of questions) have the most downvotes. If I created a permanent link to my most-downvoted questions, then I could perhaps learn from my mistakes, and hopefully avoid any further damage to my Stack Overflow reputation. Is there an option to display questions in ascending order of popularity, instead of descending order, with the most-downvoted questions shown first, instead of the most-upvoted questions shown first? Is it currently possible to do this?

  • 3
    This should be trivial on SEDE. – yannis May 13 '13 at 3:58

I posted a page that lists a user's questions by ascending score.


  • Uses the API to return results that are up-to-the-minute (excepting possible caching, by the API, on repeat requests)1.

  • The results are fully (re)sortable and searchable.

  • Can sort/search on almost every question field available in the API.

  • Supports URL parameters for automatic searches. EG:


Here's what the page looks like for the OP's current questions:

(Click for larger image)

1 The API gets current data. The Data Explorer (SEDE) data can be up to a month old.

  • +1 very cool! How about answers? – Aaron Bertrand May 13 '13 at 16:32

Nope, not possible right now short of using the data explorer as Yannis mentioned or writing something using the API.

Here's a query to get you started:

select Score, CreationDate, Id as [Post Link]
from Posts
where PostTypeId = 1 and OwnerUserId = ##userid##
order by Score asc

Once you plug in your userid, you can grab a permalink to the query that you can bookmark and revisit periodically to grab new results.

The obvious drawback, of course, is that the results can be out of date for up to a week, barring any issues that cause a delay in refreshing the data available through SEDE. Nor will this work for a site that's still in public beta, since those aren't available through the data explorer at all. Using the API would get around these limitations.

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .