*IIT Guwahati's* Micro-Credit Program in Computer Science
*Benefits of the program*:
โขโ โ โ Live Lectures and Evaluations by IIT Professors
โขโ โ โ 24 program credits - equivalent to a Minor degree in CSE (Computer Science Engineering)
โขโ โ โ Graduation ceremony at IIT Guwahati Campus.
*How to apply?*
โขโ โ *Answer the selection test* at https://bit.ly/3WQ75Hx
https://bit.ly/3WQ75Hx
*Last date to answer the test: TOMORROW*
โขโ โ โ There is no fee to answer the test
It is highly recommended that you answer the test. It is a short test that will take about 10 minutes to answer.
#Free ๐ #FREE #FreeCourse
*Benefits of the program*:
โขโ โ โ Live Lectures and Evaluations by IIT Professors
โขโ โ โ 24 program credits - equivalent to a Minor degree in CSE (Computer Science Engineering)
โขโ โ โ Graduation ceremony at IIT Guwahati Campus.
*How to apply?*
โขโ โ *Answer the selection test* at https://bit.ly/3WQ75Hx
https://bit.ly/3WQ75Hx
*Last date to answer the test: TOMORROW*
โขโ โ โ There is no fee to answer the test
It is highly recommended that you answer the test. It is a short test that will take about 10 minutes to answer.
#Free ๐ #FREE #FreeCourse
๐1
๐ฐComplete DSA Roadmap๐ฐ
|-- Basic_Data_Structures
| |-- Arrays
| |-- Strings
| |-- Linked_Lists
| |-- Stacks
| โโ Queues
|
|-- Advanced_Data_Structures
| |-- Trees
| | |-- Binary_Trees
| | |-- Binary_Search_Trees
| | |-- AVL_Trees
| | โโ B-Trees
| |
| |-- Graphs
| | |-- Graph_Representation
| | | |- Adjacency_Matrix
| | | โ Adjacency_List
| | |
| | |-- Depth-First_Search
| | |-- Breadth-First_Search
| | |-- Shortest_Path_Algorithms
| | | |- Dijkstra's_Algorithm
| | | โ Bellman-Ford_Algorithm
| | |
| | โโ Minimum_Spanning_Tree
| | |- Prim's_Algorithm
| | โ Kruskal's_Algorithm
| |
| |-- Heaps
| | |-- Min_Heap
| | |-- Max_Heap
| | โโ Heap_Sort
| |
| |-- Hash_Tables
| |-- Disjoint_Set_Union
| |-- Trie
| |-- Segment_Tree
| โโ Fenwick_Tree
|
|-- Algorithmic_Paradigms
| |-- Brute_Force
| |-- Divide_and_Conquer
| |-- Greedy_Algorithms
| |-- Dynamic_Programming
| |-- Backtracking
| |-- Sliding_Window_Technique
| |-- Two_Pointer_Technique
| โโ Divide_and_Conquer_Optimization
| |-- Merge_Sort_Tree
| โโ Persistent_Segment_Tree
|
|-- Searching_Algorithms
| |-- Linear_Search
| |-- Binary_Search
| |-- Depth-First_Search
| โโ Breadth-First_Search
|
|-- Sorting_Algorithms
| |-- Bubble_Sort
| |-- Selection_Sort
| |-- Insertion_Sort
| |-- Merge_Sort
| |-- Quick_Sort
| โโ Heap_Sort
|
|-- Graph_Algorithms
| |-- Depth-First_Search
| |-- Breadth-First_Search
| |-- Topological_Sort
| |-- Strongly_Connected_Components
| โโ Articulation_Points_and_Bridges
|
|-- Dynamic_Programming
| |-- Introduction_to_DP
| |-- Fibonacci_Series_using_DP
| |-- Longest_Common_Subsequence
| |-- Longest_Increasing_Subsequence
| |-- Knapsack_Problem
| |-- Matrix_Chain_Multiplication
| โโ Dynamic_Programming_on_Trees
|
|-- Mathematical_and_Bit_Manipulation_Algorithms
| |-- Prime_Numbers_and_Sieve_of_Eratosthenes
| |-- Greatest_Common_Divisor
| |-- Least_Common_Multiple
| |-- Modular_Arithmetic
| โโ Bit_Manipulation_Tricks
|
|-- Advanced_Topics
| |-- Trie-based_Algorithms
| | |-- Auto-completion
| | โโ Spell_Checker
| |
| |-- Suffix_Trees_and_Arrays
| |-- Computational_Geometry
| |-- Number_Theory
| | |-- Euler's_Totient_Function
| | โโ Mobius_Function
| |
| โโ String_Algorithms
| |-- KMP_Algorithm
| โโ Rabin-Karp_Algorithm
|
|-- OnlinePlatforms
| |-- LeetCode
| |-- HackerRank
Join our Community ๐
https://t.me/coderbroo
Share with your College Whatsapp Groups & Friends too
|-- Basic_Data_Structures
| |-- Arrays
| |-- Strings
| |-- Linked_Lists
| |-- Stacks
| โโ Queues
|
|-- Advanced_Data_Structures
| |-- Trees
| | |-- Binary_Trees
| | |-- Binary_Search_Trees
| | |-- AVL_Trees
| | โโ B-Trees
| |
| |-- Graphs
| | |-- Graph_Representation
| | | |- Adjacency_Matrix
| | | โ Adjacency_List
| | |
| | |-- Depth-First_Search
| | |-- Breadth-First_Search
| | |-- Shortest_Path_Algorithms
| | | |- Dijkstra's_Algorithm
| | | โ Bellman-Ford_Algorithm
| | |
| | โโ Minimum_Spanning_Tree
| | |- Prim's_Algorithm
| | โ Kruskal's_Algorithm
| |
| |-- Heaps
| | |-- Min_Heap
| | |-- Max_Heap
| | โโ Heap_Sort
| |
| |-- Hash_Tables
| |-- Disjoint_Set_Union
| |-- Trie
| |-- Segment_Tree
| โโ Fenwick_Tree
|
|-- Algorithmic_Paradigms
| |-- Brute_Force
| |-- Divide_and_Conquer
| |-- Greedy_Algorithms
| |-- Dynamic_Programming
| |-- Backtracking
| |-- Sliding_Window_Technique
| |-- Two_Pointer_Technique
| โโ Divide_and_Conquer_Optimization
| |-- Merge_Sort_Tree
| โโ Persistent_Segment_Tree
|
|-- Searching_Algorithms
| |-- Linear_Search
| |-- Binary_Search
| |-- Depth-First_Search
| โโ Breadth-First_Search
|
|-- Sorting_Algorithms
| |-- Bubble_Sort
| |-- Selection_Sort
| |-- Insertion_Sort
| |-- Merge_Sort
| |-- Quick_Sort
| โโ Heap_Sort
|
|-- Graph_Algorithms
| |-- Depth-First_Search
| |-- Breadth-First_Search
| |-- Topological_Sort
| |-- Strongly_Connected_Components
| โโ Articulation_Points_and_Bridges
|
|-- Dynamic_Programming
| |-- Introduction_to_DP
| |-- Fibonacci_Series_using_DP
| |-- Longest_Common_Subsequence
| |-- Longest_Increasing_Subsequence
| |-- Knapsack_Problem
| |-- Matrix_Chain_Multiplication
| โโ Dynamic_Programming_on_Trees
|
|-- Mathematical_and_Bit_Manipulation_Algorithms
| |-- Prime_Numbers_and_Sieve_of_Eratosthenes
| |-- Greatest_Common_Divisor
| |-- Least_Common_Multiple
| |-- Modular_Arithmetic
| โโ Bit_Manipulation_Tricks
|
|-- Advanced_Topics
| |-- Trie-based_Algorithms
| | |-- Auto-completion
| | โโ Spell_Checker
| |
| |-- Suffix_Trees_and_Arrays
| |-- Computational_Geometry
| |-- Number_Theory
| | |-- Euler's_Totient_Function
| | โโ Mobius_Function
| |
| โโ String_Algorithms
| |-- KMP_Algorithm
| โโ Rabin-Karp_Algorithm
|
|-- OnlinePlatforms
| |-- LeetCode
| |-- HackerRank
Join our Community ๐
https://t.me/coderbroo
Share with your College Whatsapp Groups & Friends too
Telegram
Coderbroo community
๐ ๐ฏ๐๐๐ ๐๐๐ ๐๐๐๐ ๐๐๐ ๐
๐ด programming, coding ๐ ๐๐๐ courses
๐ข Handwritten notes on Programming
๐ฃ Daily ๐๐พ๐๐จ
โญ ๐ต๐ ๐ด๐ด ๐ณ๐ด๐ ๐ด๐ป๐พ๐ฟ๐ด๐ ๐ ๐ฒ๐พ๐ผ๐ผ๐ ๐ฝ๐ธ๐ ๐
๐ Internships opportunity
๐ข Dev support
๐ด Placement Materials
๐
๐ด programming, coding ๐ ๐๐๐ courses
๐ข Handwritten notes on Programming
๐ฃ Daily ๐๐พ๐๐จ
โญ ๐ต๐ ๐ด๐ด ๐ณ๐ด๐ ๐ด๐ป๐พ๐ฟ๐ด๐ ๐ ๐ฒ๐พ๐ผ๐ผ๐ ๐ฝ๐ธ๐ ๐
๐ Internships opportunity
๐ข Dev support
๐ด Placement Materials
๐
๐6
*Tech News โ๏ธโ๏ธ*
โก๏ธCMF Phone 1 to launch in India soon, Nothing confirms.
โก๏ธSingle crack on iPhones, Apple Watches no longer covered under warranty.
โก๏ธAmazon agrees to Purchase some assets of MX Player in $100 million deal.
โก๏ธNvidia overtakes Apple as No. 2 most valuable company.
โก๏ธHumane is reportedly trying to sell itself to HP for $1 billion.
โก๏ธRBI sets up panel to track online payment frauds.
โก๏ธSalesforce to open London AI centre as part of $4bn UK investment.
โก๏ธSAP to acquire Israel-based digital adoption platform WalkMe for $1.5bn.
โก๏ธCMF Phone 1 to launch in India soon, Nothing confirms.
โก๏ธSingle crack on iPhones, Apple Watches no longer covered under warranty.
โก๏ธAmazon agrees to Purchase some assets of MX Player in $100 million deal.
โก๏ธNvidia overtakes Apple as No. 2 most valuable company.
โก๏ธHumane is reportedly trying to sell itself to HP for $1 billion.
โก๏ธRBI sets up panel to track online payment frauds.
โก๏ธSalesforce to open London AI centre as part of $4bn UK investment.
โก๏ธSAP to acquire Israel-based digital adoption platform WalkMe for $1.5bn.
Join channel - https://t.me/coderbroo
๐๐
https://drive.google.com/drive/folders/1-xmLdiHEtepyVeam-z2j3KdhZWPfCmL4
Complete Frontend + Server side Resources, Ebooks, Notes, Interview Questions Everything ๐คฉ
React with any random emoji, if you can access the resources ๐๐ฅ
Hope this helps you!!
๐๐
https://drive.google.com/drive/folders/1-xmLdiHEtepyVeam-z2j3KdhZWPfCmL4
Complete Frontend + Server side Resources, Ebooks, Notes, Interview Questions Everything ๐คฉ
React with any random emoji, if you can access the resources ๐๐ฅ
Hope this helps you!!
Telegram
Coderbroo community
๐ ๐ฏ๐๐๐ ๐๐๐ ๐๐๐๐ ๐๐๐ ๐
๐ด programming, coding ๐ ๐๐๐ courses
๐ข Handwritten notes on Programming
๐ฃ Daily ๐๐พ๐๐จ
โญ ๐ต๐ ๐ด๐ด ๐ณ๐ด๐ ๐ด๐ป๐พ๐ฟ๐ด๐ ๐ ๐ฒ๐พ๐ผ๐ผ๐ ๐ฝ๐ธ๐ ๐
๐ Internships opportunity
๐ข Dev support
๐ด Placement Materials
๐
๐ด programming, coding ๐ ๐๐๐ courses
๐ข Handwritten notes on Programming
๐ฃ Daily ๐๐พ๐๐จ
โญ ๐ต๐ ๐ด๐ด ๐ณ๐ด๐ ๐ด๐ป๐พ๐ฟ๐ด๐ ๐ ๐ฒ๐พ๐ผ๐ผ๐ ๐ฝ๐ธ๐ ๐
๐ Internships opportunity
๐ข Dev support
๐ด Placement Materials
๐
๐1
Forwarded from IconicMagx ๐ฅ
๐จ *Will you really get your dream job??*
๐จ *Will you sound confident and fluent enough in the interview??*
๐ฑ *Will you have the level of technical skills your dream job demands??*
๐งโโ๏ธ *Just Relax* ๐ฎโ๐จ
๐ *Leave it all up to us!!
๐Get certification from top MNCs, AI portal and job assistance.
*So What are You Waiting for Now????๐ง*
*๐ฅณYouโre Just 1 click Away From BECOMING YOUR BEST SELF๐ฆพ*
๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ
*Apply Now:
https://forms.gle/Z5jxU3BLeoM55fph7
๐จ *Will you sound confident and fluent enough in the interview??*
๐ฑ *Will you have the level of technical skills your dream job demands??*
๐งโโ๏ธ *Just Relax* ๐ฎโ๐จ
๐ *Leave it all up to us!!
๐Get certification from top MNCs, AI portal and job assistance.
*So What are You Waiting for Now????๐ง*
*๐ฅณYouโre Just 1 click Away From BECOMING YOUR BEST SELF๐ฆพ*
๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ๐คฉ
*Apply Now:
https://forms.gle/Z5jxU3BLeoM55fph7
โ
Company-specific DSA Material: LeetCode Questions
Discover more free DSA resources with a collection of frequently asked problems from top companies- https://drive.google.com/drive/folders/1NlbJI1MAfb4UfL5h5AoaeO6-UlA3hF22
Join channel for more: https://t.me/coderbroo
.
Discover more free DSA resources with a collection of frequently asked problems from top companies- https://drive.google.com/drive/folders/1NlbJI1MAfb4UfL5h5AoaeO6-UlA3hF22
Join channel for more: https://t.me/coderbroo
.
Telegram
Coderbroo community
๐ ๐ฏ๐๐๐ ๐๐๐ ๐๐๐๐ ๐๐๐ ๐
๐ด programming, coding ๐ ๐๐๐ courses
๐ข Handwritten notes on Programming
๐ฃ Daily ๐๐พ๐๐จ
โญ ๐ต๐ ๐ด๐ด ๐ณ๐ด๐ ๐ด๐ป๐พ๐ฟ๐ด๐ ๐ ๐ฒ๐พ๐ผ๐ผ๐ ๐ฝ๐ธ๐ ๐
๐ Internships opportunity
๐ข Dev support
๐ด Placement Materials
๐
๐ด programming, coding ๐ ๐๐๐ courses
๐ข Handwritten notes on Programming
๐ฃ Daily ๐๐พ๐๐จ
โญ ๐ต๐ ๐ด๐ด ๐ณ๐ด๐ ๐ด๐ป๐พ๐ฟ๐ด๐ ๐ ๐ฒ๐พ๐ผ๐ผ๐ ๐ฝ๐ธ๐ ๐
๐ Internships opportunity
๐ข Dev support
๐ด Placement Materials
๐