Hristijan Petreski

#Day22 DSA (Priya Bhatia )(Raghav Garg ) Question covered =>count pairs whose sum is less than target WebDevelopment (Anurag Singh ) #CSS -Position Static -Position Relative in Depth -Top Property with Relative Position -Bottom Property with Relative Position - Left Property with Relative Position -Inset Property with Relative Position -Unset Value of Relative Property 🔻Position property of each element is static(by default), we can set it relative or absolute or sticky or fixed. 🔻inset ⇒ it includes all 4 (top, bottom, left , right) 🔻unset ⇒ it will change the position to static #css #html #javascript #dsa #algorithms #datastructure #frontend #coding #developer #consistency #learnings #staymotivated #techjourney #leetcode #dailyquestions #connections #web #webdevelopmeny #bennett #bennetian #codeeveryday

5

Assalam U Alikum Connections ! #day16 / 50 DSA CHALLANGE Today I solved Binary search DFS Traversal methods #LeetCode problems (Traverse a tree using Inorder , preorder , postorder methods ). I solved same problems in January but at that time I solved them in a high Time and Space Complicity but for this time I solved in 0 ms and the Time and Space Complicity is O(N). This Tree Series journey should be wonderful and hope so a good problem solver in terms of trees.

15

4 komentarze

Hello Geeks..! We are here for you with the Ultimate Challenge GfG160 🥳🎉 Boost Your DSA Skills with GfG 160! 🎯 💻 Solve a daily DSA problem 📚 Watch editorials & tackle bonus problems ✔️ Become interview-ready in just 160 days! 🎒 And that's not all—earn an assured GeeksforGeeks bag as you complete the journey! Start your journey to mastering DSA today! 🚀 𝗛𝘂𝗿𝗿𝘆 𝗨𝗽 𝗥𝗲𝗴𝗶𝘀𝘁𝗲𝗿 𝗡𝗼𝘄! https://lnkd.in/g8fdNr9n *Insight of GfG 160💡✨ Comprehensive Topic Coverage: Arrays, Strings, Sorting, Hashing, Two Pointer Technique, and more. Perfect for Coding Interviews: Enhance Student's programming abilities and prepare for interviews. Structured Learning: Follow a roadmap for maximum effectiveness. *Key Benefits of GFG 160🗝️💻 160 Curated DSA Problems: Solve the most essential problems, each supported by detailed articles and video explanations. Bonus Practice: 90 additional problems for a total of 250 challenges to strengthen your skills. Exclusive Completion Certificate: Showcase your achievements and skills to future employers. Free Career Roadmap Workshops: Learn about trending technologies like DevOps, Full Stack, and more to stay ahead. Exciting Rewards: Consistent effort guarantees you a cool GeeksforGeeks bag as a token of their dedication!🧑🏻‍💻 #gfg160 #geeksstreak2024 #GFGStudentChapter #GeeksforGeeks #DSA #CodingJourney

27

3 komentarze

Jhankar Mahbub Sir Reference for CSE Student's For CS101 : 1. কম্পিউটার প্রোগ্রামিং (৩ টা খণ্ড ) - তামিম শাহরিয়ার সুবিন স্যার 2. Teach Yourself C/C Plus Plus - Herbert Schildt 3. C/C++: The Complete Reference - Herbert Schildt 4. Programming with C - Byron Gottfried For Data Structure & Algorithm (DSA) : 1. প্রোগ্রামিং কনটেস্ট : ডেটা স্ট্রাকচার ও অ্যালগরিদম - মোঃ মাহবুবুল হাসান 2. Introduction to Algorithms - Thomas H. Cormen 3. Grokking Algorithms - Aditya Y. Bhargava Also you can read Schaum Series books. For Object-oriented programming (OOP) : 1. জাভা প্রোগ্রামিং - আ ন ম বজলুর রহমান 2. Programming with Java - E Balagurusamy Also you can read Head First Series books. For Discrete Mathematics : 1. Discrete Mathematics - Professor A. F. M. Abdur Rahman, Dr. Ayub Ali 2. Discrete mathematics with applications - Susanna S. Epp 3. Discrete Mathematics and Its Applications (SIE) - Kenneth Rosen Jhankar Mahbub Thank You Sir.

7

Exciting Announcement! 🤩 Still wondering how to master DSA from scratch? 🤔 Here's an incredible opportunity for those serious about excelling in Data Structures and Algorithms 🚀 Enroll now in the Exam_prep_tool 𝗗𝗦𝗔 𝗽𝗹𝘂𝘀 𝗜𝗻𝘁𝗲𝗿𝗻𝘀𝗵𝗶𝗽 𝗖𝗼𝘂𝗿𝘀𝗲 and save upto 𝟯𝟬% 𝗼𝗳𝗳. Access top-notch resources and become Placement Ready for just 𝗥𝘀. 𝟭𝟬𝟱𝟬𝟬! 🌟🤑 Stop hesitating and seize the chance to become a DSA expert today! 💪🏻 Here's what you'll gain: ➡️Live and recorded lectures ➡️Comprehensive coverage from Basic to Advanced DSA ➡️Placement readiness in just 60 days ➡️Personalized one-on-one guidance ➡️500 top curated practice questions ➡️Course designed for all branches ➡️Includes OS, DBMS, CN, and DSA interview questions ➡️Open doors for Internship opportunities To avail an additional *30% discount,* use our exclusive coupon code: *ept939bha* 𝗦𝗶𝗴𝗻𝘂𝗽 𝗻𝗼𝘄: https://lnkd.in/gpw9W8zJ DSA Course Link: https://lnkd.in/g2QNEqfV #gatecse #gateda #placements #dsa #algorithms #datastructures #programming #iitian #exampreparation #testseries #gate

1

🚀 Day 12/30 of the DSA Challenge 🚀 Today, I dive deep into the world of singly linked list. I have explore more problems with different approach and new concepts. Consistency is proving to be the most rewarding aspect of my journey! 🔄 Previous Revision + Problems Solved 🔄 Merging Two Sorted Linked Lists into One: Combining two sorted lists into a single, streamlined sorted list. Merging Multiple Sorted Linked Lists into One: Tackling the challenge of merging multiple sorted lists while maintaining order. Finding the Middle Element of a Linked List: Implementing efficient algorithms to pinpoint the exact middle of the list. Cycle Detection in a Linked List: Utilizing advanced techniques to determine if a linked list contains a cycle, a crucial skill for list manipulation. This marks Day 12 of my 30-day DSA challenge. The journey has been incredibly enlightening, and I'm thrilled to continue exploring more data structures and algorithms in the days ahead. Let's keep pushing the boundaries and growing together! 💪✨ #dsa #30daydsachallenge #cpp #striverdsasheet #linkedlist #coding #programming #learning #growth

4

🚀#Web_Development :-101 days coding challenge 🚀 #Day- 38🔥 🙏Hello connection’s 🙏 🌟 **This is a Day 38of My Sigma WebDev Journey: JavaScript- Selecting by IDs, Classes, and more 🌟 In JavaScript, selecting HTML elements is a common task when you want to manipulate or interact with the DOM (Document Object Model). 🔻Here’s a quick guide on how to select elements using IDs, classes, and other methods.🔻 1️⃣Selecting by ID : - 🔸**Method**: `document.getElementById('id')` 🔸 **Usage**: Selects a single element with a specific `id` (IDs should be unique). ⚡️javascript⚡️ const element = document.getElementById('myId'); 2️⃣Selecting by Class : - 🔸 **Method**: `document.getElementsByClassName('className')` or `document.querySelectorAll('.className')` 🔸**Usage**: Selects elements with a given class name. - `getElementsByClassName` returns an HTMLCollection (live). - `querySelectorAll` returns a NodeList (static). ⚡️javascript⚡️ const elements = document.getElementsByClassName('myClass'); const elements = document.querySelectorAll('.myClass'); 3️⃣Selecting by Tag Name : - 🔸**Method**: `document.getElementsByTagName('tagName')` 🔸**Usage**: Selects all elements with a specified tag name. ⚡️javascript⚡️ const elements = document.getElementsByTagName('p'); 4️⃣Selecting with CSS Selectors : - 🔸**Method**: `document.querySelector('selector')` or `document.querySelectorAll('selector')` 🔸 **Usage**: Selects elements based on CSS selectors. - `querySelector` returns the first matching element. - `querySelectorAll` returns all matching elements. ⚡️javascript⚡️ const firstElement = document.querySelector('.myClass'); const allElements = document.querySelectorAll('div > p'); 5️⃣Selecting by Attribute : - 🔸**Method**: `document.querySelector('input[name="attributeValue"]')` or `document.querySelectorAll('input[name]')` 🔸 **Usage**: Selects elements based on their attributes. ⚡️javascript⚡️ const input = document.querySelector('input[name="username"]'); 🔻Summary🔻 🔹**getElementById**: Selects a single element by its unique ID. 🔹**getElementsByClassName**: Selects all elements with a given class name. 🔹**getElementsByTagName**: Selects all elements with a given tag name. 🔹**querySelector**: Selects the first element that matches a CSS selector. 🔹**querySelectorAll**: Selects all elements that match a CSS selector. These methods provide flexibility in how you can select and manipulate elements within your web pages. #HTML #CSS #Java_Script⚡️ #LearningEveryDay #FrontendDevelopment😍 #WebDevelopment #CodingJourney #Sigma_Web_Development_Course🧑‍💻🚀 #You_tube

6

Day 9️⃣ 2️⃣ of #100daysofcoding and #75daysDSA Challenge 🚀 Today , I learnt about Priority Queues and the Big O of Heaps in DSA. >> Priority Queues A priority queue is an abstract data type that operates similarly to a regular queue but with an added feature: each element has a priority associated with it. In a priority queue, elements with higher priorities are dequeued before elements with lower priorities. If two elements have the same priority, they are dequeued in the order they were enqueued. >> Big O Complexity in Heaps The time complexity of heap operations is crucial for understanding their performance in various scenarios. Below is a summary of the time complexities for different heap operations: • Insert (push): O(log n) • Remove (pop): O(log n) • Peek: O(1) • Heapify Up: O(log n) • Heapify Down: O(log n) • Build Heap: O(n) #DSA #DataStructures #Algorithms #100daysofcoding #75daysDSA #Heaps #PriorityQueue #BigO

19

2 komentarze

🌺Week 1 Day 4 of #Leetcode Today I Have Did Some Qustion Practices on leetcode This week, under the expert guidance Love Babbar Sir , Vishwa Mohan sir , Sandeepak Singh sir , Mithun S sir . Key Highlights: 1.🐦 Insert ,Delete and getRandom O(1).(Meduim) 2.🐍 Gas Station(Medium) 3.🦐Candy Problem (High) This Qustion was incredibly informative, providing a strong foundation in Problem solving and how to use it effectively in real-world scenarios.

4

🌟 Day 38 of the 45-60 Days DSA Challenge 🌟 Today, I worked through two problems focusing on permutations: 1. Permutations 2. Permutations II These problems really tested my understanding of backtracking and recursion. Feeling accomplished and ready for more challenges! 💪 Arsh Goyal #DSAChallenge #Day38 #ProblemSolving #Permutations #Backtracking #CodingJourney #CrackYourInternship #CrackYourPlacement

4

Day 11 of #ArshGoyal DSA Challenge #CrackYourInternship Today marks the 11th day of my journey to prepare for internships by taking on Arsh Goyal's DSA coding challenge! 💻🚀 The goal: Solve 5-6 Data Structures and Algorithms questions daily. Why am I doing this? To sharpen my problem-solving skills To build a strong foundation in DSA To increase my chances of landing a great internship I'm excited to see how much I'll grow over the coming weeks. #CodingChallenge #DSA GitHub Repository: https://lnkd.in/gCaPBpYH Todays Questions : 1) Permutation in the array 2) Best time to buy stock 3) Two Sum 4) Best time to buy stock 2 5) Subarray sum divisible by k

2

Day 14 of #ArshGoyal DSA Challenge #CrackYourInternship Today marks the 14th day of my journey to prepare for internships by taking on Arsh Goyal's DSA coding challenge! 💻🚀 The goal: Solve 5-6 Data Structures and Algorithms questions daily. Why am I doing this? To sharpen my problem-solving skills To build a strong foundation in DSA To increase my chances of landing a great internship I'm excited to see how much I'll grow over the coming weeks. #CodingChallenge #DSA GitHub Repository: https://lnkd.in/gCaPBpYH Todays Questions : 1) Reverse Linked List 2) Reverse Linked List II 3) Palidrome Linked List 4) Sort List 5) Remove duplicates from sorted list II 6) Remove Nth node from end of the list

2

Day 18 of #ArshGoyal DSA Challenge #CrackYourInternship Arsh Goyal Today marks the 18th day of my journey to prepare for internships by taking on Arsh Goyal's DSA coding challenge! 💻🚀 The goal: Solve 5-6 Data Structures and Algorithms questions daily. Why am I doing this? To sharpen my problem-solving skills To build a strong foundation in DSA To increase my chances of landing a great internship I'm excited to see how much I'll grow over the coming weeks. hashtag #CodingChallenge #DSA GitHub Repository: https://lnkd.in/gCaPBpYH Todays Questions : 1) Circular Tour 2) Agressive cows 3) Reverse Nodes in K group 4) LRU Cache 5) The Celebrity Problem 6) Remove All Adjacent Duplicates in String II

2

Day 10 of #ArshGoyal DSA Challenge #CrackYourInternship Today marks the 10th day of my journey to prepare for internships by taking on Arsh Goyal's DSA coding challenge! 💻🚀 The goal: Solve 5-6 Data Structures and Algorithms questions daily. Why am I doing this? To sharpen my problem-solving skills To build a strong foundation in DSA To increase my chances of landing a great internship I'm excited to see how much I'll grow over the coming weeks. #CodingChallenge #DSA GitHub Repository: https://lnkd.in/gCaPBpYH Todays Questions : 1) Middle of Linked List 2) Linked List Cycle 3) Remove Dublicates from sorted list 4) Implement stacks using queues 5) Implement queues using stacks 6) Backspace string compare

1

Today I applied for a HTML CSS #internship with minimum pay ever thinked, I recieved their first assessment round which of 5 DSA hard level question, What should I do now, should I do #DSA in #HTML.

4

2 komentarze