Competitive Programming
前往频道在 Telegram
Experince a new world of algorithmic problems using C++ Channel link: https://t.me/Competitive_Programming_Cpp For any query contact me: @saranyanaharoy You can also share your experiences and ideas with us. We will share it in our channel.
显示更多未指定国家未指定类别
4 082
订阅者
无数据24 小时
无数据7 天
无数据30 天
数据加载中...
吸引订阅者
七月 '24
七月 '240
在0个频道中
六月 '240
在0个频道中
Get PRO
五月 '240
在0个频道中
Get PRO
四月 '240
在0个频道中
Get PRO
三月 '240
在0个频道中
Get PRO
二月 '240
在0个频道中
Get PRO
一月 '240
在0个频道中
Get PRO
十二月 '230
在0个频道中
Get PRO
十一月 '230
在0个频道中
Get PRO
十月 '230
在0个频道中
Get PRO
九月 '230
在0个频道中
Get PRO
八月 '230
在0个频道中
Get PRO
七月 '230
在0个频道中
Get PRO
六月 '230
在0个频道中
Get PRO
五月 '230
在0个频道中
Get PRO
四月 '230
在0个频道中
Get PRO
三月 '230
在0个频道中
Get PRO
二月 '23
+20
在0个频道中
Get PRO
一月 '23
+67
在0个频道中
Get PRO
十二月 '22
+77
在0个频道中
Get PRO
十一月 '22
+77
在0个频道中
Get PRO
十月 '22
+110
在0个频道中
Get PRO
九月 '22
+149
在0个频道中
Get PRO
八月 '22
+191
在0个频道中
Get PRO
七月 '220
在0个频道中
Get PRO
六月 '22
+107
在0个频道中
Get PRO
五月 '220
在0个频道中
Get PRO
四月 '22
+94
在0个频道中
Get PRO
三月 '22
+82
在0个频道中
Get PRO
二月 '22
+94
在0个频道中
Get PRO
一月 '22
+104
在0个频道中
Get PRO
十二月 '21
+73
在0个频道中
Get PRO
十一月 '21
+81
在0个频道中
Get PRO
十月 '21
+127
在0个频道中
Get PRO
九月 '21
+129
在0个频道中
Get PRO
八月 '21
+118
在0个频道中
Get PRO
七月 '21
+127
在0个频道中
Get PRO
六月 '21
+121
在0个频道中
Get PRO
五月 '21
+102
在0个频道中
Get PRO
四月 '21
+124
在0个频道中
Get PRO
三月 '21
+2 842
在0个频道中
| 日期 | 订阅者增长 | 提及 | 频道 | |
| 14 七月 | 0 |
频道帖子
| 2 | https://github.com/InterviewReady/system-design-resources | 902 |
| 3 | The Ultimate Topic List (with Resources, Problems and Templates) - Codeforces
https://codeforces.com/blog/entry/95106 | 9 960 |
| 4 | List of awesome learning resources :
https://www.topcoder.com/thrive/articles/List%20of%20awesome%20learning%20resources | 10 849 |
| 5 | Some links for Competitive Programming Resources :
1. https://github.com/kothariji/competitive-programming
2. https://github.com/kunal-kushwaha/Competitive-Programming-Resources | 9 625 |
| 6 | Coding Ninjas will help you achieve what you actually deserve - A DREAM JOB
We are here with 9 month carrer program with dedicated placement support to help you land in your dream job.
Just crack a simple test to grab your spot for our carrer camp on 3rd January, 2021.
Syllabus : Basic Aptitude Questions + Beginner level Coding
Register here: https://bit.ly/3lE3nL3 | 6 337 |
| 7 | 🌟Free Programming Courses From Coding Ninjas🌟
Start Learning for free
Build in-demand tech skills with our industry targeted courses. Get access to 10+ expert led courses for free.
✅JAVA FOUNDATION WITH DATA STRUCTURES
✅APTITUDE PREPARATION COURSE
✅PYTHON FOUNDATION WITH DATA STRUCTURES
✅C++ FOUNDATION WITH DATA STRUCTURES
✅ANDROID DEVELOPMENT WITH KOTLIN LANGUAGE
✅FULL STACK WEB DEVELOPMENT WITH NODEJS
✅ADVANCED FRONT-END WEB DEVELOPMENT WITH REACT
✅DATA SCIENCE & MACHINE LEARNING COMPLETE
✅INTERVIEW PREPARATION COURSE
✅MACHINE LEARNING COURSE
✅COMPETITIVE PROGRAMMING COURSE
✨Free SignUp (We don’t need your credit card❌)
✨Live Doubt Support
✨Get CERTIFICATE from Cn for FREE💯
Link - https://bit.ly/39tu4zC | 3 923 |
| 8 | GeeksforGeeks is organising a free 11 weeks workshop on Data Structures and Algorithms. This workshop primarily focuses on introducing DSA and optimization techniques to rank well in competitive programming.
This workshop is organised for free. Interested can use the code GFG7EOAW0 as the invitation code.
Link to Register: https://practice.geeksforgeeks.org/courses/Workshop-DSA | 5 864 |
| 9 | Coding Ninjas is recuriting Interns and Full Time for the role of SDE.
Link to apply for Internship: http://bitly.ws/atjQ
Link to apply for Full Time:http://bitly.ws/atk7
You can apply till 28 November 2020
Salary/stipend: Based on How the interview goes | 6 020 |
| 10 |  Link:- https://unacademy.com/a/free-course-on-number-theory | 5 376 |
| 11 | Introducing FREE courses by CodeChef in collaboration with Uncademy !!
In this FREE Course, Sanket will be giving an Introduction to Number Theory and how we can solve some conventional GCD Problems. These classes will help you to set up the base level understanding of problem-solving with Number Theory. | 4 754 |
| 12 | CodeChef Programming Aptitude League is an amazing opportunity for aspiring programmers to assess their programming aptitude & Win some amazing prizes like Iphone SE and Kindle Paperwhite.
Test Link : https://unacademy.com/event/testseries/cpal | 4 230 |
| 13 | Dynamic Programming playlist by Chirayu Jain
https://www.youtube.com/playlist?list=PLtBICreuIvuuVifFHcHvIUR6elWTy1K5v | 18 830 |
| 14 | Here are some groups where you can discuss competitive programming related problems
1) https://t.me/competitive_programming
2) https://t.me/CodeForcesGroup
3) https://t.me/competitve_programming
4) https://t.me/joinchat/MT1U1VdfnN-Gm5Evx-a0xA | 12 698 |
| 15 | Adobe Interview:
Credits : GFG
Problem:
Find Minimum Number of Platforms Required for a Railway/Bus Station
Given arrival and departure times of all trains that reach a railway station, the task is to find the minimum number of platforms required for the railway station so that no train waits.
We are given two arrays which represent arrival and departure times of trains that stop
Examples:
Input: arr[] = {9:00, 9:40, 9:50, 11:00, 15:00, 18:00}
dep[] = {9:10, 12:00, 11:20, 11:30, 19:00, 20:00}
Output: 3
There are at-most three trains at a time (time between 11:00 to 11:20)
Solution:
SOLUTION | 18 432 |
| 16 | Elevator Problem
A building has floors numbered 0 through n≤10^18. There is a single elevator with four buttons: "go to floor 0", "+a floors", "+b floors", and "+c floors". We have a,b,c≤ 10^6. Compute the number of unreachable floors.
Solution:
This feels like a number theory problem, but trying to solve it by GCDs and casework will not lead to success. Instead, treat it as a graph theory problem. First, note that if you can reach floor x, you can reach all floors of the form x+k*a. Hence, for each remainder modulo a all we need is the smallest reachable x with this remainder. These can be found by using Dijkstra’s shortest path algorithm on a graph with a nodes. The nodes are the remainder classes, and from each node there are two edges, corresponding to +b and +c.
The stunning thing about this problem is the asymmetry of the solution: you are treating one button differently from the other two.
Credits : Michal Forišek on Quora, scientist, competitive programmer | 13 680 |
| 17 | Problem : Merge Intervals
Given a collection of intervals, merge all overlapping intervals.
Example 1:
Input: [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].
Example 2:
Input: [[1,4],[4,5]]
Output: [[1,5]]
Explanation: Intervals [1,4] and [4,5] are considered overlapping.
Solution:
SOLUTION | 11 360 |
| 18 | Asked in Amazon Interview
Find Longest Palindrome in a String : Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
NOTE: Required Time Complexity O(n^2).
Example:
Input:
1
aaaabbaa
Output:
aabbaa
Solution:
https://www.linkedin.com/feed/update/urn:li:activity:6594490601763364864 | 9 700 |
| 19 | "What are the algorithms required to solve all problems (using C++) in any competitive coding contest?"
Answered by Mostafa Saad Ibrahim, ACM ICPC World Finalist, Problem Setter
Here is my helper list. It lists most of needed algorithms/concepts.Some elements are not algorithms (e.g. Fake, States/Concerns) and little repetitions.
But 1 final advice: Initially, Given great attention to thinking skills rather than the knowledge. This is helpful for both competitions and your future. To do so, make sure you are so good in adhocks, where no algorithms are required, just pure thinking. | 8 751 |
| 20 | Microsoft Interview Problem
Given an array, rotate the array to the right by k steps, where k is non-negative.
Example 1:
Input: [1,2,3,4,5,6,7] and k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]
Example 2:
Input: [-1,-100,3,99] and k = 2
Output: [3,99,-1,-100]
Explanation:
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]
Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
Could you do it in-place with O(1) extra space?
Solution:
SOLUTION | 7 606 |
