From 6cc204c2efe5dfbd5ff59f9a9541b56d1f7d4c33 Mon Sep 17 00:00:00 2001 From: Abhishek-kumar09 Date: Tue, 11 May 2021 21:34:11 +0530 Subject: [PATCH 1/3] Add volunteer video link and forms --- src/components/Banner.js | 6 +- .../forms}/ApplyNowModal.js | 0 src/components/forms/VolunteerForm.js | 265 ++++++++ src/data/HomeViewData/HomeViewData.js | 3 +- src/data/courses/advanced/CompetitiveCpp.js | 623 +++++++++--------- src/data/courses/advanced/index.js | 7 +- src/data/courses/foundation/AlgoCpp.js | 541 ++++++++------- src/data/courses/training/CompetitiveCpp.js | 4 +- src/data/courses/training/index.js | 7 +- src/data/recommendations.js | 2 +- src/views/pages/Bootcamp/ApplyModal.js | 2 +- src/views/pages/CLView/Apply.js | 2 +- src/views/pages/CLView/CTA.js | 13 +- src/views/pages/CLView/Hero.js | 2 +- src/views/pages/Course/CoursePage/index.js | 2 +- src/views/pages/Course/Header.js | 21 +- src/views/pages/Course/Schedule.js | 36 +- src/views/pages/CoursesView/index.js | 2 +- src/views/pages/HomeView/Promo.js | 15 +- src/views/pages/SpecialCourse/ApplyModal.js | 5 +- src/views/pages/SpecialCourse/Header.js | 21 +- src/views/pages/SpecialCourse/Process.js | 4 +- src/views/pages/common/Recommendations.js | 8 +- 23 files changed, 939 insertions(+), 652 deletions(-) rename src/{views/pages/CLView => components/forms}/ApplyNowModal.js (100%) create mode 100644 src/components/forms/VolunteerForm.js diff --git a/src/components/Banner.js b/src/components/Banner.js index 949ee042..3bdcb421 100644 --- a/src/components/Banner.js +++ b/src/components/Banner.js @@ -12,7 +12,11 @@ function Banner() { const classes = useStyles(); return ( - Banner + Banner ); } diff --git a/src/views/pages/CLView/ApplyNowModal.js b/src/components/forms/ApplyNowModal.js similarity index 100% rename from src/views/pages/CLView/ApplyNowModal.js rename to src/components/forms/ApplyNowModal.js diff --git a/src/components/forms/VolunteerForm.js b/src/components/forms/VolunteerForm.js new file mode 100644 index 00000000..6fa66524 --- /dev/null +++ b/src/components/forms/VolunteerForm.js @@ -0,0 +1,265 @@ +import React, { useState } from 'react'; +import { + Dialog, + DialogActions, + DialogContent, + DialogContentText, + DialogTitle, + Button, + Typography, + MenuItem, + Grid +} from '@material-ui/core'; +import { makeStyles } from '@material-ui/core/styles'; +import CircularProgress from '@material-ui/core/CircularProgress'; +import { + ValidatorForm, + TextValidator, + SelectValidator +} from 'react-material-ui-form-validator'; +import { useSnackbar } from 'notistack'; +import axios from 'axios'; + +const useStyles = makeStyles(theme => ({ + btn: { + backgroundColor: '#A60000', + color: '#ffffff', + textTransform: 'capitalize', + [theme.breakpoints.down('sm')]: { + width: '100%' + }, + '&:hover': { + backgroundColor: 'rgba(166, 0, 0, 0.8)' + } + }, + textField: { + marginBottom: '16px' + }, + submissions: { + width: '80px', + height: '50px' + } +})); + +export default function VolunteerFormModal({ className }) { + const classes = useStyles(); + const [open, setOpen] = useState(false); + const [formData, updateFormData] = useState({}); + const [submitting, setSubmitting] = useState(0); + + const { enqueueSnackbar } = useSnackbar(); + + const handleClickOpen = () => { + setOpen(true); + formData.countryCode = '+91'; + formData.phone = ''; + }; + + const handleClose = () => { + setOpen(false); + }; + + const handleChange = event => { + updateFormData({ + ...formData, + [event.target.name]: event.target.value + }); + }; + + const handleSubmit = e => { + formData.phone = `${formData.countryCode}${formData.phone}`; + setSubmitting(1); + e.preventDefault(); + axios({ + method: 'post', + url: + 'https://us-central1-codeforcauseorg.cloudfunctions.net/widgets/leads', // TO CHANGE****************** + data: formData + }) + .then(response => { + setSubmitting(0); + handleClose(); + enqueueSnackbar('Application Submitted Successfully'); + }) + .catch(error => { + enqueueSnackbar('Application Failed. Try again later'); + }); + }; + + const countryCodes = Array(100) + .fill(1) + .map((x, y) => x + y) + .reverse(); + + return ( +
+ + + + Apply to Volunteer with Codeforcause + + + + Please provide your details below. + + + + + + + + + + {countryCodes.map(code => { + return +{code}; + })} + + + + + + + + + + + + + + + {submitting === 0 ? ( + + ) : ( +
+ +
+ )} + + + + + + +
+ ); +} diff --git a/src/data/HomeViewData/HomeViewData.js b/src/data/HomeViewData/HomeViewData.js index 7d6927a8..206a2d94 100644 --- a/src/data/HomeViewData/HomeViewData.js +++ b/src/data/HomeViewData/HomeViewData.js @@ -104,8 +104,7 @@ export const mentors = [ name: 'Bharat Kumar', avatar: '/static/images/members/bharat.png', linkedin: 'https://www.linkedin.com/in/bharatbbhardwaj/' - }, - + } ]; // experience data --------------------- diff --git a/src/data/courses/advanced/CompetitiveCpp.js b/src/data/courses/advanced/CompetitiveCpp.js index ee841305..0068b808 100644 --- a/src/data/courses/advanced/CompetitiveCpp.js +++ b/src/data/courses/advanced/CompetitiveCpp.js @@ -1,313 +1,312 @@ export const competitiveCpp = { - difficulty: 'Intermediate', - duration: '40 Live Lectures', - level: 'Level 2', - link: '/competitive-programming-using-cpp', - domain: 'Interview Prepration', - title: 'Competitive Programming using C++', - upcoming: 'June 27th', - language: 'Hindi', - mentors: ['nityanand'], - default: 0, - schedule: [ - { - courseId: 'ccomp0121', - dates: '27th June - 04th Sep', - days: 'Mon, Wed, Fri, Sun', - timing: '09:00 PM - 11:00 PM (IST)', - link: '', - priceCut: '', - price: '₹ 15,000', - priceId: 'price_1IkVqNLVU3L7vcSrHDgseECa', - duration: '40 Live Lectures', - mentor: 'Nityanand Rai', - language: 'Hindi', - active: true - } - ], - projects: [ - { - title: 'Automatic Sudoku Solver', - img: '/static/images/courses/projects/sudoku.jpg' - }, - { - title: 'File Encryption and Compression', - img: '/static/images/courses/projects/security.jpg' - }, - { - title: 'Splitwise Cashflow Minimization', - img: '/static/images/courses/projects/split.png' - }, - { - title: 'Search routes like Google Maps', - img: '/static/images/courses/projects/maps.png' - }, - { - title: 'Git Version Control Replica', - img: '/static/images/courses/projects/git.png' - } - ], - sections: [ - { - title: 'Advance Competetive Algorithms', - classes: 'Classes 01-20', - topics: [ - { - title: 'Revisiting STL', - classes: 'Lectures 1-2', - subtopics: [ - 'In-built Data Structures', - 'OOP Refresher', - 'Best practices with STL', - 'lurking over recursion problems' - ] - }, - { - title: 'Understanding online platforms: Codeforces & Leetcode', - classes: 'Lectures 3', - subtopics: [ - 'Start Competitive Programming on Codeforces', - 'Set up ide for Competitive Coding', - 'Create Template to save time in Competitive Coding' - ] - }, - { - title: 'Bit Masking and Manipulation', - classes: 'Lectures 4-5', - subtopics: [ - 'Get, Set, Clear and Update bits', - 'Fast Exponentiation using Bitmasking', - 'Generate Subsets using Bitmasking', - 'Decimal to Binary using Bitwise', - 'Inclusion Exclusion Concept + Implementation' - ] - }, - { - title: 'Number theory & Computational Theory', - classes: 'Lectures 6-7', - subtopics: [ - 'Binomial coefficients', - 'Matrix Exponentiation', - 'Catalan Series', - 'Fibonacci & other series facts', - 'Prime factorization', - 'Pigeonhole Principle', - 'Extended Euclids Algorithms', - 'Willsons Theorem', - 'Pollards rho Theorem' - ] - }, - { - title: 'Divide & Conquer Algorithms', - classes: 'Lectures 8', - subtopics: [ - 'Randomized Binary Search', - 'Merge sort & Quick sort', - 'Second largest element', - 'Painter partition problem', - 'Aggressive Cows', - 'Tilling problem' - ] - }, - { - title: 'Recursion & Backtracking', - classes: 'Lectures 10-12', - subtopics: [ - 'Recursive tree, Stack trace', - 'Generate all passwords from given character set', - 'Lockdown Game', - 'Its confidential problem', - 'Sudoku solver', - 'Optimal BST problem', - 'Subset sum', - 'M coloring problem', - 'Lexical permutation', - 'N-Queens & N-Knights' - ] - }, - { - title: 'Dynamic Programming', - classes: 'Lectures 13-15', - subtopics: [ - 'Understanding the concept in Dynamic Programming', - 'Understanding overlapping subproblems', - 'Memoization vs Tabulation', - 'Top down & bottom-up approach', - '0-1 KnapSack problem', - 'Wildcard pattern problem', - 'Egg drop problem', - 'Matrix chain multiplication', - 'Longest Increasing Subsequence', - 'Maximum Subarray Sum' - ] - }, - { - title: 'Greedy Algorithms', - classes: 'Lectures 16-17', - subtopics: [ - 'Greedy Algorithm concept & philosphy', - 'Pirates & Gold coins problem', - 'Activity selection & Job sequencing problem', - 'Policemen catch thieves', - 'Efficient Huffman encoding & decoding', - 'Assign mice to holes', - 'Minimum Spanning Tree', - 'Memory Management Algorithms' - ] - } - ] - }, - { - title: 'Advanced non-linear data structures', - classes: 'Classes 21-40', - topics: [ - { - title: 'Binary Tree', - classes: 'Lectures 17-18', - subtopics: [ - 'Implementation of Binary Trees', - 'Tree traversal- inorder, preorder and postorder', - 'Searching Algorithms- DFS and BFS', - 'Calculate- height, depth, diameter of tree', - 'Implementation of Binary Search Tree', - 'AVL Trees & Rotations', - 'Interview problems on BT & BST' - ] - }, - { - title: 'String Matching', - classes: 'Lectures 19-20', - subtopics: [ - 'String Matching Algorithms', - 'String window problems', - 'String Hashing', - 'Rabin Karp Algorithm', - 'Knuth Morris Pratt Algorithm' - ] - }, - { - title: 'Tries', - classes: 'Lectures 21-22', - subtopics: [ - 'Trie as a Data Structure', - 'Implementation', - 'Max XOR pair', - 'Library Bookmarks', - 'Range XOR', - 'Trie Interview problem' - ] - }, - { - title: 'Segment Tree', - classes: 'Lectures 22-23', - subtopics: [ - 'Segment Tree: structure & concepts', - 'Build & update implementation', - 'Lazy Propagation', - 'Persistent Segment Tree', - 'XOR Sum problem', - 'Xenia & Bit operations[Codeforces]', - 'Alpha & his arrays', - 'Greatest common divisor', - 'Distinct Integers in range' - ] - }, - { - title: 'Fenwick Tree', - classes: 'Lectures 24-25', - subtopics: [ - 'Fenwick Tree concept', - 'Build & update implementation', - 'Range Sum query', - 'Inversion count', - '2D Binary Indexed Tree', - 'No. of elements greater than K in [L,R] range', - 'Range Queries problems' - ] - }, - { - title: 'Graphs', - classes: 'Lectures 26-27', - subtopics: [ - 'Terminologies in Graph', - 'EdgeList implementation', - 'AdjacencyList implementation', - 'AdjacencyMap implementation', - 'Searching Algorithms- DFS and BFS', - 'Connected component, Cycle detection', - 'Bipartite Graph', - "Kruskal's, Dijkstra's, Prim's Algorithms", - "Kosaraju's Algorithm", - 'Dynamic Programming with Graphs' - ] - }, - { - title: 'Advanced Mathematics', - classes: 'Lectures 28-29', - subtopics: [ - 'Fast Fourier transform concepts', - 'FFT Implementation', - 'Discrete Fourier transform', - 'Inverse FFT', - 'Square Root Decompositions', - 'Segmented Sieve', - 'Modulo inverse', - 'Lucas Theorem' - ] - }, - { - title: 'Game Theory', - classes: 'Lectures 30', - subtopics: [ - 'Concept around Game theory', - 'Combinational Game theory', - 'Game of chocolates', - 'Robot problems' - ] - } - ] - } - ], - - slides: [ - { - heading: '', - subheading: '', - image: '/static/images/backs/dsa.png' - } - ], - tags: [ - 'Dynamic Programming', - 'Tree', - 'Graph', - 'Bitwise', - 'Pointer', - 'Pigeonhole Principle', - 'Number Theory', - 'Segment Tree', - 'Fenwick Tree', - 'Decompositions' - ], - overview: [ - 'During the course, you’ll learn everything needed to participate in real competitions — that’s the main goal. Along the way you’ll also gain useful skills for which competitive programmers are so highly valued by employers: ability to write efficient, reliable, and compact code, manage your time well when it’s limited, apply basic algorithmic ideas to real problems, etc.', - 'We start from the very beginning by teaching you what competitions there are, what are their rules, what specifics problems have, how to read problem statements, how to organize your work, and what you should and shouldn’t do. So it’s fine if you’ve never taken part in programming competitions before.' - ], - faqs: [ - { - title: 'Will this help me with my career path?', - answer: - 'Yes. If you learn well, all that the course intends to teach, you’ll be able to impress quite a few interviewers across quite a few fine companies.' - }, - { - title: 'How your doubts will get resolved?', - answer: - 'We have an army of TA’s who are available in different time slots to resolve all your doubts. You can also interact with faculty through Slack.' - }, - { - title: 'Is this course suitable for me?', - answer: - 'Definitely! If you want to shift to software developer career path, then this course is perfect for you!' - } - ] - }; - \ No newline at end of file + difficulty: 'Intermediate', + duration: '40 Live Lectures', + level: 'Level 2', + link: '/competitive-programming-using-cpp', + domain: 'Interview Prepration', + title: 'Competitive Programming using C++', + upcoming: 'June 27th', + language: 'Hindi', + mentors: ['nityanand'], + default: 0, + schedule: [ + { + courseId: 'ccomp0121', + dates: '27th June - 04th Sep', + days: 'Mon, Wed, Fri, Sun', + timing: '09:00 PM - 11:00 PM (IST)', + link: '', + priceCut: '', + price: '₹ 15,000', + priceId: 'price_1IkVqNLVU3L7vcSrHDgseECa', + duration: '40 Live Lectures', + mentor: 'Nityanand Rai', + language: 'Hindi', + active: true + } + ], + projects: [ + { + title: 'Automatic Sudoku Solver', + img: '/static/images/courses/projects/sudoku.jpg' + }, + { + title: 'File Encryption and Compression', + img: '/static/images/courses/projects/security.jpg' + }, + { + title: 'Splitwise Cashflow Minimization', + img: '/static/images/courses/projects/split.png' + }, + { + title: 'Search routes like Google Maps', + img: '/static/images/courses/projects/maps.png' + }, + { + title: 'Git Version Control Replica', + img: '/static/images/courses/projects/git.png' + } + ], + sections: [ + { + title: 'Advance Competetive Algorithms', + classes: 'Classes 01-20', + topics: [ + { + title: 'Revisiting STL', + classes: 'Lectures 1-2', + subtopics: [ + 'In-built Data Structures', + 'OOP Refresher', + 'Best practices with STL', + 'lurking over recursion problems' + ] + }, + { + title: 'Understanding online platforms: Codeforces & Leetcode', + classes: 'Lectures 3', + subtopics: [ + 'Start Competitive Programming on Codeforces', + 'Set up ide for Competitive Coding', + 'Create Template to save time in Competitive Coding' + ] + }, + { + title: 'Bit Masking and Manipulation', + classes: 'Lectures 4-5', + subtopics: [ + 'Get, Set, Clear and Update bits', + 'Fast Exponentiation using Bitmasking', + 'Generate Subsets using Bitmasking', + 'Decimal to Binary using Bitwise', + 'Inclusion Exclusion Concept + Implementation' + ] + }, + { + title: 'Number theory & Computational Theory', + classes: 'Lectures 6-7', + subtopics: [ + 'Binomial coefficients', + 'Matrix Exponentiation', + 'Catalan Series', + 'Fibonacci & other series facts', + 'Prime factorization', + 'Pigeonhole Principle', + 'Extended Euclids Algorithms', + 'Willsons Theorem', + 'Pollards rho Theorem' + ] + }, + { + title: 'Divide & Conquer Algorithms', + classes: 'Lectures 8', + subtopics: [ + 'Randomized Binary Search', + 'Merge sort & Quick sort', + 'Second largest element', + 'Painter partition problem', + 'Aggressive Cows', + 'Tilling problem' + ] + }, + { + title: 'Recursion & Backtracking', + classes: 'Lectures 10-12', + subtopics: [ + 'Recursive tree, Stack trace', + 'Generate all passwords from given character set', + 'Lockdown Game', + 'Its confidential problem', + 'Sudoku solver', + 'Optimal BST problem', + 'Subset sum', + 'M coloring problem', + 'Lexical permutation', + 'N-Queens & N-Knights' + ] + }, + { + title: 'Dynamic Programming', + classes: 'Lectures 13-15', + subtopics: [ + 'Understanding the concept in Dynamic Programming', + 'Understanding overlapping subproblems', + 'Memoization vs Tabulation', + 'Top down & bottom-up approach', + '0-1 KnapSack problem', + 'Wildcard pattern problem', + 'Egg drop problem', + 'Matrix chain multiplication', + 'Longest Increasing Subsequence', + 'Maximum Subarray Sum' + ] + }, + { + title: 'Greedy Algorithms', + classes: 'Lectures 16-17', + subtopics: [ + 'Greedy Algorithm concept & philosphy', + 'Pirates & Gold coins problem', + 'Activity selection & Job sequencing problem', + 'Policemen catch thieves', + 'Efficient Huffman encoding & decoding', + 'Assign mice to holes', + 'Minimum Spanning Tree', + 'Memory Management Algorithms' + ] + } + ] + }, + { + title: 'Advanced non-linear data structures', + classes: 'Classes 21-40', + topics: [ + { + title: 'Binary Tree', + classes: 'Lectures 17-18', + subtopics: [ + 'Implementation of Binary Trees', + 'Tree traversal- inorder, preorder and postorder', + 'Searching Algorithms- DFS and BFS', + 'Calculate- height, depth, diameter of tree', + 'Implementation of Binary Search Tree', + 'AVL Trees & Rotations', + 'Interview problems on BT & BST' + ] + }, + { + title: 'String Matching', + classes: 'Lectures 19-20', + subtopics: [ + 'String Matching Algorithms', + 'String window problems', + 'String Hashing', + 'Rabin Karp Algorithm', + 'Knuth Morris Pratt Algorithm' + ] + }, + { + title: 'Tries', + classes: 'Lectures 21-22', + subtopics: [ + 'Trie as a Data Structure', + 'Implementation', + 'Max XOR pair', + 'Library Bookmarks', + 'Range XOR', + 'Trie Interview problem' + ] + }, + { + title: 'Segment Tree', + classes: 'Lectures 22-23', + subtopics: [ + 'Segment Tree: structure & concepts', + 'Build & update implementation', + 'Lazy Propagation', + 'Persistent Segment Tree', + 'XOR Sum problem', + 'Xenia & Bit operations[Codeforces]', + 'Alpha & his arrays', + 'Greatest common divisor', + 'Distinct Integers in range' + ] + }, + { + title: 'Fenwick Tree', + classes: 'Lectures 24-25', + subtopics: [ + 'Fenwick Tree concept', + 'Build & update implementation', + 'Range Sum query', + 'Inversion count', + '2D Binary Indexed Tree', + 'No. of elements greater than K in [L,R] range', + 'Range Queries problems' + ] + }, + { + title: 'Graphs', + classes: 'Lectures 26-27', + subtopics: [ + 'Terminologies in Graph', + 'EdgeList implementation', + 'AdjacencyList implementation', + 'AdjacencyMap implementation', + 'Searching Algorithms- DFS and BFS', + 'Connected component, Cycle detection', + 'Bipartite Graph', + "Kruskal's, Dijkstra's, Prim's Algorithms", + "Kosaraju's Algorithm", + 'Dynamic Programming with Graphs' + ] + }, + { + title: 'Advanced Mathematics', + classes: 'Lectures 28-29', + subtopics: [ + 'Fast Fourier transform concepts', + 'FFT Implementation', + 'Discrete Fourier transform', + 'Inverse FFT', + 'Square Root Decompositions', + 'Segmented Sieve', + 'Modulo inverse', + 'Lucas Theorem' + ] + }, + { + title: 'Game Theory', + classes: 'Lectures 30', + subtopics: [ + 'Concept around Game theory', + 'Combinational Game theory', + 'Game of chocolates', + 'Robot problems' + ] + } + ] + } + ], + + slides: [ + { + heading: '', + subheading: '', + image: '/static/images/backs/dsa.png' + } + ], + tags: [ + 'Dynamic Programming', + 'Tree', + 'Graph', + 'Bitwise', + 'Pointer', + 'Pigeonhole Principle', + 'Number Theory', + 'Segment Tree', + 'Fenwick Tree', + 'Decompositions' + ], + overview: [ + 'During the course, you’ll learn everything needed to participate in real competitions — that’s the main goal. Along the way you’ll also gain useful skills for which competitive programmers are so highly valued by employers: ability to write efficient, reliable, and compact code, manage your time well when it’s limited, apply basic algorithmic ideas to real problems, etc.', + 'We start from the very beginning by teaching you what competitions there are, what are their rules, what specifics problems have, how to read problem statements, how to organize your work, and what you should and shouldn’t do. So it’s fine if you’ve never taken part in programming competitions before.' + ], + faqs: [ + { + title: 'Will this help me with my career path?', + answer: + 'Yes. If you learn well, all that the course intends to teach, you’ll be able to impress quite a few interviewers across quite a few fine companies.' + }, + { + title: 'How your doubts will get resolved?', + answer: + 'We have an army of TA’s who are available in different time slots to resolve all your doubts. You can also interact with faculty through Slack.' + }, + { + title: 'Is this course suitable for me?', + answer: + 'Definitely! If you want to shift to software developer career path, then this course is perfect for you!' + } + ] +}; diff --git a/src/data/courses/advanced/index.js b/src/data/courses/advanced/index.js index f609f455..4dffbb13 100644 --- a/src/data/courses/advanced/index.js +++ b/src/data/courses/advanced/index.js @@ -2,6 +2,11 @@ import { machineLearning } from './MachineLearning'; import { webDevelopment } from './WebDevelopment'; import { competitiveJava } from './CompetitiveJava'; import { competitiveCpp } from './CompetitiveCpp'; -const advanced = { machineLearning, competitiveCpp, competitiveJava, webDevelopment }; +const advanced = { + machineLearning, + competitiveCpp, + competitiveJava, + webDevelopment +}; export default advanced; diff --git a/src/data/courses/foundation/AlgoCpp.js b/src/data/courses/foundation/AlgoCpp.js index b041e3e3..01327b59 100644 --- a/src/data/courses/foundation/AlgoCpp.js +++ b/src/data/courses/foundation/AlgoCpp.js @@ -1,272 +1,271 @@ export const algoCpp = { - difficulty: 'Foundation', - duration: '40 Live Lectures', - level: 'Level 1', - link: '/ds-algo-with-cpp', - domain: 'Algorithms & Complexities', - title: 'Data Structures and Algorithms with C++', - started: '', - upcoming: 'June 20th (Weekdays)', - mentors: ['nityanand'], - language: 'Hindi', - default: 0, - schedule: [ - { - courseId: 'cds0121', - dates: '20th June - 28th Aug', - days: 'Mon, Wed, Fri, Sun', - timing: '06:00 PM - 08:00 PM (IST)', - link: '', - priceCut: '', - price: '₹ 12,000', - priceId: 'price_1IjK7oLVU3L7vcSrdSju1Tu7', - duration: '40 Live Lectures (2 hrs)', - mentor: 'Nityanand Rai', - language: 'Hindi', - active: true - } - ], - projects: [ - { - title: 'Automatic Sudoku Solver', - img: '/static/images/courses/projects/sudoku.jpg' - }, - { - title: 'File Encryption and Compression', - img: '/static/images/courses/projects/security.jpg' - }, - { - title: 'Splitwise Cashflow Minimization', - img: '/static/images/courses/projects/split.png' - }, - { - title: 'Search routes like Google Maps', - img: '/static/images/courses/projects/maps.png' - }, - { - title: 'Git Version Control Replica', - img: '/static/images/courses/projects/git.png' - } - ], - - sections: [ - { - title: 'C++ Foundation Constructs', - classes: 'Classes 01-20', - topics: [ - { - title: 'Getting started with C++', - classes: 'Classes 1-3', - subtopics: [ - 'Flowcharts & Pseudocode', - 'Control Flow Statements ', - 'Setting up Coding Environment', - 'Primitive data-types', - 'Input-Output on online judge', - 'Coding standards in C++', - 'Methods along with problems', - 'Setting up debugger' - ] - }, - { - title: '1D and 2D Arrays', - classes: 'Classes 4-7', - subtopics: [ - 'Introduction of arrays', - 'Input-output & traversing', - 'Linear Search & Binary Search', - 'Selection sort, Bubble sort, Insertion sort, Count sort', - 'Multi-Dimensional arrays', - 'Rotation in arrays', - ] - }, - { - title: 'Number theory & Bitmasking', - classes: 'Classes 8-9', - subtopics: [ - 'Euclidean algorithms', - 'Sieve of eratosthenes', - 'Puzzle problems', - 'Bitwise operators', - 'Advantages & cost-effectiveness', - 'Backtracking with Bitmasking', - 'Interview problems' - ] - }, - { - title: 'String and Operations', - classes: 'Classes 10-11', - subtopics: [ - 'Intro to Strings in C++', - 'Mutability and behavior', - 'String operations', - 'String operations optimization', - 'String Manipulation' - ] - }, - { - title: 'Space and Time complexity analysis', - classes: 'Classes 12', - subtopics: [ - 'Best case, worst case and average case', - 'Sandwich theorem, recurrence relation', - 'Theta, Big-oh, Omega notations', - 'Understanding complexity of loops', - 'Auxiliary vs Total space', - 'Static & Dynamic Memory Allocation' - ] - }, - { - title: 'Recursion & Backtracking', - classes: 'Classes 13-16', - subtopics: [ - 'Recursion- what, why, when?', - 'Control flow & stack trace', - 'understanding recursive tree', - 'Merge sort & Quick sort', - 'Interview problems on Recursion', - 'Backtracking-Sudoku solver, N-Queens, lexo-permute' - ] - }, - { - title: 'Object Oriented Programming', - classes: 'Classes 17-18', - subtopics: [ - 'Classes & Objects', - 'Constructors, states & behaviors', - 'Abstraction, Inheritance, Polymorphism, Encapsulation', - 'Access modifiers', - 'Static & non-static', - ] - } - ] - }, - { - title: 'Data Structure & Algorithms', - classes: 'Classes 20-40', - topics: [ - { - title: 'Stacks & Queues', - classes: 'Classes 19-20', - subtopics: [ - 'Stack Implementation', - 'Operations in Stack', - 'Stack using Array & LinkedList', - 'Push efficient & Pop efficient Stacks', - 'Queue Implementation', - 'Operations in Queue', - 'Queue using 2 stacks', - 'Interview problems on Stack & Queue' - ] - }, - { - title: 'LinkedList', - classes: 'Classes 21-22', - subtopics: [ - 'Intro to LinkedList', - 'Implementation of LinkedList', - 'Operations in LinkedList', - 'Cycle detection Algorithms', - 'Problems based on LinkedList' - ] - }, - { - title: 'Binary Trees', - classes: 'Classes 23-24', - subtopics: [ - 'Implementation of Binary Trees', - 'Tree traversal- inorder, preorder, postorder', - 'Searching Algorithms- DFS and BFS', - 'Calculate- hieght, depth, diameter of tree', - 'Implementation of Binary Search Tree', - 'AVL Trees & Rotations', - 'Interview problems on BT & BST' - ] - }, - { - title: 'Heap & HashMap', - classes: 'Classes 25-26', - subtopics: [ - 'Implementation of Heaps', - 'HeapSort with complexity analysis', - 'Concept of Hashing', - 'HashMap implementation using LinkedList', - 'Problems on Hashmap & Heaps' - ] - }, - { - title: 'Graph', - classes: 'Classes 27-28', - subtopics: [ - 'Terminologies in Graph', - 'EdgeList implementation', - 'AdjacencyList implementation', - 'AdjacencyMap implementation', - 'Searching Algorithms- DFS and BFS', - 'Connected component, Cycle detection', - "Kruskal's, Dijkstra's, Prim's Algorithms" - ] - }, - { - title: 'Dynamic Programming', - classes: 'Classes 29-30', - subtopics: [ - 'Understanding the concept in Dynamic Programming', - 'Understanding overlapping subproblems', - 'Memoization vs Tabulation', - 'Top down & bottom-up approach', - '0-1 KnapSack problem', - 'Wildcard pattern problem', - 'Egg drop problem', - 'Matrix chain multiplication' - ] - } - ] - } - ], - slides: [ - { - heading: '', - subheading: '', - image: '/static/images/backs/dsa.png' - } - ], - tags: [ - 'Problem Solving', - 'Tree', - 'Graph', - 'Algorithms', - 'Data Structures', - 'Recursion', - 'Pointer', - 'Backtracking', - 'Dynamic Programming', - 'Stack', - 'Queue', - 'Sets', - 'Bit Masking', - 'Interview Prep' - ], - overview: [ - 'Every students have in their mind that why to study Data Structure. How it helps me in real life problem? Data Structures are the most important skills for a person belonging to computer-science background to understand the nature of problems, develop the logic to solve a problem in an optimised way with an efficient use of appropriate Data Structures.', - 'From Competitive programming to development, the first step on the success ladder will be to master in Data Structures & Algorithms. To solve any real-life problem, we use an algorithm, but is that algorithm is the most optimised and efficient one? Today, every company believes that a person with strong DSA skills would be a perfect candidate to hire!' - ], - faqs: [ - { - title: 'Will this help me with my career path?', - answer: - 'Yes. If you learn well, all that the course intends to teach, you’ll be able to impress quite a few interviewers across quite a few fine companies.' - }, - { - title: 'How your doubts will get resolved?', - answer: - 'We have an army of TA’s who are available in different time slots to resolve all your doubts. You can also interact with faculty through Slack.' - }, - { - title: 'Is this course suitable for me?', - answer: - 'Definitely! If you want to shift to software developer career path, then this course is perfect for you!' - } - ] - }; - \ No newline at end of file + difficulty: 'Foundation', + duration: '40 Live Lectures', + level: 'Level 1', + link: '/ds-algo-with-cpp', + domain: 'Algorithms & Complexities', + title: 'Data Structures and Algorithms with C++', + started: '', + upcoming: 'June 20th (Weekdays)', + mentors: ['nityanand'], + language: 'Hindi', + default: 0, + schedule: [ + { + courseId: 'cds0121', + dates: '20th June - 28th Aug', + days: 'Mon, Wed, Fri, Sun', + timing: '06:00 PM - 08:00 PM (IST)', + link: '', + priceCut: '', + price: '₹ 12,000', + priceId: 'price_1IjK7oLVU3L7vcSrdSju1Tu7', + duration: '40 Live Lectures (2 hrs)', + mentor: 'Nityanand Rai', + language: 'Hindi', + active: true + } + ], + projects: [ + { + title: 'Automatic Sudoku Solver', + img: '/static/images/courses/projects/sudoku.jpg' + }, + { + title: 'File Encryption and Compression', + img: '/static/images/courses/projects/security.jpg' + }, + { + title: 'Splitwise Cashflow Minimization', + img: '/static/images/courses/projects/split.png' + }, + { + title: 'Search routes like Google Maps', + img: '/static/images/courses/projects/maps.png' + }, + { + title: 'Git Version Control Replica', + img: '/static/images/courses/projects/git.png' + } + ], + + sections: [ + { + title: 'C++ Foundation Constructs', + classes: 'Classes 01-20', + topics: [ + { + title: 'Getting started with C++', + classes: 'Classes 1-3', + subtopics: [ + 'Flowcharts & Pseudocode', + 'Control Flow Statements ', + 'Setting up Coding Environment', + 'Primitive data-types', + 'Input-Output on online judge', + 'Coding standards in C++', + 'Methods along with problems', + 'Setting up debugger' + ] + }, + { + title: '1D and 2D Arrays', + classes: 'Classes 4-7', + subtopics: [ + 'Introduction of arrays', + 'Input-output & traversing', + 'Linear Search & Binary Search', + 'Selection sort, Bubble sort, Insertion sort, Count sort', + 'Multi-Dimensional arrays', + 'Rotation in arrays' + ] + }, + { + title: 'Number theory & Bitmasking', + classes: 'Classes 8-9', + subtopics: [ + 'Euclidean algorithms', + 'Sieve of eratosthenes', + 'Puzzle problems', + 'Bitwise operators', + 'Advantages & cost-effectiveness', + 'Backtracking with Bitmasking', + 'Interview problems' + ] + }, + { + title: 'String and Operations', + classes: 'Classes 10-11', + subtopics: [ + 'Intro to Strings in C++', + 'Mutability and behavior', + 'String operations', + 'String operations optimization', + 'String Manipulation' + ] + }, + { + title: 'Space and Time complexity analysis', + classes: 'Classes 12', + subtopics: [ + 'Best case, worst case and average case', + 'Sandwich theorem, recurrence relation', + 'Theta, Big-oh, Omega notations', + 'Understanding complexity of loops', + 'Auxiliary vs Total space', + 'Static & Dynamic Memory Allocation' + ] + }, + { + title: 'Recursion & Backtracking', + classes: 'Classes 13-16', + subtopics: [ + 'Recursion- what, why, when?', + 'Control flow & stack trace', + 'understanding recursive tree', + 'Merge sort & Quick sort', + 'Interview problems on Recursion', + 'Backtracking-Sudoku solver, N-Queens, lexo-permute' + ] + }, + { + title: 'Object Oriented Programming', + classes: 'Classes 17-18', + subtopics: [ + 'Classes & Objects', + 'Constructors, states & behaviors', + 'Abstraction, Inheritance, Polymorphism, Encapsulation', + 'Access modifiers', + 'Static & non-static' + ] + } + ] + }, + { + title: 'Data Structure & Algorithms', + classes: 'Classes 20-40', + topics: [ + { + title: 'Stacks & Queues', + classes: 'Classes 19-20', + subtopics: [ + 'Stack Implementation', + 'Operations in Stack', + 'Stack using Array & LinkedList', + 'Push efficient & Pop efficient Stacks', + 'Queue Implementation', + 'Operations in Queue', + 'Queue using 2 stacks', + 'Interview problems on Stack & Queue' + ] + }, + { + title: 'LinkedList', + classes: 'Classes 21-22', + subtopics: [ + 'Intro to LinkedList', + 'Implementation of LinkedList', + 'Operations in LinkedList', + 'Cycle detection Algorithms', + 'Problems based on LinkedList' + ] + }, + { + title: 'Binary Trees', + classes: 'Classes 23-24', + subtopics: [ + 'Implementation of Binary Trees', + 'Tree traversal- inorder, preorder, postorder', + 'Searching Algorithms- DFS and BFS', + 'Calculate- hieght, depth, diameter of tree', + 'Implementation of Binary Search Tree', + 'AVL Trees & Rotations', + 'Interview problems on BT & BST' + ] + }, + { + title: 'Heap & HashMap', + classes: 'Classes 25-26', + subtopics: [ + 'Implementation of Heaps', + 'HeapSort with complexity analysis', + 'Concept of Hashing', + 'HashMap implementation using LinkedList', + 'Problems on Hashmap & Heaps' + ] + }, + { + title: 'Graph', + classes: 'Classes 27-28', + subtopics: [ + 'Terminologies in Graph', + 'EdgeList implementation', + 'AdjacencyList implementation', + 'AdjacencyMap implementation', + 'Searching Algorithms- DFS and BFS', + 'Connected component, Cycle detection', + "Kruskal's, Dijkstra's, Prim's Algorithms" + ] + }, + { + title: 'Dynamic Programming', + classes: 'Classes 29-30', + subtopics: [ + 'Understanding the concept in Dynamic Programming', + 'Understanding overlapping subproblems', + 'Memoization vs Tabulation', + 'Top down & bottom-up approach', + '0-1 KnapSack problem', + 'Wildcard pattern problem', + 'Egg drop problem', + 'Matrix chain multiplication' + ] + } + ] + } + ], + slides: [ + { + heading: '', + subheading: '', + image: '/static/images/backs/dsa.png' + } + ], + tags: [ + 'Problem Solving', + 'Tree', + 'Graph', + 'Algorithms', + 'Data Structures', + 'Recursion', + 'Pointer', + 'Backtracking', + 'Dynamic Programming', + 'Stack', + 'Queue', + 'Sets', + 'Bit Masking', + 'Interview Prep' + ], + overview: [ + 'Every students have in their mind that why to study Data Structure. How it helps me in real life problem? Data Structures are the most important skills for a person belonging to computer-science background to understand the nature of problems, develop the logic to solve a problem in an optimised way with an efficient use of appropriate Data Structures.', + 'From Competitive programming to development, the first step on the success ladder will be to master in Data Structures & Algorithms. To solve any real-life problem, we use an algorithm, but is that algorithm is the most optimised and efficient one? Today, every company believes that a person with strong DSA skills would be a perfect candidate to hire!' + ], + faqs: [ + { + title: 'Will this help me with my career path?', + answer: + 'Yes. If you learn well, all that the course intends to teach, you’ll be able to impress quite a few interviewers across quite a few fine companies.' + }, + { + title: 'How your doubts will get resolved?', + answer: + 'We have an army of TA’s who are available in different time slots to resolve all your doubts. You can also interact with faculty through Slack.' + }, + { + title: 'Is this course suitable for me?', + answer: + 'Definitely! If you want to shift to software developer career path, then this course is perfect for you!' + } + ] +}; diff --git a/src/data/courses/training/CompetitiveCpp.js b/src/data/courses/training/CompetitiveCpp.js index eacde602..2c0a8381 100644 --- a/src/data/courses/training/CompetitiveCpp.js +++ b/src/data/courses/training/CompetitiveCpp.js @@ -76,7 +76,7 @@ export const competitiveCpp = { 'Linear Search & Binary Search', 'Selection sort, Bubble sort, Insertion sort, Count sort', 'Multi-Dimensional arrays', - 'Rotation in arrays', + 'Rotation in arrays' ] }, { @@ -135,7 +135,7 @@ export const competitiveCpp = { 'Constructors, states & behaviors', 'Abstraction, Inheritance, Polymorphism, Encapsulation', 'Access modifiers', - 'Static & non-static', + 'Static & non-static' ] } ] diff --git a/src/data/courses/training/index.js b/src/data/courses/training/index.js index 5fbb94cb..e69928d7 100644 --- a/src/data/courses/training/index.js +++ b/src/data/courses/training/index.js @@ -2,6 +2,11 @@ import { machineLearning } from './MachineLearning'; import { webDevelopment } from './WebDevelopment'; import { competitiveJava } from './CompetitiveJava'; import { competitiveCpp } from './CompetitiveCpp'; -const advanced = { machineLearning, competitiveCpp, webDevelopment, competitiveJava }; +const advanced = { + machineLearning, + competitiveCpp, + webDevelopment, + competitiveJava +}; export default advanced; diff --git a/src/data/recommendations.js b/src/data/recommendations.js index 431a657b..f532b2db 100644 --- a/src/data/recommendations.js +++ b/src/data/recommendations.js @@ -118,5 +118,5 @@ export const recommendations = [ avatar: '/static/reviews/students/AswinBarath.png', text: 'I took the Zomato Bootcamp from Code for Cause and I really liked their live & interactive sessions where we learn to build a clone from scratch with just basic knowledge of JavaScript.' - }, + } ]; diff --git a/src/views/pages/Bootcamp/ApplyModal.js b/src/views/pages/Bootcamp/ApplyModal.js index b7aa90b4..de35fc5e 100644 --- a/src/views/pages/Bootcamp/ApplyModal.js +++ b/src/views/pages/Bootcamp/ApplyModal.js @@ -47,7 +47,7 @@ export default function ApplyModal({ {...rest} fullWidth={fullWidth} > - {course.enabled ? "Register Now" : "Applications Closed"} + {course.enabled ? 'Register Now' : 'Applications Closed'} diff --git a/src/views/pages/CLView/Apply.js b/src/views/pages/CLView/Apply.js index 707a63c7..0c52c3a2 100755 --- a/src/views/pages/CLView/Apply.js +++ b/src/views/pages/CLView/Apply.js @@ -3,7 +3,7 @@ import PropTypes from 'prop-types'; import clsx from 'clsx'; import { Box, Grid, Typography, makeStyles, Hidden } from '@material-ui/core'; -import ApplyNowModal from './ApplyNowModal'; +import ApplyNowModal from '../../../components/forms/ApplyNowModal'; const useStyles = makeStyles(theme => ({ root: { diff --git a/src/views/pages/CLView/CTA.js b/src/views/pages/CLView/CTA.js index b9432507..49e0ddca 100755 --- a/src/views/pages/CLView/CTA.js +++ b/src/views/pages/CLView/CTA.js @@ -11,6 +11,7 @@ import { Button, Hidden } from '@material-ui/core'; +import VolunteerFormModal from 'src/components/forms/VolunteerForm'; const useStyles = makeStyles(theme => ({ root: { @@ -266,17 +267,9 @@ function CTA({ className, ...rest }) { - + /> diff --git a/src/views/pages/CLView/Hero.js b/src/views/pages/CLView/Hero.js index b0bfabd2..3aba2139 100755 --- a/src/views/pages/CLView/Hero.js +++ b/src/views/pages/CLView/Hero.js @@ -1,6 +1,6 @@ import React from 'react'; import PropTypes from 'prop-types'; -import ApplyNowModal from './ApplyNowModal'; +import ApplyNowModal from '../../../components/forms/ApplyNowModal'; import HeroWithOneButton from '../../../components/Hero/HeroWithOneButton'; function Hero({ className, ...rest }) { diff --git a/src/views/pages/Course/CoursePage/index.js b/src/views/pages/Course/CoursePage/index.js index 5319a6dd..0fb7fa2c 100755 --- a/src/views/pages/Course/CoursePage/index.js +++ b/src/views/pages/Course/CoursePage/index.js @@ -28,7 +28,7 @@ function CoursePage({ course }) { return ( -
+
{/* */} {/* */} diff --git a/src/views/pages/Course/Header.js b/src/views/pages/Course/Header.js index 1567ec75..ec7fa850 100644 --- a/src/views/pages/Course/Header.js +++ b/src/views/pages/Course/Header.js @@ -28,19 +28,24 @@ function Header({ course, className, ...rest }) { return (
- + - {course.schedule[course.default].active ? '🕊️ Use Coupon code : EARLYSAVE60 and get Flat 60% early bird discount 🕊️' : 'Oops! The seats are full. ✅ We will be happy to see you in the next batch! 😊'} + {course.schedule[course.default].active + ? '🕊️ Use Coupon code : EARLYSAVE60 and get Flat 60% early bird discount 🕊️' + : 'Oops! The seats are full. ✅ We will be happy to see you in the next batch! 😊'} - {course.schedule[course.default].active ? : undefined} + {course.schedule[course.default].active ? ( + + ) : ( + undefined + )}
); @@ -57,7 +62,7 @@ const Completionist = () => ( const timeString = (days, hours, minutes, seconds) => { if (days > 0) { - return `Ending in ${days} ${days === 1 ? 'Day':'Days'}`; + return `Ending in ${days} ${days === 1 ? 'Day' : 'Days'}`; } else { return `Ending in ${String(hours).padStart(2, '0')} : ${String( minutes diff --git a/src/views/pages/Course/Schedule.js b/src/views/pages/Course/Schedule.js index 6d8aa01e..adaaaf1e 100755 --- a/src/views/pages/Course/Schedule.js +++ b/src/views/pages/Course/Schedule.js @@ -297,26 +297,26 @@ function BatchDropBox({ course, batch, batchIndex, expanded, setExpanded }) { {batch.price} - {batch.active?( - - Apply coupon EARLYSAVE60 to get this course in{' '} - - ₹{' '} - {parseInt( - course.schedule[course.default].price.match(/\d+/g).join('') - ) * 0.4} - - - ) : undefined} - + {batch.active ? ( + + Apply coupon EARLYSAVE60 to get this course in{' '} + + ₹{' '} + {parseInt( + course.schedule[course.default].price.match(/\d+/g).join('') + ) * 0.4} + + + ) : ( + undefined + )} - - + {/* */} diff --git a/src/views/pages/HomeView/Promo.js b/src/views/pages/HomeView/Promo.js index d397dee4..b45cb4dc 100644 --- a/src/views/pages/HomeView/Promo.js +++ b/src/views/pages/HomeView/Promo.js @@ -121,8 +121,8 @@ function Promo({ benefits, className, ...rest }) { key={index} style={{ height: '100%', - display: "flex", - flexDirection: "column" + display: 'flex', + flexDirection: 'column' }} raised className={classes.cards} @@ -147,9 +147,14 @@ function Promo({ benefits, className, ...rest }) { flexDirection: 'column' }} > - {item.desc} + + {item.desc} + {item.disabled ? ( undefined ) : ( diff --git a/src/views/pages/SpecialCourse/ApplyModal.js b/src/views/pages/SpecialCourse/ApplyModal.js index 56dadb72..3ca7f9b8 100644 --- a/src/views/pages/SpecialCourse/ApplyModal.js +++ b/src/views/pages/SpecialCourse/ApplyModal.js @@ -143,7 +143,7 @@ export default function ApplyModal({ .fill(1) .map((x, y) => x + y) .reverse(); - + const theme = createMuiTheme({ palette: { action: { @@ -322,7 +322,8 @@ export default function ApplyModal({ - You will be redirected to payment page. For fail-safe yous will also get email containing payment link (expires in 15 minutes). + You will be redirected to payment page. For fail-safe yous will + also get email containing payment link (expires in 15 minutes). diff --git a/src/views/pages/SpecialCourse/Header.js b/src/views/pages/SpecialCourse/Header.js index 77a12e38..1b6f7073 100644 --- a/src/views/pages/SpecialCourse/Header.js +++ b/src/views/pages/SpecialCourse/Header.js @@ -28,19 +28,24 @@ function Header({ course, className, ...rest }) { return (
- + - {course.active ? `Offering ${course.discount} On this Batch.` : 'Oops! The seats are full. ✅ We will be happy to see you in the next batch! 😊'} + {course.active + ? `Offering ${course.discount} On this Batch.` + : 'Oops! The seats are full. ✅ We will be happy to see you in the next batch! 😊'} - {course.active ? : undefined} + {course.active ? ( + + ) : ( + undefined + )}
); @@ -57,7 +62,7 @@ const Completionist = () => ( const timeString = (days, hours, minutes, seconds) => { if (days > 0) { - return `Ending in ${days} ${days === 1 ? 'Day':'Days'}`; + return `Ending in ${days} ${days === 1 ? 'Day' : 'Days'}`; } else { return `Ending in ${String(hours).padStart(2, '0')} : ${String( minutes diff --git a/src/views/pages/SpecialCourse/Process.js b/src/views/pages/SpecialCourse/Process.js index 7c77dc70..52189c11 100644 --- a/src/views/pages/SpecialCourse/Process.js +++ b/src/views/pages/SpecialCourse/Process.js @@ -71,7 +71,9 @@ const timeString = (days, hours, minutes, seconds) => { if (days > 0) { return `Ending in ${days} ${days === 1 ? 'Day' : 'Days'}`; } else { - return `Ending in ${String(hours).padStart(2, "0")} : ${String(minutes).padStart(2, "0")} : ${String(seconds).padStart(2, "0")}`; + return `Ending in ${String(hours).padStart(2, '0')} : ${String( + minutes + ).padStart(2, '0')} : ${String(seconds).padStart(2, '0')}`; } }; diff --git a/src/views/pages/common/Recommendations.js b/src/views/pages/common/Recommendations.js index 4d684879..349b2497 100644 --- a/src/views/pages/common/Recommendations.js +++ b/src/views/pages/common/Recommendations.js @@ -1,4 +1,4 @@ -import React, {useEffect, useState} from 'react'; +import React, { useEffect, useState } from 'react'; import { makeStyles } from '@material-ui/core/styles'; import { @@ -129,12 +129,12 @@ const useStyles = makeStyles(theme => ({ export default function Recommendations() { let [reviews, setReviews] = useState([]); - useEffect(function(){ + useEffect(function() { let set = new Set(); let list = []; - while(set.size<8){ + while (set.size < 8) { let random = Math.floor(Math.random() * 20); - if(!set.has(recommendations[random])){ + if (!set.has(recommendations[random])) { set.add(recommendations[random]); list.push(recommendations[random]); } From 8c1d0f4eb204ad1febfbf3862a3b1cbb294cc2ed Mon Sep 17 00:00:00 2001 From: Abhishek-kumar09 Date: Wed, 12 May 2021 13:07:49 +0530 Subject: [PATCH 2/3] Remove require field from contact --- src/components/forms/VolunteerForm.js | 1 - 1 file changed, 1 deletion(-) diff --git a/src/components/forms/VolunteerForm.js b/src/components/forms/VolunteerForm.js index 6fa66524..5cf99e15 100644 --- a/src/components/forms/VolunteerForm.js +++ b/src/components/forms/VolunteerForm.js @@ -167,7 +167,6 @@ export default function VolunteerFormModal({ className }) { Date: Wed, 12 May 2021 13:53:45 +0530 Subject: [PATCH 3/3] make fields optional and remove country code --- src/components/forms/VolunteerForm.js | 72 +++++++-------------------- 1 file changed, 17 insertions(+), 55 deletions(-) diff --git a/src/components/forms/VolunteerForm.js b/src/components/forms/VolunteerForm.js index 5cf99e15..47a89eac 100644 --- a/src/components/forms/VolunteerForm.js +++ b/src/components/forms/VolunteerForm.js @@ -6,17 +6,11 @@ import { DialogContentText, DialogTitle, Button, - Typography, - MenuItem, - Grid + Typography } from '@material-ui/core'; import { makeStyles } from '@material-ui/core/styles'; import CircularProgress from '@material-ui/core/CircularProgress'; -import { - ValidatorForm, - TextValidator, - SelectValidator -} from 'react-material-ui-form-validator'; +import { ValidatorForm, TextValidator } from 'react-material-ui-form-validator'; import { useSnackbar } from 'notistack'; import axios from 'axios'; @@ -72,8 +66,7 @@ export default function VolunteerFormModal({ className }) { e.preventDefault(); axios({ method: 'post', - url: - 'https://us-central1-codeforcauseorg.cloudfunctions.net/widgets/leads', // TO CHANGE****************** + url: 'https://us-central1-codeforcauseorg.cloudfunctions.net/widgets', // TO CHANGE****************** data: formData }) .then(response => { @@ -86,11 +79,6 @@ export default function VolunteerFormModal({ className }) { }); }; - const countryCodes = Array(100) - .fill(1) - .map((x, y) => x + y) - .reverse(); - return (