- 614
- 1 591 179
shashCode
India
Приєднався 17 тра 2011
Hi I am Shashwat Tiwari, software engineer at Samsung Research. I enjoy solving problems using coding and other computer science stuff. This channel is for sharing knowledge on programming, computer science fundamentals, data structures and algorithms, and a lot more with touch of motivational talks. You can get free courses, learn how to code, how to start programming, how to prepare for Interviews and everything in between.
Learn to develop in hindi
Learn to code in hindi
Btw Hindi is my language , programming language could be java, python, c++, javascipt, go lang.
Feel free to dm me whenever you want: linktr.ee/shashwat_tiwari_st
Learn to develop in hindi
Learn to code in hindi
Btw Hindi is my language , programming language could be java, python, c++, javascipt, go lang.
Feel free to dm me whenever you want: linktr.ee/shashwat_tiwari_st
2661. First Completely Painted Row or Column | leetcode daily challenge | shashcode | java | dsa
Problem Link:
leetcode.com/problems/first-completely-painted-row-or-column/?envType=daily-question&envId=2025-01-20
Problem Statement:
You are given a 0-indexed integer array arr, and an m x n integer matrix mat. arr and mat both contain all the integers in the range [1, m * n].
Go through each index i in arr starting from index 0 and paint the cell in mat containing the integer arr[i].
Return the smallest index i at which either a row or a column will be completely painted in mat.
Solution Link:
github.com/Tiwarishashwat/InterviewCodes/blob/main/FirstCompletelyPaintedRow.java
Custom Comparator:
ua-cam.com/video/quegYlReztM/v-deo.htmlsi=G265RK8IFpP92_4b
Lambda Expression:
ua-cam.com/video/3DkmAUdrzKw/v-deo.htmlsi=q9pqrvNPKAXt1g0d
Dynamic Programming:
ua-cam.com/video/P3MFBCZCGXs/v-deo.htmlsi=A832THtbhyqPNAf2
Graph Playlist:
ua-cam.com/play/PLQ7ZAf76c0ZOGuMjg3qwNgILb_dKWTxyQ.html
Java Plus DSA Placement Course Playlist:
ua-cam.com/play/PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE.html
Java Plus DSA Sheet:
docs.google.com/spreadsheets/d/119u25NO-4ZJ9zwfUKs5eGNo0exCVq3gZEFWvkCDiMqI/edit?usp=sharing
Notes:
github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course
Telegram Link:
shashwattiwari.page.link/telegramShashwat
Ultimate Recursion Series Playlist:
ua-cam.com/play/PLQ7ZAf76c0ZMzC9OHPbo-dUgx6oU3T0jK.html
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari.page.link/shashwatInsta
Samsung Interview Experience:
ua-cam.com/video/GrvlpBzphSU/v-deo.html
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
leetcode.com/problems/first-completely-painted-row-or-column/?envType=daily-question&envId=2025-01-20
Problem Statement:
You are given a 0-indexed integer array arr, and an m x n integer matrix mat. arr and mat both contain all the integers in the range [1, m * n].
Go through each index i in arr starting from index 0 and paint the cell in mat containing the integer arr[i].
Return the smallest index i at which either a row or a column will be completely painted in mat.
Solution Link:
github.com/Tiwarishashwat/InterviewCodes/blob/main/FirstCompletelyPaintedRow.java
Custom Comparator:
ua-cam.com/video/quegYlReztM/v-deo.htmlsi=G265RK8IFpP92_4b
Lambda Expression:
ua-cam.com/video/3DkmAUdrzKw/v-deo.htmlsi=q9pqrvNPKAXt1g0d
Dynamic Programming:
ua-cam.com/video/P3MFBCZCGXs/v-deo.htmlsi=A832THtbhyqPNAf2
Graph Playlist:
ua-cam.com/play/PLQ7ZAf76c0ZOGuMjg3qwNgILb_dKWTxyQ.html
Java Plus DSA Placement Course Playlist:
ua-cam.com/play/PLQ7ZAf76c0ZPVdhV1bAjFv0bQc1xHURzE.html
Java Plus DSA Sheet:
docs.google.com/spreadsheets/d/119u25NO-4ZJ9zwfUKs5eGNo0exCVq3gZEFWvkCDiMqI/edit?usp=sharing
Notes:
github.com/Tiwarishashwat/Java-Plus-DSA-Placement-Course
Telegram Link:
shashwattiwari.page.link/telegramShashwat
Ultimate Recursion Series Playlist:
ua-cam.com/play/PLQ7ZAf76c0ZMzC9OHPbo-dUgx6oU3T0jK.html
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari.page.link/shashwatInsta
Samsung Interview Experience:
ua-cam.com/video/GrvlpBzphSU/v-deo.html
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
Переглядів: 56
Відео
407. Trapping Rain Water II | leetcode daily challenge | shashcode | java | dsa
Переглядів 1,5 тис.21 годину тому
Problem Link: leetcode.com/problems/trapping-rain-water-ii/description/?envType=daily-question&envId=2025-01-19 Problem Statement: Given an m x n integer matrix heightMap representing the height of each unit cell in a 2D elevation map, return the volume of water it can trap after raining. Solution Link: github.com/Tiwarishashwat/InterviewCodes/blob/main/TrappingRainwater2.java Trapping Rainwate...
1368. Minimum Cost to Make at Least One Valid Path in a Grid | leetcode daily challenge | shashcode
Переглядів 1,6 тис.2 години тому
prerequisite: dijkstra: ua-cam.com/video/jhlo_YQPXR0/v-deo.htmlsi=Mz0jo-uIUkRvWHVq shortest path using bfs: ua-cam.com/video/vNHDWm_aVgA/v-deo.htmlsi=MXYjb-DUhlKp7Jqw Problem Link: leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid/submissions/1512127855/?envType=daily-question&envId=2025-01-18 Problem Statement: Given an m x n grid. Each cell of the grid has a sign po...
2683. Neighboring Bitwise XOR | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,5 тис.7 годин тому
Problem Link: leetcode.com/problems/neighboring-bitwise-xor/description/?envType=daily-question&envId=2025-01-17 Problem Statement: A 0-indexed array derived with length n is derived by computing the bitwise XOR (⊕) of adjacent values in a binary array original of length n. Specifically, for each index i in the range [0, n - 1]: If i = n - 1, then derived[i] = original[i] ⊕ original[0]. Otherwi...
2425. Bitwise XOR of All Pairings | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,5 тис.9 годин тому
Problem Link: leetcode.com/problems/bitwise-xor-of-all-pairings/description/?envType=daily-question&envId=2025-01-16 Problem Statement: You are given two 0-indexed arrays, nums1 and nums2, consisting of non-negative integers. There exists another array, nums3, which contains the bitwise XOR of all pairings of integers between nums1 and nums2 (every integer in nums1 is paired with every integer ...
2429. Minimize XOR | leetcode daily challenge | dsa | shashcode | java | shashwat
Переглядів 2,3 тис.12 годин тому
Problem Link: leetcode.com/problems/minimize-xor/description/?envType=daily-question&envId=2025-01-15 Problem Statement: Given two positive integers num1 and num2, find the positive integer x such that: x has the same number of set bits as num2, and The value x XOR num1 is minimal. Note that XOR is the bitwise XOR operation. Return the integer x. The test cases are generated such that x is uniq...
2657. Find the Prefix Common Array of Two Arrays | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,7 тис.14 годин тому
Problem Link: leetcode.com/problems/find-the-prefix-common-array-of-two-arrays/description/?envType=daily-question&envId=2025-01-14 Problem Statement: You are given two 0-indexed integer permutations A and B of length n. A prefix common array of A and B is an array C such that C[i] is equal to the count of numbers that are present at or before the index i in both A and B. Return the prefix comm...
3223. Minimum Length of String After Operations | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,5 тис.16 годин тому
Problem Link: leetcode.com/problems/minimum-length-of-string-after-operations/description/?envType=daily-question&envId=2025-01-13 Problem Statement: You are given a string s. You can perform the following process on s any number of times: Choose an index i in the string such that there is at least one character to the left of index i that is equal to s[i], and at least one character to the rig...
2116. Check if a Parentheses String Can Be Valid | leetcode daily challenge | dsa | shashcode | java
Переглядів 2,3 тис.16 годин тому
Problem Link: leetcode.com/problems/check-if-a-parentheses-string-can-be-valid/description/?envType=daily-question&envId=2025-01-12 Problem Statement: A parentheses string is a non-empty string consisting only of '(' and ')'. It is valid if any of the following conditions is true: It is (). It can be written as AB (A concatenated with B), where A and B are valid parentheses strings. It can be w...
1400. Construct K Palindrome Strings | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,6 тис.19 годин тому
Problem Link: leetcode.com/problems/construct-k-palindrome-strings/description/?envType=daily-question&envId=2025-01-11 Problem Statement: Given a string s and an integer k, return true if you can use all the characters in s to construct k palindrome strings or false otherwise. Solution Link: github.com/Tiwarishashwat/InterviewCodes/blob/main/ConstructKPalindromeStrings.java Dynamic Programming...
916. Word Subsets | leetcode daily challenge | dsa | shashcode | java | shashwat
Переглядів 1,8 тис.21 годину тому
Problem Link: leetcode.com/problems/word-subsets/description/?envType=daily-question&envId=2025-01-10 Problem Statement: You are given two string arrays words1 and words2. A string b is a subset of string a if every letter in b occurs in a including multiplicity. For example, "wrr" is a subset of "warrior" but is not a subset of "world". A string a from words1 is universal if for every string b...
2185. Counting Words With a Given Prefix | leetcode daily challenge | dsa | shashcode | java
Переглядів 816День тому
Problem Link: leetcode.com/problems/counting-words-with-a-given-prefix/description/?envType=daily-question&envId=2025-01-09 Problem Statement: You are given an array of strings words and a string pref. Return the number of strings in words that contain pref as a prefix. A prefix of a string s is any leading contiguous substring of s. Solution Link: github.com/Tiwarishashwat/InterviewCodes/blob/...
3042. Count Prefix and Suffix Pairs I | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,4 тис.День тому
Problem Link: leetcode.com/problems/count-prefix-and-suffix-pairs-i/description/?envType=daily-question&envId=2025-01-08 Problem Statement: You are given a 0-indexed string array words. Let's define a boolean function isPrefixAndSuffix that takes two strings, str1 and str2: isPrefixAndSuffix(str1, str2) returns true if str1 is both a prefix and a suffix of str2, and false otherwise. For example...
1408. String Matching in an Array | leetcode daily challenge | dsa | shashcode | java
Переглядів 2 тис.День тому
Problem Link: leetcode.com/problems/string-matching-in-an-array/description/?envType=daily-question&envId=2025-01-07 Problem Statement: Given an array of string words, return all strings in words that is a substring of another word. You can return the answer in any order. A substring is a contiguous sequence of characters within a string Solution Link: github.com/Tiwarishashwat/InterviewCodes/b...
1769. Minimum Number of Operations to Move All Balls to Each Box | leetcode daily challenge | dsa
Переглядів 2,3 тис.14 днів тому
Problem Link: leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/description/?envType=daily-question&envId=2025-01-06 Problem Statement: You have n boxes. You are given a binary string boxes of length n, where boxes[i] is '0' if the ith box is empty, and '1' if it contains one ball. In one operation, you can move one ball from a box to an adjacent box. Box i is adj...
2381. Shifting Letters II | leetcode daily challenge | dsa | shashcode | java
Переглядів 3,1 тис.14 днів тому
2381. Shifting Letters II | leetcode daily challenge | dsa | shashcode | java
1930. Unique Length-3 Palindromic Subsequences | leetcode daily challenge | dsa | shashcode
Переглядів 3 тис.14 днів тому
1930. Unique Length-3 Palindromic Subsequences | leetcode daily challenge | dsa | shashcode
2270. Number of Ways to Split Array | leetcode daily challenge | dsa
Переглядів 1,3 тис.14 днів тому
2270. Number of Ways to Split Array | leetcode daily challenge | dsa
2559. Count Vowel Strings in Ranges | leetcode daily challenge | dsa | shashcode | java
Переглядів 2 тис.14 днів тому
2559. Count Vowel Strings in Ranges | leetcode daily challenge | dsa | shashcode | java
1422. Maximum Score After Splitting a String | leetcode daily challenge | dsa | shashcode | java
Переглядів 1,6 тис.14 днів тому
1422. Maximum Score After Splitting a String | leetcode daily challenge | dsa | shashcode | java
983. Minimum Cost For Tickets | leetcode daily challenge | shashcode | java | dsa
Переглядів 1,2 тис.14 днів тому
983. Minimum Cost For Tickets | leetcode daily challenge | shashcode | java | dsa
2466. Count Ways To Build Good Strings | leetcode daily challenge | dsa | shashcode
Переглядів 1,6 тис.21 день тому
2466. Count Ways To Build Good Strings | leetcode daily challenge | dsa | shashcode
1639. Number of Ways to Form a Target String Given a Dictionary | leetcode daily challenge | dsa
Переглядів 91021 день тому
1639. Number of Ways to Form a Target String Given a Dictionary | leetcode daily challenge | dsa
kya bekar sawal hai bhai | 689. Maximum Sum of 3 Non-Overlapping Subarrays | | shashwat | shashcode
Переглядів 64821 день тому
kya bekar sawal hai bhai | 689. Maximum Sum of 3 Non-Overlapping Subarrays | | shashwat | shashcode
Leetcode potd is back | 1014. Best Sightseeing Pair | dsa | shashcode | shashwat
Переглядів 1,2 тис.21 день тому
Leetcode potd is back | 1014. Best Sightseeing Pair | dsa | shashcode | shashwat
Dynamic Programming in one shot | shashcode dp | shashcode dynamic programming | dsa | dp hindi
Переглядів 4,9 тис.21 день тому
Dynamic Programming in one shot | shashcode dp | shashcode dynamic programming | dsa | dp hindi
2872. Maximum Number of K-Divisible Components | leetcode daily challenge | shashcode30
Переглядів 2,2 тис.28 днів тому
2872. Maximum Number of K-Divisible Components | leetcode daily challenge | shashcode30
2415. Reverse Odd Levels of Binary Tree | leetcode daily challenge | shashcode30
Переглядів 1,4 тис.Місяць тому
2415. Reverse Odd Levels of Binary Tree | leetcode daily challenge | shashcode30
769. Max Chunks To Make Sorted | leetcode daily challenge | shashcode30
Переглядів 1,9 тис.Місяць тому
769. Max Chunks To Make Sorted | leetcode daily challenge | shashcode30
1475. Final Prices With a Special Discount in a Shop | leetcode daily challenge | shashcode30
Переглядів 779Місяць тому
1475. Final Prices With a Special Discount in a Shop | leetcode daily challenge | shashcode30