Code W Me
Code W Me
  • Видео 69
  • Просмотров 2 868
Autonomous Line Follower Drone using MATLAB & Simulink |MathWorks Mini Drone Competition |Naman Jain
This video showcases a Parrot Mini Drone autonomously tracking a red line and landing on a designated circle using its onboard camera. The project was developed using Simulink MATLAB for the MathWorks International Mini Drone Competition.
Key Features:
Real-time image processing for line detection using edge filters and Hough transforms.
Dynamic path planning with speed adjustments based on object distance.
Obstacle detection through black region analysis.
Autonomous landing using circle detection algorithms.
Project Overview: The drone uses real-time visual data to detect, process, and adjust its path. With features like ROI-based heading adjustments and path correction, the drone avoids obsta...
Просмотров: 34

Видео

EASY MERGE TOOL | Naman Jain | IIITG | Node Js | HTML CSS Bootstrap | Render | Python
Просмотров 943 месяца назад
Tool Link : naman-portfolio-pn0u.onrender.com/index.html Static Non-Working Website Link : naman-portfolio-one.vercel.app (As the website is deployed on Render Free version it will take 3-4 mins to be deployed ) Easy Merge Tool Experience seamless merging of your data with our intuitive tool. Simplify complex tasks and enhance productivity effortlessly. How It Works: Upload DOCX Templates: Uplo...
DAY 60 |GFG Swapping pairs make sum equal |5 June |Naman Jain|IIITG #gfgpotd #dfs #java #logic
Просмотров 213 месяца назад
Swapping pairs make sum equal MediumAccuracy: 23.94%Submissions: 117K Points: 4 Given two arrays of integers a[] and b[] of size n and m, the task is to check if a pair of values (one value from each array) exists such that swapping the elements of the pair will make the sum of two arrays equal. Note: Return 1 if there exists any such pair otherwise return -1. Example 1: Input: n = 6, m = 4, a[...
DAY 59 |GFG Binary representation of next number|4 June |Naman Jain|IIITG #gfgpotd #dfs #java #logic
Просмотров 63 месяца назад
Binary representation of next number EasyAccuracy: 50.0%Submissions: 39K Points: 2 Be the comment of the day in POTD and win a GfG T-Shirt! Solve right now banner Given a binary representation in the form of a string(s) of a number n, the task is to find a binary representation of n 1. Note: Output binary string should not contain leading zeros. Example 1: Input: s = "10" Output: 11 Explanation...
DAY 1 | Append Char to string to make subsequence |3 June |Naman Jain|IIITG #leetcode #string #java
Просмотров 34 месяца назад
You are given two strings s and t consisting of only lowercase English letters. Return the minimum number of characters that need to be appended to the end of s so that t becomes a subsequence of s. A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order of the remaining characters. Example 1: Input: s = "coaching", t = "cod...
DAY 58 |GFG Trail of ones |3 June |Naman Jain|IIITG #gfgpotd #dfs #java #logic #graph #bst
Просмотров 144 месяца назад
Trail of ones Given a number n, find the number of binary strings of length n that contain consecutive 1's in them. Since the number can be very large, return the answer after modulo with 1e9 7. Example 1: Input: n = 2 Output: 1 Explanation: There are 4 strings of length 2, the strings are 00, 01, 10, and 11. Only the string 11 has consecutive 1's. Example 2: Input: n = 5 Output: 19 Explanation...
How to Master Dynamic Programming: 5 Basic Problems Explained in 10 Minutes! | Naman Jain | IIITG
Просмотров 284 месяца назад
In this video, We dive into the fundamental concepts of Dynamic Programming (DP) by solving five basic DP problems in just 10 minutes! Whether you're new to DP or looking to solidify your understanding, this concise tutorial covers essential DP techniques and strategies through practical examples. Watch as I break down each problem step-by-step, providing clear explanations and intuitive soluti...
First Time Ever : Robo-Soccer | Robo-Con 24' | IIITG | Naman Jain | Club-Coordinator
Просмотров 1185 месяцев назад
Welcome to the Robo-Soccer of Robo-World at IIITG Robo-Con! This competition, organized by the Robotics and Emerging Club Technocrats under the Technical Board Technocrats Official Insta page : technocrats_iiitg My dedication and hard work as the coordinator truly made a significant impact on the success of this remarkable event. I was very lucky to witness such high enthusiasm an...
Yuvaan 2k24 | EVENT MANAGEMENT | BEHIND THE SCENES | Naman Jain | IIITG
Просмотров 545 месяцев назад
Hey guys, this is Naman Jain! I was part of the EM Core team for Yuvaan 2k24, and let me tell you, it was an absolute blast working with the EM Family. Today, I'm bringing you a sneak peek behind the scenes! Insta IDs Naman Jain ( Creator ) : _naman.jain_01 Team Heads Sindhu Rallabandi : sindhugh_ Shreya Gupta : shre.yagupta7 Event Management Core Te...
DAY 57|GFG Reach a given score|25 Feb |Naman Jain|IIITG #gfgpotd #dfs #java #logic #graph #bst
Просмотров 287 месяцев назад
Reach a given score EasyAccuracy: 79.23%Submissions: 39K Points: 2 Internship Alert! Become an SDE Intern by topping this monthly leaderboard! banner Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of distinct combinations to reach the given score. Example 1: Input n = 10 Output 2 Explanation There are two ways {5,5} and {10}. Example 2...
DAY 57|GFG Sum of leaf Nodes |18 Feb |Naman Jain|IIITG #gfgpotd #dfs #java #logic #graph #bst
Просмотров 177 месяцев назад
Sum of leaf nodes in BST Easy Given a Binary Search Tree with n nodes, find the sum of all leaf nodes. BST has the following property (duplicate nodes are possible): The left subtree of a node contains only nodes with keys less than the node’s key. The right subtree of a node contains only nodes with keys greater than or equal to the node’s key. Your task is to determine the total sum of the va...
DAY 56|GFG Array represent MaxHeap? |17 Feb |Naman Jain|IIITG #gfgpotd #dfs #java #logic #graph #bst
Просмотров 117 месяцев назад
Does array represent Heap Easy Given an array arr of size n, the task is to check if the given array can be a level order representation of a Max Heap. Example 1: Input: n = 6 arr[] = {90, 15, 10, 7, 12, 2} Output: 1 Explanation: The given array represents below tree 90 / \ 15 10 / \ / 7 12 2 The tree follows max-heap property as every node is greater than all of its descendants. Problem link :...
DAY 55 |GFG Flatten BST |16 Feb |Naman Jain|IIITG #gfgpotd #dfs #java #logic #graph #bst
Просмотров 277 месяцев назад
Flatten BST to sorted list Medium You are given a Binary Search Tree (BST) with n nodes, each node has a distinct value assigned to it. The goal is to flatten the tree such that, the left child of each element points to nothing (NULL), and the right child points to the next element in the sorted list of elements of the BST (look at the examples for clarity). You must accomplish this without usi...
DAY 54 |GFG: Count all Possible Path |15 Feb |Naman Jain|IIITG #gfgpotd #dfs #java #logic #graph
Просмотров 177 месяцев назад
"Count all Possible Path" Medium You are presented with an undirected connected graph consisting of n vertices and connections between them represented by an adjacency matrix. Your objective is to determine whether it is possible to start traversing from a node, x, and return to it after traversing all the vertices at least once, using each edge exactly once. Example 1: Input: paths = 0 1 1 1 1...
DAY 53 |GFG Critical Connection using Kosaraju's|14 Feb |Naman Jain|IIITG #gfgpotd #java #graph #dfs
Просмотров 97 месяцев назад
"Find all Critical Connections in the Graph" A critical connection refers to an edge that, upon removal, will make it impossible for certain nodes to reach each other through any path. You are given an undirected connected graph with v vertices and e edges and each vertex distinct and ranges from 0 to v-1, and you have to find all critical connections in the graph. It is ensured that there is a...
DAY 52 |GFG: Clone Undir. Graph |13 Feb |Naman Jain|IIITG #gfgpotd #java #logic #graph #dfs #copy
Просмотров 67 месяцев назад
DAY 52 |GFG: Clone Undir. Graph |13 Feb |Naman Jain|IIITG #gfgpotd #java #logic #graph #dfs #copy
DAY 51 |GFG: Recursive Sequence |12 Feb |Naman Jain|IIITG #gfgpotd #java #logic #logic #dp #memo
Просмотров 117 месяцев назад
DAY 51 |GFG: Recursive Sequence |12 Feb |Naman Jain|IIITG #gfgpotd #java #logic #logic #dp #memo
DAY 50 |GFG: Recamans sequence |11 Feb |Naman Jain|IIITG #gfgpotd #matrix #java #logic #arrays
Просмотров 467 месяцев назад
DAY 50 |GFG: Recamans sequence |11 Feb |Naman Jain|IIITG #gfgpotd #matrix #java #logic #arrays
DAY 49 |GFG: Unique Path in a Matrix |10 Feb |Naman Jain|IIITG #gfgpotd #matrix #java #logic
Просмотров 257 месяцев назад
DAY 49 |GFG: Unique Path in a Matrix |10 Feb |Naman Jain|IIITG #gfgpotd #matrix #java #logic
DAY 48 |GFG: Children Sum Property in a BT | 9 Feb | Naman Jain |IIITG #gfgpotd #binarytree #java
Просмотров 167 месяцев назад
DAY 48 |GFG: Children Sum Property in a BT | 9 Feb | Naman Jain |IIITG #gfgpotd #binarytree #java
DAY 47 |GFG: 8 Feb : Leaves At Same Level | Naman Jain |IIITG #gfgpotd #binarytree #java
Просмотров 67 месяцев назад
DAY 47 |GFG: 8 Feb : Leaves At Same Level | Naman Jain |IIITG #gfgpotd #binarytree #java
DAY 46 |GFG:Min Dist B/W two nodes in Binary Tree|7 Feb |Naman Jain|IIITG #gfgpotd #binarytree #java
Просмотров 267 месяцев назад
DAY 46 |GFG:Min Dist B/W two nodes in Binary Tree|7 Feb |Naman Jain|IIITG #gfgpotd #binarytree #java
DAY 45 |GFG:Count nodes at distance K from leaf |6 Feb | Naman Jain|IIITG #gfgpotd #binarytree #java
Просмотров 487 месяцев назад
DAY 45 |GFG:Count nodes at distance K from leaf |6 Feb | Naman Jain|IIITG #gfgpotd #binarytree #java
DAY 44 |GFG: Insertion in circular linked list |5 Feb | Naman Jain|IIITG #gfgpotd #strings #linked
Просмотров 138 месяцев назад
DAY 44 |GFG: Insertion in circular linked list |5 Feb | Naman Jain|IIITG #gfgpotd #strings #linked
DAY 43|GFG: Subtraction in Linked List |4 Feb |Naman Jain|IIITG #gfgpotd #strings #linkedlist #java
Просмотров 168 месяцев назад
DAY 43|GFG: Subtraction in Linked List |4 Feb |Naman Jain|IIITG #gfgpotd #strings #linkedlist #java
DAY 42 |GFG: Numeric value of Binary Linked List |3 Feb | Naman Jain|IIITG #gfgpotd #strings #linked
Просмотров 248 месяцев назад
DAY 42 |GFG: Numeric value of Binary Linked List |3 Feb | Naman Jain|IIITG #gfgpotd #strings #linked
DAY 41 |GFG:Implement Atoi |2 February |Naman Jain|IIITG #gfgpotd #integer #strings #java #logic
Просмотров 288 месяцев назад
DAY 41 |GFG:Implement Atoi |2 February |Naman Jain|IIITG #gfgpotd #integer #strings #java #logic
DAY 40 |GFG: Panagram Checking |1 Feb | Naman Jain|IIITG #gfgpotd #data #dsa #logic #algorithm
Просмотров 388 месяцев назад
DAY 40 |GFG: Panagram Checking |1 Feb | Naman Jain|IIITG #gfgpotd #data #dsa #logic #algorithm
DAY 39 |GFG:Insert and Search in a Trie|31 JANUARY|Naman Jain|IIITG #gfgpotd #datastructures #dsa
Просмотров 348 месяцев назад
DAY 39 |GFG:Insert and Search in a Trie|31 JANUARY|Naman Jain|IIITG #gfgpotd #datastructures #dsa
DAY 38 |GFG:Lowest Common Subsequence LCS |30 JANUARY|Naman Jain|IIITG #gfgpotd #dp #recursion #memo
Просмотров 448 месяцев назад
DAY 38 |GFG:Lowest Common Subsequence LCS |30 JANUARY|Naman Jain|IIITG #gfgpotd #dp #recursion #memo

Комментарии

  • @SamarthKala
    @SamarthKala 4 месяца назад

    SIR JI✍🙏

  • @chessnoobelo800
    @chessnoobelo800 7 месяцев назад

    Great explaination

  • @SandeepPatil-fw9el
    @SandeepPatil-fw9el 7 месяцев назад

    Please maintain the video quality

    • @namanjain2970
      @namanjain2970 7 месяцев назад

      Thanks for the feedback ! It is highly appreciated ! Will work on the quality ! Keep coding 👍👍

  • @chessnoobelo800
    @chessnoobelo800 8 месяцев назад

    Great explanation!! keep posting 😊😊

  • @codecode360
    @codecode360 8 месяцев назад

    Great

  • @codecode360
    @codecode360 8 месяцев назад

    Hello friend

  • @aman_rockstar31
    @aman_rockstar31 8 месяцев назад

    nice explanation

    • @namanjain2970
      @namanjain2970 8 месяцев назад

      Thank You.Your Feedback is Highly Appreciated.

    • @namanjain2970
      @namanjain2970 7 месяцев назад

      Thank you so much ! Your feedback is highly appreciated! Keep coding

    • @aman_rockstar31
      @aman_rockstar31 7 месяцев назад

      ​@@namanjain2970 make more vedioes like this and try new things in your explanation keep doing hard work best of luck for your future.

    • @namanjain2970
      @namanjain2970 7 месяцев назад

      @@aman_rockstar31 Surely I will try new things . Just waiting for my new pc-setup.

  • @darshanjain9793
    @darshanjain9793 8 месяцев назад

    Please can you give neetcode

  • @darshanjain9793
    @darshanjain9793 8 месяцев назад

    Nice solution

  • @chessnoobelo800
    @chessnoobelo800 9 месяцев назад

    Nice Solution 🔥🔥

    • @namanjain2970
      @namanjain2970 9 месяцев назад

      Yes thanks, for any doubts feel free to reach out

  • @namanjain2970
    @namanjain2970 9 месяцев назад

    Surely ! Thanks for the suggestion.

  • @gaminggenix6559
    @gaminggenix6559 9 месяцев назад

    bro your are too fast please be little slow