Competitive Programming❤️
930 subscribers
2 photos
26 links
Computer Science Study Material, Notes, Programming Playlist, Data Structure and Algorithms Playlist

@Codeforces_Codechef_U
@Codechef_U
@CompStudyM
Download Telegram
Messaging is turned off.
Good luck for long challenge 😂
Interviews Tips and how to approach any Coding Problem by Aditya Verma. SDE at Flipkart.

This playlist explains How to approach any coding problem in a systematic way. 1) What to do and what not to do 2) Time management 3) Importance of Constraints 4) Debugging

@CompStudyM @Codechef_U @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWcB1QSAgbdMqyq-KXDqBiZx
Sliding Window Algorithm by Aditya Verma. SDE at Flipkart.

Sliding window technique is useful for solving problems in array or string, especially it is considered as a technique that could reduce the time complexity from O(n²) to O(n).

@CompStudyM @Codechef_U @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWeM8BDJmIYDaoQ5zuwyxnfj
How to deal with Stack Problems By Aditya Verma. SDE at Flipkart.

This playlist explains Stack in a concise way. Explaining how to approach a Stack problem and moreover how to identify it first.

@Codechef_U @CompStudyM @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWdeOezg68SKkeLN4-T_jNHd
Binary Search Algorithm Explained by Aditya Verma. SDE at Flipkart.

This playlist explains Binary Search in a concise way. Explaining how to approach a Binary Search problem and moreover how to identify it first.

@Codechef_U @CompStudyM @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWeYfhtuKHj-9MpYb6XQJ_f2
Heap Interview Questions by Aditya Verma. SDE at Flipkart.

This playlist explains Heap Problems in a concise way. Explaining how to approach a Heap problem and moreover how to identify it first.

@Codechef_U @CompStudyM @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWdtY9W22VjnPxG30CXNZpI9
Swap Sort Technique by Aditya Verma. SDE at Flipkart.

Given a limited range array of integers of size n with all its elements between 1 to n with the exception of one element which occur twice and one number which is missing from the list. Find missing number and the duplicate element in linear time and without using any extra memory.

@Codechef_U @CompStudyM @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWdJfdZHiNYYM46tYQUjbBJx
Fear of Recursion Aditya Verma is here to help you. Recursion Playlist by Aditya Verma. SDE at Flipkart.

This playlist explains Recursion in a concise way. Explaining how to approach a Recursive problem and moreover how to identify it first.

@Codechef_U @CompStudyM @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWeT1ffjiImo0sYTcnLzo-wY
Dynamic Programming Playlist by Aditya Verma. SDE at Flipkart.

This playlist explains Dynamic Programming in a concise way. Explaining how to approach a Dynamic Programming problem and moreover how to identify it first.

@Codechef_U @CompStudyM @Codeforces_U

https://youtube.com/playlist?list=PL_z_8CaSLPWekqhdCPmFohncHwz8TY2Go