divyagodayal / coderchef-kitchen Goto Github PK

• README

• Solution for the minimum as well as the maximum element

• Explore descending order array as well.

https://leetcode.com/problems/largest-sum-of-averages/description/

• Solution

• README

https://leetcode.com/problems/daily-temperatures/description/

• README

• Heap Solution (going forward)

• Stack solution (going reverse)

Convert a sorted list into a binary search tree
Leet Code Question: 109

This requires double pointers in c++ to accomplish the task in a faster way.

https://leetcode.com/problems/top-k-frequent-words/description/

• README

• Solution(s)

https://leetcode.com/problems/prime-palindrome/description/

• README

• Solution

https://leetcode.com/problems/bus-routes/description/

• Solution

• README

https://leetcode.com/problems/minimum-cost-to-hire-k-workers/description/

• README.md

• Solution Greedy

• Solution Heap based

https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/description/

• README

• Solution(s)

https://leetcode.com/problems/score-of-parentheses/description/

• README

• Solution

https://leetcode.com/problems/isomorphic-strings/description/

• README

• Solution

• https://leetcode.com/problems/next-greater-element-ii/description/

• README

• Solution(s)

https://leetcode.com/problems/number-of-islands/description/

• README

• Solution(s)

Generate Parentheses

This question will help students about how to draw and solve problems using recursion tree whenever they encounter such permutations based questions

https://leetcode.com/problems/implement-magic-dictionary/description/

• README

• Neighbors solution

• Hash based solution

https://leetcode.com/problems/add-and-search-word-data-structure-design/description/

• README

• Solutiion

https://leetcode.com/problems/maximum-product-of-word-lengths/description/

• README

• Solution(s)

https://leetcode.com/problems/word-search/description/

• README

• Solution

https://leetcode.com/problems/3sum/

• README.md

• Solution(s)

https://leetcode.com/problems/4sum/description/

• README.md

• Solution(s)

https://leetcode.com/problems/remove-invalid-parentheses/description/

• README

• Solution-1 Super slow, recursive

• Pruned recursion.

https://leetcode.com/problems/lemonade-change/description/

• README

• Solution

https://leetcode.com/problems/swap-nodes-in-pairs/description/

• README

• Solution

https://leetcode.com/problems/soup-servings/description/

• README

• Solution

https://leetcode.com/problems/two-sum/

• README.md

• Solution(s)

https://leetcode.com/problems/sort-list/description/

• README

• Solution(s)

https://leetcode.com/problems/optimal-division/description/

• README

• Dynamic Programming based approach

• Mathematical approach

Leet Code Question No :503
continuous-subarray-sum

Three ways to do:

1. O(n^3) : Naive way
2. O(n^2) : using dp
3. O(n): using hashmap
   I encountered this in my recent interview.

https://leetcode.com/problems/matchsticks-to-square/description/

• README

• DFS Solution

• DP based Solution

https://leetcode.com/problems/next-greater-element-i/description/

• README

• Solution(s)

https://leetcode.com/problems/asteroid-collision/

• README

• Solution(s)

A lot of programmers already working as frontend developers or some starting their journey in javascript, and struggle to practice ds/algorithms for interview preparation.

Can I submit problems/solutions in js?

Contruct Tree from Inorder Traversal and Postorder Traversal

This might be a tricky interview question where you are asked to generate preorder traversal from given inorder and postorder traversals.

https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/

• README

• Solution(s)

• README

• Solution

• README

• Solution

https://leetcode.com/problems/advantage-shuffle/description/

• README

• Solution(s)

https://leetcode.com/problems/minimum-number-of-refueling-stops/description/

• README

• Heap Solution

• Dynamic Programming Solution

https://leetcode.com/problems/rotate-array/

There are various straightforward ways to solve this problem but while I came across quite a creative approach to solve it in O(1) extra space and O(n) time. The solution involves reversal of an array, which is shared in an article as one of the top 25 interview questions. Let me know what you think of it.

https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/

• Solution(s)

• README