Orientation Session - Supreme Batch
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!
Lecture 2:- Orientation Session - Supreme Batch
A comprehensive program that covers the fundamentals of data structures and algorithms. It includes lectures and exercises to help students design and implement efficient solutions. This course is suitable for beginners and experienced programmers and aims to prepare students for technical interviews and placement exams.
- 1. Numeric Hollow Half Pyramid
- 2. Numeric Hollow Inverted Half Pyramid
- 3. Numeric Palindrome Equilateral Pyramid
- 4. Solid Half Diamond
- 5. Fancy Pattern - 1
- 6. Fancy Pattern - 2
- 7. Fancy Pattern - 3
- 8. Floyd's Triangle Pattern
- 9. Pascal's Triangle Pattern
- 10. Butterfly Pattern
- 11. Display Area Of Circle
- 12. Given Number Is Even or Odd
- 13. Find The Factorial
- 14. Check Given Number Prime or Not
- 15. Print All Prime From 1 to N
- 16. Reverse Integer
- 17. Set the Kth Bit
- 18. Convert the Temperature
- 1. Valid Anagram
- 2. Reverse Only Letters
- 3. Longest Common Prefix
- 4. Reverse Vowels Of A String
- 5. Isomorphic Strings
- 6. Reorganise String
- 7. Group Anagrams
- 8. Longest Palindromic Substring
- 9. Find The Index Of First Occurence in a String
- 10. String To Integer (atoi)
- 11. String Compression
- 12. Integer To Romans
- 13. Zig-Zag Conversion
- 14. Largest Number
- 1. Last Occurence Of A Char
- 2. Reverse A String RE
- 3. Add Strings RE
- 4. Palindrome Check RE
- 5. Remove All Occurrences of a Substring
- 6. Print All Subarrays Using RE
- 7. Buy & Sell Stocks
- 8. House Robber Problem
- 9. Integer to English Words
- 10. Wild Card Matching Matching
- 11. Perfect Squares
- 12. Minimum Cost For Tickets
- 13. Number Of Dice Roll With Target Sum
- 1. OOPs Class-1
- 2. OOPs Class-2
- 3. OOPs Class-3
- 4. const keyword Initialization list MACROS
- 5. Shallow vs Deep Copy
- 6. Local & Global Variables
- 7. Static Keyword In Class
- 8. Abstraction In C++
- 9. Inline Functions
- 10. Friend Keyword In C++
- 11. Can Constructor Be Made Private
- 12. Virtual Constructor VS Virtual Destructor
- 13. Memory Layout Of A Program
- 1. Print Kth Node From The End
- 2. Intersection Of 2 Link Lists
- 3. Merge Two Sorted Lists
- 4. Sort List Using Merge Sort
- 5. Flatten Linked List
- 6. Copy List with Random Pointer
- 7. Rotate List
- 8. Delete N Nodes After M Nodes
- 9. Find minmax number between critical points (LC-2058)
- 10. Merge Nodes In Between Zeros
- 1. Remove All Adjacent Strings
- 2. Minimum Bracket Reversal
- 3. Next Greater Element In LL
- 4. Celebrity Problem
- 5. N Stacks In An Array
- 6. Online Stock Span
- 7. Simplify Path
- 8. Check If Word Is Valid After Substitutions
- 9. Decode String
- 10. Max Rectangle In Binary Matrix
- 11. Car Fleet I
- 12. Car Fleet-II
Frequently Asked Questions (FAQs)
How do I register on Sciaku.com?
How can I enroll in a course on Sciaku.com?
Are there free courses available on Sciaku.com?
How do I purchase a paid course on Sciaku.com?
What payment methods are accepted on Sciaku.com?
How will I access the course content after purchasing a course?
How long do I have access to a purchased course on Sciaku.com?
How do I contact the admin for assistance or support?
Can I get a refund for a course I've purchased?
How does the admin grant access to a course after payment?
Comments: 2
SCIAKU Team please upload 1st video of TREE please please please, please
I bought this course, it worth it!
Hi i want to buy this course but you dont have master card payment method please let me know how i can buy it
Dear mk.info.work, Now we have all types of payment options. If you need to purchase just checkout our official website