Competitive Programming with Python
(Batches Start from 1st & 15th Feb, 2021)
About The Program:
With the belief to build a healthy ecosystem as per the Industry Standards REGex Software brings a Internship/Training Program on “Competitive Programming with Python”. We organize Internship/Training Program for improving the knowledge and skills of the Students/Professionals, so that they can become expert in the field of Competitive Programming and get their Dream Job in Software Development Field in Big MNCs.
REGex Software Services’s Competitive Programming course is a valuable resource for beginners and experts. This program will introduce you to Data Structures, Python and Interview Based Questions of Product Based Companies from Basics to Advance. If you are preparing for a coding interview, REGex introduce this course for you.
Timing
Platform
Duration
What People Tell About Us
What you will Learn
- Python (Basics to Advance)
- Data Structures & Algorithms
- Problem Solving Approach
- How to Crack Interview Questions in Product Based Companies
- Learn how to use Data Structures & Algorithms in Problem Solving
Study Material
- E-Notes
- Assignments per day
- Poll test per day
- Weekly Tests
- 80+ hours on demand Live Video Lectures
- Offline Access of Lecture Videos & Notes
24*7 Mentorship Support
- Working on Live Projects
Output
- Good Programmer.
- Able to think out of the box.
- Expertise in different Domain like Python, Data Structures & Algorithms, Problem Solving
- Able to solve many Interview Questions of Top MNCs
- Create your own personal portfolio site to showcase your projects to potential employers
- Package of Software Developer in Product Based Companies starts from 10LPA
Live Sessions
Live Sessions by Expertise Trainers and Access of Recorded Session is also available
Live Projects
Get a chance to work on Industry Oriented Projects to implement your learning
24*7 Support
24*7 Mentorship Support available for all Students to clear all of your doubts
Opportunities
REGex provides Internship / Job opportunities to the best Students in different Companies.
Our Students Placed In
Course Content
S. No. | Topic |
|---|---|
1 | Section 1 |
-> Setting up the environment -> Jupyter NoteBook -> Know about Importance of Competitive Programming -> Key to get a JOB in Product Based Company, Start preparing for it -> Data structures and abstract data types | |
2 | Section 2 |
-> What is an array data structure -> Arrays related interview questions -> Linked list data structure and its implementation -> Stacks and queues -> Related interview questions | |
3 | Section 3 |
-> Algorithmic Thinking, Peak Finding -> Models of Computation, Python Cost Model, Document Distance -> What are binary search trees -> Practical applications of binary search trees | |
4 | Section 4 |
-> Problems with binary trees -> Binary Search Trees -> BST Sort -> Balanced trees: AVL trees and red-black trees -> AVL Trees, AVL Sort | |
5 | Section 5 |
-> Insertion Sort, Merge Sort -> Heaps and Heap Sort -> Counting Sort -> Radix Sort -> Lower Bounds for Sorting and Searching | |
6 | Section 6 |
-> Associative arrays and dictionaries -> How to achieve O(1) constant running time with hashing -> Ternary search trees as associative arrays -> Hashing with Chaining -> Simulation Algorithms -> Table Doubling, DNA Sequence Matching | |
S. No. | Topic |
|---|---|
7 | Section 7 |
-> Numerics a) Integer Arithmetic b) Karatsuba Multiplication c) Square Roots d) Newton’s Method | |
8 | Section 8 |
-> Shortest path algorithms -> Dijkstra’s algorithm -> Speeding up Dijkstra -> Bellman-Ford algorithm | |
9 | Section 9 |
-> What are spanning trees -> Kruskal algorithm | |
10 | Section 10 |
-> Sorting algorithms -> Bubble sort, selection sort and insertion sort -> Quicksort and merge sort -> Non-comparison based sorting algorithms -> Counting sort and radix sort | |
11 | Section 11 |
-> Memoization, Subproblems, Guessing, Bottom-up; Fibonacci, Shortest Paths -> Parent Pointers; Text Justification, Perfect-Information Blackjack -> String Subproblems, Pseudo Polynomial Time. -> Parenthesization, Edit Distance, Knapsack | |
12 | Section 12 |
-> Computational Complexity -> Algorithms Research Topics -> String Subproblems, Pseudo Polynomial Time. -> Parenthesization, Edit Distance, Knapsack |