Learn to Code and Code to Learn
Your Journey to Code Mastery
Problem:Given a string s, find the length of the longest substring without repeating characters. Example: š„ Best Approach (HashMap Jump Optimization) Instead of removing one by one,jump left directly to the correct position. āļø Algorithm š» C++ Optimal Solution š Dry Run Input: right char left window ans 0 a 0 a 1 1 b…
Read More “3. Longest Substring Without Repeating Characters” »
https://leetcode.com/problems/palindrome-linked-list/description/ Given the head of a singly linked list, return true if it is a palindrome or false otherwise. Example 1: Input: head = [1,2,2,1] Output: true Example 2: Input: head = [1,2] Output: false ā Algorithm (Steps): Find the middle of the list using slow/fast pointers. Reverse the second half of the list. Compare…
https://leetcode.com/problems/find-the-duplicate-number Given an array of integersĀ numsĀ containingĀ n + 1Ā integers where each integer is in the rangeĀ [1, n]Ā inclusive. There is onlyĀ one repeated numberĀ inĀ nums, returnĀ thisĀ repeatedĀ number. You must solve the problemĀ withoutĀ modifying the arrayĀ numsĀ and using only constant extra space. Example 1: Input: nums = [1,3,4,2,2] Output: 2 Example 2: Input: nums = [3,1,3,4,2] Output: 3 Example 3: Input: nums =…
https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/ Given theĀ headĀ of a linked list, remove theĀ nthĀ node from the end of the list and return its head. Example 1: Input: head = [1,2,3,4,5], n = 2 Output: [1,2,3,5] Example 2: Input: head = [1], n = 1 Output: [] Example 3: Input: head = [1,2], n = 1 Output: [1] Solution:
https://leetcode.com/problems/linked-list-cycle-ii/description/ Given theĀ headĀ of a linked list, returnĀ the node where the cycle begins. If there is no cycle, returnĀ null. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following theĀ nextĀ pointer. Internally,Ā posĀ is used to denote the index of the node that tail’sĀ nextĀ pointer is…
Given an integer arrayĀ nums, rotate the array to the right byĀ kĀ steps, whereĀ kĀ is non-negative. Example 1: Example 2: Solutions 1 : Solutions 2 : Solution 3:
Problem Given an arrayĀ A[]Ā of sizeĀ NĀ and a positive integerĀ K, find the first negative integer for each and every window(contiguous subarray) of sizeĀ K. Solution-1 Solution-2
Problem : Given an array of integers and a number K. Find the count of distinct elements in every window of size K in the array. Solution:
Day 1 Highlights: Introduction and History: Dive into the fascinating history of the C programming language and understand its evolution. Structure of C Programs: Learn the fundamental structure that every C program follows. Discover the key components that make up a C program. Setting Up Your Environment: Get your hands dirty by setting up a…
Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity. Example 1: Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 Explanation: 9 exists in nums and its index is 4 Example…