|ETCPC EDUC
EtCPC Training Contest #7
📅 Date: Thursday, August 10
⏰ Time: 7:30 – 9:30 PM [1:30 - 3:30 Evening LT]
Contest Link: Link
Contest Platform: Open Kattis
Contest Type: Individual contest
#ETCPC #Contest
EtCPC Training Contest #7
📅 Date: Thursday, August 10
⏰ Time: 7:30 – 9:30 PM [1:30 - 3:30 Evening LT]
Contest Link: Link
Contest Platform: Open Kattis
Contest Type: Individual contest
#ETCPC #Contest
👍1
|ETCPC
📢 Calling all graph enthusiasts! 📊🌐
📢 Join us for the thrilling continuation of our two-part tutorial on Graphs and Graph Algorithms - Part 2! 🎓
🗓️ Date: Mon, 14th August 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Abdi Adem, a seasoned programmer and graph algorithm expert.
✉️ Meeting Link: https://meet.google.com/wom-uins-nvh
🔥 Don't miss this incredible opportunity to deepen your understanding of graphs and explore essential graph algorithms like Shortest Path Algorithms and Minimum Spanning Trees! 🌟🔍
#ETCPC #TrainingCamp
📢 Calling all graph enthusiasts! 📊🌐
📢 Join us for the thrilling continuation of our two-part tutorial on Graphs and Graph Algorithms - Part 2! 🎓
🗓️ Date: Mon, 14th August 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Abdi Adem, a seasoned programmer and graph algorithm expert.
✉️ Meeting Link: https://meet.google.com/wom-uins-nvh
🔥 Don't miss this incredible opportunity to deepen your understanding of graphs and explore essential graph algorithms like Shortest Path Algorithms and Minimum Spanning Trees! 🌟🔍
#ETCPC #TrainingCamp
|ETCPC
📢 Calling all graph enthusiasts! 📊🌐
📢 Join us for the thrilling continuation of our two-part tutorial on Graphs and Graph Algorithms - Part 2! 🎓
🗓️ Date: Mon, 14th August 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Abdi Adem, a seasoned programmer and graph algorithm expert.
🔥 Don't miss this incredible opportunity to deepen your understanding of graphs and explore essential graph algorithms like Shortest Path Algorithms and Minimum Spanning Trees! 🌟🔍
In Part 2 of this tutorial, we will unravel the fascinating world of shortest path algorithms. These algorithms are essential tools for finding the most efficient path between two vertices in a graph. We will cover:
1. Shortest Path Algorithms:
Shortest path algorithms are fundamental tools used to find the most efficient path between two vertices in a graph. They have numerous applications, ranging from navigation systems to network routing protocols. Here are two commonly used algorithms for finding the shortest path:
a) Dijkstra's Algorithm: Named after the Dutch computer scientist Edsger W. Dijkstra, this algorithm efficiently determines the shortest path in a graph with non-negative edge weights. By maintaining a priority queue, Dijkstra's algorithm explores vertices in increasing order of their distance from the source vertex.
b) Bellman-Ford Algorithm: This algorithm handles graphs with negative edge weights and detects negative cycles. It iteratively relaxes the edges of the graph until it finds the shortest path.
Next, we will dive into the concept of Minimum Spanning Trees (MSTs). An MST is a tree that spans all the vertices in a connected, weighted graph while minimizing the total sum of edge weights. We will explore:
2. Minimum Spanning Tree (MST) Algorithms:
Minimum spanning tree algorithms are used to find the most cost-effective way to connect all the vertices in a graph. The two main algorithms for finding MSTs are:
a) Kruskal's Algorithm: Named after the Czech mathematician Josef Kruskal, this algorithm builds an MST by iteratively adding the smallest-weighted edges that do not create cycles.
b) Prim's Algorithm: Named after the American mathematician Robert C. Prim, this algorithm grows an MST from an arbitrary starting vertex by greedily adding edges with the smallest weights.
We will dive into the intricacies of these algorithms, understand their time complexities, and discuss real-world applications.
Whether you're a novice seeking to expand your knowledge or an experienced enthusiast looking to refine your graph algorithm skills, this tutorial is perfect for you! Mr. Abdi Adem will present the concepts in a clear and engaging manner, making complex graph algorithms approachable for all attendees. 💪💡
Get ready to embark on a captivating journey as we explore the world of graphs and elevate your algorithmic thinking to new heights!
We eagerly anticipate your active participation in this enriching tutorial!
For any inquiries or further information, please contact us on Telegram @etcpc_support.
#ETCPC #GraphAlgorithms #GraphTheory #ShortestPathAlgorithms #MinimumSpanningTrees #KruskalsAlgorithm #PrimsAlgorithm #CodingTutorial #AlgorithmExpert #ProblemSolving #CodingEnthusiasts
📢 Calling all graph enthusiasts! 📊🌐
📢 Join us for the thrilling continuation of our two-part tutorial on Graphs and Graph Algorithms - Part 2! 🎓
🗓️ Date: Mon, 14th August 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Abdi Adem, a seasoned programmer and graph algorithm expert.
🔥 Don't miss this incredible opportunity to deepen your understanding of graphs and explore essential graph algorithms like Shortest Path Algorithms and Minimum Spanning Trees! 🌟🔍
In Part 2 of this tutorial, we will unravel the fascinating world of shortest path algorithms. These algorithms are essential tools for finding the most efficient path between two vertices in a graph. We will cover:
1. Shortest Path Algorithms:
Shortest path algorithms are fundamental tools used to find the most efficient path between two vertices in a graph. They have numerous applications, ranging from navigation systems to network routing protocols. Here are two commonly used algorithms for finding the shortest path:
a) Dijkstra's Algorithm: Named after the Dutch computer scientist Edsger W. Dijkstra, this algorithm efficiently determines the shortest path in a graph with non-negative edge weights. By maintaining a priority queue, Dijkstra's algorithm explores vertices in increasing order of their distance from the source vertex.
b) Bellman-Ford Algorithm: This algorithm handles graphs with negative edge weights and detects negative cycles. It iteratively relaxes the edges of the graph until it finds the shortest path.
Next, we will dive into the concept of Minimum Spanning Trees (MSTs). An MST is a tree that spans all the vertices in a connected, weighted graph while minimizing the total sum of edge weights. We will explore:
2. Minimum Spanning Tree (MST) Algorithms:
Minimum spanning tree algorithms are used to find the most cost-effective way to connect all the vertices in a graph. The two main algorithms for finding MSTs are:
a) Kruskal's Algorithm: Named after the Czech mathematician Josef Kruskal, this algorithm builds an MST by iteratively adding the smallest-weighted edges that do not create cycles.
b) Prim's Algorithm: Named after the American mathematician Robert C. Prim, this algorithm grows an MST from an arbitrary starting vertex by greedily adding edges with the smallest weights.
We will dive into the intricacies of these algorithms, understand their time complexities, and discuss real-world applications.
Whether you're a novice seeking to expand your knowledge or an experienced enthusiast looking to refine your graph algorithm skills, this tutorial is perfect for you! Mr. Abdi Adem will present the concepts in a clear and engaging manner, making complex graph algorithms approachable for all attendees. 💪💡
Get ready to embark on a captivating journey as we explore the world of graphs and elevate your algorithmic thinking to new heights!
We eagerly anticipate your active participation in this enriching tutorial!
For any inquiries or further information, please contact us on Telegram @etcpc_support.
#ETCPC #GraphAlgorithms #GraphTheory #ShortestPathAlgorithms #MinimumSpanningTrees #KruskalsAlgorithm #PrimsAlgorithm #CodingTutorial #AlgorithmExpert #ProblemSolving #CodingEnthusiasts
|ETCPC EDUC
EtCPC Training Contest #8
📅 Date: Wednesday
⏰ Time: 7:30 – 9:30 PM [1:30 - 3:30 Evening LT]
Contest Link: Link
Contest Platform: Open Kattis
Contest Type: Individual contest
#ETCPC #Contest
EtCPC Training Contest #8
📅 Date: Wednesday
⏰ Time: 7:30 – 9:30 PM [1:30 - 3:30 Evening LT]
Contest Link: Link
Contest Platform: Open Kattis
Contest Type: Individual contest
#ETCPC #Contest
|ETCPC
Attention all coding enthusiasts and problem-solving wizards! 🌟💻
We are thrilled to announce the highly anticipated ETCPC (Ethiopian Collegiate Programming Contest), an exciting regional contest where your programming skills will be put to the ultimate test. If you're passionate about algorithms, logic puzzles, and the thrill of competition, this event is tailor-made for you! 🔥🏆
📅 Date: August 30, 2023 - August 31, 2023
📍 Location: Adama Science and Technology University
🏢 Address: Adama, Ethiopia
📝 Registration for ETCPC is now open! Secure your spot among the region's most brilliant coders by visiting our website at https://icpc.global/regionals/finder/EtCPC-2024.
👉 The registration is open between August 13, 2023 - August 27, 2023.
You can find the steps of the registration here -> https://t.me/etcpc/88
#ETCPC
Attention all coding enthusiasts and problem-solving wizards! 🌟💻
We are thrilled to announce the highly anticipated ETCPC (Ethiopian Collegiate Programming Contest), an exciting regional contest where your programming skills will be put to the ultimate test. If you're passionate about algorithms, logic puzzles, and the thrill of competition, this event is tailor-made for you! 🔥🏆
📅 Date: August 30, 2023 - August 31, 2023
📍 Location: Adama Science and Technology University
🏢 Address: Adama, Ethiopia
📝 Registration for ETCPC is now open! Secure your spot among the region's most brilliant coders by visiting our website at https://icpc.global/regionals/finder/EtCPC-2024.
👉 The registration is open between August 13, 2023 - August 27, 2023.
You can find the steps of the registration here -> https://t.me/etcpc/88
#ETCPC
👍1
|ETCPC
Attention all coding enthusiasts and problem-solving wizards! 🌟💻
We are thrilled to announce the highly anticipated ETCPC (Ethiopian Collegiate Programming Contest), an exciting regional contest where your programming skills will be put to the ultimate test. If you're passionate about algorithms, logic puzzles, and the thrill of competition, this event is tailor-made for you! 🔥🏆
📅 Date: August 30, 2023 - August 31, 2023
📍 Location: Adama Science and Technology University
🏢 Address: Adama, Ethiopia
Whether you're a seasoned coding veteran or a budding talent eager to make your mark, ETCPC promises an unforgettable experience filled with intense challenges and opportunities for growth. Join forces with fellow programmers, sharpen your skills, and showcase your talent in an electrifying atmosphere. ⚡️🚀
📝 Registration for ETCPC is now open! Secure your spot among the region's most brilliant coders by visiting our website at https://icpc.global/regionals/finder/EtCPC-2024.
👉 The registration is open between August 13, 2023 - August 27, 2023.
Don't miss your chance to be part of this exhilarating event that will push your boundaries and expand your coding prowess. 🎟💪
Prepare to embark on an epic coding journey, where innovation and collaboration reign supreme. Discover new techniques, make lifelong connections, and vie for the coveted title of ETCPC champion. 🌟🤝🏆
🗓 Mark your calendars and get ready to code your way to glory at ETCPC. We can't wait to witness your coding genius and celebrate the spirit of competition with you. 🎉💻
#ETCPC #RegionalContest
Attention all coding enthusiasts and problem-solving wizards! 🌟💻
We are thrilled to announce the highly anticipated ETCPC (Ethiopian Collegiate Programming Contest), an exciting regional contest where your programming skills will be put to the ultimate test. If you're passionate about algorithms, logic puzzles, and the thrill of competition, this event is tailor-made for you! 🔥🏆
📅 Date: August 30, 2023 - August 31, 2023
📍 Location: Adama Science and Technology University
🏢 Address: Adama, Ethiopia
Whether you're a seasoned coding veteran or a budding talent eager to make your mark, ETCPC promises an unforgettable experience filled with intense challenges and opportunities for growth. Join forces with fellow programmers, sharpen your skills, and showcase your talent in an electrifying atmosphere. ⚡️🚀
📝 Registration for ETCPC is now open! Secure your spot among the region's most brilliant coders by visiting our website at https://icpc.global/regionals/finder/EtCPC-2024.
👉 The registration is open between August 13, 2023 - August 27, 2023.
Don't miss your chance to be part of this exhilarating event that will push your boundaries and expand your coding prowess. 🎟💪
Prepare to embark on an epic coding journey, where innovation and collaboration reign supreme. Discover new techniques, make lifelong connections, and vie for the coveted title of ETCPC champion. 🌟🤝🏆
🗓 Mark your calendars and get ready to code your way to glory at ETCPC. We can't wait to witness your coding genius and celebrate the spirit of competition with you. 🎉💻
#ETCPC #RegionalContest
icpc.global
The International Collegiate Programming Contest is an algorithmic programming contest for college students. Teams of three, representing their university, work to solve the most real-world problems, fostering collaboration, creativity, innovation, and the…
|ETCPC
📢 Calling all coding enthusiasts! 🖥💻
📢 Join us for an informative tutorial on Dynamic Programming! 🚀🔢
🗓 Date: Sun, 20 Aug, 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙 Speaker: Mr. Yohannes Melese, an experienced programmer and Dynamic Programming expert.
🎥 Meeting information:
Sunday, August 20 · 7:30 – 9:30pm
Time zone: Addis Ababa/Ethiopia
Google Meet joining info
Video call link: https://meet.google.com/xzs-ejkb-wtq
🔥 Don't miss this incredible opportunity to dive into the world of Dynamic Programming and enhance your problem-solving skills! 💪💡
#ETCPC
📢 Calling all coding enthusiasts! 🖥💻
📢 Join us for an informative tutorial on Dynamic Programming! 🚀🔢
🗓 Date: Sun, 20 Aug, 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙 Speaker: Mr. Yohannes Melese, an experienced programmer and Dynamic Programming expert.
🎥 Meeting information:
Sunday, August 20 · 7:30 – 9:30pm
Time zone: Addis Ababa/Ethiopia
Google Meet joining info
Video call link: https://meet.google.com/xzs-ejkb-wtq
🔥 Don't miss this incredible opportunity to dive into the world of Dynamic Programming and enhance your problem-solving skills! 💪💡
#ETCPC
|ETCPC
📢 Calling all coding enthusiasts! 🖥️💻
📢 Join us for an informative tutorial on Dynamic Programming! 🚀🔢
🗓️ Date: Sun, 20 Aug, 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Yohannes Melese, an experienced programmer and Dynamic Programming expert.
🔥 Don't miss this incredible opportunity to dive into the world of Dynamic Programming and enhance your problem-solving skills! 💪💡
In this tutorial, we will explore the power of Dynamic Programming and its applications in solving complex problems efficiently. The session will cover the following topics:
1. Fibonacci Numbers:
Discover the beauty of Fibonacci sequences and learn how Dynamic Programming can be used to compute Fibonacci numbers efficiently. Unravel the secrets behind this famous sequence and witness the magic of optimized calculations. 🌸🔢
1. Longest Common Subsequence (LCS):
Delve into the realm of sequence matching and unravel the mysteries of finding the Longest Common Subsequence. Explore how Dynamic Programming can be applied to efficiently solve this problem, unlocking the potential for various applications such as DNA sequence analysis and text comparison. 🧬✨
1. Knapsack Problem:
Embark on a journey of optimization as we tackle the Knapsack Problem. Learn how Dynamic Programming techniques can help us maximize value while considering limited capacity. Discover strategies to efficiently solve this classic problem, making informed decisions on item selection and resource allocation. 🎒💡
1. Matrix Chain Multiplication:
Enter the realm of matrices and explore the fascinating Matrix Chain Multiplication problem. Learn how Dynamic Programming can be employed to determine the optimal order of multiplication, minimizing computational complexity and maximizing efficiency. 🧮⚙️
1. Dynamic Programming Optimization:
Dive into the world of optimization techniques within Dynamic Programming. Explore strategies like memoization, tabulation, and bottom-up approaches to optimize your solutions further. Unleash the true potential of Dynamic Programming by mastering these optimization techniques. 🚀🔝
Whether you're a beginner looking to expand your coding knowledge or an experienced programmer aiming to sharpen your algorithmic thinking, this tutorial is perfect for you! Mr. Yohannes Melese will present the concepts in a clear and engaging manner, ensuring that all attendees can grasp the material easily. 🎓💻
Get ready to unlock the power of Dynamic Programming and witness how it revolutionizes problem-solving.
We eagerly anticipate your active participation in this enriching tutorial!
For any inquiries or further information, please contact us on Telegram @etcpc_support.
#ETCPC #DynamicProgramming #ProblemSolving #CodingTutorial #AlgorithmicThinking #CodingEnthusiasts
📢 Calling all coding enthusiasts! 🖥️💻
📢 Join us for an informative tutorial on Dynamic Programming! 🚀🔢
🗓️ Date: Sun, 20 Aug, 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Yohannes Melese, an experienced programmer and Dynamic Programming expert.
🔥 Don't miss this incredible opportunity to dive into the world of Dynamic Programming and enhance your problem-solving skills! 💪💡
In this tutorial, we will explore the power of Dynamic Programming and its applications in solving complex problems efficiently. The session will cover the following topics:
1. Fibonacci Numbers:
Discover the beauty of Fibonacci sequences and learn how Dynamic Programming can be used to compute Fibonacci numbers efficiently. Unravel the secrets behind this famous sequence and witness the magic of optimized calculations. 🌸🔢
1. Longest Common Subsequence (LCS):
Delve into the realm of sequence matching and unravel the mysteries of finding the Longest Common Subsequence. Explore how Dynamic Programming can be applied to efficiently solve this problem, unlocking the potential for various applications such as DNA sequence analysis and text comparison. 🧬✨
1. Knapsack Problem:
Embark on a journey of optimization as we tackle the Knapsack Problem. Learn how Dynamic Programming techniques can help us maximize value while considering limited capacity. Discover strategies to efficiently solve this classic problem, making informed decisions on item selection and resource allocation. 🎒💡
1. Matrix Chain Multiplication:
Enter the realm of matrices and explore the fascinating Matrix Chain Multiplication problem. Learn how Dynamic Programming can be employed to determine the optimal order of multiplication, minimizing computational complexity and maximizing efficiency. 🧮⚙️
1. Dynamic Programming Optimization:
Dive into the world of optimization techniques within Dynamic Programming. Explore strategies like memoization, tabulation, and bottom-up approaches to optimize your solutions further. Unleash the true potential of Dynamic Programming by mastering these optimization techniques. 🚀🔝
Whether you're a beginner looking to expand your coding knowledge or an experienced programmer aiming to sharpen your algorithmic thinking, this tutorial is perfect for you! Mr. Yohannes Melese will present the concepts in a clear and engaging manner, ensuring that all attendees can grasp the material easily. 🎓💻
Get ready to unlock the power of Dynamic Programming and witness how it revolutionizes problem-solving.
We eagerly anticipate your active participation in this enriching tutorial!
For any inquiries or further information, please contact us on Telegram @etcpc_support.
#ETCPC #DynamicProgramming #ProblemSolving #CodingTutorial #AlgorithmicThinking #CodingEnthusiasts
|ETCPC
📣 Attention all coding enthusiasts! Join us for an exciting tutorial on Greedy Algorithms! 🌟💻
🗓️ Date: Sunday, 27 Aug 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Yohannes Melese, an experienced programmer and expert in Greedy Algorithms.
🔥 Don't miss this incredible opportunity to explore the world of Greedy Algorithms and enhance your problem-solving skills! 💪💡
#ETCPC #TRAININGCAMP
📣 Attention all coding enthusiasts! Join us for an exciting tutorial on Greedy Algorithms! 🌟💻
🗓️ Date: Sunday, 27 Aug 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Yohannes Melese, an experienced programmer and expert in Greedy Algorithms.
🔥 Don't miss this incredible opportunity to explore the world of Greedy Algorithms and enhance your problem-solving skills! 💪💡
#ETCPC #TRAININGCAMP
|ETCPC
📣 Attention all coding enthusiasts! Join us for an exciting tutorial on Greedy Algorithms! 🌟💻
🗓️ Date: Sunday, 27 Aug 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Yohannes Melese, an experienced programmer and expert in Greedy Algorithms.
🔥 Don't miss this incredible opportunity to explore the world of Greedy Algorithms and enhance your problem-solving skills! 💪💡
In this tutorial, we will delve into the power of Greedy Algorithms and their applications in solving optimization problems. The session will cover the following topics:
1. Activity Selection Problem:
Discover the elegance of the Activity Selection Problem and how Greedy Algorithms can efficiently schedule activities for maximum productivity. Learn how to make optimal choices at each step, resulting in an overall optimal solution. 📅⏱️
1. Fractional Knapsack Problem:
Embark on a journey of optimization as we explore the Fractional Knapsack Problem. Discover how Greedy Algorithms can help us maximize value while considering item weights and limited capacity. Learn the strategy of selecting items with the highest value-to-weight ratio to achieve an optimal solution. 🎒💰
1. Huffman Encoding:
Enter the realm of data compression as we dive into Huffman Encoding. Explore how Greedy Algorithms can be used to construct efficient prefix codes, minimizing the total encoded length. Uncover the secrets of optimal encoding and decoding, resulting in space-efficient data representation. 📚💾
Whether you're a beginner or an experienced programmer, this tutorial is designed to enhance your problem-solving skills. Yohannes Melese will present the concepts in a clear and engaging manner, making it easy for all attendees to grasp the material. 🎓💡
Get ready to unlock the power of Greedy Algorithms and witness how they revolutionize optimization problem-solving.
We eagerly anticipate your active participation in this enriching tutorial!
For any inquiries or further information, please contact us on Telegram @etcpc_support.
#ETCPC #GreedyAlgorithms #ProblemSolving #CodingTutorial #Optimization #CodingEnthusiasts
📣 Attention all coding enthusiasts! Join us for an exciting tutorial on Greedy Algorithms! 🌟💻
🗓️ Date: Sunday, 27 Aug 2023
⏰ Time: 7:30 PM [1:30 Evening LT]
🎙️ Speaker: Mr. Yohannes Melese, an experienced programmer and expert in Greedy Algorithms.
🔥 Don't miss this incredible opportunity to explore the world of Greedy Algorithms and enhance your problem-solving skills! 💪💡
In this tutorial, we will delve into the power of Greedy Algorithms and their applications in solving optimization problems. The session will cover the following topics:
1. Activity Selection Problem:
Discover the elegance of the Activity Selection Problem and how Greedy Algorithms can efficiently schedule activities for maximum productivity. Learn how to make optimal choices at each step, resulting in an overall optimal solution. 📅⏱️
1. Fractional Knapsack Problem:
Embark on a journey of optimization as we explore the Fractional Knapsack Problem. Discover how Greedy Algorithms can help us maximize value while considering item weights and limited capacity. Learn the strategy of selecting items with the highest value-to-weight ratio to achieve an optimal solution. 🎒💰
1. Huffman Encoding:
Enter the realm of data compression as we dive into Huffman Encoding. Explore how Greedy Algorithms can be used to construct efficient prefix codes, minimizing the total encoded length. Uncover the secrets of optimal encoding and decoding, resulting in space-efficient data representation. 📚💾
Whether you're a beginner or an experienced programmer, this tutorial is designed to enhance your problem-solving skills. Yohannes Melese will present the concepts in a clear and engaging manner, making it easy for all attendees to grasp the material. 🎓💡
Get ready to unlock the power of Greedy Algorithms and witness how they revolutionize optimization problem-solving.
We eagerly anticipate your active participation in this enriching tutorial!
For any inquiries or further information, please contact us on Telegram @etcpc_support.
#ETCPC #GreedyAlgorithms #ProblemSolving #CodingTutorial #Optimization #CodingEnthusiasts
👍1
ETCPC - Training Camp #10 Part I
Sunday, August 27 · 7:30 – 8:30pm
Time zone: Africa/Nairobi
Google Meet joining info
Video call link: https://meet.google.com/esj-ggsb-vdj
Sunday, August 27 · 7:30 – 8:30pm
Time zone: Africa/Nairobi
Google Meet joining info
Video call link: https://meet.google.com/esj-ggsb-vdj
Google
Real-time meetings by Google. Using your browser, share your video, desktop, and presentations with teammates and customers.
ETCPC - Training Camp #10 Part II
Sunday, August 27 · 8:30 – 9:30pm
Time zone: Africa/Nairobi
Google Meet joining info
Video call link: https://meet.google.com/bzq-djto-gzz
Sunday, August 27 · 8:30 – 9:30pm
Time zone: Africa/Nairobi
Google Meet joining info
Video call link: https://meet.google.com/bzq-djto-gzz
Google
Real-time meetings by Google. Using your browser, share your video, desktop, and presentations with teammates and customers.