DataStructure and Algorithms Solutions with Supercool 💯
Відкрити в Telegram
DSA with supercool For paid projects:- Email :- supercool7151@gmail.com Follow me on social media https://linktr.ee/codemaking
Показати більше643
Підписники
Немає даних24 години
Немає даних7 днів
Немає даних30 день
Архів дописів
for job updates follow me on discord----> https://discord.com/channels/1005309661169324083/1063789653985075200
Java Basics Programs ---> https://github.com/Supercool-Coder/List-of-Java-Programs-for-Practice-/blob/main/README.md
https://linktr.ee/codemaking
DSA For Faang or Maang Companies
https://chat.whatsapp.com/GK9NADqt9lpGBB6KcMpvoW
Frontend Development
https://chat.whatsapp.com/CLtgpIBJP00CYnAnsyJkNS
Work hard for what you want because it won't come to you without a fight. You have to be strong and courageous and know that you can do anything you put your mind to. If somebody puts you down or criticises you, just keep on believing in yourself and turn it into something positive.
Discord Group --> https://discord.gg/9vDA5Pgd
𝗙𝗿𝗲𝗲 Google Certified Courses for 𝟮𝟬𝟮𝟯 🎯
1. Learn Python Basics for Data Analysis
🌀 https://lnkd.in/dRunXPtA
2. Data Science with Python
🌀https://lnkd.in/dkr4KGHD
3. Data Science Foundation
🌀https://lnkd.in/d5Dz7q8Y
4. Machine Learning Crash Course
🌀https://lnkd.in/dmZinF4p
Happy Learning !!!
A very happy new year to all of you..
Stay Healthy
Stay safe
Stay Happy..
Take care all of you..
📌Save Your time with Short Cuts
Ctrl + A - Select All
Ctrl + B - Bold
Ctrl + C - Copy
Ctrl + D - Fill
Ctrl + F - Find
Ctrl + G - Find next instance of text
Ctrl + H - Replace
Ctrl + I - Italic
Ctrl + K - Insert a hyperlink
Ctrl + N - New workbook
Ctrl + O - Open
Ctrl + P - Print
Ctrl + R - Nothing right
Ctrl + S - Save
Ctrl + U - Underlined
Ctrl + V - Paste
Ctrl W - Close
Ctrl + X - Cut
Ctrl + Y - Repeat
Ctrl + Z - Cancel
F1 - Help
F2 - Edition
F3 - Paste the name
F4 - Repeat the last action
F5 - Goto
F6 - Next Pane
F7 - Spell Check
F8 - Extension of the mode
F9 - Recalculate all workbooks
F10 - Activate Menubar
F11 - New graph
F12 - Save As
Shift + F1 - What is it?
Shift + F2 - Edit cell comment
Shift + F3 - Paste the function into the formula
Shift + F4 - Search Next
Shift + F5 - Find
Shift + F6 - Previous Panel
Shift + F8 - Add to the selection
Shift + F9 - Calculate the active worksheet
Shift + F10 - Popup menu display
Shift + F11 - New spreadsheet
Shift + F12 - Save
Ctrl + F3 - Set name
Ctrl + F4 - Close
Ctrl + F5 - XL, size of the restore window
Ctrl + F6 - Next Workbook Window
Shift + Ctrl + F6 - Previous Workbook Window
Ctrl + F7 - Move window
Ctrl + F8 - Resize Window
Ctrl + F9 - Minimize the workbook
Ctrl + F10 - Maximize or Restore Window
Ctrl + F11 - Inset 4.0 Macro sheet
Ctrl + F1 - Open File
Alt + F1 - Insert a graph
Alt + F2 - Save As
Alt + F4 - Output
Alt + F8 - Macro dialog
Alt + F11 - Visual Basic Editor
Ctrl + Shift + F3 - Create a name using the names of row and column labels
Ctrl + Shift + F6 - Previous Window
Ctrl + Shift + F12 - Printing
Alt + Shift + F1 - New spreadsheet
Alt + Shift + F2 - Save
Alt + = - AutoSum
Ctrl + `- Toggle value / display of the formula
Ctrl + Shift + A - Insert the argument names in the formula
Alt + down arrow - automatic view list
Alt + '- Format Style Dialog
Ctrl + Shift + ~ - General Format
Enjoy❤️
Some Keyboard Shortcuts, Hope this helps you all 😊🙌🏻
Love babbar k live Web Development course padhna hai guys .?
Only 50 rupees me
Web development k channel chahiye guys
Ways to make money with coding 🤑👉https://medium.com/@inprogrammer/many-ways-to-make-money-with-coding-cb776e90b4d4
Problem Of The Day
"Largest subtree sum in a tree"
Solve the problem to win points
Given a binary tree. The task is to find subtree with maximum sum in the tree and return its sum.
Example 1:
Input:
1
/ \
2 3
/ \ / \
4 5 6 7
Output: 28
Explanation:
As all the tree elements are positive,
the largest subtree sum is equal to
sum of all tree elements.
Example 2:
Input:
1
/ \
-2 3
/ \ / \
4 5 -6 2
Output: 7
Explanation:
Subtree with largest sum is :
-2
/ \
4 5
Also, entire tree sum is also 7.
Your Task:
You don't need to read input or print anything. Your task is to complete the function findLargestSubtreeSum() which takes the root of a binary tree and returns an integer.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(N)
Solve the problem
THINGS DOESN'T CHANGE IN A DAY, DOESN'T CHANGE OVERNIGHT. EVEN A SMALL PIMPLE DOESN'T DISAPPEAR EASILY AND YOU WANT YOUR LIFE TO BE SET IN A BLINK OF AN EYE. NO. IT'S GOING TO TAKE TIME. IT'S GOING TO ROAST YOU TILL YOUR ROOTS. TEST YOUR PATIENCE. SEE YOUR LIMITS. MAP YOUR DETERMINATION. BELIEVE ME IT'S GOING TO MAKE YOU CRY. MAKE YOU FEEL LIKE YOU'RE LOST. MAKE YOU FALL. MAKE YOU FEEL LIKE YOU'RE STUCK IN A SINGLE PLACE FROM AGES, MAKE YOU INSOMNIAC AND SICK. BUT IT'S GOING TO HAPPEN. YOUR SUCCESS WILL COME IT HAS TO. AND WHEN THAT DAY WILL ARRIVE YOU'RE GOING TO CRY A RIVER OF HAPPINESS CAUSE YOU'LL KNOW WHAT YOU'VE GONE THROUGH. CAUSE YOU'LL KNOW THAT YOU FINALLY MADE IT.💫
