- Видео 14
- Просмотров 3 163
Shaaz
Индия
Добавлен 22 окт 2014
blood group detector
Blood group identification is critical for medical applications, especially in emergencies requiring quick and precise blood transfusion. Traditional blood typing methods involve chemical-based serological tests, which, although accurate, are time-consuming and sometimes resource-intensive. Recent advancements in deep learning and computer vision have introduced alternative approaches that leverage biometric features, such as fingerprints, for rapid and non-invasive blood group detection. This study proposes a novel deep learning model for blood group detection using fingerprint images, aiming to enhance accessibility, efficiency, and ease of blood type identification.In this work, a conv...
Просмотров: 17
Видео
Count Servers that Communicate | Approache | Dry Runs | Leetcode 1267 | CodeWithShaaz
Просмотров 314 дней назад
Problem: 1267. Count Servers that Communicate Objective: Given a map of a server center represented as an m x n integer matrix grid, where: 1 indicates there is a server at that cell. 0 indicates there is no server. Two servers communicate if they are in the same row or the same column. Return the number of servers that can communicate with at least one other server. Key Observations: Communica...
Map of Highest Peak | Multi-Source BFS | Leetcode 1765 | Graph Concept | CodeWithShaaz
Просмотров 1014 дней назад
🔍 Problem: 1765. Map of Highest Peak You are given an integer matrix isWater of size m x n that represents a map of land and water cells: If isWater[i][j] 0, cell (i, j) is a land cell. If isWater[i][j] 1, cell (i, j) is a water cell. You must assign each cell a height in such a way that: The height of each cell is non-negative. If a cell is a water cell, its height must be 0. Any two adjacent ...
Grid Game | Detailed Explanation | Complete Ry Run | Leetcode 2017 | CodeWithShaaz
Просмотров 2014 дней назад
🔍 Problem: 2017. Grid Game Two robots are playing a game on a 2D grid, where: Grid Dimensions: A 2 x n matrix grid, where grid[r][c] represents points at position (r, c). Movement: Each robot can move right or down from (0, 0) to (1, n-1): Robot 1: Moves first, collecting points on its path. After Robot 1 completes its path, all points in the cells it visited are set to 0. Robot 2: Moves next, ...
First Completely Painted Row or Column | Approaches | Detailed | Leetcode 2661 | CodeWithShaaz
Просмотров 914 дней назад
🔍 How It Works: Key Observations: Matrix Coordinates Mapping: Each value in the matrix can be mapped to its coordinates (row, column). This allows quick lookup of a value's position in the matrix. Row and Column Completion: A row is considered complete when all its cells are painted. A column is complete when all its cells are painted. By maintaining row and column counters, we can track when a...
Minimum Cost to Make at Least One Valid Path in a Grid| 2 Approaches | Leetcode 1368 | CodeWithShaaz
Просмотров 1221 день назад
🔍 How It Works: Dijkstra's Algorithm for Minimum Cost Path Problem Insight: The goal is to find the minimum cost path from the top-left corner (0,0) to the bottom-right corner (m-1, n-1) in a grid. Each cell in the grid has a direction, and moving in that direction costs 0, while moving in any other direction costs 1. Algorithm Explanation: Direction Array (dir): Represents 4 possible moves → R...
Neighboring Bitwise XOR | Approache | Dry Runs | Leetcode 2683 | CodeWithShaaz
Просмотров 721 день назад
🔍 How It Works: XOR Property Insight: XOR of a number with itself is 0: x ⊕ x = 0 XOR of a number with 0 is the number itself: x ⊕ 0 = x Key Observation: If the XOR of all elements in derived is 0, a valid original array exists. Otherwise, it's impossible to construct such an array. Why? XOR is cyclic and associative, so for adjacent XORs to loop back, their total XOR must cancel out (i.e., be ...
Bitwise XOR of All Pairings | Approache| Dry Runs | Leetcode 2425 | CodeWithShaaz
Просмотров 721 день назад
Java Program to Find XOR of All Pairs Between Two Arrays 🚀 This Java program calculates the XOR of all possible pairs formed by elements from two arrays, nums1 and nums2. 🔍 How It Works: Count Occurrences with Impact: Each number in nums1 is counted n times (where n is the size of nums2) because it will pair with each element in nums2. Similarly, each number in nums2 is counted m times (where m...
Minimum XOR|intuition |Leetcode 2429 |CodeWithShaaz
Просмотров 621 день назад
Java Program to Minimize XOR with Matching Set Bits 🚀 This Java program finds a number x such that: x has the same number of set bits (1's in binary) as num2. The XOR of x and num1 is minimized (x XOR num1). 🔍 How It Works: Count Set Bits: First, it counts the number of set bits in both num1 and num2. Adjust Bits: If num1 has fewer set bits than num2, it sets additional bits starting from the l...
Check if a Parentheses String Can Be Valid |Intuition |Leetcode 2116 |CodeWithShaaz
Просмотров 421 день назад
In this video, we solve LeetCode 2116 - Check if a Parentheses String Can Be Valid using a clear and intuitive approach. I explain the logic step-by-step and implement an efficient solution in Java. 🔎 Problem Overview: Given two strings, s (consisting of parentheses '(' and ')') and locked (a binary string of '0' and '1'), the task is to determine if the parentheses string can be valid after ch...
Minimum Length of String After Operations | Leetcode 3223|CodeWithShaaz
Просмотров 721 день назад
🚀 Java Program to Calculate Custom Character Sum in a String 🚀 This Java program calculates a custom sum based on the frequency of each unique character in a given string. For every character: If it appears an odd number of times ➡️ Add 1 to the sum. If it appears an even number of times ➡️ Add 2 to the sum. 📊 Example: Input: "aabbc" Output: 5 Explanation: 'a' → 2 times (even) ➡️ 2 'b' → 2 time...
Exploring Hyderabad_ A Day in the City Nawabs
Просмотров 128 месяцев назад
Exploring Hyderabad: A Day in the City Join us on an exciting journey through the vibrant streets of Hyderabad! In this video, we explore the rich history, stunning architecture, and bustling markets of this incredible city. From the iconic Charminar to the serene Hussain Sagar Lake, experience the diverse culture and flavors that make Hyderabad truly unique. Whether you're a local or a tourist...
Google's Latest Layoffs: What's Behind the Move?
Просмотров 209 месяцев назад
Google Layoffs: Python Team Cut - What's the Real Story? In this video, we delve into Google's recent decision to lay off its entire Python team as part of a broader cost-cutting strategy. Find out why Google is turning to cheaper labor markets outside the United States and how this move has impacted employees. We explore the reasons behind the restructuring, reactions from affected workers, an...
Hyderabadi Pingu as chief comedy
Просмотров 3,2 тыс.5 лет назад
Give me ideas for videos comment 👇 below
Can you share the source code..
As of 2022, all U.S. R&D salaries have to be expensed over 5 years. This means that 80% of R&D salaries are in affect, double taxed. Instead of paying high U.S. taxes, companies move the jobs offshore and expense the salaries (like all the salaries) against operations there (for example in Europe). Engineers in Germany are not must less expensive than engineer in the U.S. But the double taxation, especially at a profitable company like Google, hits them harder. The Biden administration is sleep-walking, and should repealed this change (in Section 174 of the U.S. tax code). Big mistake, that could cost an election. The U.S. economy is already teetering on recession. Inflation is not abated, despite high interest rates, and unemployment is climbing. Any crisis in the finance sector, and it is over. The smartest thing to do would be repeal section 174, immediately. And work to bring down the commodity prices that are driving U.S. inflation. But again, Biden is sleep walking this, so I think the election is definitely a coin toss this time.
Very nice