DEV Community: Rishitha Nallapureddy

Journal - 6-12-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:31:08 +0000

Hey, I am so delighted to say that I was able to take the next step in my competitive programming journey. I started with no knowledge of linked lists and have now begun learning some of the tougher concepts. After covering the basics, I moved on to more complicated topics. I’ve learned about linked lists and tackled a few related questions over the past few days. Today, I focused on Dojo-related questions, as I need them for my upcoming dojo this week. I made a plan with that in mind. So, today I worked on three different questions that were from linked list in which one of them is array. Two were difficult while the third one is okay.

First and foremost i would like to start of with my dojo belt test which i took today to be frank i though that i will be able to clear the belt but unfortunately i was able to do two question and after that i did all the next three but their is error in compiler because of the issue i lost the belt .And for learning more about linked list i was following an youtube channel. It helped me a lot with the proper guidance that i need to solve the questions.

For the first question,I did Find the sub-array which has largest sum and return its sum. In which we were provided with a list their we have to take the largest sub-array then we have to sum the array and return the value. For next question i did merge two sorted linked list where we were given two sorted linked list and we have to merge them and print the output i used the concept merge sort in sorting algorithms. it was the most difficult question for today. I felt it to be easy compare to the first one and i was improving every day and it felt good to see myself better than yesterday.

Last but not least, I did flattering of linked list. The idea is to traverse the linked list and push values of all the nodes in an array. Now, we can sort the array in ascending order, and create a new linked list by traversing the sorted array. While creating the new linked list, we will append the nodes using the bottom pointer of flattened linked list.. That all for the day. Overall, the day was great and productive.

Journal - 5-12-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:27:20 +0000

Hey, I am so delighted to say that I was able to take the next step in my competitive programming journey. I started with no knowledge of linked lists and have now begun learning some of the tougher concepts. After covering the basics, I moved on to more complicated topics. I’ve learned about linked lists and tackled a few related questions over the past few days. Today, I focused on Dojo-related questions, as I need them for my upcoming dojo this week. I made a plan with that in mind. So, today I worked on three different questions that were from linked list. In the three two questions are difficult and other was moderate.

For the first question,I did Sorting array in liked list where we are required to arrange a linked list which were arranged randomly in proper manner it also took me a lot of time to do this while watch a youtube video. After completing the first i did the next question which is if their exist a pair of elements in linked list whose sum is equal to X. In this we have to check by adding two indexes if this is equal to the provided value X then we have to return the pair indexes. I felt it to be easy compare to the first one and i was improving every day and it felt good to see myself better than yesterday.

Last but not least, I did odd even linked list where we will be provided with a list we have to rearrange the list by verifying if they are odd we have to get them to the start of the list if not the at the end of the list we have to add the even elements . That all for the day. Overall, the day was great and productive.

Journal - 4-12-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:25:56 +0000

Hey, I am so delighted to say that I was able to take the next step in my competitive programming journey. I started with no knowledge of linked lists and have now begun learning some of the tougher concepts. After covering the basics, I moved on to more complicated topics. I’ve learned about linked lists and tackled a few related questions over the past few days. Today, I focused on Dojo-related questions, as I need them for my upcoming dojo this week. I made a plan with that in mind. So, today I worked on four different questions that were from linked list and also from array. One was difficult which is based on linked list, while the other three were moderately challenging from array.

First and foremost i would like to start of with my dojo belt test which i took in morning to be frank i though that i will be able to clear the belt but unfortunately i was able to do only two question which is also good as i did only one in my last belt test. And for learning more about linked list i was following an youtube channel. It helped me a lot with the proper guidance that i need to solve the questions.

For the first question,I did flower bed question in which we are asked to plant the flowers and return the we were able to arrange from the given array it was easy the array consist of 0 and 1. For understanding it and also for approach i watched a youtube video. It was helpful. For next question also i followed the same way that is assign cookies, it was explained so nicely in the video. For the third question i did remove duplicates from the array. In this we should print one number only once’s if it is repeated we should remove it and return the new array. I felt it to be easy compare to the first one and i was improving every day and it felt good to see myself better than yesterday.

Last but not least, I did set the given linked list by removing the occurrences of x where we need to remove the element if it is same as the x then return the new value it is linked list i felt it to be the most difficult one for today. That all for the day. Overall, the day was great and productive.

Journal - 3-12-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:22:12 +0000

Hey, I am so delighted to say that I was able to take the next step in my competitive programming journey. I started with no knowledge of linked lists and have now begun learning some of the tougher concepts. After covering the basics, I moved on to more complicated topics. I’ve learned about linked lists and tackled a few related questions over the past few days. Today, I focused on Dojo-related questions, as I need them for my upcoming dojo this week. I made a plan with that in mind. So, today I worked on three different questions that were from linked list and also from array. One was difficult which is based on linked list, while the other two were moderately challenging from array.

For the first question, I did insertion in linked list where we are required to add an element to the start of the list. First we will take the new element and assign it the head using dot next their we will be able to create a new list. Next question which i did was prefix sum of array where i need to the add the next index like [i+1] [i+2]… like that through out the array and print the new array. I felt it to be easy compare to the first one and i was improving every day and it felt good to see myself better than yesterday.

Last but not least, I did target sum where we will be given a sum and we have go through the array see at which we will get the provided sum by adding what are all the indexes we will print that indexes. That all for the day. Overall, the day was great and productive.

Journal - 2-12-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:20:14 +0000

Hey, I am so delighted to say that I was able to take the next step in my competitive programming journey. I started with no knowledge of linked lists and have now begun learning some of the tougher concepts. After covering the basics, I moved on to more complicated topics. I’ve learned about linked lists and tackled a few related questions over the past few days. Today, I focused on Dojo-related questions, as I need them for my upcoming dojo this week. I made a plan with that in mind. So, today, I worked on three different questions that were from linked lists. One was difficult which is also based on linked list, while the other two were moderately challenging.

I did the same questions that i did in last week because i was still trying for the same belt. For the first question i did reverse linked list while i stored all in one element and another one was empty while running i added the modified data to the empty element and returned it was pretty easy as i already did it. Same goes to the second question i did middle node where i used two pointers technic which i felt comfortable and then i assigned a new value to the head of two pointers and returned the first pointer. It is also easy as it felt like the first question.

Last but not least,I did delete node from the head in this question we will delete the first index from the head and return the modified value.It was bit difficult compare to the other two questions. That all for the day. Overall, the day was great and productive.

Journal - 29-11-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:03:38 +0000

Hi, folks! Today, I solved three problems on LeetCode: “Find All Anagrams in a String,” “Longest Consecutive Sequence,” and “Search in Rotated Sorted Array.” These problems are really interesting, and we have different logical approaches to solve them. They are extensions of the classic problems of checking if two strings are anagrams and searching for a target element in an array.

Find All Anagrams in a String: To solve this problem, we can use the sliding window technique. We need to traverse the input array while keeping track of a fixed length of consecutive elements. We check whether this segment is an anagram of the target string. If it is, we add the index to the result array; if not, we ignore the index. In this way we can solve the problem.

Longest Consecutive Sequence: To solve this problem, we first remove duplicate elements from the array using a set. Then, we traverse the array and check for any sequence of consecutive elements (+1 or -1). If such a sequence exists, we keep track of its count; otherwise, we ignore it. This way, we can determine the length of the longest consecutive sequence.

Search in Rotated Sorted Array: To solve this problem, we can use the binary search approach. First, we divide the input array into two parts. We then identify which half is sorted and perform a binary search on that half to find the target element. If the target is not found in the sorted half, we continue searching in the unsorted half. If the target element is not found in either half, we return -1. In this way we can solve this problem.

Journal - 28-11-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 12:01:52 +0000

Hi, Folks! Today, I solved three problems on LeetCode: Max Chunks to Make Sorted, Find the Town Judge, and Maximum Subarray. Every competitive programmer has their own logic to solve problems. However, algorithms can sometimes optimize the solution. For a programmer, solving the problem is not the challenge; solving the problem in an optimized way is the real challenge. This can sometimes be achieved through algorithms and sometimes with our own logic. As programmers, we should know both algorithmic and logical approaches.

Max Chunks to Make Sorted: To solve this problem, we can traverse through the input array and, for each traversal, find the maximum number in the array. Every time you find a new maximum number, keep track of the count. This count will be the result. This approach will solve the problem effectively.

Find the Town Judge: To solve this problem, we first need to fully understand the problem statement. We need to identify the town judge, who trusts no one but is trusted by everyone else. Once we grasp the problem statement, solving it becomes straightforward.

Maximum Subarray: To solve this problem, we can use Kadane’s Algorithm, which is one of the most efficient ways to solve it. Using this algorithm makes the problem much easier compared to my initial logic.

I hope my experience will be helpful.

Journal - 27-11-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 11:55:06 +0000

Hi, Folks! Today, I solved three problems on LeetCode: Single Number, First Missing Positive, and Next Greater Element III. There are some common mistakes that most of us make myself included. For instance, when we come across an easy problem, we might be tempted to ignore it or use a familiar approach to quickly solve it, then move on without exploring further. However, it’s important to use resources to determine whether the solution you found is the most efficient one. If it’s not, take the time to learn the more efficient solution.

Single Number is an easy problem, and I was familiar with one approach. However, I was curious to find the most efficient solution. When I discovered it, I was really surprised that the problem could be solved in such an efficient way.

Similarly, when solving First Missing Positive and Next Greater Element III, it’s crucial to focus on building a solid logic first. Then, break it down into smaller steps this will simplify the process. Approaching problems in this way helps to develop better solutions.

I hope my experience will be helpful to you.

Problem solving (26-11-24)

Rishitha Nallapureddy — Sun, 15 Dec 2024 11:51:46 +0000

Hello, Everyone! Today, I have solved three problems on LeetCode, namely, Letter Combination of a Phone Number, Container with Most Water, and Rotate Array. Solving different problems each day will make us think of problems from different angles. There are so many ways of solving a problem. Once you find one way of solving it, don't stop there. Instead, try to optimize the solution further. This will help you find the most efficient way of solving the given problem.

Letter Combination of a Phone Number: To solve this problem we can use the concept of backtracking using just one base condition. Given an input, we need to find all the possible combinations of characters related to certain digits in the input. A base condition will come in handy and will help the function in terminating its execution whenever necessary so that it can solve the problem in a proper way.

Container with Most Water: Here the problem is that we will have to find out a maximum area which can be formed. We are actually traversing the given array using two pointers. While one starts from the extreme beginning of the array the other starts from the opposite end. It this helps us to get a possible solution for the given problem.

Rotate Array: In this problem, we are required to rotate the array by a given number of positions. We can achieve this by slicing the array based on the given position and forming a new array by appending the slices in the right order. This solution solves the problem efficiently.

I hope my experience will be helpful to you.

Journal - 25-11-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 11:49:22 +0000

Hi, Folks! Today, I solved three problems on LeetCode: Koko Eating Bananas, Maximize the Confusion of an Exam, and Target Sum. Today is the start of the week, so I planned to solve some problems this week. This can help me understand data structures better. There are some problems that I repeated in this week’s plan because I feel that these problems are conceptual and tough to understand. These problems may take practice several times to get a better understanding. So, repeating problems like N-Queens will be helpful.

In LeetCode, there are so many problems, and it is not important how many problems we solve. The concepts we learn and the logic we apply really matter a lot. Koko Eating Bananas and Maximize the Confusion of an Exam are revision problems for today. They helped me go through the logic once again, and I also learned some concepts in data structures, such as deque, stacks, and queues. Revising all the concepts will help us memorize the important ones for a long time.

To solve the target sum problem, we will use dynamic programming (DP). The DP approach will help us keep track of how many solutions we have found. Since we need to return the total number of possible solutions from the array to get the target element, this method will help us to solve the problem.

I hope my experience will be helpful.

Journal - 22-11-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 11:36:15 +0000

Hi, Folks! Today, I solved three problems on LeetCode : Bag of tokens, k-th smallest prime fraction, and Fruits into basket. As a Beginner, you need patience, and it’s okay to take a long time to solve problems. Depending on their difficulty, some problems may take days to solve. In the future, if you aim to solve a problem with in minutes, you need to spend more time in practicing. We should not get discouraged if it takes us a long time to solve a hard level or medium level problems.

If we invest really hours or even days solving a problem, the joy we feel once it’ solved is unimaginable. Try to stay curious and approach the problems as challenges rather than burdens. this will help you to enjoy the problem solving more.

For example, solving the kth smallest prime fraction problem took me almost 4–5 hours. Coming up with a logic itself took a lot of time. If a problem feels hard, don’t give up. Find resources to learn the concept related to problem, and then give it another try.

Bag of tokens : To solve this problems, we can use two pointers left and right. The left pointer will start from the 0th index, and the The right pointer will start from the last index. We can traverse the array of tokens with pointers, increment and decrement the value of power depending on values of the tokens. Create a variable ‘score’, to store the updated score at each step and we can return score as output. This is one way to solve this problem.

I hope my experience will be helpful.

Journal - 21-11-24

Rishitha Nallapureddy — Sun, 15 Dec 2024 11:34:38 +0000

Hi, Folks! Today, I solved three problems on LeetCode: Simplify Path, Score of Parentheses, and Longest Palindromic substring. As learners, we have to increase the complexity of problems step by step. We should not start with complex problems. Try to start with moderate level problems and gradually increase the complexity.

There are so many problems in LeetCode that start at moderate level and increases the complexity level step by step. As a Beginner, at first I felt really hard to solve palindrome problem. after solving this problem the level of problem increases which is one of the question solved by me today, Longest palindromic substring. In this way slowly increase the level of problems. If, on the first day itself, I had tried to solve longest palindromic substring problem, it might not be a easy task, and I might lost interest in problem solving.

Score of Parentheses: Traverse through the input string. Use the stack data structure to update the count. If you find the opening bracket, increment the count. If not, try to pop it from the stack. In this way we can solve this problem.

Simplify Path : Traverse through the input string. Use the stack data structure to update the output string. Depending on input special characters either pop it or push it into stack. In this way, we can solve this problem.

I hope my experience will be helpful.