What we're about

About This Meetup :-

This meetup is for python developers :-
Those who are a data scientist (or want to be ) writing custom machine learning based application.
Those who are involved in any software automation product development using python,

1: We will be discussing on the analysis and design of fundamental Python data structures.
2: Get a better understanding of advanced programming concepts such as big-o notation, dynamic programming, and functional data structures.
3: Explore data structures and algorithms in a clear and visual manner.

Prerequisites :: Basic understanding of python is required.

What You Will Learn

Getting a solid understanding of Python data structures implementation.
Understand the common programming patterns and algorithms used in Python data science, or while developing a test automation software product.
Write efficient robust code.

This meetup will introduce you to different types of data structure in Python
you will learn about critical data structures and topics such as linear, tree/graph data structures, hashing and different shorting , searching and graph algorithms

We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dictionaries and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting.

Upcoming events (5)

LearnBay: Data Structure and Algorithms in Python ( Data scientist , SDET)

Greetings from learnbay.io !!! Data Structure and Algorithms in Python course is specially designed for Data scientist & SDET's trageting to crack interviews or online coding round of tier one company (Amazon, Flipkart , Walmart etc ) Prerequisites :: Basic understanding of python is required. What to bring :: Please bring you laptop with Python IDE installed. Agenda :: This meetup we will covering array based problems from Leetcode =================================================================== Meeting details Topic: data structure and algorithms Time: Sep 12,[masked]:30 PM India Join Zoom Meeting https://us02web.zoom.us/j/84969190745?pwd=T3VYOXdzSFJJRnh4L2hiVTRwYWN4UT09 Meeting ID:[masked] Passcode:[masked] One tap mobile [masked],,[masked]#,,,,,,0#,,581872# US (Germantown) [masked],,[masked]#,,,,,,0#,,581872# US (Chicago) Dial by your location [masked] US (Germantown) [masked] US (Chicago) [masked] US (Houston) [masked] US (New York) [masked] US (San Jose) [masked] US (Tacoma) Meeting ID:[masked] Passcode:[masked] Find your local number: https://us02web.zoom.us/u/kdsinb9huv =================================================================== Problems: • WAP for reversing a queue Q, To access the queue, we are only allowed to use the methods of queue ADT • Implement a queue using stacks. • Implement a stack using queues. • Maximum sum in sliding window :  https://leetcode.com/problems/sliding-window-maximum/description/ • Minimum time required to rot all oranges. o https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten • Little Monk and Goblet of Fire: o https://www.hackerearth.com/practice/data-structures/queues/basics-of-queues/practice-problems/algorithm/little-monk-and-goblet-of-fire/ , ============================================================= Click on below link to know more about the course http://learnbay.io/data-structure-algorithm-using-python/ What You Will Learn Get a better understanding of advanced programming concepts such as big-o notation, dynamic programming, and functional data structures. Explore data structures and algorithms in a clear and visual manner. Getting a solid understanding of Python data structures implementation. Understand the common programming patterns and algorithms used in Python data science, or while developing a test automation software product. Write efficient robust code. This meetup will introduce you to different types of data structure in Python you will learn about critical data structures and topics such as linear, tree/graph data structures, hashing and different shorting , searching and graph algorithms We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dictionaries and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting. www.learnbay.io / www.learnbay.in

LearnBay: Data Structure and Algorithms in Python ( Data scientist , SDET)

Learnbay ,Kadubessianhalli

Greetings from learnbay.io !!! Data Structure and Algorithms in Python course is specially designed for Data scientist & SDET's trageting to crack interviews or online coding round of tier one company (Amazon, Flipkart , Walmart etc ) Prerequisites :: Basic understanding of python is required. What to bring :: Please bring you laptop with Python IDE installed. Agenda :: This meetup we will cover basics of Stack & Queues and few tricky problems based on it. • What are Stack & Queue? • How are Stack & Queues used? • Applications • Implementation of Stack & queues. • Problems & Solution =================================================================== Please fill below Form :: TBD =================================================================== Problems: • WAP for reversing a queue Q, To access the queue, we are only allowed to use the methods of queue ADT • Implement a queue using stacks. • Implement a stack using queues. • Maximum sum in sliding window :  https://leetcode.com/problems/sliding-window-maximum/description/ • Minimum time required to rot all oranges. o https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten • Little Monk and Goblet of Fire: o https://www.hackerearth.com/practice/data-structures/queues/basics-of-queues/practice-problems/algorithm/little-monk-and-goblet-of-fire/ , ============================================================= Click on below link to know more about the course http://learnbay.io/data-structure-algorithm-using-python/ What You Will Learn Get a better understanding of advanced programming concepts such as big-o notation, dynamic programming, and functional data structures. Explore data structures and algorithms in a clear and visual manner. Getting a solid understanding of Python data structures implementation. Understand the common programming patterns and algorithms used in Python data science, or while developing a test automation software product. Write efficient robust code. This meetup will introduce you to different types of data structure in Python you will learn about critical data structures and topics such as linear, tree/graph data structures, hashing and different shorting , searching and graph algorithms We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dictionaries and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting. www.learnbay.io / www.learnbay.in

LearnBay: Data Structure and Algorithms in Python ( Data scientist , SDET)

Learnbay ,Kadubessianhalli

Greetings from learnbay.io !!! Data Structure and Algorithms in Python course is specially designed for Data scientist & SDET's trageting to crack interviews or online coding round of tier one company (Amazon, Flipkart , Walmart etc ) Prerequisites :: Basic understanding of python is required. What to bring :: Please bring you laptop with Python IDE installed. Agenda :: This meetup we will cover basics of Stack & Queues and few tricky problems based on it. • What are Stack & Queue? • How are Stack & Queues used? • Applications • Implementation of Stack & queues. • Problems & Solution =================================================================== Please fill below Form :: TBD =================================================================== Problems: • WAP for reversing a queue Q, To access the queue, we are only allowed to use the methods of queue ADT • Implement a queue using stacks. • Implement a stack using queues. • Maximum sum in sliding window :  https://leetcode.com/problems/sliding-window-maximum/description/ • Minimum time required to rot all oranges. o https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten • Little Monk and Goblet of Fire: o https://www.hackerearth.com/practice/data-structures/queues/basics-of-queues/practice-problems/algorithm/little-monk-and-goblet-of-fire/ , ============================================================= Click on below link to know more about the course http://learnbay.io/data-structure-algorithm-using-python/ What You Will Learn Get a better understanding of advanced programming concepts such as big-o notation, dynamic programming, and functional data structures. Explore data structures and algorithms in a clear and visual manner. Getting a solid understanding of Python data structures implementation. Understand the common programming patterns and algorithms used in Python data science, or while developing a test automation software product. Write efficient robust code. This meetup will introduce you to different types of data structure in Python you will learn about critical data structures and topics such as linear, tree/graph data structures, hashing and different shorting , searching and graph algorithms We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dictionaries and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting. www.learnbay.io / www.learnbay.in

LearnBay: Data Structure and Algorithms in Python ( Data scientist , SDET)

Learnbay ,Kadubessianhalli

Greetings from learnbay.io !!! Data Structure and Algorithms in Python course is specially designed for Data scientist & SDET's trageting to crack interviews or online coding round of tier one company (Amazon, Flipkart , Walmart etc ) Prerequisites :: Basic understanding of python is required. What to bring :: Please bring you laptop with Python IDE installed. Agenda :: This meetup we will cover basics of Stack & Queues and few tricky problems based on it. • What are Stack & Queue? • How are Stack & Queues used? • Applications • Implementation of Stack & queues. • Problems & Solution =================================================================== Please fill below Form :: TBD =================================================================== Problems: • WAP for reversing a queue Q, To access the queue, we are only allowed to use the methods of queue ADT • Implement a queue using stacks. • Implement a stack using queues. • Maximum sum in sliding window :  https://leetcode.com/problems/sliding-window-maximum/description/ • Minimum time required to rot all oranges. o https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten • Little Monk and Goblet of Fire: o https://www.hackerearth.com/practice/data-structures/queues/basics-of-queues/practice-problems/algorithm/little-monk-and-goblet-of-fire/ , ============================================================= Click on below link to know more about the course http://learnbay.io/data-structure-algorithm-using-python/ What You Will Learn Get a better understanding of advanced programming concepts such as big-o notation, dynamic programming, and functional data structures. Explore data structures and algorithms in a clear and visual manner. Getting a solid understanding of Python data structures implementation. Understand the common programming patterns and algorithms used in Python data science, or while developing a test automation software product. Write efficient robust code. This meetup will introduce you to different types of data structure in Python you will learn about critical data structures and topics such as linear, tree/graph data structures, hashing and different shorting , searching and graph algorithms We are going to implement problems in Python. You will start by learning the basics of data structures, linked lists, and arrays in Python. You will be shown how to code tuples in Python followed by an example that shows how to program dictionaries and sets in Python. You will learn about the use of pointers in Python. You will then explore linear data structures in Python such as stacks, queues, and hash tables. In these you will learn how to implement a stack and code queues and deques. There will also be a demonstration on how to realize a hash table in Python. Following this you will learn how to use tree/graph data structures including binary trees, heaps and priority queues in Python. You will program priority queues and red-black trees in Python with examples. Finally, you will be shown how to apply different algorithms such as Graph traversal, Shortest Path, Minimum Spanning Tree, Maximum Flow tree, and DAG topological sorting. www.learnbay.io / www.learnbay.in

Photos (20)