education learning

adult content

English

The domain name 'minimal-beige-xbmugbt5cd-ae91v2qewv.edgeone.dev' uses the developer-focused generic top-level domain (.dev) and includes subdomain 'minimal-beige-xbmugbt5cd-ae91v2qewv'. The second-level label 'edgeone' is 7 characters long holding 4 vowels versus 3 consonants. Segmentation suggests two words: edge, one. Average segment length settles at 3.5 characters. No strong language cues emerged from the frequency lists.

html/25/56/2556f98b-6951-411a-b4f5-13c3fb65b7a5.html.gz

176e894661aa9cdc9a5cba6c720044cbbf7b8bd80d1c9a142a7c24b1b6c50d15

5ebe285ab43e5be2c766c65329eab267e7cefd2cb448b0f69e6ca881bb751519

dac8cca6aab5c3deef9077447614e1fc2ec522f27d7e230ac89759101c7c6c3b

width=device-width, initial-scale=1.0, maximum-scale=1.0, user-scalable=no

viewport

child-src 'none';object-src 'none';require-trusted-types-for 'script';script-src chrome://resources 'self';trusted-types;worker-src blob: 'self';frame-ancestors 'none';

child-src 'none';object-src 'none';require-trusted-types-for 'script';script-src chrome://resources 'self';trusted-types;frame-ancestors 'none';

require-trusted-types-for 'script'; report-uri https://csp.withgoogle.com/csp/apps-themes

Prudence Malinki

MarkMonitor Inc.

edgeone.dev

// --- Data: 10 Day Plan (Same data, optimized rendering) ---
        const studyPlan = {
            "2025-12-25": {
                day: 1,
                title: "Fundamentals & Philosophy",
                color: "bg-indigo-500",
                morning: [
                    "Teaching Philosophy: Draft engaging DSA approach.",
                    "Big O: Time/space complexity deep dive.",
                    "Trade-offs: Best/Avg/Worst case analysis."
                ],
                afternoon: [
                    "Calc complexity for code snippets.",
                    "Review recursive math proofs.",
                    "Analogy prep (Array = Shelves)."
                ],
                evening: [
                    "Refine 'Why teach?' answer.",
                    "Review Day 1 notes."
                ]
            },
            "2025-12-26": {
                day: 2,
                title: "Linear Structures I",
                color: "bg-indigo-500",
                morning: [
                    "Arrays: Memory & access patterns.",
                    "Strings: Immutability & manipulation.",
                    "Linked Lists: Singly, Doubly, Circular."
                ],
                afternoon: [
                    "Code ArrayList from scratch.",
                    "Reverse LL, Detect Cycle.",
                    "Compare O(1) insert vs access."
                ],
                evening: [
                    "Slides: LL vs Array."
                ]
            },
            "2025-12-27": {
                day: 3,
                title: "Linear Structures II",
                color: "bg-indigo-500",
                morning: [
                    "Stacks: LIFO & recursion.",
                    "Queues: FIFO & Priority Queues.",
                    "Hash Tables: Collision resolution."
                ],
                afternoon: [
                    "Stack via Queue implementation.",
                    "Valid Parentheses, LRU Cache.",
                    "Design hash function."
                ],
                evening: [
                    "Hash Table vs BST scenarios."
                ]
            },
            "2025-12-28": {
                day: 4,
                title: "Trees & Traversals",
                color: "bg-indigo-500",
                morning: [
                    "Binary Trees: Props & types.",
                    "Traversals: In/Pre/Post/Level.",
                    "BST logic & Self-Balancing intro."
                ],
                afternoon: [
                    "Code BST from scratch.",
                    "Max Depth, LCA, Validate BST.",
                    "Visualize traversals."
                ],
                evening: [
                    "Real-world: DOM, File Systems."
                ]
            },
            "2025-12-29": {
                day: 5,
                title: "Graphs & Algorithms",
                color: "bg-indigo-500",
                morning: [
                    "Adj Matrix vs List.",
                    "BFS (Queue) vs DFS (Stack).",
                    "Dijkstra & Bellman-Ford."
                ],
                afternoon: [
                    "Implement BFS/DFS.",
                    "Number of Islands, Topo Sort.",
                    "Trace Dijkstra manually."
                ],
                evening: [
                    "Prim's vs Kruskal's MST."
                ]
            },
            "2025-12-30": {
                day: 6,
                title: "Sorting & Searching",
                color: "bg-indigo-500",
                morning: [
                    "Quadratic Sorts.",
                    "Merge, Quick, Heap Sort.",
                    "Binary Search nuances."
                ],
                afternoon: [
                    "Code Merge & Quick Sort.",
                    "Search Rotated Array.",
                    "Stability analysis."
                ],
                evening: [
                    "Visualizing Divide & Conquer."
                ]
            },
            "2025-12-31": {
                day: 7,
                title: "Recursion & DP",
                color: "bg-indigo-500",
                morning: [
                    "Recursion: Base cases.",
                    "DP: Memoization vs Tabulation.",
                    "Optimal Substructure."
                ],
                afternoon: [
                    "Fibonacci, Climbing Stairs.",
                    "Knapsack, LCS.",
                    "DP Table filling."
                ],
                evening: [
                    "Recursion vs Iteration."
                ]
            },
            "2026-01-01": {
                day: 8,
                title: "Advanced Structures",
                color: "bg-indigo-500",
                morning: [
                    "Tries (Prefix trees).",
                    "Heaps (Min/Max).",
                    "Segment Trees."
                ],
                afternoon: [
                    "Code Trie insert/search.",
                    "Kth Largest Element.",
                    "Merge K Lists (Heap)."
                ],
                evening: [
                    "Union-Find operations."
                ]
            },
            "2026-01-02": {
                day: 9,
                title: "System Design & Research",
                color: "bg-indigo-500",
                morning: [
                    "Real-world DSA (Maps, DBs).",
                    "Scalability & Complexity.",
                    "Research trends."
                ],
                afternoon: [
                    "URL Shortener design.",
                    "Typeahead design.",
                    "Draft research topics."
                ],
                evening: [
                    "Refine Teaching Portfolio."
                ]
            },
            "2026-01-03": {
                day: 10,
                title: "Mock Interview",
                color: "bg-orange-500",
                morning: [
                    "Teaching Demo (20m).",
                    "Whiteboard prep.",
                    "Student Q&A prep."
                ],
                afternoon: [
                    "Tech Interview (30m).",
                    "Research Discussion (20m).",
                    "Feedback loop."
                ],
                evening: [
                    "Final Review.",
                    "Relaxation."
                ]
            }
        };

        // --- Logic ---
        let currentDate = new Date(2025, 11, 1); 
        const monthNames = ["January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"];
        
        const calendarGrid = document.getElementById('calendarDays');
        const currentMonthYearEl = document.getElementById('currentMonthYear');
        const modal = document.getElementById('taskModal');
        const modalBackdrop = document.getElementById('modalBackdrop');
        const modalContent = document.querySelector('.modal-content');
        
        function renderCalendar(date) {
            calendarGrid.innerHTML = '';
            
            const year = date.getFullYear();
            const month = date.getMonth();
            
            currentMonthYearEl.textContent = `${monthNames[month]} ${year}`;
            
            const firstDayIndex = new Date(year, month, 1).getDay();
            const lastDay = new Date(year, month + 1, 0).getDate();
            
            // Empty slots
            for (let i = 0; i < firstDayIndex; i++) {
                const emptyDiv = document.createElement('div');
                emptyDiv.classList.add('h-20', 'sm:h-28'); // Consistent height
                calendarGrid.appendChild(emptyDiv);
            }
            
            // Days
            for (let i = 1; i <= lastDay; i++) {
                const dayDiv = document.createElement('div');
                const dateString = `${year}-${String(month + 1).padStart(2, '0')}-${String(i).padStart(2, '0')}`;
                const planData = studyPlan[dateString];
                
                dayDiv.classList.add('calendar-day', 'bg-white', 'rounded-lg', 'sm:rounded-xl', 'p-1.5', 'sm:p-3', 'flex', 'flex-col', 'justify-between', 'border', 'border-gray-100', 'h-20', 'sm:h-28', 'relative', 'overflow-hidden');
                
                let contentHTML = `<span class="font-bold text-gray-400 text-xs sm:text-base">${i}</span>`;
                
                if (planData) {
                    dayDiv.classList.add('cursor-pointer', 'border-l-2', planData.color === 'bg-orange-500' ? 'border-l-orange-400' : 'border-l-indigo-400');
                    dayDiv.onclick = () => openModal(planData, dateString);
                    
                    // Mobile-Optimized Content
                    contentHTML += `
                        <div class="mt-1 flex-grow flex flex-col justify-end sm:justify-center">
                            <span class="text-[9px] sm:text-xs font-bold uppercase tracking-wide text-indigo-600 mb-0.5 block">D${planData.day}</span>
                            <div class="hidden sm:block text-[10px] leading-tight text-gray-600 font-medium line-clamp-2">${planData.title}</div>
                            
                            <div class="sm:hidden w-1.5 h-1.5 rounded-full ${planData.color} mt-1"></div>
                        </div>
                    `;
                    
                    if(planData.day === 10) {
                        dayDiv.classList.add('bg-orange-50/50');
                    } else {
                        dayDiv.classList.add('bg-indigo-50/30');
                    }

                } else {
                     dayDiv.classList.add('opacity-40');
                }

                dayDiv.innerHTML = contentHTML;
                calendarGrid.appendChild(dayDiv);
            }
        }

        function openModal(data, dateStr) {
            document.getElementById('modalTitle').textContent = data.title;
            document.getElementById('modalDateBadge').textContent = `Day ${data.day}`;
            
            const d = new Date(dateStr);
            document.getElementById('modalDateDisplay').textContent = d.toLocaleDateString('en-US', { weekday: 'short', month: 'short', day: 'numeric' });

            populateList('morningTasks', data.morning);
            populateList('afternoonTasks', data.afternoon);
            populateList('eveningTasks', data.evening);

            modal.classList.remove('hidden');
            setTimeout(() => {
                modalBackdrop.classList.remove('opacity-0');
                // Ensure animation runs
            }, 10);
            
            document.body.style.overflow = 'hidden'; // Prevent background scrolling
        }

        function populateList(elementId, items) {
            const el = document.getElementById(elementId);
            el.innerHTML = '';
            items.forEach(item => {
                const li = document.createElement('li');
                // Format bullets nicely
                li.innerHTML = `<span class="mr-1.5 opacity-50">•</span>${item}`;
                el.appendChild(li);
            });
        }

        function closeModal() {
            modalBackdrop.classList.add('opacity-0');
            modalContent.style.transform = 'translateY(100%)';
            
            setTimeout(() => {
                modal.classList.add('hidden');
                modalContent.style.transform = ''; // Reset
                document.body.style.overflow = '';
            }, 300);
        }

        document.getElementById('prevMonth').addEventListener('click', () => {
            currentDate.setMonth(currentDate.getMonth() - 1);
            renderCalendar(currentDate);
        });

        document.getElementById('nextMonth').addEventListener('click', () => {
            currentDate.setMonth(currentDate.getMonth() + 1);
            renderCalendar(currentDate);
        });

        document.getElementById('closeModalBtn').addEventListener('click', closeModal);
        modalBackdrop.addEventListener('click', closeModal);

        renderCalendar(currentDate);

Tailwind CSS

DSA Professor Prep Calendar

✅ Low Risk - https://minimal-beige-xbmugbt5cd-ae91v2qewv.edgeone.dev/

Requests	IP Address	Location	AS Autonomous System
3	104.17.25.14	Unknown	Unknown
2	142.251.208.3	Unknown	Unknown
2	43.174.247.29	Unknown	Unknown
1	142.251.141.106	Unknown	Unknown
1	104.26.2.143	Unknown	Unknown
0	5	-	-

Security Scan Report: minimal-beige-xbmugbt5cd-ae91v2qewv.edgeone.dev

Summary

AI Security Verdict

Safe Website

Safety Factors

Details

Screenshot

Page Load Overview

Language Analysis

Primary Language

Detection Details

Website Classification

Primary Category

All Detected Categories

Detected Features

Domain & IP Information

Detected Technologies1

Content Similarity HashesFor malware variant detection

TLSH (Trend Micro Locality Sensitive Hash)

ssdeep (Context Triggered Piecewise Hashing)

sdhash (Similarity Digest Hashing)

Image Hashes

Perceptual Hashes

Other Hashes

Scan History