In Java

Hi Everyone, I know there are tons of similar libraries out there, but I’ve implemented a TypeScript data structure collections that is pure TypeScript with Comparator for custom types, fast, and fully tested with zero external dependencies. Any kind of feedback is welcome!

See: https://github.com/baloian/typescript-ds-lib

Original post: vertex cover to 3 sat? 3 sat to vertex cover, since both are np complete?

Read the full blog post here: https://www.interviewhelp.io/blog/posts/vertex_cover_to_3_sat_3_sat_to_vertex_cover_since_/

Original post: Sorry if wrong place but question about a structure to store data/time

Read the full blog post here: https://www.interviewhelp.io/blog/posts/sorry_if_wrong_place_but_question_about_a_structur/

if both are np complete then they both reduce to one another?

3-SAT ≤ P INDEPENDENT-SET ≤ P VERTEX-COVER ≤ P SET-COVER.

There is a slide in princeton that says this. but instead of < shouldn't it be equivalent? since all of them are np-complete?

the definition of np complete says that every problem in np will reduce to it and that is np hard as well.

https://preview.redd.it/bvssjjlxn96e1.png?width=1616&format=png&auto=webp&s=442874adba997177683802d2c5f9ff617d0f4ffb

So I signed up for a competition that is worldwide it's called ICPC and I have like 8 months left for the national teams qualifications. The competition is about problem solving, data structure and algorithm. Given that I'm still a junior in the cs world I need your experience and tell me how and from where should I start.

I'm willing to put all of my time in this it's a good cause either ways so I need the perfect plan to master these things.

Hey I'm doing DSA about 34% done in my second semester. But the mid term exams are coming next week what should I do should I stop my DSA for a week? Or do what?

What's the yt playlist or website to learn DSA in c++ and also best way to practice it??

Hello, I have been programming for a while and I would love to study DSA in depth to get to understand programming concepts in depth. I have watched videos on youtube but none of the ones I have seen seem to hit the mark for me. Looking for suggestions from anyone on resources that made them improve and get better at it. Cheers!

Hi all,

I'm looking for a fast, space efficient data structure that allows me to look up values by partial key - so if value V has keys given by functions f0, f1..fn I should be able to lookup all V such that f0(V)=X for key value X, or all V such that f1(v)=y, etc. (apologies for shitty mobile formatting). Could have a hash or tree map per function but I'm looking for other alternatives to play around with. Lookup must be fast, insertion/deletion less important.

Any ideas?

Original post: Working on a video on Dijsktra's algorithm

Read the full blog post here: https://www.interviewhelp.io/blog/posts/working_on_a_video_on_dijsktras_algorithm_/

Original post: How much DSA

Read the full blog post here: https://www.interviewhelp.io/blog/posts/how_much_dsa/

Original post: Plz guide me

Read the full blog post here: https://www.interviewhelp.io/blog/posts/plz_guide_me/

Original post: What is the answer? I think B because X is dependent on Y right?

Read the full blog post here: https://www.interviewhelp.io/blog/posts/what_is_the_answer_i_think_b_because_x_is_dependen/

Original post: Recursion and Backtracking

Read the full blog post here: https://www.interviewhelp.io/blog/posts/recursion_and_backtracking_/

Original post: Caution: log2base2 Not refunds if bought in offer.

Read the full blog post here: https://www.interviewhelp.io/blog/posts/caution_log2base2_not_refunds_if_bought_in_offer/

Original post: About Data Structure

Read the full blog post here: https://www.interviewhelp.io/blog/posts/about_data_structure_/

Original post: Started DSA but...

Read the full blog post here: https://www.interviewhelp.io/blog/posts/started_dsa_but/

Original post: Let's understand Selection Sort

Read the full blog post here: https://www.interviewhelp.io/blog/posts/lets_understand_selection_sort_/

Original post: Solution

Read the full blog post here: https://www.interviewhelp.io/blog/posts/solution/

I wanna start doing DSA so is the competitive programmers handbook a good guide for beginners like me? Also where should I practice problems? Or is yt tutorials better? Idk anything bout it...Any guidance would be appreciated 👍👍

log2base2 - all the videos are less than a minute duration/not too many videos. And it takes time to load the videos from US(server is very slow). they dont cover all the aspects of DSA (youtube is more effficient). Accidentally bought in offer last week.

After realizing all this, i cancelled the subscription and asked for refund. They refused to refund (kind of cheating), stating they wont refund if the course is bought in offers. i lost my 90$

Suggest me best course for recursion and backtracking in C++ on Udemy or YouTube either paid or free. Please give me the best I guess this is really important topic and I couldn't find any useful resource on YouTube.

Suppose that X ≤p Y. Which of the following can we infer?

A. If X can be solved in polynomial time, then so can Y.

B. X can be solved in poly time iff Y can be solved in poly time.

C. If X cannot be solved in polynomial time, then neither can Y.

D. If Y cannot be solved in polynomial time, then neither can X

Hello everybody i am a student and i am in my first year and i wanted to do competitive programming, i have few questions can you guys give me the answer of these questions

1. what to start first dsa or cp
2. if i complete dsa at a certain level so it would made easy to do cp
3. which courses should follow for dsa and cp
4. which specific set of problems should do in each rating(800,1000,1200)
5. how much problems should we do in each rating(800,1000,1200)