devour | Do n't just consume your JSON API , Devour | REST library

I have this JSON in my js script that goes on for another 150 elements :

I've made two separate sections, one for an image slider and one for the "About Us" section which is more of a pre-footer, I wanted to push the text down a bit, however, whenever I give the text in the "About us" section a margin-top, it pushes down the entire "About us" section instead of the text only, any ideas on how to fix this?

I've created navigation with 3 items and a logo inside of it, I want the three list items to be on the right side of the page, is there any idea on how I can accomplish that?

As a part of SHA-256 hashing algorithm, there's a function that is often being referred as σ1, or sigma0 for convenience. Basically, it takes X as input, where X is 32-bit unsigned value. Then converts it like this:

I have a long string that I want to split into regular intervals of, say, 10 words each:

I am relatively new to Javascript, and just learned basic for loops and for in loops. How can I iterate over this object to get certain keys and values? there are a bunch of nested objects in objects, so i am kind of confused. I was thinking of using some sort of "Object...()" method, but not sure which one to use.

desired output outcome is an object with the given champion key, followed by the champion id/name = {"266": "Aatrox", "103" : "Ahri"}

example input below

I need to sort my query string by different parameters. For example:
[url]/handler?sort=-key1,key2 Now, the sorting happens on a list of dicts on each dict's metadata like so:

sorted(results_list, key=lambda obj:[(-obj["metadata"][x[0]] if x[1] == "desc" else obj["metadata"][x[0]]) for x in sort])

The parameters are digested from my handler and passed to the logic manager to process the sorting. This code is python 3. I want to make this sorting mechanism more extensible. Currently, it won't allow any sorting to happen that is:

1. Outside the metadata property scope.
2. not a number (for example sorting alphabetically).

I should say that I devoured answers here and saw that many of them suggest to override the cmp function and basically recreate my own sorting module from scratch. I don't think that either what I'm looking for hasn't been done before, or that it merits that kind of implementation. I could be wrong. We always learn.

So, how should I redesign this code to be more extensible?

Y'all, I'm trying to alleviate some of my work in migrating from a face-to-face teaching environment to one that is remote for at least the next three months. To this end, I am trying to create randomized lists of eligible vocabulary words for quizzes. I can have it generate up to eighteen sets of words for an identical number of quizzes, but I seem to be fumbling with checking whether the randomly selected word is already part of that quiz, i.e. I am getting a ton of repeats. Since one word is taught per day, this means the first biweekly quiz will have ten eligible words; the second, twenty words; the third, thirty words; etc. Please see the code below, and thank you in advance for your help!

I have the current response: