Your Journey to Code Mastery
What is CAP Theorem? Consistency (C) — Every read receives the most recent write, or an error. All nodes see the same data at the same time. After updating data, every future read returns updated value.Example : If user changes password, Any server/node immediately returns new password. Availability (A) — Every request to a non-failed…
TCP DSA 75 TCP DSA 150 Top 351 DSA Questions Top 351 DSA Questions Tracker 🎯 Interview Preparation Top 351 DSA Questions Track your progress, add notes, count revisions, and find which companies ask each problem. 351 Total Easy: 102 Medium: 182 Hard: 67 10 Topics Problems Solved 0 / 351 Easy: 0/102 Medium: 0/182 Hard: 0/67…
TCP HLD 50 System Design HLD — 101 Topics Tracker HLD 101 System Design Prep Tracker ⚙ HLD 101 System Design Tracker Complete preparation list for High-Level Design interviews — company tags, difficulty, revision tracking, notes & reference links. 0 Topics 0 Completed 0 Revised 3× 0 Remaining 0% Progress 0 / 0 done0% Easy…
TCP HLD 101 System Design HLD — 50 Topics Tracker HLD System Design Tracker ⚙ HLD System Design Tracker High-Level Design topics for Software Engineering interviews — company tags, difficulty, revision tracking & reference links. 0 Topics 0 Completed 0 Revised 3× 0% Progress 0 / 0 done0% All Easy Medium Hard Completed Pending Category:…
TCP DSA 75 TCP DSA 351 TCP DSA150 ✅ Top 150 Questions – Structured DSA Preparation for Coding Interviews TCP DSA150 — Interview Tracker TCP DSA150 NeetCode 150 — your personal interview preparation tracker. Track progress, revisions, and notes in one place. 0 Solved 150 Visible 0 Revisions 0% Complete 0 / 150 solved 0%…
TCP DSA 150 TCP DSA 351 TCP DSA 75 ✅ Structured DSA Preparation for Coding Interviews TCP DSA 75 — Interview Tracker TCP DSA75 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 ✓…
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…