YoVDO

LeetCode Exercise in Java - Longest Substring Without Repeating Characters - Fast Solution

Offered By: Coding with John via YouTube

Tags

Java Courses Algorithmic Problem Solving Courses

Course Description

Overview

Learn how to solve the LeetCode problem "Longest Substring Without Repeating Characters" in Java with this comprehensive tutorial video. Explore both brute force and optimized solutions, starting with a problem breakdown and progressing through implementation and results analysis. Gain insights into developing faster algorithms, with step-by-step explanations of solution discussions, coding implementations, and performance comparisons. Perfect for Java developers looking to enhance their problem-solving skills and tackle challenging LeetCode exercises efficiently.

Syllabus

The Problem
Brute Force Solution Discussion
Brute Force Solution Implementation
Brute Force Solution Results
Coming Up With a Better Solution
Fast Solution Discussion
Fast Solution Implementation
Fast Solution Results
Even... FASTER?


Taught by

Coding with John

Tags

Related Courses

Intro to Theoretical Computer Science
Udacity
Power and elegance of computational thinking
The University of Oklahoma via Janux
Comparing Genes, Proteins, and Genomes (Bioinformatics III)
University of California, San Diego via Coursera
Algoritmi quotidiani
University of Urbino via EMMA
Competitive Programmer's Core Skills
Saint Petersburg State University via Coursera