Competitive & Advanced Coding
PrepInsta Tutorial for Competitive and Advanced Coding
Learn to write most efficient programes and equip yourself to get solution for the complex codes. Get ready for the competitions like Google Codejam, SIH, Hackathon and more. Companies like Google, Microsoft, Facebook, Amazon etc hire professionals with exceptional problem-solving skills.
During the course you’ll learn everything that is needed to participate in competitions. Along the way you’ll gain useful skills for which competitive programmers are so highly valued by the employers. Ability to write efficient, reliable and compact code, manage your time well when it’s limited , apply basic algorithmic ideas to real problems, etc
Dynamic Programming Problems
- Count Binary Strings Without Consecutive Ones
- Matrix chain multiplication
- Binomial Coefficient
- Coin Change Problem
- 0-1 KnapSack
- Longest Palindromic Subsequence
- Cutting a Rod
- Longest Common Subsequence
- Longest Increasing Subsequence
- Min Cost Path
- Edit Distance
- Longest Bitonic Subsequence
- Maximum Sum Increasing Subsequence
- Egg Dropping Puzzle
- Palindrome Partitioning
- Partition Problem
- Fibonacci Numbers
- Ugly Numbers
- Minimum Jumps to Reach End
- Maximum Size Square Sub Matrix with all 1’s
- Longest Palindromic Substring
- Subset Sum
- Tiling Problem
- Count ways to reach nth stair
- Largest Sum Contiguous Subarray
- Maximum sum rectangle in a 2D matrix
- Count number of ways to reach given score in the game
- Find minimum number of coins
- Compute sum of all numbers from 1 to n
- Total number of non decreasing numbers with n digits
Trie Data Structure
Greedy Approach Programming Problems
- Fractional Knapsack
- Activity Selection Problem
- Job Sequencing Problem
- Minimum Swaps brackets balancing
- Minimum time to finish all jobs
- Maximize the sum of array
- Maximum sum of absolute difference
- Partition into two subarrays
- Minimum Sum Of absolute Difference of pairs of two arrays
- Minimum operations to make GCD of array a multiple of k
- Min sum formed by digits
- Lexicographically smallest array after consecutive swaps
- Lexicographically largest array after consecutive swaps
