• Home
  • Our Courses
    Data structures and algorithms

    Data structures and algorithms

    ₹15,000.00 ₹7,999.00
    Read More
    Machine Learning with python

    Machine Learning with python

    ₹11,999.00 ₹5,999.00
    Read More
    Aptitude

    Aptitude

    ₹2,499.00 ₹1,499.00
    Read More
  • Events
  • Blog
  • About Us
  • Contact Us
    • Login
    • Cart

      0
    Have any question?
    (+91) 88476-72506, (+91) 84169-25373
    ibytesacademy@gmail.com
    Login
    iBytes AcademyiBytes Academy
    • Home
    • Our Courses
      Data structures and algorithms

      Data structures and algorithms

      ₹15,000.00 ₹7,999.00
      Read More
      Machine Learning with python

      Machine Learning with python

      ₹11,999.00 ₹5,999.00
      Read More
      Aptitude

      Aptitude

      ₹2,499.00 ₹1,499.00
      Read More
    • Events
    • Blog
    • About Us
    • Contact Us
      • Login
      • Cart

        0

      Data Structures

      Technical CoursesData structures and algorithms
      • Flow Charts 4

        • Lecture1.1
          Introduction to problem solving 04 min
        • Lecture1.2
          Flow Chart Components 04 min
        • Lecture1.3
          More on Flow Charts 07 min
        • Lecture1.4
          Question (Flowchart)
      • Programming Fundamentals - 1 9

        • Lecture2.1
          Writing our first program 06 min
        • Quiz2.1
          Q.1 (Programming Fundamentals – 1) 0 question
        • Lecture2.2
          Variables and Operators 12 min
        • Quiz2.2
          Quiz (variables and operators) 0 question
        • Lecture2.3
          User Input and Loops 12 min
        • Quiz2.3
          Quiz (User Inputs and Loops) 0 question
        • Lecture2.4
          Do-while, break, continue 08 min
        • Lecture2.5
          Conditionals and Logical Operators 12 min
        • Quiz2.4
          Quiz(Conditionals and Logical Operators) 0 question
      • Programming Fundamentals - 2 10

        • Lecture3.1
          Data Types and How they are stored – 01 09 min
        • Lecture3.2
          Data Types and How they are stored – 02 07 min
        • Quiz3.1
          Quiz (data types) 0 question
        • Lecture3.3
          Increment/Decrement, bitwise and ternary operators 10 min
        • Lecture3.4
          Functions 13 min
        • Quiz3.2
          Quiz (Functions) 0 question
        • Lecture3.5
          Practice Questions on Functions
        • Lecture3.6
          Fibonacci Series and Prime Numbers 19 min
        • Lecture3.7
          Character Lower or Upper and Binary to Decimal 15 min
        • Lecture3.8
          Practice Problems
      • Arrays 12

        • Lecture4.1
          Arrays Introduction 09 min
        • Quiz4.1
          Basic Questions on Arrays 0 question
        • Lecture4.2
          Array Input 08 min
        • Quiz4.2
          Questions on Array Input 0 question
        • Lecture4.3
          Bubble Sort 12 min
        • Quiz4.3
          Question on bubble sort 0 question
        • Lecture4.4
          Selection Sort 10 min
        • Quiz4.4
          Question on Selection Sort 0 question
        • Lecture4.5
          Insertion Sort 11 min
        • Quiz4.5
          Question on Insertion Sort 0 question
        • Lecture4.6
          Searching an Array 13 min
        • Quiz4.6
          Quiz – Searching an Array 0 question
      • Strings and 2D arrays 5

        • Lecture5.1
          Strings and Character arrays 13 min
        • Lecture5.2
          2D Arrays 13 min
        • Quiz5.1
          Question on 2D Array 0 question
        • Lecture5.3
          Zigzag Print 06 min
        • Lecture5.4
          Problems on Arrays
      • Pointers 11

        • Lecture6.1
          Pointers Introduction 14 min
        • Quiz6.1
          Quiz(Pointer Introduction) 0 question
        • Lecture6.2
          Pointer Arithmetic and Arrays 17 min
        • Quiz6.2
          Quiz (pointer arithmetic and arrays ) 0 question
        • Lecture6.3
          Characters and Pointers 06 min
        • Quiz6.3
          Question (Characters and Pointers) 0 question
        • Lecture6.4
          Functions and Pointers 09 min
        • Quiz6.4
          Quiz on Functions and Pointers 0 question
        • Lecture6.5
          Double Pointers 10 min
        • Lecture6.6
          Pass by value and Pass by reference 06 min
        • Quiz6.5
          Quiz on double pointers and passing (by value and by reference) 0 question
      • Dynamic Memory Allocation 4

        • Lecture7.1
          Dynamic allocation Introduction 13 min
        • Lecture7.2
          Dynamic allocation – 2D arrays 11 min
        • Lecture7.3
          Local/Global, Macros, Inline functions, Default Arguments 13 min
        • Quiz7.1
          Quiz- Dynamic Memory Allocation 0 question
      • Constants 6

        • Lecture8.1
          Constant Variables 06 min
        • Quiz8.1
          Quiz Constant Variables 0 question
        • Lecture8.2
          Constant Pointers 06 min
        • Quiz8.2
          Quiz Constant Pointers 0 question
        • Lecture8.3
          Constant Parameters 03 min
        • Quiz8.3
          Quiz Constant Parameters 0 question
      • Recursion 15

        • Lecture9.1
          Recursion Introduction 11 min
        • Lecture9.2
          Power and fibonacci 11 min
        • Lecture9.3
          Is array sorted (using recursion) ? 09 min
        • Lecture9.4
          Has 5 and first index of 5 in array 10 min
        • Quiz9.1
          Quiz 1 – Recursion 0 question
        • Lecture9.5
          Binary Search using recursion 06 min
        • Quiz9.2
          Question (searching) 0 question
        • Lecture9.6
          Towers of Hanoi 11 min
        • Lecture9.7
          Bubble and Selection sort using recursion 13 min
        • Lecture9.8
          Merge Sort 17 min
        • Quiz9.3
          Question – Merge Sort 0 question
        • Lecture9.9
          Quick Sort – Part 01 10 min
        • Lecture9.10
          Quick Sort – Part 02 07 min
        • Quiz9.4
          Quiz – Quick Sort 0 question
        • Lecture9.11
          Problems on Arrays and Recursion
      • Recursion Problems 6

        • Lecture10.1
          Staircase Problem 07 min
        • Lecture10.2
          Subsequences of a String 12 min
        • Lecture10.3
          Permutations of a string 16 min
        • Lecture10.4
          Keypad Combinations 10 min
        • Lecture10.5
          String Codes 13 min
        • Lecture10.6
          Ways to reach bottom of a matrix 13 min
      • Time and Space Complexity 5

        • Lecture11.1
          Time Complexity -01 08 min
        • Lecture11.2
          Time Complexity -02 15 min
        • Lecture11.3
          Time Complexity -03 15 min
        • Lecture11.4
          Space Complexity 13 min
        • Quiz11.1
          Time & Space Complexity Quiz 0 question
      • Object Oriented Programming Basics 7

        • Lecture12.1
          OOP Introduction 08 min
        • Lecture12.2
          Private members 06 min
        • Quiz12.1
          Quiz on classes and objects 0 question
        • Lecture12.3
          Constructors, Destructors, Static Members 09 min
        • Lecture12.4
          Creating a class for complex numbers 06 min
        • Quiz12.2
          Quiz on Constructors and Destructors 0 question
        • Lecture12.5
          Practice problems on OOPS
      • Linked Lists 15

        • Lecture13.1
          Linked Lists Introduction 11 min
        • Lecture13.2
          Create our first Linked LIst 10 min
        • Lecture13.3
          Taking Linked List as input from user 10 min
        • Quiz13.1
          Linked List Quiz – 1 0 question
        • Lecture13.4
          Inserting an element 10 min
        • Lecture13.5
          Deleting an element and finding middle node 14 min
        • Quiz13.2
          Linked List Quiz – 2 0 question
        • Lecture13.6
          Reverse a Linked List 13 min
        • Lecture13.7
          Finding length of linked list 06 min
        • Lecture13.8
          Reverse K elements 08 min
        • Lecture13.9
          Problems on linked lists – Part 1
        • Lecture13.10
          Detect and remove loop 13 min
        • Lecture13.11
          Merge two sorted linked lists 06 min
        • Lecture13.12
          Add a number to Linked List 16 min
        • Lecture13.13
          Problems on linked lists – Part 2
      • Stacks Queues 10

        • Lecture14.1
          Stacks Queues Introduction 06 min
        • Quiz14.1
          Stacks Queues Quiz – 1 0 question
        • Lecture14.2
          Stacks using arrays 17 min
        • Lecture14.3
          Stack using linked list 10 min
        • Lecture14.4
          Queue using linked list 09 min
        • Quiz14.2
          Stacks Queues Quiz – 2 0 question
        • Lecture14.5
          Stacks using two queues 09 min
        • Lecture14.6
          Special stack using two stacks 12 min
        • Lecture14.7
          Inbuilt stack and queue 07 min
        • Lecture14.8
          Problems on Stacks Queues
      • Stacks Queues Problems 5

        • Lecture15.1
          Balanced Parenthesis 09 min
        • Lecture15.2
          Bottom insert and reverse stack 09 min
        • Lecture15.3
          Insert in sorted order and Sort Stack 08 min
        • Lecture15.4
          Stock Span Problem 12 min
        • Lecture15.5
          Reverse Queue and print binary till N 09 min
      • Trees 10

        • Lecture16.1
          Trees Introduction 08 min
        • Lecture16.2
          Level wise input of trees 09 min
        • Quiz16.1
          Trees Quiz – 1 0 question
        • Lecture16.3
          Print Level wise and using Recursion 15 min
        • Lecture16.4
          Print all nodes at depth K 07 min
        • Lecture16.5
          Height of Tree and largest node 11 min
        • Quiz16.2
          Trees Quiz – 2 0 question
        • Lecture16.6
          Nodes larger than given and Node & children sum greatest. 11 min
        • Lecture16.7
          Identical trees and replace with depth value 11 min
        • Lecture16.8
          Problems on Trees
      • Binary Trees 14

        • Lecture17.1
          Binary trees introduction 04 min
        • Lecture17.2
          Taking input level wise 05 min
        • Lecture17.3
          Print level wise and print recursion 07 min
        • Lecture17.4
          Find node , find largest, find mirror image 13 min
        • Quiz17.1
          Quiz on binary trees – 1 0 question
        • Lecture17.5
          Tree traversals 14 min
        • Quiz17.2
          Quiz on binary trees – 2 0 question
        • Lecture17.6
          Diameter of a binary tree 10 min
        • Lecture17.7
          Width of a binary tree 05 min
        • Lecture17.8
          Is identical and is subtree ? 11 min
        • Lecture17.9
          Remove Leaf Nodes 07 min
        • Lecture17.10
          Build binary tree from inorder and preorder 12 min
        • Quiz17.3
          Quiz on binary trees – 2 0 question
        • Lecture17.11
          Practice problems on Binary trees
      • Binary Search Trees 7

        • Lecture18.1
          BST introduction 13 min
        • Lecture18.2
          Print all nodes between K1 and K2 07 min
        • Lecture18.3
          Build BST from sorted array 06 min
        • Quiz18.1
          Binary Search Trees Quiz 0 question
        • Lecture18.4
          Kth smallest in BST 08 min
        • Lecture18.5
          LCA in BST and insert node on BST 11 min
        • Lecture18.6
          Practice problems on BSTs
      • Priority Queues 7

        • Lecture19.1
          Priority Queues Introduction 09 min
        • Quiz19.1
          Priority Queues – 1 0 question
        • Lecture19.2
          Insert 16 min
        • Lecture19.3
          Delete and heap sort 16 min
        • Quiz19.2
          Priority Queues Quiz – 2 0 question
        • Lecture19.4
          K largest Elements 07 min
        • Lecture19.5
          Sort K-sorted Array 06 min
      • Hashmaps 12

        • Lecture20.1
          Hashmaps Introduction 12 min
        • Lecture20.2
          Remove Duplicates 16 min
        • Quiz20.1
          Hashmaps quiz – 1 0 question
        • Lecture20.3
          Intersection of two arrays 10 min
        • Lecture20.4
          Duplicates in distance K and its subset 13 min
        • Lecture20.5
          Longest consecutive increasing sequence 13 min
        • Lecture20.6
          Iterators 06 min
        • Lecture20.7
          Hashmaps implementation-1 10 min
        • Lecture20.8
          Hashmaps implementation – 2 13 min
        • Lecture20.9
          Hashmaps implementation – 3 06 min
        • Lecture20.10
          Hashmaps implementation – 4 06 min
        • Lecture20.11
          Problems on hashmaps
      • Tries 5

        • Lecture21.1
          Tries Introduction 10 min
        • Lecture21.2
          Insert a word 09 min
        • Lecture21.3
          Is word present 05 min
        • Quiz21.1
          Tries Quiz – 1 0 question
        • Lecture21.4
          Delete a word 12 min
      • Graphs 12

        • Lecture22.1
          Graphs Introduction 13 min
        • Quiz22.1
          Graphs Quiz – 1 0 question
        • Lecture22.2
          Breadth First Search (BFS) 20 min
        • Lecture22.3
          Depth First Search (DFS) 08 min
        • Lecture22.4
          Have path using DFS 09 min
        • Quiz22.2
          Graphs Quiz – 2 0 question
        • Lecture22.5
          Get Path 13 min
        • Lecture22.6
          Is given graph connected 07 min
        • Lecture22.7
          Print Connected components 05 min
        • Lecture22.8
          Dijkstra’s Algorithm – 1 16 min
        • Lecture22.9
          Dijkstra’s Algorithm – 2 12 min
        • Quiz22.3
          Graphs Quiz – 3 0 question
      • Dynamic Programming 10

        • Lecture23.1
          Understanding DP using fibonacci problem 16 min
        • Quiz23.1
          DP Quiz – 1 0 question
        • Lecture23.2
          LCS using recursion 08 min
        • Lecture23.3
          LCS using DP 12 min
        • Lecture23.4
          Edit Distance using DP 11 min
        • Lecture23.5
          Minimum steps to reach one 10 min
        • Lecture23.6
          Minimum Cost Path 10 min
        • Quiz23.2
          DP Quiz – 2 0 question
        • Lecture23.7
          Largest Square matrix with all ones 11 min
        • Quiz23.3
          DP Quiz – 3 0 question
      • Bonus -Frequently asked Interview Problems 29

        • Lecture24.1
          Max contiguous subarray sum 07 min
        • Lecture24.2
          Max contiguous subarray product 18 min
        • Lecture24.3
          Triplet sum 15 min
        • Lecture24.4
          Rain water trapped 10 min
        • Lecture24.5
          Container with Max water 10 min
        • Lecture24.6
          Print Anti Diagonals 08 min
        • Lecture24.7
          Majority Element 10 min
        • Lecture24.8
          First missing positive integer 12 min
        • Lecture24.9
          Pivot element 09 min
        • Lecture24.10
          Pancake sorting 11 min
        • Lecture24.11
          Bulbs required 12 min
        • Lecture24.12
          Chess coding problem- Queen moves 14 min
        • Lecture24.13
          Minimum steps in infinite grid 06 min
        • Lecture24.14
          Smallest unsorted subarray 06 min
        • Lecture24.15
          Different Bits Sum Pairwise 09 min
        • Lecture24.16
          Find peak element 08 min
        • Lecture24.17
          Implement Power function 05 min
        • Lecture24.18
          Sorted Permutation Rank
        • Lecture24.19
          Minimum Cost Path 10 min
        • Lecture24.20
          Search for a range 10 min
        • Lecture24.21
          Minimize absolute difference 06 min
        • Lecture24.22
          Dutch Flag Problem 10 min
        • Lecture24.23
          Smallest Sequence with given primes 10 min
        • Lecture24.24
          Longest Arithmetic Progression 19 min
        • Lecture24.25
          Rearrange Array 10 min
        • Lecture24.26
          Next Greater Number 06 min
        • Lecture24.27
          Chess Coding Problem 07 min
        • Lecture24.28
          Sort Array with Squares 06 min
        • Lecture24.29
          Distribute in Circle 05 min
        This content is protected, please login and enroll course to view this content!
        Prev Double Pointers
        Next Quiz on double pointers and passing (by value and by reference)

        Contact

        (+91) 88476-72502
        (+91) 84169-25373
        ibytesacademy@gmail.com
        Facebook-f
        Google-plus-g
        Instagram

        Useful Links

        • Home
        • Our Courses
        • Events
        • Blog
        • Contact

        Developed & Managed by iBytes Tech.

        Ready to Learn ?

        Ready to Learn ?

        Dont wait ! Learn from the Best.

        Get started now

        Connect with

        Login with Google Login with LinkedIn

        logo

        Login with your site account

        Lost your password?