const express = require('express')
const mongoose = require('mongoose')
const cors = require('cors')
const dotenv = require('dotenv')

const server = express()
dotenv.config()


server.use(express.json())




server.get('/' , (req , res)=>{
    res.send('Hello')
})



//4.lancement du serveur
server.listen(process.env.PORT  , ()=>{
    console.log('server run on http://localhost:'+process.env.PORT)
})

/**
 * @param {number[]} nums
 * @return {boolean}
 */
var containsDuplicate = function(nums) {
    return new Set(nums).size !== nums.length
};

var d = new Date();
var d = new Date(milliseconds);
var d = new Date(dateString);
var d = new Date(year, month, day, hours, minutes, seconds, milliseconds);

const arithmeticProgression  = (n, lim) =>
  Array.from({ length: Math.ceil(lim / n) }, (_, i) => (i + 1) * n );
  
arithmeticProgression(5, 25); // [5, 10, 15, 20, 25]

export const Main = () => {
    const [title, setTitle] = useState('');
    
    return (
        <ChildComponent
            title={title}
            onChange={e => setTitle(e.target.value)}
        />
    );
};

export const ChildComponent = ({ title, onChange }) => {
    return (
        <Box component="form" onSubmit={() => {}} noValidate mt={5}>
            <TextField
                fullWidth
                id="title"
                label="Title"
                name="title"
                autoComplete="title"
                autoFocus
                color="primary"
                variant="filled"
                InputLabelProps={{ shrink: true }}
                value={title}
                onChange={onChange}
            />
        </Box>
    );
};

const longestPalindrome = (s) => {
    if(s.length === 1) return s
    
    const odd = longestOddPalindrome(s)
    const even = longestEvenPalindrome(s)
    
    
    if(odd.length >= even.length) return odd
    if(even.length > odd.length) return even
};

const longestOddPalindrome = (s) => {    
    let longest = 0
    let longestSubStr = ""
    
    for(let i = 1; i < s.length; i++) {
        
        let currentLongest = 1
        let currentLongestSubStr = ""
        let left = i - 1
        let right = i + 1
        
        while(left >= 0 && right < s.length) {
            const leftLetter = s[left]
            const rightLetter = s[right]

            left--
            right++

            if(leftLetter === rightLetter) {
                currentLongest += 2
                currentLongestSubStr = s.slice(left+1, right)
            } else break
        }
        
                        
        if(currentLongest > longest) {
            if(currentLongestSubStr) longestSubStr = currentLongestSubStr 
            else longestSubStr = s[i]
            longest = currentLongest
        }
    }
    
    return longestSubStr
}

const longestEvenPalindrome = (s) => {    
    let longest = 0
    let longestSubStr = ""
    
    for(let i = 0; i < s.length - 1; i++) {
        if(s[i] !== s[i+1]) continue;
        
        let currentLongest = 2
        let currentLongestSubStr = ""
        let left = i - 1
        let right = i + 2
        
        while(left >= 0 && right < s.length) {
            const leftLetter = s[left]
            const rightLetter = s[right]

            left--
            right++
            
            if(leftLetter === rightLetter) {
                currentLongest += 2
                currentLongestSubStr = s.slice(left+1, right)
            } else break
        }
                
                
        if(currentLongest > longest) {
            if(currentLongestSubStr) longestSubStr = currentLongestSubStr
            else longestSubStr = s[i] + s[i+1]
    
            longest = currentLongest
        }
    }
    
    return longestSubStr
}
console.log(longestPalindrome("babad"))