How to solve B —“Split the Array”? I had nothing better than an N2N2 DP… → Reply 18o3 3 years ago, # ^ | +7 It involved a bit of casework. Think along the lines of what will happen if k is odd/even and j is odd/even. The problem then reduced to a dp with ...
1. sort the input points array. 2. start from the first element, recursively add it to the current selection and check if the remaining score can be obtained from the current considering element set. When startIdx is 0, we consider all elements, when it is 1, we exclude element 0 as ...
Follow up question: Instead of given an integer, you are now given some strings, each string contains some number of digits. What is the max number you can get out of these strings? You are allowed to combine the strings in different order, but you can't change each individual string. ...
Notes/Question/Explanations 📒 Segment Tree | HackerEarth 📕 Dynamic Programming | HackerEarth) 📒 Disjoint Set Union (Union Find) | HackerEarth 📕 Ternary Search | HackerEarth 📒 Binary Search for Beginners | Leetcode 🏆 Sources Other coding websites, hackerearth, interviewbit,gfg, leet...
Google SDE Sheet Wipro Coding Sheet Infosys Coding Sheet TCS Coding Sheet Cognizant Coding Sheet HCL Coding Sheet SDE Sheets FAANG Coding Sheet Love Babbaar Sheet Mass Recruiter Sheet Product-Based Coding Sheet Company-Wise Preparation Sheet Top 100 DSA Interview Questions Topic-wise Top 50 Array Pr...
a free-form type presentation, without notes and slides, and simply take questions from the audience to use as improv material. With about 150 engineers in attendance, ESR fielded a fairly wide array of questions on everything from functional languages to open source licensing to coding standards...
Over the course of my career I have scheduled thousands of software engineering interviews with hundreds of hiring managers at a wide array of companies and organizations. I have learned that although no two managers look for the exact same set of techn