We launched an AI mock interviewer to our developer community a few months back. We only rolled out to 2% of the users and we just crossed 10,000 interview sessions! Getting ready to GA to all of @hackerrank soon. Excited to help developers get the job they desire and proud of the team’s work.
Vivek Ravisankar’s Post
More Relevant Posts
-
GenAI is hot right now, but how do CHROs keep it real? 🎯 We chatted with Kavita Kurup who keeps things running smoothly for over 35,000 employees at UST and she spilled the tea on how she balances tech and touch. ⚖️ Spoiler alert: it involves more than just fancy AI. Watch this video to uncover the 3️⃣ things Kavita swears by, and check the comments for the full interview! 👇
To view or add a comment, sign in
-
🧠 𝗪𝗵𝗮𝘁 𝗱𝗶𝗱 𝘄𝗲 𝗹𝗲𝗮𝗿𝗻 𝗳𝗿𝗼𝗺 𝗼𝘂𝗿 𝗔𝗜 𝗔𝗹𝗶𝗴𝗻𝗺𝗲𝗻𝘁 𝗖𝗼𝘂𝗿𝘀𝗲 𝗣𝗮𝗿𝘁𝗶𝗰𝗶𝗽𝗮𝗻𝘁𝘀? After wrapping up our June 2024 cohort, we spoke with participants about their experience. Adam Jones shares their feedback in his latest blog post: 'Summary of AI alignment participant user interviews' - 🔗 https://ow.ly/Bi0z50To0C4. Some highlights include: ✨ How participants tackled complex technical content—and how we can help future cohorts do the same 💬 The role of peer support and expert facilitation in learning 🔍 How flexibility impacted their experience 🚀 What motivated them to continue into the project phase #AISafety #AIAlignment #LearningCommunity
To view or add a comment, sign in
-
The participant experience speaks for itself! - 90% respondent NPS: It’s easy and fun! See for yourself by trying a sample interview: https://hubs.la/Q02T9mxY0 - Flexible and convenient: Everyone has the opportunity to participate - including across time zones, languages, and even outside of working hours - Judgement-free environment: No need to dress up or worry about saying the right thing - AI moderation ensures a welcoming, comfortable and consistent environment for everyone
To view or add a comment, sign in
-
🚀 New Video Alert! 🚀 Ready to tackle Part 2 of essential ML interview problems? In this video, we dive into learning rates—an absolutely crucial topic for any machine learning or data science interview. 📉💡 You'll learn: Learning Rate Basics – What it is, why it’s key to model performance, and how it impacts training. Types of Learning Rates – Discover the pros and cons of fixed, adaptive, and dynamic learning rates to make informed choices in your projects. Mastering these concepts not only enhances your understanding but also shows interviewers you’re equipped to handle real-world ML challenges! 📈✨ Check it out here: https://lnkd.in/emPincng #MachineLearning #DataScience #InterviewPrep #LearningRate
Learning rate details and intricacies in regression - ML and DS Interview Problem
https://www.youtube.com/
To view or add a comment, sign in
-
🚀 Algorithmic Problem Solving Series: Day [10] **Today's Problem: Longest Subarray with sum K** Finding the longest subarray with a sum equal to K is a classic problem in algorithmic interviews. Here's a breakdown of three approaches to solve it: Brute Force Approach: Check all possible subarrays and calculate their sums. Time Complexity: O(n^3). Better Approach: Utilize a prefix sum array and a dictionary. Time Complexity: O(n). Optimal Approach: Utilize a hashmap to store prefix sums and their frequencies. Time Complexity: O(n). Which approach do you think is the most efficient? Let's discuss in the comments! #100DaysDSA #Algorithm #Coding #InterviewPreparation #DataStructures
To view or add a comment, sign in
-
During the interviews, it is really important to think of the efficient approaches to a problem. Try using algorithms that work in O(n) or O(nlogn). Some of the tools that usually help to write efficient algorithms - 1. Segment Tree - Building takes O(n), Queries take O(logn) 2. Sparse Table - Building takes O(nlogn), Queries take O(1) 3. Priority Queue or Sets - Every operation takes O(logn) 4. Stack - O(1) operations but limited application 5. Maps - O(logn) operations 6. Linked List - O(1) operations but limited application 7. Two Pointers - O(n) runtime 8. Indexed Set - O(logn) operations 9. DFS or BFS - O(n) runtime 10. DSU - O(nlogn) runtime 11. Mobius - O(nlogn) runtime You can practice many of these tools in our sheets - asksenior.in/learn.
To view or add a comment, sign in
-
Excited to share that I have successfully completed Phase 2 of my Data Structures and Algorithms course on Smart Interviews! It's been a challenging and rewarding experience, and now I'm all set to tackle the final phase. Looking forward to applying these skills in real-world scenarios. #SmartInterviews #DataStructures #Algorithms #GrowthMindset 😊
To view or add a comment, sign in
-
Friday Fun: Sometimes "Attention" is all you need to be successful in a Machine Learning problem 😎 😎 #fridayfun #aiml_com #machinelearning #interviews -- Interested in learning ML: Join us at AIML.com 🌐 𝑨𝑰𝑴𝑳.𝒄𝒐𝒎 𝒊𝒔 𝒕𝒉𝒆 𝒘𝒐𝒓𝒍𝒅'𝒔 𝒍𝒂𝒓𝒈𝒆𝒔𝒕 𝒓𝒆𝒑𝒐𝒔𝒊𝒕𝒐𝒓𝒚 𝒐𝒇 𝑴𝑳 𝒊𝒏𝒕𝒆𝒓𝒗𝒊𝒆𝒘 𝒒𝒖𝒆𝒔𝒕𝒊𝒐𝒏𝒔 𝒂𝒏𝒅 𝒒𝒖𝒊𝒛𝒛𝒆𝒔. (𝑨𝒍𝒍 𝑭𝑹𝑬𝑬)
To view or add a comment, sign in
-
"Cracking the code on algorithms for upcoming tech interviews! 🚀 Delve into the world of complexities and gear up to ace those coding challenges. Stay tuned for more insider tips! Let's connect and level up together! #techprep #datastructures #algorithms #repost
To view or add a comment, sign in
-
Friday fun: Machine Learning is with you day and night 🙄 💜 🙄 #fridayfun #aiml_com #machinelearning #interviews -- Interested in learning ML: Join us at AIML.com 🌐 𝑨𝑰𝑴𝑳.𝒄𝒐𝒎 𝒊𝒔 𝒕𝒉𝒆 𝒘𝒐𝒓𝒍𝒅'𝒔 𝒍𝒂𝒓𝒈𝒆𝒔𝒕 𝒓𝒆𝒑𝒐𝒔𝒊𝒕𝒐𝒓𝒚 𝒐𝒇 𝑴𝑳 𝒊𝒏𝒕𝒆𝒓𝒗𝒊𝒆𝒘 𝒒𝒖𝒆𝒔𝒕𝒊𝒐𝒏𝒔 𝒂𝒏𝒅 𝒒𝒖𝒊𝒛𝒛𝒆𝒔. (𝑨𝒍𝒍 𝑭𝑹𝑬𝑬)
To view or add a comment, sign in
Founding Partner at Studio V, Founder at Quanten Media and curator at C42
4dIf you get a chance, you and Guruprakash Sivabalan should catch up. There are some synergies between what you both are building.