Kumar K’s Post

Rubrik offers a whooping CTC of 75 Lakhs to freshers for their SDE Role! Rubrik is one of those companies which asks the 𝐡𝐚𝐫𝐝𝐞𝐬𝐭 𝐃𝐒𝐀 questions to their candidates in OA rounds; this year they asked total of 18 different OA problems and all of them are a super hard nut to crack ; mostly revolving around high level Dynamic Programming + Combinatorics + Greedy + Graph :) Rubrik OA Problem asked on Nov 1 -> Name of the Problem - 𝐇𝐚𝐫𝐝 Graph 𝐏𝐫𝐨𝐛𝐥𝐞𝐦. Crux of the problem :- In the image below. We will solve this problem in our up-coming free FAANG OA Training - Master-class Saturday Link to join in the comments. #kumark #coding #oa #dsa #rubrik

Rubrik offers a whooping CTC of 75 Lakhs to freshers for their SDE Role! Rubrik is one of those companies which asks the 𝐡𝐚𝐫𝐝𝐞𝐬𝐭 𝐃𝐒𝐀 questions to their candidates in OA rounds; this year they asked total of 18 different OA problems and all of them are a super hard nut to crack ; mostly revolving around high level General Trees + Dynamic Programming + Combinatorics + Greedy :) Tower Research Capital OA Problem asked on Oct 1 -> Name of the Problem - 𝐇𝐚𝐫𝐝 𝐃𝐏 𝐏𝐫𝐨𝐛𝐥𝐞𝐦. Crux of the problem :- In the image below. 𝐉𝐨𝐢𝐧 𝐨𝐮𝐫 850 𝐡𝐨𝐮𝐫 𝐜𝐨𝐮𝐫𝐬𝐞 𝐨𝐧 𝐃𝐒𝐀 + 𝐎𝐀 + 𝐂𝐏 𝐰𝐢𝐭𝐡 8 𝐦𝐨𝐧𝐭𝐡 𝐥𝐢𝐯𝐞 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 + 𝐩𝐞𝐫𝐬𝐨𝐧𝐚𝐥 𝐦𝐞𝐧𝐭𝐨𝐫𝐢𝐧𝐠 - https://lnkd.in/dgJtAPBG (for working professionals /college students.) We will solve this problem in our up-coming free FAANG OA Training - Master-class Saturday Link to join in the comments.

Rubrik offers a whooping CTC of 80 Lakhs to freshers for their SDE Role! Rubrik is one of those high paying companies which asks the 𝐡𝐚𝐫𝐝𝐞𝐬𝐭 𝐃𝐒𝐀 questions to their candidates in OA rounds; this year they asked total of 18 different OA problems and all of them are a super hard nut to crack ; mostly revolving around high level General Trees + Dynamic Programming + Bit Manipulation + Combinatorics + Greedy :) Rubrik OA Problem asked on Nov 18 - Name of the Problem - 𝐇𝐚𝐫𝐝. Crux of the problem :- In the image below. Free DSA + OA + CP live training(each weekend) - https://lnkd.in/gZaCFnfU Free video solution to 150+ top-tech company OA in 2024 - 2025 - https://lnkd.in/djGVjeXg 𝐉𝐨𝐢𝐧 𝐨𝐮𝐫 850 𝐡𝐨𝐮𝐫 𝐜𝐨𝐮𝐫𝐬𝐞 𝐨𝐧 𝐃𝐒𝐀 + 𝐎𝐀 + 𝐂𝐏 𝐰𝐢𝐭𝐡 8 𝐦𝐨𝐧𝐭𝐡 𝐥𝐢𝐯𝐞 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 + 𝐩𝐞𝐫𝐬𝐨𝐧𝐚𝐥 𝐦𝐞𝐧𝐭𝐨𝐫𝐢𝐧𝐠 + Referral support - https://lnkd.in/dgJtAPBG (for working professionals /college students.) #kumark #coding

Rubrik offers a whooping CTC of 65 Lakhs to freshers for their SDE Role! Rubrik is one of those companies which asks the 𝐡𝐚𝐫𝐝𝐞𝐬𝐭 𝐃𝐒𝐀 questions to their candidates in OA rounds; this year they asked total of 18 different OA problems and all of them are a super hard nut to crack ; mostly revolving around high level General Trees + Dynamic Programming + Combinatorics + Greedy :) Rubrik OA Problem asked on Sep - 11 -> Name of the Problem - 𝐒𝐮𝐩𝐞𝐫 𝐇𝐚𝐫𝐝 𝐓𝐫𝐞𝐞 𝐏𝐫𝐨𝐛𝐥𝐞𝐦. Crux of the problem :- Given a tree of "N" nodes ; and each edge has some weight - you are allowed to destroy <=m edges ; destroy whichever ones you want - but final forest should be all vertical branches; sum of each of these vertical branches <=k -> Output the minimum number of vertical branches which remain after the process. Congratulations to our student for cracking off-campus SDE Intern Amazon - https://lnkd.in/dMtT9bkF (In sep) Congratulations to our student for cracking offer - Expedia Group - https://lnkd.in/dj37pBFw 𝐉𝐨𝐢𝐧 𝐨𝐮𝐫 850 𝐡𝐨𝐮𝐫 𝐜𝐨𝐮𝐫𝐬𝐞 𝐨𝐧 𝐃𝐒𝐀 + 𝐎𝐀 + 𝐂𝐏 𝐰𝐢𝐭𝐡 8 𝐦𝐨𝐧𝐭𝐡 𝐥𝐢𝐯𝐞 𝐭𝐫𝐚𝐢𝐧𝐢𝐧𝐠 + 𝐩𝐞𝐫𝐬𝐨𝐧𝐚𝐥 𝐦𝐞𝐧𝐭𝐨𝐫𝐢𝐧𝐠 - https://lnkd.in/dgJtAPBG (for working professionals /college students) We will solve this problem in our up-coming free FAANG OA Training - Master-class today Link to join in the comments.

Have you solved 500+ Leetcode Questions, but are still, struggling with getting shortlisted in your Dream Companies and Packages? I am Praduman, a 2022 graduate of IIT Roorkee, and with Newton School, I am looking to coach 4 SDEs struggling to upgrade their current SDE jobs! This upgrade journey of 3 months will include: 1. Assured Interview Round 1s in your dream companies/packages 2. Company-Specific Preparations Before Each Round 3. Personalised Guide for Resume Building 4. Mock Interviews and Feedback 5. System Design Interview Preparation 6. DSA Practice Questions Pool If you think you can be among these 5, fill out this GForm https://lnkd.in/gNQbFetC. I will reach out to you! See you on the other side!

I am a final year Software Engineering student 👩🎓 preparing for SDE interview.  How many languages should I learn to crack the interview? This is the question ❓ I have been asked by engineering students a lot. My answer to this question is always. 1️⃣ Master One Language: Delve deep into at least one programming language. Opt for widely used languages like Python, Java, C++, or JavaScript. Depth of understanding in one language trumps superficial knowledge in many. 2️⃣ Embrace Fundamentals: Prioritise understanding core computer science concepts and DSA (data structure & algorithms). Interviewers often value problem-solving prowess and algorithmic thinking over sheer language proficiency. 3️⃣ Expand Your Horizon: While depth is crucial, having a basic grasp of additional languages can broaden your skill set. For instance, supplementing Python proficiency with Java or JavaScript knowledge enhances your marketability and job prospects. Ultimately, quality trumps quantity in SDE interviews. Demonstrating strong problem-solving abilities and a solid foundation in computer science fundamentals are paramount. Focus on mastering a ONE language while cultivating a deep understanding of the underlying principles. #interviewtips #engineer #fresher #SDE #DSA

Job Ready in 30 days Roadmap 🔥 ✨ Week 1: DSA Basics * Learn Arrays, Strings, stacks, queues, searching, sorting and recursion basics. * Practice 5-10 problems daily on platforms like LeetCode or GeeksforGeeks. * Resources: Neetcode YouTube, GeeksforGeeks tutorials, Striver’s SDE sheet. * Practice: • Arrays: Sliding Window, Two Pointers • Strings: Palindromes, Substrings • Stacks: Monotonic Stack, Next Greater Element Week 2: Advanced DSA * Cover linked lists, trees, graphs, and DP. * Practice 5-10 problems daily on platforms like LeetCode or GeeksforGeeks. * Resources: Tushar Roy YouTube, GeeksforGeeks tutorials, Striver’s SDE sheet * Practice: • Linked Lists: Merge, Reverse • Trees: BFS, DFS, Binary Trees • Graphs: Shortest Path, Cycle Detection • DP: Knapsack, Subsequence Problems Week 3: Get the complete roadmap here: https://lnkd.in/gqBKKauX Hope this helps. Do follow Akanksha Buchke for hirings, referrals and tech content. #jobs #freshers #hiring #interviews #placements #tech #interview #softwareengineer #techjobs #connections #programming #careers

Hello LinkedIn I participated in CodeForces Round 961 (Div. 2) and was able to solve A and B1, and secured a global rank of 6221. It was one of my worst performances on CodeForces. Because of writing one extra line in my code, I got 3 WAs in B which made me get twice the rank. I need to improve my accuracy to get a good rank in the future. Happy Coding. #connections #connection #codeforces #leetcode #codechef #geeksforgeeks #contest #coding #cp #algorithms #software #engineering #hiring #hirings #freshers #fresher #hr #jobs #google #amazon #microsoft #development #datastructures #india #codingcontest #dailycoding #competitivecoding

Have you solved 500+ Leetcode Questions, but are still, struggling with getting shortlisted in your Dream Companies and Packages? I am Praduman, a 2022 graduate of IIT Roorkee, and with Newton School, I am looking to coach 4 SDEs struggling to upgrade their current SDE jobs! This upgrade journey of 3 months will include: 1. Assured Interview Round 1s in your dream companies/packages 2. Company-Specific Preparations Before Each Round 3. Personalised Guide for Resume Building 4. Mock Interviews and Feedback 5. System Design Interview Preparation 6. DSA Practice Questions Pool If you think you can be among these 5, fill out this GForm https://lnkd.in/gNQbFetC. I will reach out to you! See you on the other side!

Hello LinkedIn, I participated in LeetCode Weekly Contest 419 and was able to solve A and B, and secured a global rank of 3407 out of 29000 participants. I was getting TLE in hidden test cases in C, which I will try to optimize. Intuitions for questions: A. We can run nested loops to find the answers. For each loop of i, iterate from i to i+k and store the frequency of all elements of this range. Now add the top x elements (element * frequency) and return the answer. B. Start with the root and traverse through the tree. For each node, find the height of the children. If the heights are the same, then we can store the size of that particular subtree in our answer. At last, sort the answer array and return the Kth size. C. We can use dynamic programming to check for each string that we can make, and add the score of each string, and check if it satisfies the condition or not. I was getting TLE, which I need to check. Happy Coding. #connections #connection #datastructures #india #algorithms #google #development #cfbr #amazon #hiring #fresher #recruiters #hr #microsoft #software #engineer #data #hirings #jobs #coding #freshers