- 19
- 3 019
ARAVIND A
เข้าร่วมเมื่อ 2 พ.ค. 2016
Minimum Swaps to Group All 1's Together II | C++
A swap is defined as taking two distinct positions in an array and swapping the values in them.
A circular array is defined as an array where we consider the first element and the last element to be adjacent.
Given a binary circular array nums, return the minimum number of swaps required to group all 1's present in the array together at any location.
A circular array is defined as an array where we consider the first element and the last element to be adjacent.
Given a binary circular array nums, return the minimum number of swaps required to group all 1's present in the array together at any location.
มุมมอง: 18
วีดีโอ
1105. Filling Bookcase Shelves | C++
มุมมอง 36หลายเดือนก่อน
You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character arrays original and changed, and an integer array cost, where cost[i] represents the cost of changing the character original[i] to the character changed[i]. You start with the string source. In one operation, you can pick a character x f...
Minimum Cost to Convert String I DP
มุมมอง 29หลายเดือนก่อน
You are given two 0-indexed strings source and target, both of length n and consisting of lowercase English letters. You are also given two 0-indexed character arrays original and changed, and an integer array cost, where cost[i] represents the cost of changing the character original[i] to the character changed[i]. You start with the string source. In one operation, you can pick a character x f...
64. Minimum Path Sum | LEETCODE | DP-question
มุมมอง 77ปีที่แล้ว
Problem link | leetcode.com/problems/minimum-path-sum/ Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. Note: You can only move either down or right at any point in time.
3sum in 15mins | leetcode | java
มุมมอง 113ปีที่แล้ว
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] nums[j] nums[k] 0. Notice that the solution set must not contain duplicate triplets.
853. Car Fleet | Stacks | JAVA
มุมมอง 565ปีที่แล้ว
There are n cars going to the same destination along a one-lane road. The destination is target miles away. You are given two integer array position and speed, both of length n, where position[i] is the position of the ith car and speed[i] is the speed of the ith car (in miles per hour). A car can never pass another car ahead of it, but it can catch up to it and drive bumper to bumper at the sa...
102. Binary Tree Level Order Traversal | Recursive + Iterative | JAVA
มุมมอง 63ปีที่แล้ว
Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). problem link | leetcode.com/problems/binary-tree-level-order-traversal/
0 - 1 Knapsack Problem part 1 | DP Memoization |
มุมมอง 65ปีที่แล้ว
You are given weights and values of N items, put these items in a knapsack of capacity W to get the maximum total value in the knapsack. Note that we have only one quantity of each item. In other words, given two integer arrays val[0..N-1] and wt[0..N-1] which represent values and weights associated with N items respectively. Also given an integer W which represents knapsack capacity, find out ...
Rat in a Maze Problem - I | BACKTRACKING | JAVA
มุมมอง 642ปีที่แล้ว
Consider a rat placed at (0, 0) in a square matrix of order N * N. It has to reach the destination at (N - 1, N - 1). Find all possible paths that the rat can take to reach from source to destination. The directions in which the rat can move are 'U'(up), 'D'(down), 'L' (left), 'R' (right). Value 0 at a cell in the matrix represents that it is blocked and rat cannot move to it while value 1 at a...
198. House Robber | DP-medium
มุมมอง 75ปีที่แล้ว
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums representing the amount of mone...
152. Maximum Product Subarray | Amazon question
มุมมอง 46ปีที่แล้ว
Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. A subarray is a contiguous subsequence of the array. PROBLEM LINK : leetcode.com/problems/maximum-product-subarray/
Reverse Linked List recursively easiest way
มุมมอง 16ปีที่แล้ว
Reverse Linked List recursively easiest way
560. Subarray Sum Equals K | JAVA
มุมมอง 27ปีที่แล้ว
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k. A subarray is a contiguous non-empty sequence of elements within an array.
22. Generate Parentheses- leetcode | by Aravind in JAVA
มุมมอง 60ปีที่แล้ว
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
46. Permutations leetcode solution-- by Aravind A in java
มุมมอง 78ปีที่แล้ว
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
78. Subsets by ARAVIND A LEETCODE backtracking
มุมมอง 28ปีที่แล้ว
78. Subsets by ARAVIND A LEETCODE backtracking
424. Longest Repeating Character Replacement- leetcode solution by ARAVIND A in java
มุมมอง 1Kปีที่แล้ว
424. Longest Repeating Character Replacement- leetcode solution by ARAVIND A in java
3. Longest Substring Without Repeating Characters -- by Aravind
มุมมอง 33ปีที่แล้ว
3. Longest Substring Without Repeating Characters by Aravind
Aravind A 's submission for nyxwolves intern task
มุมมอง 402 ปีที่แล้ว
Aravind A 's submission for nyxwolves intern task
critical thinking😊
Great work! Keep it going!
Great work!!
Thank you, very insightful 🙏🏽
looks like someone messed up in the end
When is ur MS classes going to start bro ?
Ermm what the Sigma?
I really like how you have put up the entire unfiltered video and not trimmed the parts where you were initially going wrong or missed the typecasting, this helps us remember not to make the same mistakes which are very common to happen. Good job at explaining !! Thanks for the solution !
Improve Audio Quality
nice
c++ bhai
The logic remains the same, you can try implementing the same with c++
🙇
big fan
😂😂
Awesome GS!!!
Jai balayya 🔥🔥🔥
Guys sorry for too many typos cuz I just bought a new keyboard
bhai make videos for solving a question using this !!
Sure I am going to use in the next video for finding the top view of a tree
Bro do Bik-weekly contest live anytime pls and also how u got to knw its DP only bro ???... intution how u got ??..without tags how will uk ??
ill surely do contests in coming days , Ill make a video on how to identify a dp problem
@@aravinda1595 Tq !
problem link ??
Please zoom the editor a bit bro ...like how u did at 12:30 for entire video timing
ill do it from next video 🙂
Thanks Bhaiya !!..for perfect analysis of TC and SC 🔥
thanks a lot
TIME AND SPACE COMPLEXITY BRO !!??😥😥
N time solution 😅
Try adding time and space complexity info along with each code ....that would be helpful !!!
Yes I'll surely do it.
😎😎 WE NEED MORE !!
sure sure thank you very much
Waaaw
thanks
NICE EXPLANATION !!!
Thanks a lot ❤
Damn cool way of explaining .🔥