List of algorithms Puns

r/findareddit : no. 1

r/PsychologicalTricks : no. 2

r/whatsthatbook : no. 3

r/NewToReddit : no. 4

r/roomdetective : no. 5

r/makemychoice : no. 6

r/scienceofdeduction : no. 7

r/20questions : no. 8

r/savannah : no. 9

r/FridgeDetective : no. 10

r/AnimalsBeingMoms : no. 11

r/weirdal : no. 12

r/bald : no. 13

r/TrueAskReddit : no. 14

r/MemeTemplatesOfficial : no. 15

r/internetparents : no. 16

r/HappyTrees : no. 17

r/ThePonkeysMaw : no. 18

r/ariheads : no. 19

r/agedlikewine : no. 20

r/Dentistry : no. 21

r/RadicalChristianity : no. 22

r/dragonball : no. 23

r/Crushes : no. 24

r/DenzelCurry : no. 25

r/music_survivor : no. 26

r/RapMoreLikeCrap : no. 27

r/wikipedia : no. 28

r/IHE : no. 29

r/Adulting : no. 30

r/Stuck10YearsBehind : no. 31

r/jahcoin : no. 32

r/fearsineverknewihad : no. 33

r/DouchebagGenie : no. 34

r/Brooklyn : no. 35

r/snackexchange : no. 36

r/whatstheword : no. 37

r/transgendercirclejerk : no. 38

r/RandomKindness : no. 39

r/curiousvideos : no. 40

r/NoSleepOOC : no. 41

r/ClassicalMemes : no. 42

r/ryancreamer : no. 43

r/riddles : no. 44

r/iamveryculinary : no. 45

r/PirateKitties : no. 46

r/User_Simulator : no. 47

r/birthcontrol : no. 48

r/LGBTeens : no. 49

r/HomeworkHelp : no. 50

Let me know in the comments if you want me to reply with personal recommendations based on your own post history!

SubRecommendations bot over at r/RedditRecommender will generate a list of similar subreddits for any sub. Try a search on a sub that interests your target audience and you may be surprised by the results. You can discover one of your audience's related interests which can give you an edge in communicating with them.

For example: Did you know there is a strong relationship between first-time-home-buyers and pet services particularly for dogs (but also sometimes horses)? It seems intuitive, but you don't really think about it until you see several dog and horse subreddits come up as similar for r/FirstTimeHomeBuyer.

Here are the recommendations for readers of r/marketing:

r/marketing : no. 1 score: 441.4890531306652

r/content_marketing : no. 2 score: 132.88692356285534

r/digital_marketing : no. 3 score: 113.59723993099827

r/socialmedia : no. 4 score: 92.04721685153149

r/SEO : no. 5 score: 88.60689418034902

r/AskMarketing : no. 6 score: 88.35340883522086

r/DigitalMarketing : no. 7 score: 88.35340883522086

r/ecommerce : no. 8 score: 86.15047229011164

r/PPC : no. 9 score: 80.59237730365282

r/advertising : no. 10 score: 70.64088735117534

r/Affiliatemarketing : no. 11 score: 69.24719679045366

r/sales : no. 12 score: 65.41088991786934

r/bigseo : no. 13 score: 65.01713964596797

r/SocialMediaMarketing : no. 14 score: 58.47024636765635

r/juststart : no. 15 score: 56.798619965499135

r/copywriting : no. 16 score: 54.747982996443135

r/EntrepreneurRideAlong : no. 17 score: 54.62283859545589

r/smallbusiness : no. 18 score: 51.96181872717329

r/Emailmarketing : no. 19 score: 47.71149920616921

r/startups : no. 20 score: 47.68165886624552

r/sweatystartup : no. 21 score: 47.207081411295356

r/analytics : no. 22 score: 43.279497994033534

r/Entrepreneur : no. 23 score: 43.181492029441124

r/adwords : no. 24 score: 42.94034928555229

r/adops : no. 25 score: 37.20833859759949

r/shopify : no. 26 score: 36.71661887545194

r/growmybusiness : no. 27 score: 34.62359839522683

r/SideProject : no. 28 score: 34.09400324149109

r/startup : no. 29 score: 33.84714400643605

r/InstagramMarketing : no. 30 score: 31.89286165508528

r/MarketingAutomation : no. 31 score: 28.0

r/freelance : no. 32 score: 27.14163392176412

r/influencermarketing : no. 33 score: 26.57738471257107

NSFW

r/agency : no. 35 score: 26.57738471257107

r/Blogging : no. 36 score: 25.96769879642012

r/FulfillmentByAmazon : no. 37 score: 23.642596234897443

r/woocommerce : no. 38 score: 21.6397489

I understand that BPE will return a list of which subwords should be encoded. My question is about the next step - how do they turn these subwords - which are just strings - into vectors?

Here are the papers for GPT-1 and GPT-2

I have a problem not specific to any language or framework, it's more like an algorithm question:

I have a list of "containers" that contain various items. Each item contained in a container has a quantity and a type, so maybe one container has 3 apples and 2 peaches, another container has 12 peaches and yet another has 5 pears.

I have to come up with an algorithm that takes in this information plus a request, and returns the minimum number of containers that can satifsy such request. The request is essentially a list of wanted items together with their wanted quantity, think of it like a shopping list.

So based on the example I gave above:

Container A:
    3 x apple
    2 x peach

Container B:
    12 x peach

Container C:
    5 x pear

and this request

I want:
    1 x apple
    6 x peach

the algorithm should tell me that the best way to satifsy this request is using both container A and B and that 1 apple and 2 peaches will be consumed from A and 4 peaches will be consumed from B (Or maybe all 6 peaches are consumed from B and A is used only for the apple, it really doesn't matter).

Also the algorithm should be able to tell when a request can't be satisfied based on available containers (for instance: a request of 35 watermelons wouldn't be possible to satisfy) and also give different priorities to different containers when possible (for instance: containers that are quicker to deliver should receive a boost compared to other containers with very similar contents but much harder to deliver quickly to the customer).

So far I've tried using a very trivial and kinda crappy scoring algorithm (pseudocode):

itemsLeft = copy(itemsInRequest)
containersLeft = copy(containers)
choosenContainers = []

while len(itemsLeft) > 0:
    if len(containersLeft) == 0:
        return Error("No more containers, can't satisfy request")
    bestScore = 0
    bestContainer = null
    foreach container in containersLeft:
        // Give a score based on the items it contains
        score = 0
        foreach item in itemsLeft:
            if container.contains(item.type):
                score += min(container.quantityOf(item.type), item.wantedQty)
        // Take priority into account
        score += container.priority
        if score > bestScore:
            bestScore = score
            bestContainer = container
    choosenContainers.append(bestContainer)
    containersLeft.remove(bestContainer)
    foreach item in itemsLeft:
        if bestC

Earlier today I posted a similar thread that was removed, "It [was] inappropriate for [this] subreddit"

I've have received several messages in my inbox today from people asking what happened to the post and requesting specific links. Due to the amount of requests I have decided to re-upload the list. If this thread gets removed I will not be re-uploading this list. Therefore, I suggest saving or bookmarking the course websites below.

• Berkley: CS 61B: Data Structures YouTube Lectures
• MIT: Introduction to Algorithms
• Princeton: Algorithms, Part 1
• Princeton: Algorithms, Part 2
• Princeton: COS 226
• Stanford: Algorithms: Design and Analysis, Part 1
• edX: Introduction to Programming with Java -Part 3: Fundamental Data Structures and Algorithms

Additional thanks to u/slayersource for the following link:

• UPenn edX: 4 Course Series covers basics, data structures, algorithms, and JavaScript

Apparently there is also a compiled list on github of all the available courses online on Data Structures & Algorithms, thanks to u/baltimore for finding this:

• https://github.com/Developer-Y/cs-video-courses#data-structures-and-algorithms

I'm curious if someone has a list of discriminatory computer algorithms.

I'm trying to figure out an algorithm to find the elements that are of depth n in a binary tree, where n is a non-neg integer.

As it's a binary tree I figure I can use recursion, so I've got the base case for n=0.

I'm not very familiar with binary trees, so I'm struggling to see what the recursive step would be.

Can anyone give me some pointers on what this would be?

I apologize in advance, my math isn't the best but I'll try to make my question as clear as I can.

Essentially I have a list L of size N. Let's imagine every element in L can be any non-negative rational number. I would like to create a function such that given some number a, it would return the best possible sub-groupings of L such that the sum of the elements in each sub-grouping of L is <= a. The objective here I guess would be to minimize the sum of all the differences between the sum of all the elements in every subgroup and a.

Example:

L = [2,2,3,3]

a = 5

f(L,a) -> ([2,3],[2,3])

Thank you.

Hi,

I'm having a interview with a quite big company next week and I'm not really a specialist algorithms and data structures topic but I have been programming for years and currently I'm working as a developer; Do you have any list that contains must read algorithms or questions or data structures for an interview that can be done within a week? I am familiar with topics I just need to be ready for these kind of questions since I have been working and did not take a programming contest for a while.

I'm currently reading this https://github.com/yangshun/tech-interview-handbook/tree/master/algorithms do you have any idea about it?

In the context of understanding gale shapley algorithm from algorithm design book by eva tardos and kleinberg, we can see that gale shapley algorithm produces the same stable matching output for a given set of preference lists of men and women. But in the same chapter, they also talk about an example where there could be multiple stable matchings. I ran the gale shapley algorithm for a few examples myself and I could see that the algorithm always returns just one stable matching output. In my example, the men always proposed first. If the women proposed it would result in a different stable matching outcome.

Like the title says: are there math "cookbooks" that list a kind of problem to be solved and the step-by-step "algorithm" (or "recipe") used to solve it?

A related idea I guess would be those laminated lists of equations or sometimes they have such a kind of list of equations inside textbook covers (though these do not necessarily show the step-by-step process of an "algorithm")

For instance, geometry:

Problem: Find length of hypotenuse of a triangle when you have values of sides.

1. a^2 + b^2 = c^2

2. Insert values for "a" and "b" and square each

3. Add together

4. Take Square Root of Each Side of Equation

On Youtube, I see a video where the guy recommends creating a cookbook for you to study yourself ... however I was wondering if these already exist rather than us have to manually look through math texts and create the algorithms ourselves.

edit: "of a triangle"

edit 2: So far the answer appears to be "no", so maybe this is something to be created. Will update this if any material comes forward.

Vsevolod Dyomkin recently published two new articles:

• https://lisp-univ-etc.blogspot.com/2019/08/programming-algorithms-arrays.html
• https://lisp-univ-etc.blogspot.com/2019/08/programming-algorithms-linked-lists.html

Hi,

I took a beginner computer science class, and am looking into taking the next level. It covers all the topics in the title in Java. I was hoping there was an online course that covers some (or ideally all of this) so I could get comfortable with the material and see if I'd like this class.

Thanks,

Big Mustard Tiger.

I am taking a Data Structures and Algorithm Class and we need to concatenate Two linked list. I was given these two linked list. We have to make the two list connect without changing anything. So the end list would be 2,3,1,4,5.

public class LinkedListDemo1 {
    
    
    public static void main(String [] args){
        LinkedList L1 = new LinkedList();
        L1.head = new Node(2);
        L1.head.next = new Node(3);
        L1.head.next.next = new Node(1);
        
        LinkedList L2 = new LinkedList();
        L2.head = new Node(4);
        L2.head.next = new Node(5);
      
        concatenate(L1.head, L2.head);
        

    }
        public static void concatenate(Node L1, Node L2){
        }

I have no idea what to put into the concatenate method. I don't even know where to start or what to put down first. All I really need is a first step and I think I can figure out the rest.

Just noticed recently that my list of who views my story has started changing and getting all out of order. Anyone else confirm this or is there a new algorithm?