Philipp Stark

🚀 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

NxtWave #day77 of #100daysofcode challenge #ccbp #intensive Toady i have attended an session on OOP concept and its application. Today i have made a video #day18 of #30daysspokenskills presentation on youtube here is the video https://lnkd.in/g8HJZ75C Successfully completed all the task. Grand Assignment - 4 Basics - Study material Basic Exercise Past Simple 4 | Study Material Past Simple 4 - Practice Set A Past Simple 4 - Practice Set B Past Simple 4 - Assessment

3

1 Kommentar

Bootcamp - Trees (Competitive Coding) !!! Starts Tomorrow !!! We are starting classes on TREES from TOMORROW - 30th July 2024 (Tuesday). GOAL The goal of the boot camp is to cover all concepts involved in solving tree problems in Competitive Coding up to 5* Codechef and Expert Codeforces. PRE-REQUISITES Candidates MUST be familiar with below concepts in order to have the most productive outcome from this boot camp: 1. Basic Recursion - Fibonacci, Factorial and Tracing Recursive Codes 2. List of List 3. Dictionary/Map 4. Set 5. Bitwise Operators ENROLLMENT You need to pay a nominal amount (to ensure sincerity) of Rs 500/- to attend this boot camp. In case you are interested, and meet the requirements above pre-requisites, you can enroll https://lnkd.in/ggnTnMJE CERTIFICATION 1. Folks who will be able to solve 80 Percent of the problems added in the contest will get digital as well as physical certificate. 2. Folks who will be able to solve 40 percent of the problems added in the contest will get digital certificate 3. Note:- In any case, if you are involved in plagiarism/malpractice you will not get any certificate. Note this boot camp is INTERMEDIATE to ADVANCE level and sets you apart from the crowd by enabling you to solve tree problems with ease. This boot camp requires 6 hours of self-drive practice per week. Timing: 4-hour classes per week (Tuesday and Friday) with a daily 2-hour practice session to make your learning process smoother. #BeingZero #PowerfulYetHumble #TreeBootcamp

22

It’s a struggle to find how much DSA is enough especially when you have a lot of concepts to learn 🧑‍💻⚡ But not anymore checkout CipherSchools for a curated data structure and algorithms playlist 🚀 Whether you're a beginner or looking to level up, we've got you covered guys 👍🏻 Check out comments for free DSA course details 🔗 Follow CipherSchools to unlock your coding potential for free 🔓🙌🏻 #freelearning #coding  #datastructure #datastructuresandalgorithms #dsa #algorithms #programming

7

1 Kommentar

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

👉Day 19: on Dsa_100_Days_Challenge Circular Linked Lists 🔹 Objectives: 1. Understand the concept of Circular Linked Lists. 2. Learn how to implement basic operations (insertion, deletion, traversal) on Circular Linked Lists. 3. Solve practice problems to reinforce these concepts. #dsa #100daysofcode

2

1 Kommentar

Day-6 #30daysofcode Today i build a build a Portfolio Website Footer Section by applying the concepts we learned #ccbp #nxtwave #html #css #bootstrap

3

Day 149/180 💹💹💹💹 C++ & DSA Topic: "Introduction To Trees | Binary Tree in Data Structure" I learnt: 1) Definition of Trees Data Structure 2) Understanding Trees 3) Example of Trees Data Structure 4) What is Binary Tree 5) create Binary Tree Data Structure 6) Implement Binary Tree Rohit Negi #180daysofcode #coderarmy #dsa

8

Finding Your Path in Programming: Guidance for Freshers As a fresher stepping into the world of programming, choosing the right language and institute can be daunting. At Master Key for Coding, the Best Programming Institute in India, we understand your confusion and are here to help you make the best decision for your career. Our comprehensive courses cover multiple programming languages, equipping you with versatile skills to excel in the tech industry. Here’s why joining Master Key for Coding is the best choice: 1. Expert Guidance: Our experienced instructors provide personalized guidance to help you choose the right programming language based on your interests and career goals. 2. Comprehensive Curriculum: We offer training in various programming languages, ensuring you gain a well-rounded understanding of the tech landscape. 3. Career Support: From campus recruitment advantages to increased placement opportunities, we support your career growth every step of the way. 4. Networking Opportunities: Join a community of like-minded peers and industry professionals, expanding your professional network and opportunities. Start your coding journey with confidence and clarity at Master Key for Coding. Contact us today to learn more about our programs and register for a demo! 📞 Contact us at: +91 81257 90231 #coding #programming #techskills #education #career #india #bestinstitute #fresher

1

🌟 Day 4 of #geekstreak2024 🌟 Another coding challenge completed on GeeksforGeeks! 🎉 Today’s Problem of the Day (POTD) was about mirroring a binary tree. 🌳 The goal was to reverse the tree structure so that left and right children of all nodes are swapped. I solved this using a recursive approach combined with a simple swapping technique for the left and right child nodes. Recursion made it intuitive and elegant to traverse and modify the tree. 🔄🌲 Loving how these daily problems are sharpening my data structure skills! Can’t wait for more challenges ahead. 💪 Link:- https://lnkd.in/d_AbQ8qf #geekstreak2024 #DeutscheBank #CodingChallenge #GeeksforGeeks #BinaryTree #Recursion GeeksforGeeks Deutsche Bank

8

#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

🌟 Participated in Hacktoberfest 2024 and managed to get 1 PR merged in a web application project. Although I couldn’t hit the 4-PR goal this year, I learnt so much more and here are a few takeaways I’d love to share: Understand the Value of Your Contributions – Every line of code you add contributes to something meaningful. Not only are you helping the project, but you’re also learning and growing from it. The Open Source Community is Amazing – People are genuinely helpful, and you’ll find the support you need to get started and keep going. My personal experience has been nothing short of welcoming! Ask Questions – There are no stupid questions; we all start somewhere. There were times people literally typed me detailed steps just to setup a basic application... Align Projects with Your Interests (A mistake I made with some) – Find projects that match your interests; it makes the work so much more enjoyable and valuable. Stay Active in the Community – Many projects have active communities, often on platforms like Discord. Engaging with others there can make a huge difference.

39

2 Kommentare

Starting a journey to master data structures and algorithms can be daunting, but with the right roadmap, you'll navigate this path with confidence. Here's a comprehensive guide to help you become proficient in DSA: 1. Pick a Language 🖥️: Begin with Python, Java, and C++ to build a solid foundation. These languages will give you a well-rounded understanding of syntax, logic, and problem-solving techniques. 2. Nail the Basics 🧩: These are the building blocks: - Arrays & Strings: Store and manipulate collections of data efficiently. - Linked Lists: Understand how to link data in a chain. - Queue Up & Stack Up: Think of stacks as a stack of plates and queues like a line of people waiting. 3. Venture into Advanced Territory🚀: - Trees: Learn how to organize data hierarchically. - Heaps: Understand how to prioritize data, like a to-do list with the most important tasks on top. - Graphs: Study how to represent networks. 4. Sharpen Your Algorithmic Edge🧠: Algorithms are like recipes for solving problems: - Searching Algorithms: Learn how to quickly find data. - Sorting Algorithms: Discover ways to organize data. - Greedy Algorithms: Understand how to make the best choices step-by-step. 5. Test Yourself 🏅: Put your skills to the test on online coding platforms. By tackling problems under time pressure, you'll refine your approach and boost your coding speed. One such platform is Dcrypt, an AI-powered platform that makes mastering these concepts easier than ever. Engage in active learning, mentorship, and real-world projects. Start using Dcrypt and watch your skills skyrocket! Visit our Website dcrypt.co.in and Check out our Community server https://lnkd.in/gRc_WHjh for real-time support. #Codrel #Dcrypt #CodingJourney #DataStructures #Algorithms #Dcrypt #TechLearning #LearnToCode #Programming #CodeNewbie #Python #Java #CPlusPlus #TechSkills #CodingLife #ProgrammerLife #DeveloperJourney #CodeChallenge #AI #Mentorship #RealWorldProjects #CodeSmarter #LearnWithDcrypt #BoostYourSkills #TechCommunity

12

1 Kommentar

Day 87 of #100daysofcode challenge, Today I solved a problem from CodeChef : 𝑹𝒐𝒄𝒌 𝑷𝒂𝒑𝒆𝒓 𝑺𝒄𝒊𝒔𝒔𝒐𝒓𝒔 𝐑𝐨𝐜𝐤 𝐏𝐚𝐩𝐞𝐫 𝐒𝐜𝐢𝐬𝐬𝐨𝐫𝐬 : https://lnkd.in/eJDjZAUE 𝐆𝐢𝐭𝐡𝐮𝐛 𝐫𝐞𝐩𝐨 : https://lnkd.in/eKFbAxQH Taking on challenges like these excites me and drives me to excel in coding. It motivates me to constantly push my limits and explore new horizons. Got feedback or any suggestions about the code? Share it below! Together, we can all level up our programming skills. #100DaysOfCode #Programming #CodeChallenge #CodingCommunity #CodeGoals #CodeChef #CodeForces #LeetCode

21

Day 21 of my #JavaScriptJourney! 🔄 Today, I explored callback functions and schedulers—gaining a deeper understanding of asynchronous programming. Excited to see how this enhances my projects! 💻 #50DayChallenge #FrontendDevelopment #Callbacks #Nxtwave #ccbp

12

🚀Day 8 of #gfg160 daysofcodechallenge 🚀Day 289 of #365daysofcodechallenge 🎯Today's Problem on GeeksforGeeks is :- Stock Buy and Sell – Max one Transaction Allowed :- Given an array prices[] of length n, representing the prices of the stocks on different days. The task is to find the maximum profit possible by buying and selling the stocks on different days when at most one transaction is allowed. Here one transaction means 1 buy + 1 Sell. If it is not possible to make a profit then return 0. Note: Stock must be bought before being sold. Examples: Input: prices[] = [7, 10, 1, 3, 6, 9, 2] Output: 8 Explanation: You can buy the stock on day 2 at price = 1 and sell it on day 5 at price = 9. Hence, the profit is 8. Constraints: Time Complexity: O(n) Auxiliary Space: O(1) 1 <= prices.size() <= 105 0 <= prices[i] <= 104 Difficulty Level of this problem is EASY. #gfg #geeksforgeeks #codinglife #gfg160 #geekstreak2024 #code #dsapractice #learntocode #learndsa #dsapractice #dailydsa #dsaproblems #learntocode #100daysofcode #dsa160 #problemsolving #codingchallenge #geeksforgeeks #codingjourney #consistency #consistencyiskey #leetcode #leetcodechallenge #nesaralam GeeksforGeeks

13