Learn to Code and Code to Learn
Your Journey to Code Mastery
TCP Prep150 ✅ Top 150 Questions – Structured DSA Preparation for Coding Interviews TCP Prep150 — Interview Prep Tracker 🚀 TCP Prep150 Interview Prep Tracker All 150 essential LeetCode problems — with company tags, personal notes & revision counter. Track your journey to FAANG. 0 Solved 0 Easy 0 Medium 0 Hard 0 Revised Overall…
TCP Prep75 ✅ Structured DSA Preparation for Coding Interviews TCP Prep75 — Interview Tracker TCP Prep75 Tracker Track your progress, revision count, notes, and the companies that ask each problem. 75 Problems 0 Solved 0 Revisions 0% Complete 0 / 75 solved0% All Easy Medium Hard ✓ Solved Unsolved No problems match your filter.
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” »
You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where: 0 <= j <= nums[i] and i + j < n Return the minimum number of jumps to reach nums[n -…
You are given an integer array nums. You are initially positioned at the array’s first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index, or false otherwise. Example 1: Input: nums = [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3…
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:
Given an array nums of size n, return the majority element. The majority element is the element that appears more than ⌊n / 2⌋ times. You may assume that the majority element always exists in the array. Example 1: Input: nums = [3,2,3] Output: 3 Example 2: Input: nums = [2,2,1,1,1,2,2] Output: 2 Solution 1 Solution 2
Given an integer array nums, rotate the array to the right by k steps, where k is non-negative. Example 1: Input: nums = [1,2,3,4,5,6,7], k = 3 Output: [5,6,7,1,2,3,4] Explanation: rotate 1 steps to the right: [7,1,2,3,4,5,6] rotate 2 steps to the right: [6,7,1,2,3,4,5] rotate 3 steps to the right: [5,6,7,1,2,3,4] Example 2: Input: nums = [-1,-100,3,99], k = 2…
https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/?envType=study-plan-v2&envId=top-interview-150 Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if…
Read More “80. Remove Duplicates from Sorted Array II (medium)” »
https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/?envType=study-plan-v2&envId=top-interview-150 Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same. Then return the number of unique elements in nums. Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things: Change the array nums such that the first k elements…
Read More “26. Remove Duplicates from Sorted Array (easy)” »