Devanshi Bilthare’s Post

Day91of #100DaysOfCode ✅Set up front-end in ChatApplication project

#helloconnections 💥 Day 51 of #100daysofcode 🚀 👨💻 Problem1 : Leetcode 1481. Least Number of Unique Integers after K Removals https://lnkd.in/dsASJPNC 📌 solution: check out my Github https://lnkd.in/dS_ytNSZ ⚡ #100daysofcodechallenge #consistency

I am excited to dive into this code extension! Calling all developers: What's your go-to tool for showcasing your code? Check out the link below: https://lnkd.in/gf3RdbDN

To help newbies find the right nocode tool for them, we've created a simple chart that ranks tools by use, power and learning curve. If you need it, check this page: https://lnkd.in/eRrMCPag #NoCode

🚀Day #6 of 100 Day code challenge! Question solved:-PERMUTATIONS. Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.

Daily Leetcode #day32 Problem of the day:1171. Remove Zero Sum Consecutive Nodes from Linked List Link:https://lnkd.in/gcxbN2wE Github:https://lnkd.in/gR_CfPmH Intuition: note : we need to remove head if it is part of consecutive sum 1.Initialize a new ListNode front with the value 0 whose next field points to head and a node start to front. 2.Process all of the nodes in the linked list, while start != null: Initialize a variable prefixSum to 0 and a ListNode end to start.next. 3.Process the rest of the nodes in the linked list, while end != null: Add end's value to prefixSum. 4.If prefixSum equals 0, make a connection from start to the last node after the zero-sum consecutive sequence by setting start.next to end.next 5.Set end to end.next.,Set start to start.next. 6.Return front.next. it points to the head Time Complexity :O(N^2); Space Complexity :O(1); Happy coding ❤️ #striver #striversa2zdsa #takeuforward #coderarmy #180daysofcodechallenge #dsa #rohitnegi

#100DaysofCode Day 53: 17 April, 2024 Today's Progress: TS and React Thoughts: TS is hard. Even more so when I make it hard for myself. Break down the problem, into separate functions if needed. Keep it simple and use console log to check each section before moving on. Today we started with planning in this way and somewhere through we were convinced to try build everything in one function. When this stopped working we were then looking at a big mess. Take your time, break things down. This is a lot easier to say than keep to. We need to keep to it.

#100DaysOfCode Day 22 - Result: Though brief, today's work has helped me to re-organize my thoughts and construct a better plan for the following weeks. Beginning on Day 23, I will focus on testing the "Create" action and whether it works as expected. The following phases of testing will focus on the "Modify" action, user access controls, and session handling. This should take me the better part of two weeks, but will be adjusted according to the situation.

Day 34 & 35 of #100DaysOfCode I did a lot of code review, rectification, replanning, documenting and deployment. Read for the full details 👇 https://lnkd.in/dJaQee7k

Title: "Solving Leetcode Problem #2487: Removing Nodes from a Linked List with a 3-Step Approach 🚀 Post: Today, I solved Leetcode problem #2487 by using a simple yet effective 3-step approach to remove nodes from a linked list: Step 1: Reverse the linked list to start processing nodes from the end. Step 2: Traverse the reversed list, and remove nodes that have values smaller than the maximum encountered so far.Step 3: Reverse the list again to restore its original order, now with the unnecessary nodes removed.This approach improves efficiency and simplifies the logic! 💻