Skip to content

khaulanauman/15-Days-Of-LeetCode-Challenge

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

67 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

GDG COMSATS: 15 Days Of Leetcode Challenge

Key Takeaways

For questions that ask for:

  • Find the Most or Least Frequent Element
  • Count Specific Elements
  • Anagrams
  • Sort or Arrange Based on Frequency
  • Find the smallest substring containing all characters of another string

Calculate Frequency First

int[] freq = new int[26]; // Only English letters (a-z)
for (char c : s.toCharArray()) {
    freq[c - 'a']++; // Count frequency
}

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages