Login Required
FFT Code 1
Dear Sciaku Learner you are not logged in or not enrolled in this course.Please Click on login or enroll now button.
If you have any query feel free to chat us!
Happy Coding! Happy Learning!
FFT Code 1
1 Prerequisites
🎬 12 videos 2 Intro To Competitive Programming
🎬 2 videos 3 Lecture Pointers(Optional To Understand C++)
🎬 6 videos 4 Lecture Dynamic Allocation(Optional To Understand C++)
🎬 7 videos 5 Lecture Basics Of Recursion
🎬 12 videos 6 Time and Space Complexity Analysis
🎬 18 videos - 1. Order Complexity Analysis
- 2. Theoretical Analysis
- 3. Linear Search time complexity
- 4. Insertion Sort time complexity
- 5. Selection Sort time complexity
- 6. Theoretical Analysis - Recursive Algorithm
- 7. Merge Sort Time complexity
- 8. Fibonacci Time Complexity Analysis
- 9. Space Complexity Analysis
- 10. Merge Sort Space Complexity Analysis
- 11. Fibonacci Space Complexity Analysis
- 12. Kadane's Algorithm
- 13. Live Question - 1 Explain
- 14. Live Question - 1 Code
- 15. Live Question - 2 Explain
- 16. Live Question - 2 Code
- 17. Live Question - 3 Explain
- 18. Live Question - 3 Code
7 Language Tools
🎬 10 videos - 1. STL - Data Structures
- 2. STL - Data Structures - 2
- 3. STL - Functions
- 4. STL Examples
- 5. Live Question - 1 Hussain Set
- 6. Live Question - 1 Hussain Set(Code)
- 7. Live Question 2 - Voters List
- 8. Live Question 2 - Voters List(Code)
- 9. Live Question - 3 Permutation
- 10. Live Question - 3 Permutation Palindrome code
8 Language Tools + Time and Complexity Assignment
🎬 5 videos 9 Searching & Sorting Applications
🎬 12 videos 10 Advanced Recursion
🎬 13 videos - 1. Recursion and Strings
- 2. Replace Character Recursively Hint
- 3. Remove Duplicates Recursively Hint
- 4. Merge Sort Algo
- 5. Merge Sort Code Hint
- 6. Quick Sort Algo
- 7. Quick Sort Code Hint
- 8. Strings
- 9. Return Subsequences of a String
- 10. Return Keypad Approach
- 11. Print Subsequences of a String
- 12. Print Keypad Combinations Approach
- 13. Print Keypad Combinations Code Hint
11 Backtracking
🎬 9 videos 12 Assignment - Backtracking , Binary Search And Merge Sort Problems
🎬 3 videos 13 Bit Manipulation
🎬 7 videos 14 Adhoc Problems
🎬 6 videos 15 Modulo Arithmetic
🎬 5 videos 16 Dynamic Programming - 1
🎬 25 videos - 1. Basics Of Dp - Fibonacci Numbers
- 2. Alpha Code
- 3. AlphaCode-Question Hint
- 4. Longest Increasing Subsequence
- 5. Coin Change And StairCase
- 6. Minimum Cost
- 7. Magic Grid
- 8. Magic Grid Problem Hint
- 9. Maximum Sum Rectangle
- 10. Maximum Sum Rectangle Hint
- 11. Live Question - 1 Code
- 12. Live Question - 1 Explain
- 13. Live Question - 2 Code
- 14. Live Question - 2 Explain
- 15. Boredom Hint
- 16. Count BSTs Hint
- 17. Loot Houses Hint
- 18. Maximum Square Matrix With All Zeros
- 19. Minimum Number of Chocolates
- 20. Adjacent Bit Counts
- 21. Alyona and Spreadsheet
- 22. Angry Children
- 23. Jon Snow and his favourite number
- 24. Roy and Coin Boxes
- 25. Vanya and GCD
17 Dynamic Programming - 2
🎬 13 videos - 1. Longest Common Subsequence
- 2. LCS - Iterative
- 3. Edit Distance - Problem Hint
- 4. Balika Vadhu - Problem Hint
- 5. Knapsnack - Explain
- 6. Knapsnack -Iterative
- 7. Subset Sum Explain
- 8. Subset Sum Extended
- 9. Trader Profit
- 10. Charlie and Pilots Hint
- 11. Square Brackets
- 12. Smallest Super - Sequence Hint
- 13. Shortest Subsequence Hint
18 Greedy Problems
🎬 13 videos - 1. Intro To Greedy Techniques
- 2. Minimum Absolute Difference In Array
- 3. Nikunj And Donuts - Explain
- 4. Fractional Knapsack Hint
- 5. Fractional Knapsack - Code
- 6. Weighted Job Scheduling Hint
- 7. Weighted Job Scheduling - Code
- 8. Live Problem - 1 Explain
- 9. Live Problem - 1 Code
- 10. Live Problem - 2 Explain
- 11. Live Problem - 2 Code
- 12. Problem discussion
- 13. Winning Lottery
19 Segment Trees
🎬 11 videos - 1. Introduction To Segment Tree
- 2. How To Build A Segment Tree
- 3. Update On A Segment Tree
- 4. Query On A Segment Tree
- 5. Size Of Segment Tree
- 6. Segment Tree Max Pair Sum
- 7. Maximum Sum In Subarray Video
- 8. Lazy Propagation Intro
- 9. Lazy Propagation Code - Update
- 10. Sum Of Squares Video
- 11. 2 vs 3 Hint
20 Graphs 1
🎬 17 videos - 1. Graphs Introduction
- 2. Graphs Terminology
- 3. Graphs Implementation
- 4. Adjacency Matrix
- 5. BFS Traversal
- 6. Solution - BFS Traversal
- 7. BFS & DFS for disconnected graph
- 8. Has path
- 9. Get Path - DFS
- 10. Get Path - BFS
- 11. Code - Is Connected Hint
- 12. Return all connected components
- 13. Weighted & Directed Graphs
- 14. Islands Hint
- 15. Coding Ninjas Hint
- 16. Largest Piece Hint
- 17. Cycle Hint
21 Graphs 2
🎬 14 videos - 1. Minimum Spanning Trees
- 2. Intro To Kruskal's Algorithm
- 3. Detect Cycle
- 4. Union Find Algorithm
- 5. How To Code Kruskal's Algorithm
- 6. Kruskal's Algorithm Code
- 7. Complexity Of Kruskal's Algorithm
- 8. Prim's Algorithm
- 9. Prim's Algorithm Code
- 10. Complexity Of Prim's Algorithm
- 11. Dijkstra's Algorithm
- 12. How To Code Dijsktra's Algorithm
- 13. Dijkstra's Algorithm Code
- 14. Complexity Of Dijsktra's Algorithm
22 Advanced Graphs
🎬 12 videos 23 String Algorithms
🎬 12 videos - 1. Pattern Matching Basics
- 2. KMP Algorithm
- 3. Longest Prefix Suffix Explain
- 4. Longest Prefix Suffix Code
- 5. KMP Code
- 6. Z - Algorithm Pattern Matching
- 7. Z - Algorithm Continue
- 8. Z - Algorithm Code 1
- 9. Z - Algorithm Code 2
- 10. Longest Palindromic Substring Basics
- 11. Longest Palindromic Substring - Code
- 12. Palindromic Substrings Hint
24 Tries
🎬 7 videos 25 Fenwick Tree
🎬 13 videos - 1. Intro To Fenwick Tree
- 2. Fenwick Tree Code
- 3. Fenwick Tree Continue
- 4. Coder Rating Explain
- 5. Coder Rating Code
- 6. Coder Rating Dry Run
- 7. Distinct Query Explain
- 8. Distinct Query Code
- 9. Coordinate Compression
- 10. OrderSet Problem - Explain
- 11. KQUERY Hint
- 12. Shil and Wave Sequence
- 13. INCSEQ Hint
26 DP & BitMasking
🎬 14 videos - 1. What is Bitmasking
- 2. More About Bitmasking
- 3. DP With Bitmasking
- 4. Minimum Cost For Jobs
- 5. Minimum Cost For Jobs Iteratively
- 6. Candy Hint
- 7. Ghost Type
- 8. Dilemma Explain
- 9. Dilemma Hint
- 10. Dilemma Code
- 11. Mehta and Bank Robbery - Explain
- 12. Mehta and Bank Robbery - Code
- 13. String Maker Hint
- 14. Number of APs Hint
27 Number Theory - 1
🎬 13 videos - 1. Find Prime Numbers From 1 To N
- 2. Find Prime Numbers From 1 To N - Code
- 3. Sieve Of Eratosthenes - Explain
- 4. Sieve Of Eratosthenes - Code
- 5. Sieve Of Eratosthenes - Complexity
- 6. GCD - Euclid Algorithm
- 7. Time Complexity Of Euclid Algo
- 8. GCD - Code
- 9. Diophantine Equations
- 10. Extended Euclid Algorithm
- 11. Extended Euclid Algorithm Code
- 12. Multiplicative Modulo Inverse
- 13. Multiplicative Modulo Inverse - Code
28 Applications Of NT - 1
🎬 10 videos 29 Number Theory - 2
🎬 5 videos 30 Number Theory - 3
🎬 17 videos - 1. Optimized Power Function
- 2. Modular_Exponentiation-Recursively
- 3. Modular_Exponentiation-Code
- 4. Modular_Exponentiation-Iteratively
- 5. Matrix_Exponentiation
- 6. Matrix_Exponentiation-Continue
- 7. Nth_Fibonaaci_Number-Logn
- 8. Recurrence Relations
- 9. FiboSum-Video
- 10. Fermat_s_Little_Theorem
- 11. Wilson_s_Theorem
- 12. Income_On_Nth_Day-Video
- 13. Cubic Square Hint
- 14. GCD Extreme Hint
- 15. Sanchit And Nuclear Reactor Hint
- 16. Innocent Swaps and His Emotions Hint
- 17. Sehwag And ETF Hint
31 Game Theory
🎬 10 videos 32 Computational Geometry
🎬 7 videos 33 FFT
🎬 17 videos - 1. Multiply Two Polynomials
- 2. Applying Point Value Form
- 3. Point Value Form
- 4. Summarizing Above
- 5. Overview of Complex Numbers
- 6. Lemma 1 and 2
- 7. Lemma 3 and 4
- 8. Lemma 5
- 9. Intro To FFT
- 10. FFT - Continue - 1
- 11. FFT - Continue - 2
- 12. Summarizing Above 1
- 13. Time Complexity of FFT
- 14. FFT Code 1
- 15. FFT Code 2
- 16. Testing FFT Code
- 17. Multiply Polynomials using FFT
34 HLD
🎬 6 videos card_membership Course Certificate
Complete 100% to unlock your certificate
campaign Sponsored
Course Discussion
2 Comments
vs7977722 Oct 17, 2023 at 10:37 PM
From dynamic programming 2 I'm not able to see any of the videos what to do??
na3744 Mar 12, 2024 at 8:33 PM
same here
Frequently Asked Questions About Sciaku Courses & Services
Quick answers to common questions about our courses, quizzes, and learning platform
How do I register on Sciaku.com?
Course Related 1 min read
To register on Sciaku.com, click on the "Signup" button on the homepage, fill in the required information, and create your account. Once registered, you can log in using your credentials.
How can I enroll in a course on Sciaku.com?
Course Related 1 min read
After logging in, browse the available courses, and click on the desired course. On the course page, click the "Enroll" button. You'll gain access to the course materials and resources.
Are there free courses available on Sciaku.com?
Course Related 1 min read
Yes, Sciaku.com offers a variety of free courses. You can explore and enroll in these courses without any payment.
How do I purchase a paid course on Sciaku.com?
Course Related 1 min read
To purchase a paid course, click on the course you're interested in, and choose the "Purchase" option. Follow the on-screen instructions to complete the payment process securely.
What payment methods are accepted on Sciaku.com?
Course Related 1 min read
Sciaku.com accepts various payment methods, including credit/debit cards and other secure online payment options. Ensure your preferred payment method is supported during the checkout process.
How will I access the course content after purchasing a course?
Course Related 1 min read
Upon successful payment, you will be granted access to the course immediately. Simply log in to your account, go to the "My Courses" section, and start learning from the course materials.
How long do I have access to a purchased course on Sciaku.com?
Course Related 1 min read
Once you've purchased a course, you'll have lifetime access to it. You can revisit the course materials and resources at any time.
How do I contact the admin for assistance or support?
Course Related 1 min read
If you need assistance, contact our support team by navigating to the "Contact Us" page. Fill out the form, and our admin will respond to your inquiries promptly.
Can I get a refund for a course I've purchased?
Course Related 1 min read
Refund policies may vary. Please refer to our "Refund Policy" page for detailed information on the conditions and process for obtaining a refund.
How does the admin grant access to a course after payment?
Course Related 1 min read
Upon successful payment, our admin team will verify the transaction, and once confirmed, they will grant you access to the purchased course. This process is typically completed within a short period.
Didn't find what you're looking for?
help_center Contact Support
please fix the problem then i will buy it