The index(), count() and other "functions" you mention aren't standalone functions, they are methods of lists. That means you apply them to the list, like this: test = [1, 2, 3, 4, 5, 6] print(test.index(3)) # print index in list of the element of value 3 The list methods are described in the documentation . More on reddit.com

I wouldn’t wait to apply to jobs just because you don’t have a SQL background. I don’t think I’ve written SQL at work in years. Most work is done with ORMs or NoSQL where I work, and probably most Django devs are using Django’s ORM with some very rare exceptions. I occasionally sit on technical interview panels at work for Python developers and I can give you some advice: Learn SQL (at least basics) concurrently with your job search. Basic proficiency can probably get you by for most positions. Just accept that the positions that focus on strong SQL command aren’t gonna be a good fit for you. Most junior roles aren’t going to have expectations beyond basic proficiency though Be honest about your level of experience. I can respect a candidate that has the courage to tell me they don’t know something but are interested in learning it. I don’t respect a candidate that fumbles their way into trying to give a bullshit answer Present your strengths. This is really something minor that can be learned on the job. This wouldn’t stop me from hiring a junior if they had the other background you have (docker, CI/CD, etc.). Steer the conversation towards the things you are knowledgeable in, and show confidence in your abilities in these areas More on reddit.com

I am reading that as result = 6+ tri_recursion(6 - 1) Which is correct, but what is happening then? You enter the next recursion depth as tri_recursion(5) which because 5 > 0 calls 5 + tri_recursion(5 -1) Brings us to the next depth level as tri_recursion(4) -> 4 + tri_recursion(4-1) Next level: 3 + tri_recursion(3 - 1) -> 3 + tri_recursion(2) Next: 2 + tri_recursion(2 - 1) -> tri_recursion(1) Next: 1 + tri_recursion(1 - 1) -> tri_recursion(0) For tri_recursion(0)´ the conditionk > 0is no longer satisfied and thus theelsebranch is executed which executesreturn(0)` With this return we move one level back in the recursion to result = 1 + tri_recursion(1 - 1) -> we have the return value from the tri_recursion(1 - 1) call, which is 0 -> so it becomes result = 1 + 0 -> result = 1 The next executed line in the code is print(result) -> which prints the 1 The else´ branch is skipped and the next executed line isreturn resultwhich brings us one level back up to2 + tri_recursion(2 - 1)- the return value from before is1, so it becomes2 + 1->3` which is what is printed. And this goes on until you are back out of all levels. That is what recursion is. More on reddit.com

I think people who know the basics and go to w3 to refresh stuff recommend it but they themselves didn't learn it there. More on reddit.com