Coderbroo community
3.89K subscribers
224 photos
8 videos
851 files
651 links
๐ŸŒ• ๐‘ฏ๐’†๐’“๐’† ๐’š๐’๐’– ๐’˜๐’Š๐’๐’ ๐’ˆ๐’†๐’• ๐Ÿ‘‡

๐Ÿ”ด programming, coding ๐…๐‘๐„๐„ courses
๐ŸŸข Handwritten notes on Programming
๐ŸŸฃ Daily ๐™ˆ๐˜พ๐™Œ๐™จ
โญ ๐Ÿ„ต๐Ÿ…๐Ÿ„ด๐Ÿ„ด ๐Ÿ„ณ๐Ÿ„ด๐Ÿ……๐Ÿ„ด๐Ÿ„ป๐Ÿ„พ๐Ÿ„ฟ๐Ÿ„ด๐Ÿ…๐Ÿ…‚ ๐Ÿ„ฒ๐Ÿ„พ๐Ÿ„ผ๐Ÿ„ผ๐Ÿ…„๐Ÿ„ฝ๐Ÿ„ธ๐Ÿ…ƒ๐Ÿ…ˆ
๐ŸŸ  Internships opportunity
๐ŸŸข Dev support
๐Ÿ”ด Placement Materials
๐ŸŒ”
Download Telegram
*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
๐Ÿ‘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
๐Ÿ‘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.
๐Ÿ˜จ *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