Goutam Sharma’s Post

🌟Day - 61🌟 Hello Connection! This is day 61 of my 💯 days leetcode challenge Today's Problem 1️⃣ Problem :- Permutations Description :-Given an array nums of distinct integers, return all the possible permutations.You can return the answer in any order. Example 1: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] #Leetcode #Leetcode100dayschallenge #C++ #skillswallah #Day61 #consistency #DSA #leetcode160+ #PW #Skilkswallah

🌟Day - 87🌟 Hello Connection! This is day 87 of my 💯 days Leetcode Challenge Today's Problem 1️⃣ Problem :- Reaching Points Description :-Given four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false otherwise.The allowed operation on some point (x, y) is to convert it to either (x, x + y) or (x + y, y). Example 1: Input: sx = 1, sy = 1, tx = 3, ty = 5 Output: true Explanation: One series of moves that transforms the starting point to the target is: (1, 1) -> (1, 2) (1, 2) -> (3, 2) (3, 2) -> (3, 5) #LeetCode #Leetcode100dayschallenge #C++ #skillswallah #Day87 #consistency #DSA #leetcode190+ #PW #Skilkswallah

🌟Day - 52🌟 Hello Connection! This is day 52 of my 💯 days leetcode challenge Today's Problem 1️⃣ Problem :- Merge k sorted Lists Description :- You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one sorted linked-list and return it. Example 1: Input: lists = [[1,4,5],[1,3,4],[2,6]] Output: [1,1,2,3,4,4,5,6] Explanation: The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6 . #Leetcode #Leetcode100dayschallenge #C++ #skillswallah #Day52 #consistency #DSA #leetcode150+ #PW #Skilkswallah

🌟Day - 89🌟 Hello Connection! This is day 89 of my 💯 days Leetcode Challenge Today's Problem 1️⃣ Problem :- N th Magical Number Description :-A positive integer is magical if it is divisible by either a or b.Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 109 + 7. Example 1: Input: n = 1, a = 2, b = 3 Output: 2 Example 2: Input: n = 4, a = 2, b = 3 Output: 6 #LeetCode #Leetcode100dayschallenge #C++ #skillswallah #Day89 #consistency #DSA #leetcode190+ #PW #Skilkswallah

🌟Day - 43🌟 Hello Connection! This is day 43 of my 100 days leetcode challenge Today's Problem ✅Problem :- First Unique Character in a String Description :- given a string s find the first non repeating character in it and return it's index if it doesn't exist return -1 Example Input : s="leetcode" Output : 0 Explanation. : The character 'l' at index 0 is the first character that doesn't occur at any other index #Leetcode #Leetcode100dayschallenge #C++ #skillswallah #Day43 #consistency #DSA #leetcode140+

🌟Day - 42🌟 Hello Connection! This is day 42 of my 100 days leetcode challenge Today's Problem ✅Problem :- Power of Two Description :- given an integer n return true if it is a power of two otherwise return false Example Input : n=1 Output : true Explanation. : 2^0 = 1 #Leetcode #Leetcode100dayschallenge #C++ #skillswallah #Day42 #consistency #DSA #leetcode140+ #PW #Skilkswallah

𝐃𝐚𝐲 22 Today I solved some more problems on linked lists ( Circular Linked lists & Doubly Linked lists) as a part of the #100daysofcode challenge on the 22nd day. #dsa #100daysofdsa #problemsolving #learningeveryday #codingchallenge #codingcommunity #geeksforgeeks #leetcode

#100daysofcodingchallenge of solving problems. ✅Day -99/100 🔗 Solved problems on leetcode 🎉 Problem solved:1 1.Nearest Exit from Entrance in maze(Q.1926) 🔗 link:https://lnkd.in/gJ6j6-hp GitHub link:https://lnkd.in/gpiSnMep cc: Anchal Sharma Ikshit .. #dsa #leetcode #100daysofcode #codehelp #geeksforgeeks #leetcodechallenge #leetcode #problemsolving #dsachallenge

🌟Day - 68🌟 Hello Connection! This is day 68 of my 💯 days leetcode challenge Today's Problem 1️⃣ Problem :- Maximum Swap Description :-You are given an integer num. You can swap two digits at most once to get the maximum valued number.Return the maximum valued number you can get. Example 1: Input: num = 2736 Output: 7236 Explanation: Swap the number 2 and the number 7. #Leetcode #Leetcode100dayschallenge #C++ #skillswallah #Day68 #consistency #DSA #leetcode170+ #PW #Skilkswallah

🎯 Day 40 of 100 days 🎯 #DrGViswanathan challenge Problem Solved :- Power of Three (Leetcode 326) The objective of the problem was to determine if a given integer n is a power of three. The code checks if an integer n is a power of three. It starts with i initialized to 1 (representing 3^0), then iteratively multiplies i by 3 in each loop. If i equals n at any point, it returns true since n is confirmed to be a power of three. If i exceeds n without finding a match, it returns false. #100DaysOfCode #LeetCode #ProblemSolving #DSA #GrowthMindset #CodingChallenge #VishwanathanChallenge #TechJourney #DrGViswanathanchallenge