Alexander Marktl

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

Get 100% Distraction free learning only with GeeksforGeeks Premium! (Subscription Giveaway in this post!) . . . . Here's what you need to do in order to win GeeksforGeeks Premium Subscription worth INR 6000 for Free: 1) Write a creative Ad Copy Highlighting the "Ad-Free Learning" Feature of GeeksforGeeks Premium 2) Comment down your answer + Like this post 3) Also fill the form attached below in the description. (We'll pick winners from there only as we will need your GfG ID to provide the access to you!) 4) Wait and hope you turn out to be the lucky won! (10 Geeks will be picked) . . Fill this form to be eligible for GeeksforGeeks Premium Giveaway: https://lnkd.in/gitSERfB . . Wait no more and start commenting! #geeksforgeekspremium . . . . #gfg #geeksforgeeks #gfgpremium #premiumgfg #premium #premiumsubscription

228

45 Kommentare

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

🚀 DSA on MONDAY! Get ready to ace your next interview with these 40 most asked DSA questions! Here’s your roadmap to success: ➤ Arrays and Strings: Find the maximum sum subarray. Find all substrings that are palindromes. Implement the "two sum" problem. Implement Kadane's algorithm for maximum subarray sum. Find the missing number in an array of integers. Merge two sorted arrays into one sorted array. Check if a string is a palindrome. Find the first non-repeating character in a string. Write a program to remove duplicates from a sorted array. ➤ Linked Lists: Reverse a linked list. Detect a cycle in a linked list. Find the middle of a linked list. Merge two sorted linked lists. Implement a stack using a linked list. Find the intersection point of two linked lists. ➤ Stacks and Queues: Implement a stack using an array. Implement a stack that supports push, pop, top, and retrieving the minimum element. Implement a circular queue. Design a max stack that supports push, pop, top, and retrieve the maximum element. Design a queue using stacks. ➤ Trees and Binary Search Trees: Find the height of a binary tree. Find the lowest common ancestor of two nodes in a binary tree. Validate if a binary tree is a valid binary search tree. Serialize and deserialize a binary tree. Implement an inorder traversal of a binary tree. Find the diameter of a binary tree. Convert a binary tree to its mirror tree. ➤ Graphs: Implement depth-first search (DFS). Implement breadth-first search (BFS). Find the shortest path between two nodes in an unweighted graph. Detect a cycle in an undirected graph using DFS. Check if a graph is bipartite. Find the number of connected components in an undirected graph. Find bridges in a graph. ➤ Sorting and Searching: Implement bubble, insertion, selection, and merge sort. Implement quicksort. Implement binary search. Implement interpolation search. Find the kth smallest element in an array. Count the number of inversions in an array (an inversion occurs when two elements are out of order). 🔍 But wait, there's more! Next week, we’ll dive into Dynamic Programming (DP), Backtracking, Hashing, Heaps, Tries, and Greedy Algorithms. Get ready to sharpen your problem-solving skills and master DSA! 💪 #DSA #InterviewPreparation #CodingInterview #DataStructures #Algorithms #TechInterviews #ProblemSolving #CareerGrowth #LearnToCode #TechSkills

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

🌺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 2 of #ArshGoyal DSA Challenge #CrackYourInternship Today marks the 2nd 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 gMove Zeroes reat internship I'm excited to see how much I'll grow over the coming weeks #CodingChallenge hashtag #DSA Github Repository : https://lnkd.in/gCaPBpYH Todays Questions : 1) 3 Sum 2) Find all dublicates in Array 3) Container with Most water 4) Spiral Matrix 5) Maximum Points You Can Obtain from Cards

2

🥊C++ vs. Java: Your DSA Language Showdown 🥊 Ready to conquer the world of Data Structures and Algorithms? 🚀 But which programming language is your secret weapon, C++ or Java? ⚔️ Let's break down the pros and cons to help you decide. C++: The Speed Demon 🏎️ -Performance: C++ is a speed demon, perfect for competitive programming or projects where every millisecond counts. ⏱️ -Control: With manual memory management and pointers, you have granular control over your code. ⚙️ -STL: The Standard Template Library offers a wealth of pre-built data structures and algorithms. 💪 -But be warned: C++ can be a bit more complex and time-consuming to learn, especially for beginners. ⚠️ Java: The Beginner-Friendly Giant 🧑‍🏫 -Simplicity: Java's object-oriented nature and automatic memory management make it easier to learn. 📚 -Portability: Write once, run anywhere! 🌎 Java's platform independence is a huge advantage. -Enterprise: Ideal for large-scale enterprise applications. 🏢 -However, Java might not be the fastest choice compared to C++ due to the overhead of the JVM. 🐢 So, which one should you choose? 🤔 Competitive Programming: If speed is your top priority, C++ is the way to go. 🏆 Enterprise Applications: Java's simplicity and portability make it a great choice for larger projects. 💼 Remember: The most important thing is to practice consistently and understand the underlying DSA concepts. 🧠 Both languages can equip you with the skills you need to succeed. Ready to dive in? Start practicing on platforms like LeetCode, HackerRank, and Codeforces. Your DSA journey awaits! 🚀 #DSA #DataStructuresAndAlgorithms #ComputerScience #Programming #Tech #Coding #Developer #SoftwareEngineer GeeksforGeeks Student Chapter - Chandigarh University Sudhanshu Sharma Sugandha Sharma Shashi Mehta Sagarika .

12

2 Kommentare

Saari creativity got over in the post below.... . . . Don't forget to download your FREE DSA E-Book now from link in comments to get started with #summerskillup with GeeksforGeeks! Form closing soon, so get it now. . . . . . . . . #dsa #learntocode #codinglife #ebook #summerskillup #dsalearn #codingfun #100daysofcode #engineeringlife #engineer #developer #song #lyrics #creative #spotify #lyricsedits #officelife #relatable #codingmemes #programminglife #programming

261

5 Kommentare

Day 37 #100daysofcode ❌DSA ✅ WEB-D || Harkirat Singh Project update :- I have successfully developed a comprehensive wallet-like feature in my latest project using the MERN stack. This feature includes essential functionalities such as adding funds, signing in and out, and transferring money. Github repo :-https://lnkd.in/g2yZq4si Z-pay:- https://z-pay.netlify.app/ #100daysofcode

5

🚀 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

🔹 Day 24: On Dsa_100_Days_Challenge Introduction to Queues 🔹 Key Concepts 1. Enqueue: Adding an element to the end of the queue. 2. Dequeue: Removing an element from the front of the queue. 3. Front: The first element of the queue. 4. Rear: The last element of the queue. 5. Empty: Check if the queue is empty. #dsa #100daysopfcode

3

Hi, friends, this is my weekly #learningprogress and I am very excited to share with you. #nxtwave #nxtwaveteam #nxtwaveccbp #nxtwaveintensive #ccbp #ccbpian #ccbpteam #ccbpintensive

3