Isar Ahmad

Participated in CodeForces Round 946 (Div 3)🔥 My Intuition Problem 1: Minimum Screen Required for all icons(Phone Desktop) The display size of the window was 5*3. So only 2(two) 2*2 icons can be fitted in a window and a max of 15 1*1 icons. So first I find the number of screens required for the 2*2 icon by keeping at most 2 icons on a window. Then find the left spaces in all the screens used. If the left_space > 1*1 icons then it will be the answer otherwise, we need to find extra window required for left 1*1 icons. Problem 2: Symmetric Encoding Simple question just find the unique char of the given string s and map the reverse char using map and then use this mapping to encode the string s. i.e. s="serofedsoc" -> Unique Char string -> serofdc -> now map the reverse char of string means i th char with n-1-i th char and also n-1-i th char to i th char and now use this encoding technique to change the string s you will get codeforces Problem 3: Beautiful triple pairs I got the brute force solution of it but was not able to think of a better or optimized solution as the brute force gives tle on test case - 4. Will upsolve it Problem 4: Ingenuity-2 It was a simple greedy question. To solve this problem I checked the north-south, east, and west moves and tried to equally distribute between all of them. Like if the north and south are even so, distribute north/2 to hover and north/2 to the helicopter. If both are odd I was making one device to move the min of north and south for both north and south directions so that it remains at its place i.e. north = 5 and south = 3. Then move hover 3 times north and south so only now north = 2 left which I distribute in both equally If one is odd and the other is even then there is no possibility they will meet at the same place. Same with the east and west directions also. And I also keep in mind that both hover and helicopter move at least 1 time. I made this logic but it took a little time to debug due to which the contest got over so I solved it after the contest was over. #ICPSC #summergrind #iwillnotwastemysummer #competitveprogramming

19

Reverse revision of Blind 75 🚀 Just cracked the problem 48 of LeetCode's Blind 75 series! 🎉 🔍 Problem: Course Schedule 🔗 Problem link: https://lnkd.in/g6vfB63d 💡 Solution: 🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴 //READ THIS https://lnkd.in/g_EK8sZD // class Solution { // public: //     bool canFinish(int n, vector<vector<int>>& prerequisites) { //     // 1. Create Adjacency List and Degree Array //     vector<vector<int>> G(n); // Adjacency list for courses (n courses) //     vector<int> degree(n, 0); // Array to store in-degree of each course (number of prerequisites) //     // 2. Build Adjacency List and In-Degrees //     for (auto& e : prerequisites) { //         G[e[1]].push_back(e[0]); // Add 'e[0]' (course to take) as a dependent of 'e[1]' (prerequisite) //         degree[e[0]]++;           // Increment in-degree of 'e[0]' (number of prerequisites it needs) //     } //     // 3. Initialize Queue for Topological Sort //     vector<int> bfs; //     for (int i = 0; i < n; i++) { //         if (!degree[i]) { // If a course has no prerequisites (in-degree is 0) //         bfs.push_back(i); // Add it to the queue for processing //         } //     } //     // 4. Topological Sort Using Breadth-First Search (BFS) //     for (int i = 0; i < bfs.size(); i++) { //         for (int j : G[bfs[i]]) { // For each dependent course of the current course in the queue //         degree[j]--; // Decrement the in-degree of the dependent course //         if (degree[j] == 0) { // If the in-degree becomes 0 (all prerequisites met) //             bfs.push_back(j); // Add it to the queue for processing in the next iteration //         } //         } //     } //     // 5. Check if All Courses Can Be Completed //     return bfs.size() == n; // If the queue size equals the number of courses, all can be completed //     } // }; 🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴🔴 Excited to dive deeper into the Blind 75 series and tackle more challenges! 💪 #LeetCode #Blind75 #CodingJourney #Programming #CPP

5

👉Day 27: On Dsa_100_Days_Challenge Practice Problems 🔹 Problem-1:  https://lnkd.in/gWFexwZh 🔹 Problem-2:  https://lnkd.in/gktV-nve 🔹 Problem-3: https://lnkd.in/gkVSAYhB 🔹 Problem-4: https://lnkd.in/gq-8HY4j #dsa #100daysofcode

3

2 Comments

🚀 Day 76 of my 120-day code challenge! 🌟 Today : Solved the LeetCode Problem of the Day: "Continuous Subarray Sum" - improving my understanding of subarray calculations and modular arithmetic. Solved the GeeksforGeeks Problem of the Day: "Index of an Extra Element" - enhancing my skills in array manipulation and binary search techniques. Loving the daily progress and the continuous learning. Excited for the challenges ahead! 💻💡 #CodeChallenge #LeetCode #GeeksforGeeks #ProblemSolving #SubarrayCalculations #BinarySearch #ContinuousLearning

10

Dived Deep into JAVA SE & DATA STRUCTURE & ALGORITHM 🚀 Day-02 Setup Environment Learning Update 📚 👉 Setup Environment 👉 JDK 👉 JVM 👉 JRE 👉 Develop and run c/c++ program 👉 Develop and run Java program 👉 JDK installation 👉 Installation of IDE #JavaSE #DataStructures #Algorithms #ProgrammingJourney #Coding #LearningJava #TechSkills #Developers #JavaProgramming #SoftwareEngineering #SaurabhShukla #explore

10

🚀 Day 35/45 of the 45-Day DSA Challenge by Arsh Goyal! 🚀 Today's problem-solving journey included: 1. Missing Number -> Maths. 2. Number of 1 Bits -> Bit manipulation. 3. N-Queens II -> Backtracking, only need a 1D array to keep track of the position of the column for each ith-row. Smart way to check for diagonal validity: `abs(cols[i] - c) == abs(i - r)`. 4. Reverse Integer -> Maths, overflow prevention. 5. Palindrome Number -> Maths. 6. Rotate Array -> Observation. I also gave LeetCode Warmup Contest (virtual): - Lexicographical Numbers (accepted) -> Brute force, sorting. - First Unique Character in a String (accepted) -> Hashing. - Longest Absolute File Path (accepted) -> Stack, implementation problem. For detailed solutions, visit my Notion Page (https://lnkd.in/gKJubKZp). #CrackYourInternship #CrackYourPlacement #DSA #CodingChallenge #ReviseWithArsh #Day35

4

JavaScript's '𝘁𝗵𝗶𝘀' keyword can be confusing for many developers bcz it behaves differently in various scenarios. I highly recommend watching Akshay Saini's (NamasteDev.com) excellent video on this topic. This covers : this keyword in the global scope, this inside a function (strict mode/non-strict mode), this inside an object's method, this with call, apply, and bind (sharing methods), this inside an arrow function, this inside a nested arrow function, this inside the DOM etc. #JavaScript #Programming #WebDevelopment #SoftwareDevelopment https://lnkd.in/gndg6pKt

1

Note - 𝐁𝐞𝐠𝐢𝐧𝐧𝐞𝐫𝐬 𝐢𝐧 𝐃𝐒𝐀 𝐜𝐚𝐧 𝐢𝐠𝐧𝐨𝐫𝐞 𝐭𝐡𝐢𝐬 𝐩𝐨𝐬𝐭 College Student - I have done multiple DSA sheets and 100-250 LeetCode - GFG questions still I am not able to crack OA and CP questions. My answer - OA + CP involves new DSA questions so practice many new questions of previous OA + do lots of CP to develop the thinking skill for approaching new problems and go through most of the variations and patterns of each topic Yesterday's CodeChef contest was interesting - [𝐂𝐨𝐝𝐞𝐜𝐡𝐞𝐟 𝐒𝐭𝐚𝐫𝐭𝐞𝐫𝐬' 147] - filled with fun + interesting problems. Name - 𝐊 𝐒𝐮𝐛𝐬𝐞𝐪𝐮𝐞𝐧𝐜𝐞 101 Understanding -> Given an array of size “N” ; select a subsequence of size “K” such that g is maximum. Let's say -> i1,i2,i3,................ik are your k selected elements.  -> G =  [b[i1] + b[i2]] + [b[i2] + b[i3]] + ……………………. [b[ik-1] + b[ik]] Observation 1 :- If you have k elements -> y1,y2,.............yk -> G = y1 + 2*(y2+y3+y4+y5...................+yk-1) + yk 𝐓𝐡𝐞 𝐩𝐫𝐨𝐛𝐥𝐞𝐦 is interesting Hints - Observation + Greedy Algorithm + Optimization. Link to video solution - In the comments. We give FAANG level DSA + OA + CP training on weekend; link to join in the comments! #kumark #coding

103

2 Comments

Hello connections!! A portfolio is an important tool for your career. You will stand out from other candidates when you have a professional portfolio, which puts you ahead of the competition when applying for jobs. So here comes my second task by Oasis Infobyte. Task details: Level 01 Task2 : Portfolio Tech stack : HTML CSS Javascript IDE used : Visual Studio Code GitHub repo link : https://lnkd.in/gxH95NPZ #tech #javascript #github #connections #css #html #intern #oasisinfobyte #webdevelopment #design

2

Note - 𝐁𝐞𝐠𝐢𝐧𝐧𝐞𝐫𝐬 𝐢𝐧 𝐃𝐒𝐀 𝐜𝐚𝐧 𝐢𝐠𝐧𝐨𝐫𝐞 𝐭𝐡𝐢𝐬 𝐩𝐨𝐬𝐭 College Student - I have done multiple DSA sheets and 100-250 LeetCode - GFG questions still I am not able to crack OA and CP questions. My answer - OA + CP involves new DSA questions so practice many new questions of previous OA + do lots of CP to develop the thinking skill for approaching new problems and go through most of the variations and patterns of each topic Yesterday's CodeChef contest was interesting - [𝐂𝐨𝐝𝐞𝐜𝐡𝐞𝐟 𝐒𝐭𝐚𝐫𝐭𝐞𝐫𝐬' 148] - filled with fun + interesting problems. Name - 𝐓𝐡𝐞 𝐔𝐧𝐝𝐢𝐬𝐚𝐩𝐩𝐞𝐚𝐫𝐚𝐧𝐜𝐞. 𝐓𝐡𝐞 𝐩𝐫𝐨𝐛𝐥𝐞𝐦 is interesting Hints - Observation + Optimization + Hashing + Prefix/Suffix Sums. Link to video solution - In the comments. We give FAANG level DSA + OA + CP training on weekend; link to join in the comments! #kumark #coding

73

2 Comments

Day 6 : Solving #neetcode #blind75 product of array except self in #kotlin in multiple ways. Do leave comments and suggestions for improvements, https://lnkd.in/gXXUwftS #dsa #datastructure #kotlin #kotlindev #androiddev #programming #algo #faang #interviewprep #leetcode

1

🚀 #Day22 𝐨𝐟 𝐦𝐲 𝐊𝐨𝐭𝐥𝐢𝐧 𝐣𝐨𝐮𝐫𝐧𝐞𝐲! Today, I explored two key concepts: Type Checking and Smart Casting. 🌟 🔍 𝐓𝐲𝐩𝐞 𝐂𝐡𝐞𝐜𝐤𝐢𝐧𝐠: This involves verifying the type of an object at runtime to ensure it matches the expected type. In Kotlin, you can use the is keyword to check an object's type. ✨ 𝐒𝐦𝐚𝐫𝐭 𝐂𝐚𝐬𝐭𝐢𝐧𝐠: Once an object's type is confirmed through type checking, Kotlin automatically casts it to the appropriate type, eliminating the need for explicit casting. This makes your code cleaner and safer! Excited to apply these concepts in my projects! 💡💻 𝐀𝐝𝐝𝐢𝐭𝐢𝐨𝐧𝐚𝐥 𝐐𝐮𝐞𝐬𝐭𝐢𝐨𝐧: How can I remove the Activate Windows message (for free)? #Kotlin #Programming #SoftwareDevelopment #LearningJourney

10

#Day53 Leetcode today's problem --> K-th Smallest in Lexicographical Order link: https://lnkd.in/gG3WTAqE Input: n = 13, k = 2 Output: 10

1

📌 LeetCode Problem of the Day : [🔥 DAY 282] 📍 Name: Lucky Numbers in a Matrix 📝 Description: Given an m x n matrix of distinct numbers, return all lucky numbers in the matrix in any order. A lucky number is an element of the matrix such that it is the minimum element in its row and maximum in its column.   Example 1: Input: matrix = [[3,7,8],[9,11,13],[15,16,17]] Output: [15] Explanation: 15 is the only lucky number since it is the minimum in its row and the maximum in its column. Example 2: Input: matrix = [[1,10,4,2],[9,3,8,7],[15,16,17,12]] Output: [12] Explanation: 12 is the only lucky number since it is the minimum in its row and the maximum in its column. Example 3: Input: matrix = [[7,8],[1,2]] Output: [7] Explanation: 7 is the only lucky number since it is the minimum in its row and the maximum in its column.   Constraints: m == mat.length n == mat[i].length 1 <= n, m <= 50 1 <= matrix[i][j] <= 105. All elements in the matrix are distinct. 🔗 Link: https://lnkd.in/d-U9HzGj

4

#LEETCODE WEEKLY CONTEST 407 !! I WAS ABLE TO SOLVE FIRST TWO PROBLEM . since it was my first contest which i participated , more to go from now. will upsolve the remaining two provlem which i was unable to solve in time #LeetCode #Coding #ProblemSolving #DeveloperJourney #ContinuousLearning

7

Hello, and namaste react guys...and also namaste react to our teacher Akshay Saini 🚀 This is what I learned from the 5th lesson (part1) whatever we do using React we can also do that using HTML, CSS, JavaScript so then why do we use a library like React or framework? Because it makes your developer experience easy and fast, it makes you write less code and do more on the webpage. Some of the best practices in React World:- till now we have written all the components like - header, body, and footer in the same file, and now our file looks ugly because of so much code in just one file and it is not a good practice. and the best practice in the industry is to create separate files for separate components. So we will now restructure our code and create files for separate components. though it is not mandatory to structure like this, we can even put all the code in a single file, but it is good practice to have a good structure. and whenever we create a file for a component we should always name that file in the name of the component. Let's also know about a convention in the developer world which is to put all of the source code in the src folder. So all of the important files will be kept inside the src folder so let's create this src folder and move the app.js file inside it. and for adding components we will also create components folder inside the src folder. so app.js is a direct child of the src folder which contains root-level code and now whatever components we need inside App.js we will put those inside the components folder. Right now our javascript files have .js extension but as we are writing jsx inside this file that's why as the extension many developers .jsx extension. like App.jsx or when someone is writing typescript with jsx they use .tsx extension. but it doesn't affect our app so we can use any of them. The restaurant data(array of objects), logo img url, is some hardcoded data that we copied from Swiggy's API. but as it is some hard-coded data that's why we should never put this kind of data inside a component file like this and the best practice is to create a separate file, for this kind of hard-coded data, we usually name that kind of file config file or utils(utilities ) file or constants file. so here in this project, we will create a separate folder inside the src folder and its name will be utils, inside the utils folder we will create a config file. and inside the config file we will put all of these data because this kind of important data is gonna be used for many components for example the logo can be used on the home page, in the header also in the footer, so to keep these kinds of important data we make a separate file. and whenever some change happens then we don't need to go everywhere and change it we just need to change it on the config file and it will be reflected everywhere. so it also helps to make the data reusable. Thanks for reading #namasteReact #javascript #frontendDevelopment

3