Programming Wizard

This blog is all about helping you through your Coding Interviews, competitive Coding, and all your Data Structures and algorithm problem solution. I will discuss all famous problems, frequently asked problems from real technical interviews and coding tests.

Pages

  • Home
  • Topic-Wise
  • Interview Experience

Topic-Wise


Array:

  1. Maximum Points You Can Obtain from Cards
  2. Flip Arrays
  3. First Missing Integer


Tree:

  1. Flatten Binary Tree to Linked List
  2. Maximum Sum Path In Binary Tree
  3. Binary Tree Cameras


String:

  1. Intelligent substring
  2. Minimum appends to make string Palindrome
  3. Ambiguous Coordinates


Math:

  1. Count Primes | Sieve of Eratosthenes
  2. Minimum Moves to Equal Array Elements II


Recursion/ Backtracking:

  1. Combination Sum
  2. N Queens II


Heap:

  1. Construct Target Array With Multiple Sums


Dynamic Programming: 

  1. Palindrome Partitioning II
  2. Rod Cutting Problem
  3. Minimum Subset Sum Difference
  4. Partition to K equal Sum subset
  5. Tushar's Birthday (Unbounded Knapsack)
  6. Maximum Sum Path In Binary Tree
  7. Merge Elements
  8. Tiling With Dominoes
  9. Maximum Sum Without Adjacent Element
  10. Range Sum Query 2D - Immutable
  11. Longest String Chain


DFS (Depth first Search)

  1. Max Area Of Island



💻More Sections coming up... ✌





Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Please do not enter any spam link in the comment box

Home
Subscribe to: Posts (Atom)

Featured Post

Flipkart Interview Experience for SDE-1 - IITG, 2020

Total Pageviews

Pages

  • Home
  • Contact Us
  • About Us
  • Privacy Policy
  • DMCA
Awesome Inc. theme. Theme images by Deejpilot. Powered by Blogger.