Recent Posts
log(DSA)
Slvb6F
No.409
Starting a new thread, I hope I can be as consistent as possible. If I'm being a lazy piece of shit, please call me out. Or I will end up a loser.
This is the thread I will use to log my DSA progress, which I will be practicing using Python. I will also occasionally post my attempts to implement complex data structures in C itself.
I've only done two algorithms yet, the "Two Number Sum", and "Validate Subsequence", which i will not be discussing here. Or maybe I will make a post about it, if I change my mind in the future.
I am studying from a structured DSA course from AlgoExpert, which I """bought""" for """100% discount""". The course has a total of 4 parts:
EASY: 25 lessons
MEDIUM: 55 lessons
HARD: 46 lessons
EXPERT: 34 lessons
Total: 160 lessons (already completed 2)
My goal is do complete THREE lessons every single day, practice them, and log my progress here. Each reply will be a different lesson, containing all possible solutions for said problem.
Now, for some questions.
>Why not NeetCode 150 ?
Idk really. I found this one good, and I'm sticking to it no matter what. Constantly jumping ship will lead to no progress and wastage of my time. Plus, 160 is close to 150, I don't think I'm doing that overkill. But still if any experienced anons want to give me tips or tell where I am wrong, please do. Better I be warned before going on a death voyage.
I actually did also """buy"""" NeetCode's courses on Beginner and Advanced DSA, but I'm sticking to the AlgoExpert one.
>LC ? CF ?
I will start LeetCode problems after finishing all the MEDIUM lessons, and I will start CodeForces after finishing all the HARD problems.
>Why ?
Because I don't want to be too overloaded. I'm doing 2 degrees at the same time(one online one offline), and I'm in my 2nd sem in B.Tech., so it's not too late. If I really am as consistent as I plan, I will finish this by the end of April, right before my sem2 exams.
>What are my end goals ?
My end goals are to become as proficient as possible in PyTorch, CUDA, and computer vision. But before that, I need to revise Statistics and Probablity, which I'll do i my spare time.
Thank you anons for visiting this thread, I'm pretty lonely irl, so it's nice talking to anons. I hope I can complete the goals in the intended timeframe.
Om Namah Shivaay!!!
M9OYGd
No.412
>>409(OP)
>I'm in my 2nd sem in B.Tech
Damn man, good for you. I don't even know how to code in any one language and am in 2nd sem .
Slvb6F
No.413
posting it here this early, so that if there is some important shit that anons need to tell me before i start, they can.
Slvb6F
No.414
>>412
>I don't even know how to code in any one language and am in 2nd sem
it's okay anon, it's not too late. just start with BroCode's video on python, extremely simple and easy to understand. just pause the video repeatedly in between and do every program he does by hand in your own PC too. it will take more time, but it will be engrained into you.
right now i'm going to sleep lmao, will post after doing it tomorrow.
M9OYGd
No.415
>>414
I have Java this semester, so i guess i will be learning that first. I had C last sem and I somehow passed it with decent marks (for my tier 69 college) but i swear to god i dont know shit about C.
bYTkcE
No.416
>>415
>I have Java this semester
it's easy enough pyaare, i used to do it from 8th to 10th grade. just think about coding and logic, understand how classes and objects actually work, don't think about OOP theory too much.
as for C, 80% of it is just the same as any other language. the main thing about it is:
>pointers
>allocation and deallocation
>dynamic arrays
>the concept of stack and heap(basically why we have to allocate and deallocate memory)
it's very easy and intuitive, you can learn it in a week.
just stop being negative and do it. i know that's easier said than done, but it's my goal for this year to: to just stop thinking and start doing things.
M9OYGd
No.417
>>416
Thanks for giving me some hope yaara, I will learn some java for an hour then go to sleep.
7ST2M3
No.418
>>410
Problem #3 (EASY)
Sorted Squared Array:
You are given a sorted array of numbers, and you have to return a SORTED array containing the squares of all numbers in the original array. Problem arises when there are negative numbers in the original array.
My solution(i tried to do this multiple times on my own, then asked Claude to point out the errors without telling me the answer): runs in O(n)
AlgoExpert solution:
i didn't know it was possible to do this without using the sort function.
dvrLQ3
No.419
>>418
just square them? what are constraints?
dvrLQ3
No.420
>>418
dont do in python, pick up cpp
7ST2M3
No.422
>>410
Problem #4 (EASY)
Tournament Winner:
You're given a list of competitions and a list of results. Each competition is a pair `[homeTeam, awayTeam]`. Each result is either `1` (home team won) or `0` (away team won). There are no ties. Every team plays every other team exactly once. Find and return the team with the most points.
My solution:
--> asked claude how to fix KeyError for dictionary: it helped by telling me the get() method
--> asked syntax help for the last return line, i didn't know how to get the index of the maximum value in a dictionary
i always explicitly tell claude to not tell me the answer, and only point out the errors.
AlgoExpert solution:
this one does not use max(), it keeps track of the element with the highest score. didn't think in that direction. does using max() at the end make it less efficient ? can some knowledgeable anon tell me ?
7ST2M3
No.424
>>420
>cpp
it's on my radar, in fact C i was originally planning to do DSA in C, but i found out that most data structures and their methods just aren't there in C or C++. i really like C, but i'm gonna do DSA in python, because of availability.
oniichan actually told me that doing DSA in C will be broatul, and i said i wana do it still. i didn't know at the time that the problem is actually that C libraries just don't have jack shit.
7ST2M3
No.425
>>423
thanks a lot yaar. i'll use it in the future, but right now i have committed to the AlgoExpert course. if i jump ship too many times i won't make any actual progress.
dvrLQ3
No.426
>>424
>>425
you are on pretty basic stuff.
first it would be much better if you do it in cpp, for lots of reasons.
second, you are in 2nd year, you should ideally complete atoz sheet by the end of this year or this sem itself if possible. then you should follow usaco guide for cp concepts as they are used in OAs of bigtech like amazon. dont be complacent and think you have 2 years, in 3rd year internship postings happen for bigtech if you have done sheet properly then you will be golden. after that learn any stack like mern or spring boot and side by side understand system design. you will literally be able crack a lot of companies like they are nothing but if you try to do this in 3rd year, you will feel tremendous pressue and stress(if you are ambitious about getting a good package).
7ST2M3
No.427
>>426
aaah, but switching to C++ will be a pain in the ass. okay saar, i'll try. but in a week or two, i am currently overloaded with a lot of academic volume.
>2nd year
i am in 2nd semester yaar, not 2nd year. but yeah, you're right. gotta start now.
dvrLQ3
No.428
>>427
bruh, its nothing different, you dont need to watch tutorials for languages, just get to know basic syntax for loops, conditionals, operators, pointers, functions and that's all.
just refer to this site. dont be stuck in video tutorials. and you also have llms now, so just ask them syntax and tell them to explain you anything in them.
7ST2M3
No.430
>>410
Problem #5 (EASY)
Non-Constructuble Change:
Given an array of positive integers representing coin denominations, find the minimum amount of change that cannot be created using any combination of the coins.
My solution:
--> understood initial logic, had to take claude's help for minor corrections
--> one major correction claude made was adding the two lines at the end, because loop was only going up to len-1
AlgoExpert solution: basically the same, instead of using i he just looped the elements of the array itself.
this was easy, but when i first looked at the problem, i had no idea how to do it, or which direction to think in. is it over for me ?
7ST2M3
No.431
god my eyes are tired. i wanna go to sleep, but slept a lot today already.
today i was very depressed the entire day. i had a fight with my mom in the morning about some family problems, and she teared up. i felt very guilty and disoriented the whole day. i apologised, and in the evening mom was back to normal. but i wasn't. i still feel like shit. i just wanna curl up in a ball and die.
7ST2M3
No.432
early morning mogg.
this is Taehan Kim, graduate of Yonsei University, one of the SKY unis. has a Bachelor's in Mech. Engg. This is his work experience.
>muh IIT
>muh IISc
we're all just frogs living in a pond. and the moment we see the outside world, we know our place.
7ST2M3
No.433
apparently some iitian on bhach earns 62 LPA and it is his first jaab.
just kill me at this point.
h7hgMS
No.434
Dyaus should really fix the font of blocks of code. not being monospaced is hard to read desu
7ST2M3
No.435
>>410
Problem #5 (EASY)
Find Closest Value in Binary Search Tree:
You are given a Binary Search Tree, and a target sum. You have to find the closest value in the BST to the target and return it.
My solution:
--> it was the reiterative one
--> i had to learn what the fuck BSTs are, and find out that they aren't naturally available in Python, and lose my shit over the fact that i just wrote a bunch of fake code that i can't even test.
AlgoExpert solution:
--> it is the recursive solution
it was easy to understand, i understood both the iterative and recursive one, and how their O(n) is different. but i just couldn't understand how the hell i'm gonna write code for shit that doesn't exist.
therefore i am only going to do one problem today. i'm gonna spend the rest of my time trying to implement these things in C++. that way i can truly understand what is going on here in terms of code.
>lmao this n!gga so retarded
yes, yes i am. and i am putting it on display for the whole world to see.
7ST2M3
No.436
>>435
problem #6, sorry
dvrLQ3
No.437
>>433
you have time, aim for faang unironically. this is why i am telling you finish atoz sheet. if you do it you will be our fagman of bhach
9n9U6N
No.438
>>437
>atoz sheet
ok, will look into it tomorrow sirs.
the problem is that I'm also doing the online BS in Data Science from IITM, and it has a lot of volume. I'm not having trouble understanding it (for now atleast), but i do have trouble covering it, so I'm not able to do much
plus I'm home for holi, therefore quite busy in family stuff too.
dvrLQ3
No.439
>>438
its quite good man you are doing it from 2nd sem itself, i was just coping about my supplyexams in calculus,chemistry at that time. just keep at it. effort is rewarded.
h7hgMS
No.440
>>438
>IITM
ayy my niqqa swole. how is the quality of content taught compared to btech? does the syllabus overlap yet
7ST2M3
No.441
>>439
>its quite good man you are doing it from 2nd sem itself
lmao no, i started in my drop year, took me 5 terms to complete foundation level, when you're supposed to do it in 2. i'm a year behind. i'm a piece of shit who didn't study. currently in first term of Diploma level, fastest you can do it is in 3 terms, i.e. 1 year. but i'm scared, because volume is too much.
>>440
hello yaar. hope you are relaxed. must be tough being away from family in holi. is it possible for them to come over, stay in a hotel for a couple of days ?
>how is the quality of content taught compared to btech?
miles, no, lightyears ahead. extremely high IQ and very articulate professors who relate the concepts to actual math as they teach. makes me sad that only IITchads are getting these kinds of professors. imagine if everyone in india had atleast half the quality of faculty as IITs.
>does the syllabus overlap yet
nah, not yet. i don't think it will either, i compared my kalej's syllabus to this, some courses are the same, but they never overlap timeline-wise.
dvrLQ3
No.442
>>441
dont think too much, just be consistent yaar.
7ST2M3
No.443
>>442
apne baare mein btao sirs, which tier kalej, which sem, package(if placed) ?
h7hgMS
No.444
>>441
i wish yaar. i have so many things to do on top of 8am-6pm classes on weekdays (studying, applying to part-time jobs, research, etc) i don't think i'll be able to even post on bhach during downtime anymore. my hair is going white from stress, i have zero friends because i spent saturday in the ECE lab studying, and my time management is screwed up so I end up planning my schedule badly and don't get time to myself (you know, basic stuff like eating, showering, anime, VNs). i cringe when i think of myself 4 years from now still stuck in this small town overworking myself like this
>is it possible for them to come over
Nah lmao it takes over 24h of continuous travel to reach my town, they can't be bothered. They have told me they will only visit me once here, during graduation.
you are miles better than me, at least you took initiative to do stuff like register for courses in your drop year. i was a NEET for almost one year after 12th and i wasted the entire time doing literally nothing besides playing videogames. I hate how disorganized I've become
anyway i should cease shitting in your general. sorry sirs
7ST2M3
No.445
>>444
>part-time jobs
lmao is it some serious shit or mcdonalds kekekek
>They have told me they will only visit me once here, during graduation.
broatul. will you ever go back, during summer break maybe ? or is it just 4 years of being away from family ?
>anyway i should cease shitting in your general. sorry sirs
abe nahi yaar, aaya karo, baatein kiya karo, lonely feel hota hai bahut. i don't have friends either, but because they're all retards. talking to them makes my brain melt.
>I hate how disorganized I've become
i was just like you in my drop year yaara. that's why i'm one whole year behind in my online degree. i'm trying to fight it as we speak. plus, i'm gaining weight, need to workout too, but i just don't have time.
just stay strong sirs, take a nap if needed. we'll all make it yaar.
dvrLQ3
No.446
>>443
tier 3, ncr, in 6th sem with 6.8 cgpa now, hoping to get an 8 this sem to catchup to 7 so that i can sit for most companies. been doing dsa from sept/oct. lacked regularility previously. but regular now from jan. i am generally targeting offcampus and will also try for bigtech. honestly its an aim to get placed in bigtech for me at this moment. there was a placement drive today for my batch, around 115 were eligible(7 was criteria). well yea. it has started sort of. its just i am aware of reality that have to apply for everything like tcsnextstep and other mass recruitments that will start in july.
7ST2M3
No.447
>>446
>tier 3, ncr
NCR is still NCR yaar. compared to that i am tier 69420+
>been doing dsa from sept/oct. lacked regularility previously. but regular now from jan
hmmm
>there was a placement drive today for my batch, around 115 were eligible(7 was criteria)
damn saar, wish you the best.
>its just i am aware of reality that have to apply for everything like tcsnextstep
that's what everybody else is telling me too, to go for the small jaabs and eventually level up.
wish you good luck sirs, do come here and post your progress every once in a while, it inspires me to be consistent too.
there is no escape from grinding. there is nothing else to do other than get up and fight.
h7hgMS
No.448
>>445
serious jobs lol. my kalej has a bunch of labs with professors hiring undergrad students for jobs in the summer holidays that continue throughout next semester. Working on stuff that sounds groundbreaking but irl the only people who get to really work with it are the PhDs and the professors, the undergrads just do boring stuff like data entry or writing reports, but it helps resume a lot when i'll be applying for internships next year. The pay is also very low, lower than even delivery jobs, but students who are not us citizens or green card holders (aka PRs) cannot work jobs off-campus in the US in their 1st year. Even after 1st year you can't work at something like McDonalds or KFC, or anywhere offcampus unless its directly related to what you're studying. Pretty strict stuff
>will you ever go back, during summer break maybe ?
If my application gets accepted for the national lab I'll have to stay back on campus for summer. I likely won't see my family until December 2027 to be honest :/ but from what I hear, this is very common in the US. people working on h1-b visas barely get enough time to come home
i can't wait to graduate and move to Europe or Asia
>plus, i'm gaining weight
that is pretty normal in 1st year if you have unhealthy college food kek https://en.wikipedia.org/wiki/Freshman_15
i am planning to move out of the college dorm after 1-2 years, it will probably be healthier and cheaper compared to overpriced shitty hostel food
7ST2M3
No.449
>>448
nice saar, wish you the best of luck. kabhi kabhar idhar aao, tell me of happenings in your kalej.
we're the only biharis here, we need to stick together kekekek.
7ST2M3
No.451
This is my new rival. I'm coming for you Taehan.
I'm gonna read his publications, and specifically specialise in his ares of interest, and specifically get cracked at the courses he chose.
This is your fault, Taehan, for coming into my LinkedIn feed, and making me feel like shit.
7ST2M3
No.452
>>410
IWKMS #1
New problem series: I Wanna Kill Myself
today i tried implementing Linked Lists in pure C. i was trying it a couple of weeks ago, but i couldn't understand it, but today i finally tried to do it. i posted my code to claude and GPT multiple times, asking for errors, but never directly the answer. i think i have a decent understanding of pointers and memory management now. my bad habit is that i constantly forget to use free().
i wrote the following functions:
Node* createNewNode(int value);
<creates new Node
Node insertAtBeginning(Node head, int value);
<inserts element at the beginning of a linked list
Node insertAtEnd(Node head, int value);
<inserts element at the end of a linked list
Node insertAtIndex(Node head, int value, int index);
<inserts element at the given index of a linked list
Node insertListAtEnd(Node head, int* arr, int arr_len);
<inserts an array at the end of a linked list
Node insertListAtBeginning(Node head, int* arr, int arr_len);
<inserts an array at the beginning of a linked list
void printLinkedList(Node* head);
<prints the linked list
void freeLinkedList(Node* head);
<frees the linked list (Claude wrote this one because i was tired)
AAAAAAAAAAAAAAAAAAAAAAAA
I WANNA KILL MYSELF
EVERYTIME I GIVE MY CODE TO CLAUDE SONNET 4.6 EXTENDED IT MANAGES TO FIND A NEW BIG OR MEMORY LEAK
MY FUCKING CODE WORKS
NO SEGMENT FAULT OR ERRORS OR WARNINGS
BUT CLAUDE ALWAYS FINDS A FAULT AAAAAAAAAAAAAAAA
7ST2M3
No.453
can't wait to implement BST in pure C tomorrow.
ahahahahahahahhahahaha
AHAHAHAHAHAHAHAHAHAHAHA
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA
itUHXn
No.457
>>456
Happy Holi Anon
7ST2M3
No.463
hoof, haven't posted in a while huh. sorry anamas, got tangled in holi and Java. will post today.
7ST2M3
No.464
nvm i give up. BSTs are too hard. i'll post tomorrow.
7ST2M3
No.468
i have exam on sunday. no programming until then.
b/KbHf
No.469
my brain is fucking fried. too much information consumed in the last two weeks.
9KaZgP
No.470
write code -> GPT analysis -> errors -> write code -> GPT analysis -> errors -> write code -> GPT analysis -> errors -> write code -> GPT analysis -> errors
it never ends. can anons here help me ?
