I am a B.Tech(CSE) Student. My first semester has been finsished and going to begin with second semester. I have learnt basic Python and currently i am learning C. Should i start with basic concepts of DSA or not ?

I am a B.Tech(CSE) Student. My first semester has been finsished and going to begin with second semester. I have learnt basic Python and currently i am learning C. Should i start with basic concepts of DSA or not ?

Count the sequential key press

I am getting back on the Leetcode grind in preparation for rejoining the workforce as a SDE. I am pretty certain I got this question right, and according to my custom test case it does pass. Why does it not behave as expected when submitted?

I know in stack overflow people are cold and say rude words but despite that I feel they have enough knowledge to guide one person. I am currently in 4th year of my college. Everyone got their stuffs and I had mine that’s why I am not good in programming but I want to do well , crack internship and take part in hackathons. Please don’t get angry at me and say rude words. Please tell me a road map I can follow for three months to change my life. I really want to do something.

void inorderPredecessor(Node* root, Node* &pre,int key){
if(root == NULL ) return ;

Application of dsa like polynomials in linked list ,expression evaluation and backtracking in stacks etc important? Mainly in terms of placements

I am new to Competitive Programming coming from DSA i want a path to becoming a good competitive programmer. I am currently at ease while solving 800 , 900 questions. And i have about an year or so for learning it. Thanks…

I was currently in my final year of bachelors in computer science and engineering and i was searching for job. i need a good resource to about fundamental patterns in datastructures and algorithms to crack my interviews and to participate in competative programming related contests.

I’m a beginner with Python and I’m trying to learn user-defined data structures. I’m confused why one would ever want to use an array implementation of a binary tree. It’s equally time efficient and less memory efficient than classes. The only use cases I can think of seem far too obscure to be put on a free learn-to-code site.