Skip to content
Paras Gupta

Jan 16 - Daily Programming Diary

Diary, Programming1 min read

22:00

Just solving today's Leetcode challenge and then relaxing

kth-largest-element-in-an-array.cpp
1int findKthLargest(vector<int> &nums, int k)
2{
3 sort(nums.begin(), nums.end(), greater<int>());
4 return nums[k - 1];
5}

Ok, bye!

EOD Checklist

  • Leetcode January Challenge
  • Raahee
  • This blog
© 2022 by Paras Gupta. All rights reserved.
Theme by LekoArts