Index: backend/challenges/initialChallenges.json =================================================================== --- backend/challenges/initialChallenges.json (revision 4fd4dc76c1275130d3e5ec521791ab392eaa0c1b) +++ backend/challenges/initialChallenges.json (revision d141d4710a08eddbfb0ea59f1b03d623466d8fd0) @@ -868,4 +868,194 @@ "difficulty": "Easy", "output_type": "string" + }, + { + "title": "print-pyramid", + "description": "Write a program that prints a pyramid of stars (`*`) with a given height and orientation (`normal` or `reverse`). The pyramid should be centered, with each row having an odd number of stars, increasing by 2 for each subsequent row in a normal pyramid, or decreasing by 2 in a reverse pyramid. The input consists of two parameters: `height` (an integer) and `order` (a string, either 'normal' or 'reverse'). Each row should be separated by a newline (`\n`).", + "examples": [ + { + "input": "3, normal", + "output": " *\n ***\n*****" + }, + { + "input": "3, reverse", + "output": "*****\n ***\n *" + }, + { + "input": "5, normal", + "output": " *\n ***\n *****\n *******\n*********" + }, + { + "input": "5, reverse", + "output": "*********\n *******\n *****\n ***\n *" + } + ], + "testcases": [ + { + "input": "7, normal", + "output": " *\n ***\n *****\n *******\n *********\n ***********\n*************" + }, + { + "input": "7, reverse", + "output": "*************\n ***********\n *********\n *******\n *****\n ***\n *" + }, + { + "input": "10, normal", + "output": " *\n ***\n *****\n *******\n *********\n ***********\n *************\n ***************\n *****************\n*******************" + }, + { + "input": "10, reverse", + "output": "*******************\n *****************\n ***************\n *************\n ***********\n *********\n *******\n *****\n ***\n *" + }, + { + "input": "8, normal", + "output": " *\n ***\n *****\n *******\n *********\n ***********\n *************\n***************" + }, + { + "input": "8, reverse", + "output": "***************\n *************\n ***********\n *********\n *******\n *****\n ***\n *" + }, + { + "input": "12, normal", + "output": " *\n ***\n *****\n *******\n *********\n ***********\n *************\n ***************\n *****************\n *******************\n *********************\n***********************" + }, + { + "input": "12, reverse", + "output": "***********************\n *********************\n *******************\n *****************\n ***************\n *************\n ***********\n *********\n *******\n *****\n ***\n *" + }, + { + "input": "15, normal", + "output": " *\n ***\n *****\n *******\n *********\n ***********\n *************\n ***************\n *****************\n *******************\n *********************\n ***********************\n *************************\n ***************************\n*****************************" + }, + { + "input": "15, reverse", + "output": "*****************************\n ***************************\n *************************\n ***********************\n *********************\n *******************\n *****************\n ***************\n *************\n ***********\n *********\n *******\n *****\n ***\n *" + } + ], + "difficulty": "Easy", + "output_type": "string" + }, + { + "title": "maximum-subarray-sum", + "description": "Given an array of `n` integers, find the contiguous subarray with the largest sum. The input consists of the number of integers `n` on the first line, followed by `n` integers separated by spaces on the next line. Return the maximum sum of any contiguous subarray. If all sums are negative, return the least negative sum.", + "examples": [ + { + "input": "8\n-1 2 4 -3 5 2 -5 2", + "output": "10" + }, + { + "input": "6\n-2 1 -3 4 -1 2", + "output": "6" + }, + { + "input": "5\n-1 -2 -3 -4 -5", + "output": "-1" + } + ], + "testcases": [ + { + "input": "10\n-2 3 -1 5 -3 2 -4 6 -2 1", + "output": "12" + }, + { + "input": "15\n-1 2 -3 4 -5 6 -7 8 -9 10 -11 12 -13 14 -15", + "output": "25" + }, + { + "input": "20\n1 -2 3 -4 5 -6 7 -8 9 -10 11 -12 13 -14 15 -16 17 -18 19 -20", + "output": "34" + }, + { + "input": "12\n-5 -4 -3 -2 -1 0 1 2 3 4 5 6", + "output": "21" + }, + { + "input": "18\n-10 -9 -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7", + "output": "28" + }, + { + "input": "25\n-3 2 -4 5 -6 7 -8 9 -10 11 -12 13 -14 15 -16 17 -18 19 -20 21 -22 23 -24 25 -26", + "output": "49" + }, + { + "input": "30\n1 -2 3 -4 5 -6 7 -8 9 -10 11 -12 13 -14 15 -16 17 -18 19 -20 21 -22 23 -24 25 -26 27 -28 29 -30", + "output": "64" + }, + { + "input": "22\n-5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16", + "output": "120" + }, + { + "input": "28\n-10 -9 -8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17", + "output": "147" + }, + { + "input": "35\n-5 4 -3 2 -1 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29", + "output": "385" + } + ], + "difficulty": "Medium", + "output_type": "integer" + }, + { + "title": "reverse-polish-notation", + "description": "Create a calculator that evaluates expressions in Reverse Polish Notation (RPN), where operators follow their operands. The input is a single line of space-separated tokens (integers or operators). Supported operators are `+`, `-`, `*`, `/` (integer division, rounding down). Each operator has exactly two operands. Return the result of the expression as an integer. Assume all inputs are valid RPN expressions and division by zero does not occur.", + "examples": [ + { + "input": "3 4 +", + "output": "7" + }, + { + "input": "5 1 2 + 4 * + 3 -", + "output": "14" + }, + { + "input": "10 5 /", + "output": "2" + } + ], + "testcases": [ + { + "input": "100 50 25 5 * + 10 / - 3 2 * + 7 -", + "output": "168" + }, + { + "input": "15 7 3 4 + * 8 2 / - 5 * 10 +", + "output": "260" + }, + { + "input": "200 50 25 5 * + 10 / - 3 4 5 * + * 7 - 2 /", + "output": "1493" + }, + { + "input": "30 20 10 5 * 2 / - 3 4 * + 5 2 * - *", + "output": "1020" + }, + { + "input": "500 200 100 50 25 * + 5 / - 10 5 * 3 - + 2 /", + "output": "2231" + }, + { + "input": "80 40 20 10 * 5 / - 3 2 1 + * + 7 4 * - 2 /", + "output": "301" + }, + { + "input": "1000 500 250 125 * + 25 / - 15 10 5 * 2 / - * 3 +", + "output": "14853" + }, + { + "input": "60 30 15 5 * 2 / - 10 5 3 * - * 4 2 * + 3 -", + "output": "597" + }, + { + "input": "2000 1000 500 250 * + 50 / - 20 10 5 * 2 / - 3 * + 7 - 2 /", + "output": "2971" + }, + { + "input": "150 75 25 5 * + 5 / - 10 5 3 * - 2 * + 4 2 1 + * - 8 /", + "output": "281" + } + ], + "difficulty": "Medium", + "output_type": "integer" } ] Index: backend/scripts/addChallenge.js =================================================================== --- backend/scripts/addChallenge.js (revision 4fd4dc76c1275130d3e5ec521791ab392eaa0c1b) +++ backend/scripts/addChallenge.js (revision d141d4710a08eddbfb0ea59f1b03d623466d8fd0) @@ -1,50 +1,50 @@ -// const supabase = require("../supabaseClient"); -// const prisma = require("../lib/prisma"); -// const fs = require("fs").promises; -// const path = require("path"); -// const Challenge = require("../models/Challenge"); +const supabase = require('../supabaseClient'); +const prisma = require('../lib/prisma'); +const fs = require('fs').promises; +const path = require('path'); +const Challenge = require('../models/Challenge'); -// async function addChallenge() { -// const jsonPath = path.join(__dirname, "../challenges/initialChallenges.json"); -// const data = await fs.readFile(jsonPath, "utf8"); -// const challengesData = JSON.parse(data); +async function addChallenge() { + const jsonPath = path.join(__dirname, '../challenges/initialChallenges.json'); + const data = await fs.readFile(jsonPath, 'utf8'); + const challengesData = JSON.parse(data); -// const challenge = challengesData[challengesData.length - 3]; + const challenge = challengesData[challengesData.length - 1]; -// let currentDate = new Date(); -// currentDate.setDate(currentDate.getDate()); -// const newChallenge = new Challenge({ -// title: challenge.title, -// content: challenge.description, -// solving_date: currentDate, -// attempted_by: 0, -// solved_by: 0, -// expired: false, -// examples: challenge.examples, -// test_cases: challenge.testcases.map((testCase) => ({ -// input: testCase.input, -// output: testCase.output, -// })), -// output_type: challenge.output_type, -// difficulty: challenge.difficulty, -// }); -// const createdChallenge = await prisma.challenges.create({ -// data: { -// title: newChallenge.title, -// content: newChallenge.content, -// solving_date: newChallenge.solving_date, -// attempted_by: newChallenge.attempted_by, -// solved_by: newChallenge.solved_by, -// expired: newChallenge.expired, -// examples: newChallenge.examples, -// output_type: newChallenge.output_type, -// difficulty: newChallenge.difficulty, + let currentDate = new Date(); + currentDate.setDate(currentDate.getDate() + 1); + const newChallenge = new Challenge({ + title: challenge.title, + content: challenge.description, + solving_date: currentDate, + attempted_by: 0, + solved_by: 0, + expired: false, + examples: challenge.examples, + test_cases: challenge.testcases.map((testCase) => ({ + input: testCase.input, + output: testCase.output, + })), + output_type: challenge.output_type, + difficulty: challenge.difficulty, + }); + const createdChallenge = await prisma.challenges.create({ + data: { + title: newChallenge.title, + content: newChallenge.content, + solving_date: newChallenge.solving_date, + attempted_by: newChallenge.attempted_by, + solved_by: newChallenge.solved_by, + expired: newChallenge.expired, + examples: newChallenge.examples, + output_type: newChallenge.output_type, + difficulty: newChallenge.difficulty, -// test_cases: { -// create: newChallenge.test_cases, -// }, -// }, -// }); -// } + test_cases: { + create: newChallenge.test_cases, + }, + }, + }); +} -// addChallenge(); +addChallenge(); Index: client/src/Dashboard/components/ManagePosts.jsx =================================================================== --- client/src/Dashboard/components/ManagePosts.jsx (revision 4fd4dc76c1275130d3e5ec521791ab392eaa0c1b) +++ client/src/Dashboard/components/ManagePosts.jsx (revision d141d4710a08eddbfb0ea59f1b03d623466d8fd0) @@ -1,15 +1,15 @@ -import React, { useState, useEffect, useCallback, useRef } from "react"; -import { useSearchParams } from "react-router-dom"; -import doneAll from "../../assets/images/done-all.svg"; -import trashIcon from "../../assets/images/delete.svg"; -import { useAuth } from "@/contexts/AuthContext"; +import React, { useState, useEffect, useCallback, useRef } from 'react'; +import { useSearchParams } from 'react-router-dom'; +import doneAll from '../../assets/images/done-all.svg'; +import trashIcon from '../../assets/images/delete.svg'; +import { useAuth } from '@/contexts/AuthContext'; import { getReviewPosts, deleteReviewPost, approveReviewPost, -} from "@/services/reviewService"; -import CalendarPopover from "./CalendarPopover"; -import "react-datepicker/dist/react-datepicker.css"; -import "cally"; +} from '@/services/reviewService'; +import CalendarPopover from './CalendarPopover'; +import 'react-datepicker/dist/react-datepicker.css'; +import 'cally'; const ManagePosts = () => { const [posts, setPosts] = useState([]); @@ -25,6 +25,6 @@ const [modal, setModal] = useState({ isOpen: false, - message: "", - type: "", + message: '', + type: '', postId: null, post: null, @@ -34,8 +34,8 @@ // Filter states const defaultFilters = { - topic: "all", - dateSort: "newest", + topic: 'all', + dateSort: 'oldest', selectedDate: null, - searchText: "", + searchText: '', }; @@ -60,5 +60,5 @@ } } - newSearchParams.set("page", "1"); + newSearchParams.set('page', '1'); setPage(1); setSearchParams(newSearchParams); @@ -72,5 +72,5 @@ newSearchParams.delete(filterKey); setPage(1); - newSearchParams.set("page", "1"); + newSearchParams.set('page', '1'); setSearchParams(newSearchParams); } @@ -79,5 +79,5 @@ const freshDefaultFilters = { ...defaultFilters }; setFilters(freshDefaultFilters); - setSearchParams({ page: "1" }); + setSearchParams({ page: '1' }); setPage(1); }; @@ -94,11 +94,11 @@ const openViewPostModal = (post) => { - showModal("", "view-post", post.id, post); + showModal('', 'view-post', post.id, post); }; const closeModal = () => { setModal({ isOpen: false, - message: "", - type: "", + message: '', + type: '', postId: null, post: null, @@ -108,7 +108,7 @@ const confirmAction = async () => { setIsActionLoading(true); - if (modal.type === "delete" && modal.postId) { + if (modal.type === 'delete' && modal.postId) { await handleDeletePost(modal.postId); - } else if (modal.type === "approve" && modal.post) { + } else if (modal.type === 'approve' && modal.post) { await handleApprovePost(modal.post); } @@ -124,12 +124,12 @@ const filtersForApi = { - searchText: searchParams.get("searchText") || "", - topic: searchParams.get("topic") || "all", - selectedDate: searchParams.get("selectedDate") || null, - dateSort: searchParams.get("dateSort") || "newest", + searchText: searchParams.get('searchText') || '', + topic: searchParams.get('topic') || 'all', + selectedDate: searchParams.get('selectedDate') || null, + dateSort: searchParams.get('dateSort') || 'oldest', }; try { - const currentPage = parseInt(searchParams.get("page") || "1", 10); + const currentPage = parseInt(searchParams.get('page') || '1', 10); setPage(currentPage); @@ -144,10 +144,10 @@ setTotalPages(data.totalPages); } catch (err) { - console.error("Error fetching review posts:", err); + console.error('Error fetching review posts:', err); setPosts([]); setTotalPages(0); setError( err.response?.data?.error || - "Failed to fetch posts. You may not have permission." + 'Failed to fetch posts. You may not have permission.' ); } finally { @@ -163,9 +163,9 @@ await deleteReviewPost(postId, user.id); setPosts((prevPosts) => prevPosts.filter((p) => p.id !== postId)); - showModal("Post deleted successfully.", "deleted"); + showModal('Post deleted successfully.', 'deleted'); } catch (err) { - console.error("Error deleting review post:", err); + console.error('Error deleting review post:', err); setError( - err.response?.data?.message || err.message || "Failed to delete post." + err.response?.data?.message || err.message || 'Failed to delete post.' ); } @@ -185,13 +185,13 @@ prevPosts.filter((p) => p.id !== postToApprove.id) ); - showModal("Post approved successfully.", "success"); + showModal('Post approved successfully.', 'success'); } catch (err) { - console.error("Error approving post:", err); + console.error('Error approving post:', err); setError( - err.response?.data?.message || err.message || "Failed to approve post." + err.response?.data?.message || err.message || 'Failed to approve post.' ); showModal( - err.response?.data?.message || err.message || "Failed to approve post.", - "error" + err.response?.data?.message || err.message || 'Failed to approve post.', + 'error' ); } @@ -199,15 +199,15 @@ const openConfirmationModal = (type, item) => { - if (type === "delete") { + if (type === 'delete') { showModal( `Are you sure you want to delete post with title "${item.title}"? This action cannot be undone.`, - "delete", + 'delete', item.id, item ); - } else if (type === "approve") { + } else if (type === 'approve') { showModal( `Are you sure you want to approve post with title "${item.title}"? It will be published to the forum.`, - "approve", + 'approve', item.id, item @@ -218,9 +218,9 @@ const isLoading = authLoading || isFetching; const formatFilterLabel = (value) => { - if (!value) return ""; + if (!value) return ''; return value - .split("-") + .split('-') .map((word) => word.charAt(0).toUpperCase() + word.slice(1)) - .join(" "); + .join(' '); }; @@ -244,6 +244,6 @@ Filters {/* Active filter count indicator */} - {(filters.topic !== "all" || - filters.dateSort !== "newest" || + {(filters.topic !== 'all' || + filters.dateSort !== 'newest' || filters.selectedDate || (filters.searchText && filters.searchText.trim())) && ( @@ -251,8 +251,8 @@ { [ - filters.topic !== "all", - filters.dateSort !== "newest", + filters.topic !== 'all', + filters.dateSort !== 'newest', filters.selectedDate, - filters.commentSort !== "none", + filters.commentSort !== 'none', filters.searchText && filters.searchText.trim(), ].filter(Boolean).length @@ -267,5 +267,5 @@ @@ -308,5 +308,5 @@ } onKeyDown={(e) => { - if (e.key === "Enter") { + if (e.key === 'Enter') { applyFilters(); } @@ -367,6 +367,6 @@ className="select select-sm select-bordered w-full text-xs h-8 min-h-8" > + - @@ -390,10 +390,10 @@ ? new Date( filters.selectedDate - ).toLocaleDateString("en-US", { - year: "numeric", - month: "short", - day: "numeric", + ).toLocaleDateString('en-US', { + year: 'numeric', + month: 'short', + day: 'numeric', }) - : "" // Use empty string so placeholder is visible + : '' // Use empty string so placeholder is visible } placeholder="Select date" @@ -436,6 +436,6 @@
- {(filters.topic !== "all" || - filters.dateSort !== "newest" || + {(filters.topic !== 'all' || + filters.dateSort !== 'newest' || filters.selectedDate || (filters.searchText && @@ -466,15 +466,15 @@ {/* Active Filters Display - Improved Mobile Layout */}
- {filters.topic !== "all" && ( + {filters.topic !== 'all' && ( - {filters.topic === "general" - ? "General" - : "Daily Challenge"} + {filters.topic === 'general' + ? 'General' + : 'Daily Challenge'}