Tutorial Horizon
Tutorial Horizon
  • 109
  • 564 173
How to Find a Missing Number in a Sequence of Consecutive Numbers | Beginner
Complete Article - tutorialhorizon.com/algorithms/find-a-missing-number-from-a-sequence-of-consecutive-numbers/
Learn efficient methods to find a missing number in a sequence of consecutive numbers. Explore step-by-step approaches with examples and algorithms.
#algorithm #interview #coding #array #beginner #numbers
Переглядів: 21

Відео

Evaluate Infix Expression | Animation | Learn in 3 mins
Переглядів 1,9 тис.21 день тому
Complete Article - tutorialhorizon.com/algorithms/evaluation-of-infix-expressions/ Understand the evaluation of infix expressions step-by-step with detailed examples. Learn how operators, precedence, and parentheses are used to calculate results. Explore infix to postfix conversion and practical implementation in Python or other programming languages Example: A * ( B C ) / D 2 * (5 3) / 4 Outpu...
Multiplication by Power of 2 Without pow() or * | Beginner
Переглядів 27Місяць тому
Complete Article - tutorialhorizon.com/algorithms/multiply-with-power-of-2-without-using-pow-or-operator/ Learn how to multiply numbers by powers of 2 in Python without using pow() or the * operator. Discover efficient techniques leveraging bitwise shifts for fast and accurate results. #algorithm #interview #coding #array #medium #strings
Convert Infix to Postfix Expression | Medium
Переглядів 2,1 тис.Місяць тому
Complete Article - tutorialhorizon.com/algorithms/convert-infix-to-postfix-expression/ Learn how to convert infix expressions to postfix (Reverse Polish Notation) using the Shunting Yard algorithm. This step-by-step guide explains infix-to-postfix conversion, with examples and code snippets to help you master expression evaluation in programming. #algorithm #interview #coding #infix #medium #st...
The Number of Pairs with Odd XOR in an Array: A Detailed Explanation
Переглядів 31Місяць тому
Complete Post: Find the number of pairs with odd XOR - tutorialhorizon.com/algorithms/find-the-number-of-pairs-with-odd-xor/ The number of pairs with odd XOR in an array can be found using a simple algorithm. The algorithm works by first counting the number of even and odd numbers in the array. The number of pairs with odd XOR is then equal to the product of these two counts. #algorithm #interv...
Shape Transitions in Mac Keynote: Transform Objects Seamlessly
Переглядів 38Місяць тому
In this tutorial, I’ll show you how to transform one shape or object into another using Mac Keynote’s powerful animation tools. Whether you're creating professional presentations or engaging visual content, this step-by-step guide will help you achieve smooth and seamless object transitions. Perfect for enhancing your slides and adding dynamic effects! Watch now to take your Keynote skills to t...
Classic Snake Game | Python | PyGame | Complete Implementation | Game Design
Переглядів 3202 місяці тому
Complete Article (Include Github Code) - tutorialhorizon.com/algorithms/how-to-build-a-snake-game-in-python-using-pygame/ In this tutorial, we’ll walk through how to build a classic Snake Game in Python using the pygame library. We’ll start by explaining each component of the game and how they work together to create an engaging, interactive experience. #algorithm #interview #games #snakegame #...
Linear Search vs Binary Search | Animation | Learn in 1 min
Переглядів 1062 місяці тому
Complete Article - tutorialhorizon.com/algorithms/linear-search-vs-binary-search/ Learn the key differences between Linear Search and Binary Search algorithms, including their time complexities, use cases, and how they work. Understand when to use each search method effectively. #algorithm #interview #coding #array #beginner #linearsearch #binarysearch
Patience Sorting - Longest Increasing Subsequence | Animation | Learn in 4 mins
Переглядів 1422 місяці тому
Complete Article - tutorialhorizon.com/algorithms/patience-sorting-longest-increasing-subsequence/ Learn how Patience Sorting, inspired by the card game Solitaire, efficiently solves the Longest Increasing Subsequence (LIS) problem. Discover its step-by-step approach, algorithm, and time complexity improvement from O(n²) to O(nlogn). #algorithm #interview #coding #array #medium #sorting #patien...
Level Order Traversal (BFS): Print Each Level of a Binary Tree on a Separate Line | Medium
Переглядів 952 місяці тому
Complete Article - tutorialhorizon.com/algorithms/level-order-traversal-print-each-level-in-separate-line/ Height of Tree- ua-cam.com/video/j9jrpe-c8UU/v-deo.html Learn how to perform Level Order Traversal (BFS) on a binary tree and print each level on a separate line. This guide covers step-by-step implementation for optimal understanding. #algorithm #interview #coding #array #medium #binarytr...
Merge Sort | Animation | Learn in 2 mins
Переглядів 562 місяці тому
Complete Article - tutorialhorizon.com/algorithms/merge-sort-updated-most-efficient-ways-to-implement/ Learn about Merge Sort, a highly efficient, comparison-based sorting algorithm. Understand its divide-and-conquer approach, time complexity, and step-by-step process to improve your algorithmic problem-solving skills. #algorithm #interview #coding #array #medium #sortingalgorithm #sorting
Selection Sort | Animation l Beginner | 2 mins
Переглядів 3032 місяці тому
Complete Article - tutorialhorizon.com/algorithms/selection-sort/ Learn about Selection Sort, a simple comparison-based sorting algorithm with O(n²) time complexity. Understand its working principle, pseudocode, time and space complexities, and usage examples #algorithm #interview #coding #array #sorting
Breadth-First Search (BFS) in Undirected Graph | Animation | Learn in 2 mins
Переглядів 5043 місяці тому
Complete Article - tutorialhorizon.com/algorithms/breadth-first-search-in-disconnected-graph/ Breadth-First Search (BFS) algorithm implementation for graph traversal . This code demonstrates how to traverse a graph or tree level by level using a queue. It maintains a set of visited nodes to avoid reprocessing and a queue to handle node exploration. Ideal for learning and solving problems relate...
Maximum Overlaps In a Given list of Time Intervals | Medium | Animation
Переглядів 2283 місяці тому
Complete Article - tutorialhorizon.com/algorithms/maximum-overlaps-in-a-given-list-of-time-intervals/ The problem is to find the maximum number of overlapping intervals from a given list of time intervals. An interval is represented as [start, end], where start is the beginning time and end is the ending time of the interval. The task is to write an algorithm that determines the maximum number ...
Print Numbers from 1 to N without using loop | Beginner | Animation | 2 mins
Переглядів 9643 місяці тому
Complete Article - tutorialhorizon.com/algorithms/print-numbers-from-1-to-n-without-using-loop/ Learn how to print numbers from 1 to N without using loops through a simple and efficient recursive approach. Explore step-by-step solutions and coding examples. #algorithm #interview #coding #array #beginner #strings #recursion
Move All Zeroes to the End of the Array | Beginner
Переглядів 7363 місяці тому
Move All Zeroes to the End of the Array | Beginner
Colorful Numbers
Переглядів 5573 місяці тому
Colorful Numbers
Binary Tree - Vertical Order Path | Medium
Переглядів 2263 місяці тому
Binary Tree - Vertical Order Path | Medium
Check If Contains Duplicates - 3 Approaches | Beginner | Animation | Learn in 1 min
Переглядів 4633 місяці тому
Check If Contains Duplicates - 3 Approaches | Beginner | Animation | Learn in 1 min
Minimize Scheduling Headaches: Clone Yourself for Overlapping Events | Hard
Переглядів 3343 місяці тому
Minimize Scheduling Headaches: Clone Yourself for Overlapping Events | Hard
Count Similar Words in a Given Array | Beginner
Переглядів 253 місяці тому
Count Similar Words in a Given Array | Beginner
Deep Q-Learning: AI Robot Navigates Maze with Fire Pit in PyTorch | Reinforcement Learning
Переглядів 864 місяці тому
Deep Q-Learning: AI Robot Navigates Maze with Fire Pit in PyTorch | Reinforcement Learning
Snake Game - AI - Reinforcement learning (RL) - Deep Q Learning (DQN) Using Pytorch
Переглядів 1634 місяці тому
Snake Game - AI - Reinforcement learning (RL) - Deep Q Learning (DQN) Using Pytorch
Efficiently Rank Elements in a Given Array | Beginner
Переглядів 725 місяців тому
Efficiently Rank Elements in a Given Array | Beginner
Maximum Consecutive Ones in a given array | Beginner
Переглядів 477 місяців тому
Maximum Consecutive Ones in a given array | Beginner
Efficient Algorithm to Find Number of Subgraphs in a Graph | Beginner
Переглядів 2758 місяців тому
Efficient Algorithm to Find Number of Subgraphs in a Graph | Beginner
Get the Height of a Node in a Binary Tree | Beginner
Переглядів 4748 місяців тому
Get the Height of a Node in a Binary Tree | Beginner
Group Anagrams Together: Efficient String Matching Algorithm | Medium
Переглядів 468 місяців тому
Group Anagrams Together: Efficient String Matching Algorithm | Medium
Sum of all sub arrays in O(n) Time | Hard
Переглядів 3239 місяців тому
Sum of all sub arrays in O(n) Time | Hard
Identifying Extra Element in Almost Similar Arrays | Beginner
Переглядів 63510 місяців тому
Identifying Extra Element in Almost Similar Arrays | Beginner

КОМЕНТАРІ

  • @fabioaccurso1795
    @fabioaccurso1795 6 днів тому

    u are the best!! thank you! <3

  • @siddharthreddy7990
    @siddharthreddy7990 6 днів тому

    tnx my exam is in 1hr

  • @donermannali2701
    @donermannali2701 13 днів тому

    Ty now I can get my cs major and get homeless faster ❤

  • @tutorialhorizon9085
    @tutorialhorizon9085 13 днів тому

    Complete Article - tutorialhorizon.com/algorithms/evaluation-of-infix-expressions/ Post any questions in comments. Subscribe to our channel for more videos.

  • @sandhyaray2935
    @sandhyaray2935 13 днів тому

    thank you!

  • @sandhyaray2935
    @sandhyaray2935 13 днів тому

    thank you so much

  • @NOOR-dy6yn
    @NOOR-dy6yn 15 днів тому

    Thanks for brilliant animation

  • @Dewranedewran
    @Dewranedewran Місяць тому

    thank you 👍👍👌👌

  • @rogermichou8654
    @rogermichou8654 Місяць тому

    does your graph use a adjacency matrix or adjacency lists ?

    • @tutorialhorizon9085
      @tutorialhorizon9085 Місяць тому

      The code in the article is using adjacency list, however the logic will be same for adjacency matrix as well. tutorialhorizon.com/algorithms/check-if-given-undirected-graph-is-connected-or-not/

  • @Nykster
    @Nykster Місяць тому

    Thank you!

  • @tutorialhorizon9085
    @tutorialhorizon9085 2 місяці тому

    Path - follow the order in which nodes are turning red 0 - 1 - 2 - 4 - 3 - 5.

  • @BigRovia
    @BigRovia 2 місяці тому

    You should highlight the chosen edges, it's pretty unclear what is the final path

    • @tutorialhorizon9085
      @tutorialhorizon9085 2 місяці тому

      Path - follow the order in which nodes are turning red 0 - 1 - 2 - 4 - 3 - 5. Thanks for the advice, will remember this in future videos.

  • @Maxwork82
    @Maxwork82 2 місяці тому

    Impossible to figure out by UI. You have to know how to achieve it. Thanks

  • @coolcoder-q4i
    @coolcoder-q4i 2 місяці тому

    Thanks 👍

  • @sauravchandra10
    @sauravchandra10 2 місяці тому

    If we have to find the sum of each subarray, what would be the approach?

    • @tutorialhorizon9085
      @tutorialhorizon9085 2 місяці тому

      Refer - the video below, you can easily modify to get sum of subarray instead of printing it. Video - ua-cam.com/video/6H95YDRpV8Y/v-deo.html&ab_channel=TutorialHorizon Post - tutorialhorizon.com/algorithms/print-all-subarrays-using-recursion/ Modified code: public class Main { public static void printSubArray(int [] input, int currIndex){ if(currIndex==input.length) return; //print all the subarray from currIndex to end int result = 0; for (int i = currIndex; i <input.length ; i++) { result += input[i]; System.out.print("[" +result + "] "); } printSubArray(input, currIndex+1); } public static void main(String[] args) { int [] input = {4, 6, 8}; printSubArray(input, 0); } }

  • @MAN-co8sq
    @MAN-co8sq 2 місяці тому

    Patience Sort please

  • @jainrjain764
    @jainrjain764 3 місяці тому

    Thanks for explaining

  • @coolcoder-q4i
    @coolcoder-q4i 3 місяці тому

    Quick and easy explanation. Thanks

  • @coolcoder-q4i
    @coolcoder-q4i 3 місяці тому

    Nice explanation, Thanks for making it easy to understand.

  • @ShinAkuma
    @ShinAkuma 3 місяці тому

    random background music = instant dislike.

  • @oximas-oe9vf
    @oximas-oe9vf 4 місяці тому

    thank you

  • @SickOfMetal
    @SickOfMetal 5 місяців тому

    very cool feature

  • @kemalhariz
    @kemalhariz 6 місяців тому

    thank you so much man, you saved me a lot. im reviewing the usage of my design system and your tutorial saved me

  • @prodwb
    @prodwb 7 місяців тому

    i was able to sort a linked list in a traverse tree with this, thanks!

  • @rix_1723
    @rix_1723 7 місяців тому

    thank you, exam is tmrw

  • @yavarjn2055
    @yavarjn2055 7 місяців тому

    These are not all the routes! There are routes that are longer but exist like 1->2->3->6->5->4->7->8->9, if I counted well there are 12 paths

  • @HuyNguyen-zp8ju
    @HuyNguyen-zp8ju 7 місяців тому

    awesome

  • @carolinekloppert5177
    @carolinekloppert5177 8 місяців тому

    didn't work for me. I click nodes, I click beziere, and the red squares disappear and there are blue X's instead and it says 'handle to cup node' and all I want is to continue my outline so I can cut out a drawing by closing the shape.

    • @carolinekloppert5177
      @carolinekloppert5177 8 місяців тому

      it used to work a year or two ago, but the program has changed.

  • @ValentinoFilipetto
    @ValentinoFilipetto 9 місяців тому

    Great video thanks!

  • @zachary_thomas
    @zachary_thomas 10 місяців тому

    Thanks! I’ve seen implementations that start at the second element instead of the first

  • @j.r.r.tolkien8724
    @j.r.r.tolkien8724 10 місяців тому

    Bad explanation.

    • @JonathanSebastianS
      @JonathanSebastianS 8 місяців тому

      I think it's a cool explanation because he already explained for every iteration, the array will be sorted from index 1 to index i (from its box) so that when you move the element to the next index, the array will be sorted to the end.

    • @Unlimit-729
      @Unlimit-729 7 місяців тому

      It's cool explanation

    • @tutorialhorizon9085
      @tutorialhorizon9085 3 місяці тому

      Will try to improve

    • @anshik.k.t
      @anshik.k.t 28 днів тому

      @@Unlimit-729 wrf is "cool" in this

  • @Martinioini
    @Martinioini 10 місяців тому

    W

  • @bhrt1995
    @bhrt1995 10 місяців тому

    Hello Tutorial Horizon Thanks for intuitive explanation of the Max sub array problem I'm wondering how are we saying the subarray is 4,-1,2,1 I mean we can say just by looking, if code is to print subarray how to tackle the problem (Pardon me If it is dumb I'm beginner to DSA)

    • @tutorialhorizon9085
      @tutorialhorizon9085 10 місяців тому

      You need to keep track of start and end index of subarray and change it Everytime you update the max sum. I have updated the code at the main article to cover this- tutorialhorizon.com/algorithms/kadanes-algorithm-maximum-subarray-problem/

  • @kindnessorimolade641
    @kindnessorimolade641 11 місяців тому

    what about illustrator, is there any tool like this?

  • @alexanderpetranov
    @alexanderpetranov Рік тому

    Wow! Amazing video my friend! Great explanation and explained in such a simple manner - just how it should be!! Keep doing what you do :)

  • @DHANANJAYSINGH-mt9ku
    @DHANANJAYSINGH-mt9ku Рік тому

    First comment...

  • @DHANANJAYSINGH-mt9ku
    @DHANANJAYSINGH-mt9ku Рік тому

    First comment...

  • @thecourageman7594
    @thecourageman7594 Рік тому

    👏

  • @tutorialhorizon9085
    @tutorialhorizon9085 Рік тому

    Corrections: 7:33 Only up to index 15, not 16 Corrections: 15:03 Once iteration is over, Check If overlapping was found ***

  • @tutorialhorizon9085
    @tutorialhorizon9085 Рік тому

    Corrections: 3:40 ** j iterates from i to n** Corrections: 3:45 ** max size of subarray would be (n - i)**

    • @loneleyEngineer
      @loneleyEngineer Місяць тому

      exactly what I was going to comment. But you haven't changed on website

  • @melbalesch
    @melbalesch Рік тому

    Promo'SM ❤️

  • @redtornado422
    @redtornado422 Рік тому

    Thank you so much!

  • @ryanas101
    @ryanas101 Рік тому

    Very clear explanation. And easy to follow along. Thanks a tonne!

  • @Gaganarorachennai
    @Gaganarorachennai Рік тому

    Helped a lot thanks 😊

  • @mikeysalais1313
    @mikeysalais1313 Рік тому

    and then there is objects to guides

  • @devarapallivamsi2981
    @devarapallivamsi2981 Рік тому

    Thank you so much....!! Appreciate your work...!!

  • @PatTrnkaAdams
    @PatTrnkaAdams Рік тому

    Thank you!! Just what I needed. Very good, right to the point demonstration.

  • @youngpark3019
    @youngpark3019 Рік тому

    loud sound makes us hard to think. delete music or lower the volume!

    • @tutorialhorizon9085
      @tutorialhorizon9085 3 місяці тому

      Sorry about that

    • @RachelTe
      @RachelTe 7 днів тому

      you can actually just turn down the music yourself since there's no audio explanation anyway! hope this helps:)

  • @thiagkashig314
    @thiagkashig314 Рік тому

    Great animation for visualise the Heap Sort

  • @kayani8389
    @kayani8389 Рік тому

    thanks man