Skip to content

Repository with leetcode solutions and dedicated index to prepare for your Meta, Google, Amazon, Microsoft interviews. Feel free to share and contribute to this awesome repository.

License

Notifications You must be signed in to change notification settings

Jiganesh/Loads-Of-Logic

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Click below to expand and view problems.

difficulty chart

Arrays
Bit Manipulation
Backtracking
Design
Dynamic Programming
Graphs
Greedy
HashTable
Heap
LinkedLists
Maths
Prefix Sum
Queue
Recursion
Search
Sorting
Stack
Strings
Trees
Tries
Two Pointers
Concepts - Print Number from 1 to N && from N to 1 && from 1 to N and N to 1 in same - Sum and Product of Digits in a Number - Reverse A Number - Maximize The Number By Swapping Adjacent Two Digits ```Not Yet Solved```
  • dynamic Programming

    • Print possible Sum for Target using given number as many times possible
    • Longest Common Subsequence
    • Printing Longest Common Subsequence
  • binarySearch

    • Order Agnostic Binary Search Binary Search
    • Search in Infinite Array Binary Search
    • Find Binary Search Ceiling Value Binary Search
    • Find Binary Search Floor ValueBinary Search
    • Find Pivot in Rotated Sorted Array Binary Search
    • Find Pivot in Rotated Sorted Element with Duplicates Binary Search
    • Rotation Count for Rotated Array Binary Search
    • Search in Sorted Row and Column Wise Matrix Binary Search
    • Search a Matrix sorted Row and Column wise Binary Search , Matrix
    • Search a Sorted Matrix Binary Search , Matrix
  • overflow & underflow

    • String to Integer - Handling Integer Overflow and Underflow
  • graphs

    • Graph Representation
    • BFS
    • DFS
    • Cycle Detection Using BFS
    • Cycle Detection Using DFS
    • Cycle Detection Using BFS in DAG
    • Cycle Detection Using DFS in DAG
    • Topological Sort (Linear Ordering of Vertices such that if there is and edge u --> v, u appears before v in that ordering )

Wanna Contribute to this repository !!

Thank You !!

About

Repository with leetcode solutions and dedicated index to prepare for your Meta, Google, Amazon, Microsoft interviews. Feel free to share and contribute to this awesome repository.

Topics

Resources

License

Code of conduct

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published