This plan includes
- Limited free courses access
- Play & Pause Course Videos
- Video Recorded Lectures
- Learn on Mobile/PC/Tablet
- Quizzes and Real Projects
- Lifetime Course Certificate
- Email & Chat Support
What you'll learn?
- Learn various Popular Data Structures and their Algorithms.
- Develop your Analytical skills on Data Structure and use then efficiently.
- Ace coding interviews given by some of the top tech companies
- Become a better developer by mastering computer science fundamentals
- Time and Space Complexity of Algorithms, Detailed Discussion of Logic to solve LEETCODE questions
- Code Implementation in Java
- Real Coding Interview Questions from Google, Meta, Amazon, Adobe, Microsoft etc.
- Learn Java from Scratch
Course Overview
Pre-requisites
- No coding or Data Structure and Algorithm knowledge needed! We'll start from scratch!
- A computer (Windows/Mac/Linux) with access to the internet. That's it!
- All tools and software used in this course will be free!
Target Audience
- Any engineer, developer, programmer, who wants to improve their coding skills
Curriculum 93 Lectures 40:09:07
-
Section 1 : Introduction
- Lecture 2 :
- Flow of Program - Flowcharts & Pseudocode
- Lecture 3 :
- Introduction to Java - Installation & Architecture
- Lecture 4 :
- Basics of Java - Input/Output, Debugging and Datatypes
-
Section 2 : Conditionals & Loops
- Lecture 1 :
- Conditionals & Loops
-
Section 3 : Switch Case
- Lecture 1 :
- Switch Case
-
Section 4 : Functions or Methods in Java
- Lecture 1 :
- Functions Or Methods In Java
-
Section 5 : Introduction to Arrays and ArrayList in Java
- Lecture 1 :
- Arrays
- Lecture 2 :
- Multidimensional Arrays a.k.a 2D Arrays
- Lecture 3 :
- Arraylist
- Lecture 4 :
- Swapping Arrays (LeetCode Problem)
- Lecture 5 :
- Maximum value in the Array (LeetCode Problem)
-
Section 6 : Strings and StringBuilders
- Lecture 1 :
- Strings and StringBuilders
-
Section 7 : Bitwise Operators & Number Systems
- Lecture 1 :
- Number Systems
- Lecture 2 :
- Bitwise Operators
- Lecture 3 :
- Odd Or Even
- Lecture 4 :
- Finding Unique Elements In Array
- Lecture 5 :
- Find, Set, Reset Bits
- Lecture 6 :
- Negative Binary numbers and Range of numbers
-
Section 8 : Linear Search Algorithm
- Lecture 1 :
- Linear Search
- Lecture 2 :
- Search In String
- Lecture 3 :
- Search In Given Range
- Lecture 4 :
- Search Minimum Value In Array
- Lecture 5 :
- Search In 2D Array
- Lecture 6 :
- Leetcode Problem
-
Section 9 : Binary Search Algorithm
- Lecture 1 :
- Binary Search Algorithm
- Lecture 2 :
- Order Agnostic Binary Search
- Lecture 3 :
- Ceiling Of A Number
- Lecture 4 :
- Floor Of A Number
- Lecture 5 :
- First And Last Occurance Of Target
- Lecture 6 :
- Search In 2D Array
-
Section 10 : Bubble Sort Algorithm
- Lecture 1 :
- Bubble Sort Algorithm
-
Section 11 : Selection Sort Algorithm
- Lecture 1 :
- Selection Sort
-
Section 12 : Insertion Sort Algorithm
- Lecture 1 :
- Insertion Sort
-
Section 13 : Cycle Sort Algorithm
- Lecture 1 :
- Cycle Sort Algorithm
- Lecture 2 :
- Missing Number (LeetCode Problem)
- Lecture 3 :
- Finding Disappeared number (LeetCode Problem)
- Lecture 4 :
- Finding Duplicate number (LeetCode Problem)
- Lecture 5 :
- Find All duplicate numbers (LeetCode Problem)
- Lecture 6 :
- Set Mismatch (LeetCode Problem)
- Lecture 7 :
- First Missing Positive (LeetCode Problem)
-
Section 14 : Pattern Questions
- Lecture 1 :
- Pattern Questions
-
Section 15 : TIme & Space Complexity
- Lecture 1 :
- Introduction to Time Complexity
- Lecture 2 :
- Big Oh, Omega, Theta Notation
- Lecture 3 :
- Little Oh, Omega Notation
- Lecture 4 :
- Introduction to Space Complexity
- Lecture 5 :
- Determing Time Complexity Of A Problem
-
Section 16 : Maths For Data Structures & Algorithm
- Lecture 1 :
- Prime Numbers
- Lecture 2 :
- Seive Of Eratosthenes
- Lecture 3 :
- Square root of a number
- Lecture 4 :
- Newton Raphson Method
- Lecture 5 :
- Factors Of A Number
-
Section 17 : Recursion Deep Dive
- Lecture 1 :
- Introduction To Recursion
- Lecture 2 :
- Fibonacci Number
- Lecture 3 :
- Binary Search Using Recursion
- Lecture 4 :
- Solving Basic Questions Using Recursion
- Lecture 5 :
- Solving Array Questions Using Recursion
- Lecture 6 :
- Solving Pattern Questions Using Recursion
- Lecture 7 :
- Bubble Sort Using Recursion
- Lecture 8 :
- Selection Sort Using Recursion
- Lecture 9 :
- Merge Sort Using Recursion
- Lecture 10 :
- Quick Sort Using Recursion
- Lecture 11 :
- Strings, Subsets, Sub Sequence using Recursion
- Lecture 12 :
- Permutations Using Recursion
- Lecture 13 :
- Google and Amazon level problem on Recursion
- Lecture 14 :
- Maze Problems
-
Section 18 : Backtracking
- Lecture 1 :
- Backtracking
- Lecture 2 :
- Soduku Solver (Leetcode)
-
Section 19 : Object Oriented Programming - Learn in the Best Way
- Lecture 1 :
- Classes and Objects
- Lecture 2 :
- Packages and 'Static' Keyword
- Lecture 3 :
- Inheritance, Encapsulation, Polymorphism
- Lecture 4 :
- Access Specifier, In-built Methods
- Lecture 5 :
- Interfaces and Abstract Methods
- Lecture 6 :
- Exception Handling, ArrayList Implementation
- Lecture 7 :
- Java Collections Framework
-
Section 20 : Linked List
- Lecture 1 :
- Singly, Doubly And Circular Linked List
- Lecture 2 :
- Insert node in Linked List using Recursion
- Lecture 3 :
- Removing Duplicates from Linked List
- Lecture 4 :
- Merge 2 sorted Lists (LeetCode Problem)
- Lecture 5 :
- Linked List Cycle (Leetcode Problem)
- Lecture 6 :
- Happy Number (Linked List)
- Lecture 7 :
- Middle of Linked List (LeetCode Problem)
- Lecture 8 :
- Sort List (LeetCode Problem)
- Lecture 9 :
- Reversing Linked List
-
Section 21 : Stack & Queues
- Lecture 1 :
- Stacks, Customstack, Dynamic Stacks
- Lecture 2 :
- Queues, CustomQueue, Circular Queues
-
Section 22 : Binary Trees
- Lecture 1 :
- Binary Trees
- Lecture 2 :
- Count Number Of Nodes In Binary Tree
- Lecture 3 :
- Sum Of Nodes In Binary Tree
- Lecture 4 :
- Height Of Tree
- Lecture 5 :
- Diameter Of A Tree
- Lecture 6 :
- Subtree of a tree (LeetCode Problem)
-
Section 23 : Binary Search Trees
- Lecture 1 :
- Binary Search Tree
Our learners work at
Frequently Asked Questions
-
How do i access the course after purchase?
It's simple. When you sign up, you'll immediately have unlimited viewing of thousands of expert courses, paths to guide your learning, tools to measure your skills and hands-on resources like exercise files. There’s no limit on what you can learn and you can cancel at any time. -
Are these video based online self-learning courses?
Yes. All of the courses comes with online video based lectures created by certified instructors. Instructors have crafted these courses with a blend of high quality interactive videos, lectures, quizzes & real world projects to give you an indepth knowledge about the topic. -
Can i play & pause the course as per my convenience?
Yes absolutely & thats one of the advantage of self-paced courses. You can anytime pause or resume the course & come back & forth from one lecture to another lecture, play the videos mulitple times & so on. -
How do i contact the instructor for any doubts or questions?
Most of these courses have general questions & answers already covered within the course lectures. However, if you need any further help from the instructor, you can use the inbuilt Chat with Instructor option to send a message to an instructor & they will reply you within 24 hours. You can ask as many questions as you want. -
Do i need a pc to access the course or can i do it on mobile & tablet as well?
Brilliant question? Isn't it? You can access the courses on any device like PC, Mobile, Tablet & even on a smart tv. For mobile & a tablet you can download the Learnfly android or an iOS app. If mobile app is not available in your country, you can access the course directly by visting our website, its fully mobile friendly. -
Do i get any certificate for the courses?
Yes. Once you complete any course on our platform along with provided assessments by the instructor, you will be eligble to get certificate of course completion. -
For how long can i access my course on the platform?
You require an active subscription to access courses on our platform. If your subscription is active, you can access any course on our platform with no restrictions. -
Is there any free trial?
Currently, we do not offer any free trial. -
Can i cancel anytime?
Yes, you can cancel your subscription at any time. Your subscription will auto-renew until you cancel, but why would you want to?
Instructor
1042 Course Views
4 Courses
Hey there, I'm Prerak Mehta, your go-to guide for conquering the digital realm and unlocking the secrets to online success. With a passion for marketing, web design, and productivity tools, I've made it my mission to empower individuals and businesses to thrive in the digital age. My Expertise: Marketing Maven: I'm dedicated to helping businesses not just survive but thrive in the digital landscape. From crafting stunning websites to implementing winning SEO strategies, I've got the tools and tactics to elevate your brand. Web Wizardry: Whether you're starting from scratch or giving your existing site a facelift, I'll guide you through the process, ensuring your online presence shines brighter than ever. Productivity Prodigy: In today's fast-paced world, time is money. I'll introduce you to the latest productivity tools and techniques, helping you streamline your workflow and supercharge your efficiency. Why Learn From Me? I'm not just an educator; I'm a practitioner. As a freelance web designer and digital marketer, I've rolled up my sleeves and partnered with businesses of all sizes to create stunning websites, implement effective SEO strategies, and drive tangible results. The secret sauce? It's all in my courses on Skillshare. What to Expect: When you start watching my classes, you're not just signing up for knowledge; you're embarking on a journey. I'm here to demystify the complex and make the daunting doable. I'll share real-world stories, strategies, and techniques that have transformed businesses and careers. So, whether you're an aspiring digital pro, a business owner looking to boost your online presence, or simply someone eager to navigate the digital landscape with confidence, I'm here to guide you every step of the way. Let's embark on this adventure together! See you in class!