You may know in your heart how amazing a person you are, but the world won't believe it until you prove it. Proof of your credibility matters a lot.

RT @aravind: This is a long post. If you prefer, you can skip to section B. The first part is my assurance, especially for the young 40% o….

RT @chesscom: CONGRATULATIONS TO GUKESH, THE NEW WORLD CHAMPION 🏆. The 18-year-old Indian star has defeated the reigning champion, Ding Lir….

RT @anuatluru: the greatest life advice is hiding on reddit

Day 21 of #geekstreak2024. Q. Multiply two linked lists.A. Form the numbers by traversing through the linked list ( don't forget to %(1e9 + 7)), then multiply both the numbers, return ans % (1e9 + 7).#deutschebank @geeksforgeeks @DeutscheBank . This marks the end of the challenge

Day 20 of #geekstreak2024. Q. Merge two BST's.A. Did it the wrong way, just inserted all the elements of both the trees in a array and returned the sorted array. Will learn the actual method.#deutschebank @geeksforgeeks @DeutscheBank

Day 19 of #geekstreak2024. Q. Total Counts.A. Divide each element of array by k and add the quotient to ans, if remainder != 0, ans += 1.#deutschebank @geeksforgeeks @DeutscheBank

Day 18 of #geekstreak2024. Q. Minimal Cost.A. Use dp to store the minimum cost at a particular index. Classic 1-D dp question.#deutschebank @geeksforgeeks @DeutscheBank

Day 17 of #geekstreak2024. Q. K sized subarray maximum.A. Sliding window , deque.#deutschebank @geeksforgeeks @DeutscheBank

Day 16 of #geekstreak2024. Q. Roof Top.A. Increment count if the next roof is greater than the current one else set it back to zero. Return the max count encountered while iterating.#deutschebank @geeksforgeeks @DeutscheBank

Day 14 of #geekstreak2024. Q. Palindrome Linked List.A. Stored half of the linked list in an array and compared the values of the other half from the array ones.#deutschebank @geeksforgeeks @DeutscheBank

Day 14 of #geekstreak2024. Q. Smallest window in a string containing all the characters of another string.A. Store the frequencies of chars of string p, use sliding window to check whether the window of string s contains all of p. #deutschebank @geeksforgeeks @DeutscheBank

Day 13 of #geekstreak2024. Q. Missing and repeating.A. Mark the indices by multiplying them with -1, and if you encounter an already marked index, that's your repeating number, whichever index still remains positive is the missing no. #deutschebank @geeksforgeeks @DeutscheBank

Day 12 of #geekstreak2024. Q. Longest Prefix Suffix.A. One of a kind problem, better to learn the approach and keep in mind. I learnt through yesterday's leetcode problem and it came in handy soon enough, uses KMP ig.#deutschebank @geeksforgeeks @DeutscheBank

Day 11 of #geekstreak2024. Q. Clone a linked list with next and random pointer.A. Don't know, just returned head.#deutschebank @geeksforgeeks @DeutscheBank

Notifications are evolving 🌎😂

Day 10 of #geekstreak2024. Q. Facing the sun.A. Increment the count if the current height is the highest compared to heights encountered before.#deutschebank @geeksforgeeks @DeutscheBank

Day 9 of #geekstreak2024. Q. Reverse Words.A. Split the string at "." either using inbuilt methods if using python/js or manually using loop. Store the strings in a vector and reverse and add to the answer string. #deutschebank @geeksforgeeks @DeutscheBank

Day 8 of #geekstreak2024. Q. Parenthesis Checker.A. Use stack to store opening brackets and match the closing brackets with the top of stack and return false true accordingly.#deutschebank @geeksforgeeks @DeutscheBank

Day 7 of #geekstreak2024. Q. Minimize the heights II.A. Greedily check for the possible max and min element after adding/subtracting k and calculate the min of their differences as the answer. #deutschebank @geeksforgeeks @DeutscheBank

Day 6 of #geekstreak2024. Q. Longest valid parenthesis.A. Use stack to store the indices of opening parenthesis, pop when closing ones are encountered and keep on storing the max difference between the indices.#deutschebank @geeksforgeeks @DeutscheBank