Genesis Tech’s Post

Is Prepping for Big Tech Engineering Roles Worth It? Real Skills vs. Trivia Questions   #BigTech #EngineeringSkills #PreparationIsKey Hey guys, let's talk about something controversial today. 🤔 So, I see a lot of hate towards prepping for Big Tech interviews, with people saying it's not real engineering and doesn't test practical skills. But hear me out on this one... 💡 Which company truly requires more real engineering skills: - Company 1: Asking trivia questions and simple ... Source: https://lnkd.in/g7bjf7Y8 #mymetric360

MEDIAN OF TWO SORTED ARRAYS - Leetcode 4 [ TOP INTERVIEW PROBLEM ] #dsa #leetcode Question:- Given two sorted arrays nums1 and nums2 of size "m" and "n" respectively, return the median of the two sorted arrays. Solution:- Runtime Complexity: O(log(min(m, n))) Space Complexity: O(1) 1. The function takes two sorted arrays, nums1 and nums2, as input. 2. It ensures that nums1 is the smaller array by swapping them if necessary. 3. It initializes pointers (low and high) for binary search in the smaller array (nums1). 4. The while loop continues until low is greater than high. 5. Inside the loop, it calculates partition points (partitionX and partitionY) based on the binary search. 6. It then calculates the maximum and minimum values on the left and right sides of the partitions. 7. It checks if the partitions are at the correct position for the median. If so, it calculates and returns the median. 8. If the maximum of the left side (maxX) is greater than the minimum of the right side (minY), it adjusts the partition points accordingly. 9. The loop continues until the correct partition points are found, and the median is returned. 10. If the input arrays are not sorted, it throws an IllegalArgumentException.

Want to brush up on your Spark skills? Check out my latest post in the Spark interview series! Discover how coalesce can reduce partition numbers without shuffling and learn how to broadcast the left side of a table in a join. #Spark #BigData #dataengineering #apachespark #interview #opensource

🔵 Spark Interview Question: 🔴 ===================== What are the types of Deploy Modes? The Spark Submit allows you to submit the spark application to the cluster, and you can apply to run in one of the two modes. 1. Cluster Mode 2. Client Mode ✅ In cluster mode, Spark Submit will reach the YARN RM, requesting it to start the driver in an AM container. YARN will start your driver in the AM container on a worker node in the cluster. ✅ In Client Mode, Spark Submit doesn’t go to the YARN resource manager for starting an AM container. Instead, the spark-submit command will start the driver JVM directly on the client machine. So, in this case, the spark driver is a JVM application running on your client machine.

DAY 20: 🚀Achievement Unlocked: Next Permutation🚀 Excited to share that I've successfully tackled the " Next Permutation " problem on InterviewBit!🎉💻 Here's the link to the problem: https://lnkd.in/g2_kmZsQ #CodingAchievement #Permutation #InterviewBit #ProgrammingJourney #Backtracking #medium #arrays

Hi Connections!!! Learning Data Structures and Algorithms not only secures jobs but also boosts problem-solving skills, making us better programmers. I shared a quick approach for the 'Palindrome Linked List' problem on LeetCode, highlighting its importance in technical interviews. Best of luck ! https: https://lnkd.in/gDWyNz34 #TechInterviews #CodingChallenges #Algorithm #DataStructures #CareerInTech #ProblemSolving

#StriversSDESheet Challenge - Day 14 Problems Solved: 1 1. Reverse a LinkedList in groups of size k - https://lnkd.in/gr3rDr9P - Solving this problem proved to be quite challenging. Initially, I had the idea of maintaining a counter on the linked list, and whenever the counter was divisible by k, it indicated the end of a group. At that point, I would track the end node and perform a reverse operation on the linked list from the start to the end. This process would be repeated for all possible groups of size k. While the concept seemed simple, the actual implementation turned out to be much more complex, and I encountered numerous edge cases that made it difficult to get right. After struggling for a while, I realized that my initial approach was not the way to tackle this problem. To gain a better understanding, I watched a solution video multiple times. The key insight in this approach was to reverse the linked list group step by step, rather than reversing the entire group at once. This approach was less intuitive and required a solid foundation in linked lists and understanding how different links could be established. It became evident that approaching this type of problem in an interview without prior knowledge of the approach could be quite challenging. When faced with similar questions, it's essential to thoroughly dry run the solution a few times to grasp the approach and how it functions. This practice can significantly improve your problem-solving skills in interviews. That's it for the day! Enjoy your night 🙂 #leetcode #striversa2zdsa #dsa #linkedlist #problemsolving #softwaredevelopment

Here's how to ace this most crucial Spark question in any interview! (❌ without getting overwhelmed) I have come across many situations where this common question is asked: what is the difference between cache and persist in Spark? ✅ Cache is the mechanism of storing a data frame or RDD in memory. Its primary goal is to avoid recomputation of the entire lineage of transformations when an action is performed on the dataset. ✅ While caching primarily involves storing data in memory, persist allows you to choose different storage levels, including memory, disk, or a combination of both. When to Choose: ★ Use Cache: ✅ Enough memory to hold the complete dataset. ✅ Small to medium-sized datasets accessed frequently. ★ Use Persist: ✅ Handling larger datasets not fully fitting in memory. ✅ Balancing memory usage and performance across various dataset sizes. Repost ♻️ if you learned something new. P.S. Will you feel confident answering this question the next time an interviewer asks?

Day: 3 Today, as part of my challenge to solve the "Top 150 Interview Questions" from LeetCode, I solved these two problems from linked list: 1. 141. Linked List Cycle: Solved using the two-pointer approach. [My Solution: https://lnkd.in/gQHZee34] 2. 2. Add Two Numbers: This was the most interesting problem, and I believe it is one of the important problems among the Linked List problems. I solved it using a straightforward implementation approach. However, the challenge in this problem arises when the two linked lists are of different sizes. [My Solution: https://lnkd.in/g5SHF3Rm]